Stable low-rank matrix recovery via null space properties
From MaRDI portal
Publication:4606522
Abstract: The problem of recovering a matrix of low rank from an incomplete and possibly noisy set of linear measurements arises in a number of areas. In order to derive rigorous recovery results, the measurement map is usually modeled probabilistically. We derive sufficient conditions on the minimal amount of measurements ensuring recovery via convex optimization. We establish our results via certain properties of the null space of the measurement map. In the setting where the measurements are realized as Frobenius inner products with independent standard Gaussian random matrices we show that measurements are enough to uniformly and stably recover an matrix of rank at most . We then significantly generalize this result by only requiring independent mean-zero, variance one entries with four finite moments at the cost of replacing by some universal constant. We also study the case of recovering Hermitian rank- matrices from measurement matrices proportional to rank-one projectors. For rank-one projective measurements onto independent standard Gaussian vectors, we show that nuclear norm minimization uniformly and stably reconstructs Hermitian rank- matrices with high probability. Next, we partially de-randomize this by establishing an analogous statement for projectors onto independent elements of a complex projective 4-designs at the cost of a slightly higher sampling rate . Moreover, if the Hermitian matrix to be recovered is known to be positive semidefinite, then we show that the nuclear norm minimization approach may be replaced by minimizing the -norm of the residual subject to the positive semidefinite constraint. Then no estimate of the noise level is required a priori. We discuss applications in quantum physics and the phase retrieval problem.
Recommendations
- Low rank matrix recovery from rank one measurements
- Uniqueness conditions for low-rank matrix recovery
- The minimal measurement number for low-rank matrix recovery
- Low-rank matrix recovery via rank one tight frame measurements
- Minimization of the difference of nuclear and Frobenius norms for noisy low rank matrix recovery
Cites work
- scientific article; zbMATH DE number 4061904 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A mathematical introduction to compressive sensing
- A partial derandomization of phaselift using spherical designs
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Bounding the smallest singular value of a random matrix without concentration
- Characterization of the law of the iterated logarithm in Banach spaces
- Compressive Multiplexing of Correlated Signals
- Condition Numbers of Gaussian Random Matrices
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
- Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- Learning without concentration
- Living on the edge: phase transitions in convex programs with random data
- Low rank matrix recovery from rank one measurements
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Normalized iterative hard thresholding for matrix completion
- Null space conditions and thresholds for rank minimization
- On sparse reconstruction from Fourier and Gaussian measurements
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Painless reconstruction from magnitudes of frame coefficients
- Phase retrieval via Wirtinger flow: theory and algorithms
- Phase retrieval via matrix completion
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Quantum computation and quantum information. 10th anniversary edition
- Quantum tomography under prior information
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Restricted eigenvalue properties for correlated Gaussian designs
- Sharp recovery bounds for convex demixing, with applications
- Simultaneous analysis of Lasso and Dantzig selector
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Some estimates of norms of random matrices
- Stable optimizationless recovery from phaseless linear measurements
- Strong converse for identification via quantum channels
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The convex geometry of linear inverse problems
- The role of topology in quantum tomography
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Tight informationally complete quantum measurements
- User-friendly tail bounds for sums of random matrices
Cited in
(32)- Jointly low-rank and bisparse recovery: questions and partial answers
- Mixing properties of stochastic quantum Hamiltonians
- Complex phase retrieval from subgaussian measurements
- Guarantees of Riemannian optimization for low rank matrix recovery
- Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property
- Phase retrieval with PhaseLift algorithm
- An analysis of noise folding for low-rank matrix recovery
- Uniqueness conditions for low-rank matrix recovery
- Fast state tomography with optimal error bounds
- Estimation of low rank density matrices: bounds in Schatten norms and other distances
- Compressive statistical learning with random feature moments
- Efficient matrix sensing using rank-1 Gaussian measurements
- Gradient descent for deep matrix factorization: dynamics and implicit bias towards low rank
- Perturbation analysis of low-rank matrix stable recovery
- Harmonic mean iteratively reweighted least squares for low-rank matrix recovery
- Almost everywhere injectivity conditions for the matrix recovery problem
- The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising
- On the robustness of noise-blind low-rank recovery from rank-one measurements
- Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval
- ROP: matrix recovery via rank-one projections
- On connections between amplitude flow and error reduction for phase retrieval and ptychography
- Stability of low-rank matrix recovery and its connections to Banach space geometry
- Null space conditions and thresholds for rank minimization
- Recovery of low-rank matrices based on the rank null space properties
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- Low-rank matrix recovery via rank one tight frame measurements
- Algebraic compressed sensing
- Near-optimal matrix recovery from random linear measurements
- Truncated sparse approximation property and truncated \(q\)-norm minimization
- Proof methods for robust low-rank matrix recovery
- Statistical analysis of compressive low rank tomography with random measurements
- The minimal measurement number for low-rank matrix recovery
This page was built for publication: Stable low-rank matrix recovery via null space properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606522)
