Proof methods for robust low-rank matrix recovery

DOI10.1007/978-3-031-09745-4_2zbMath1504.94038arXiv2106.04382OpenAlexW3168624210MaRDI QIDQ2106469

Peter Jung, David J. Gross, Felix Krahmer, Richard Kueng, Dominik Stöger, Tim Fuchs

Publication date: 14 December 2022

Full work available at URL: https://arxiv.org/abs/2106.04382

zbMATH Keywords

low-rank matrix recovery problemsreconstruction performance

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Uses Software

• SDPLR
• Wirtinger Flow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
• Improved recovery guarantees for phase retrieval from coded diffraction patterns
• Low rank matrix recovery from rank one measurements
• A mathematical introduction to compressive sensing
• Localization from incomplete noisy distance measurements
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• User-friendly tail bounds for sums of random matrices
• Explicit frames for deterministic phase retrieval via PhaseLift
• Convex multi-task feature learning
• Painless reconstruction from magnitudes of frame coefficients
• Characterization of the subdifferential of some matrix norms
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• The convex geometry of linear inverse problems
• Sparse power factorization: balancing peakiness and sample complexity
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
• Complex phase retrieval from subgaussian measurements
• A partial derandomization of phaselift using spherical designs
• Noisy low-rank matrix completion with general sampling distribution
• Phase retrieval: stability and recovery guarantees
• An algebraic characterization of injectivity in phase retrieval
• Phase retrieval from coded diffraction patterns
• Exact matrix completion via convex optimization
• Learning without Concentration
• Convex Recovery of a Structured Signal from Independent Random Linear Measurements
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Suprema of Chaos Processes and the Restricted Isometry Property
• Guaranteed Matrix Completion via Non-Convex Factorization
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
• Incoherence-Optimal Matrix Completion
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
• Blind Deconvolution Using Convex Programming
• Blind Recovery of Sparse Signals From Subsampled Convolution
• Identifiability in Bilinear Inverse Problems With Applications to Subspace or Sparsity-Constrained Blind Gain and Phase Calibration
• Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
• Bounding the Smallest Singular Value of a Random Matrix Without Concentration
• Decoding by Linear Programming
• Phase Retrieval Without Small-Ball Probability Assumptions
• Robust Nonnegative Sparse Recovery and the Nullspace Property of 0/1 Measurements
• Blind Demixing and Deconvolution at Near-Optimal Rate
• Practical Sketching Algorithms for Low-Rank Matrix Approximation
• Stable low-rank matrix recovery via null space properties
• Sparse Approximate Solutions to Linear Systems
• On the Convex Geometry of Blind Deconvolution and Matrix Completion
• Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access With a Massive MIMO Receiver
• Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization
• Living on the edge: phase transitions in convex programs with random data
• A Probabilistic and RIPless Theory of Compressed Sensing
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems
• Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
• A Simpler Approach to Matrix Completion
• Stable signal recovery from incomplete and inaccurate measurements
• Low-rank matrix completion using alternating minimization
• Phase Retrieval via Matrix Completion

This page was built for publication: Proof methods for robust low-rank matrix recovery