mlsanityData to 14 Oct 2026

Sharp Restricted Isometry Thresholds for Global Minima of Rank-Restricted Matrix LASSO

arXiv 2608.29018 ↗First posted 29 Aug 2026stat.ML cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We determine the sharp restricted isometry threshold for recovery at global minima of the rank-restricted matrix LASSO. For target rank rstar, if the rank-k RIP constant satisfies δ<δsharp(k/rstar), where δsharp(t)=t/(4-t) for 0<t<4/3 and δsharp(t)=√(t-1)/t for t≥4/3, then every global minimizer has Frobenius error lesssim√rstarλ for all λgtrsim|A*(xi)|op and at every search rank r≥ rstar. The constants depend only on the RIP constant and t=k/rstar, and in particular are independent of the search rank. When the rank restriction is inactive, the result specializes to the ordinary convex matrix LASSO. We also obtain the analogous results for sparsity-restricted vector LASSO. Conversely, we show that the threshold δ<δsharp(k/rstar) cannot be improved, due to the existence of counterexamples whose global minimizers fail to recover the ground truth.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 21 references that are in the map. First posted on arXiv 29 Aug 2026.

Builds on

5 of 21 references.

References · 5

  1. 2016The non-convex Burer-Monteiro approach works on smooth semidefinite programscited by 46
  2. 2022Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterizationcited by 13
  3. 2018Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty formcited by 10
  4. 2021Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regimecited by 5
  5. 2026Sharp recovery and landscape guarantees for the nonconvex matrix LASSOcited by 1

Built on by

Not cited yet.