Sign-RIP: A Robust Restricted Isometry Property for Low-rank Matrix Recovery
Not on the map. Why?
Abstract (arXiv)
Restricted isometry property (RIP), essentially stating that the linear measurements are approximately norm-preserving, plays a crucial role in studying low-rank matrix recovery problem. However, RIP fails in the robust setting, when a subset of the measurements are grossly corrupted with noise. In this work, we propose a robust restricted isometry property, called Sign-RIP, and show its broad applications in robust low-rank matrix recovery. In particular, we show that Sign-RIP can guarantee the uniform convergence of the subdifferentials of the robust matrix recovery with nonsmooth loss function, even at the presence of arbitrarily dense and arbitrarily large outliers. Based on Sign-RIP, we characterize the location of the critical points in the robust rank-1 matrix recovery, and prove that they are either close to the true solution, or have small norm. Moreover, in the over-parameterized regime, where the rank of the true solution is over-estimated, we show that subgradient method converges to the true solution at a (nearly) dimension-free rate. Finally, we show that sign-RIP enjoys almost the same complexity as its classical counterparts, but provides significantly better robustness against noise.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 14 of its 34 references that are in the map. First posted on arXiv 5 Feb 2021.
Builds on
14 of 34 references.
References · 14
- 2017Implicit Regularization in Matrix Factorizationcited by 318
- 2017How to Escape Saddle Points Efficientlycited by 284
- 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
- 2016The Landscape of Empirical Risk for Non-convex Lossescited by 86
- 2016Global Optimality of Local Search for Low Rank Matrix Recoverycited by 81
- 2018Uniform Convergence of Gradients for Non-Convex Learning and Optimizationcited by 38
- 2021On the computational and statistical complexity of over-parameterized matrix sensingcited by 31
- 2020Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Numbercited by 27
- 2019Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recoverycited by 26
- 2020Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Over-parameterizationcited by 26
- 2018Graphical Convergence of Subgradients in Nonconvex Optimization and Learningcited by 17
- 2018Subgradient Descent Learns Orthogonal Dictionariescited by 17
Built on by
Citing papers per year: 2021: 1; 2022: 4; 2023: 3; 2024: 1; 2025: 1.
10 papers.
- 2022Algorithmic Regularization in Model-free Overparametrized Asymmetric Matrix Factorizationcited by 34
- 2021Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recoverycited by 21
- 2022Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterizationcited by 21
- 2023How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initializationcited by 18
- 2022A Validation Approach to Over-parameterized Matrix and Image Recoverycited by 8
- 2022Blessing of Nonconvexity in Deep Linear Models: Depth Flattens the Optimization Landscape Around the True Solutioncited by 3
- 2024On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learningcited by 3
- 2023Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?cited by 2
- 2023Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensingcited by 0
- 2025RANSAC Revisited: An Improved Algorithm for Robust Subspace Recovery under Adversarial and Noisy Corruptionscited by 0
- 2025RANSAC Revisited: An Improved Algorithm for Robust Subspace Recovery under Adversarial and Noisy Corruptions13 Apr 2025
- 2024On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning16 May 2024
- 2023How Over-Parameterization Slows Down Gradient Descent in Matrix Sensing: The Curses of Symmetry and Initialization3 Oct 2023
- 2023Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing24 Mar 2023
- 2023Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?21 Feb 2023
- 2022A Validation Approach to Over-parameterized Matrix and Image Recovery21 Sep 2022
- 2022Blessing of Nonconvexity in Deep Linear Models: Depth Flattens the Optimization Landscape Around the True Solution15 Jul 2022
- 2022Algorithmic Regularization in Model-free Overparametrized Asymmetric Matrix Factorization6 Mar 2022
- 2022Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterization17 Feb 2022
- 2021Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery23 Sep 2021