Research map / Learning theory and algorithms / Matrix and tensor methods
Universality in Learning from Linear Measurements
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace iid measurement vectors with vectors from another admissible distribution having the same mean and covariance | Convex estimator for structured-signal recovery · Linear measurements | perfect-recovery phase transition | No clear effect |
| Use quadratic measurements with nuclear-norm recovery for a rank-r PSD matrix | Low-rank matrix recovery · Quadratic measurements, rank-r PSD matrix | required measurements: 3nr | Helped |
| Use PhaseLift for rank-one phase retrieval | Phase retrieval · PhaseLift | required measurements: 3n | Helped |
| Use quadratic measurements with ℓ1 penalty for sparse matrix recovery | Sparse matrix recovery · Quadratic measurements, sparse matrix | required measurements: n^2 \delta^\star | Helped |
| Use a weighted sum of ℓ1 and trace penalties for simultaneous sparsity and low rank | Simultaneously sparse and low-rank matrix recovery · Quadratic measurements, simultaneously sparse and rank-r PSD matrix | required measurements: \mathcal O(\min (k^2,rn)) | Helped |
Closest papers by meaning
- Learning without the Phase: Regularized PhaseMax Achieves Optimal Sample Complexity (NeurIPS 2018 · similarity 0.90)
- Blind Deconvolutional Phase Retrieval via Convex Programming (NeurIPS 2018 · similarity 0.89)
- The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements (NeurIPS 2025 · similarity 0.89)
- A Fast and Provable Algorithm for Sparse Phase Retrieval (ICLR 2024 · similarity 0.87)
- Exact Recovery of Sparse Binary Vectors from Generalized Linear Measurements (ICML 2025 · similarity 0.87)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
