mlsanityData to 7 Oct 2026

Sign-RIP: A Robust Restricted Isometry Property for Low-rank Matrix Recovery

arXiv 2102.02969 ↗First posted 5 Feb 2021cs.LG stat.MLcited by 10

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

  1. 2017Implicit Regularization in Matrix Factorizationcited by 318
  2. 2017How to Escape Saddle Points Efficientlycited by 284
  3. 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
  4. 2016The Landscape of Empirical Risk for Non-convex Lossescited by 86
  5. 2016Global Optimality of Local Search for Low Rank Matrix Recoverycited by 81
  6. 2018Uniform Convergence of Gradients for Non-Convex Learning and Optimizationcited by 38
  7. 2021On the computational and statistical complexity of over-parameterized matrix sensingcited by 31
  8. 2020Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Numbercited by 27
  9. 2019Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recoverycited by 26
  10. 2020Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Over-parameterizationcited by 26
  11. 2018Graphical Convergence of Subgradients in Nonconvex Optimization and Learningcited by 17
  12. 2018Subgradient Descent Learns Orthogonal Dictionariescited by 17
2 more
  1. 2018Exact Guarantees on the Absence of Spurious Local Minima for Non-negative Rank-1 Robust Principal Component Analysiscited by 13
  2. 2018A theory on the absence of spurious solutions for nonconvex and nonsmooth optimizationcited by 3

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 4; 2023: 3; 2024: 1; 2025: 1.

10 papers.