stat.MLAug 29, 2026

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

Authors: Richard Y. Zhang

Organizations: Department of Electrical and Computer Engineering, University of Illinois Urbana–Champaign, Urbana, IL 61801 USA

Abstract

We determine the sharp restricted isometry threshold for recovery at global minima of the rank-restricted matrix LASSO. For target rank r⋆r_{\star}, if the rank-kk RIP constant satisfies δ<δsharp(k/r⋆)δ<δ_{\mathrm{sharp}}(k/r_{\star}), where δsharp(t)=t/(4−t)δ_{\mathrm{sharp}}(t)=t/(4-t) for 0<t<4/30<t<4/3 and δsharp(t)=(t−1)/tδ_{\mathrm{sharp}}(t)=\sqrt{(t-1)/t} for t≥4/3t\ge4/3, then every global minimizer has Frobenius error ≲r⋆λ\lesssim\sqrt{r_{\star}}λ for all λ≳∥A∗(ξ)∥opλ\gtrsim\|\mathcal{A}^{*}(ξ)\|_{\mathrm{op}} and at every search rank r≥r⋆r\ge r_{\star}. The constants depend only on the RIP constant and t=k/r⋆t=k/r_{\star}, 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/r⋆)δ<δ_{\mathrm{sharp}}(k/r_{\star}) cannot be improved, due to the existence of counterexamples whose global minimizers fail to recover the ground truth.

Figures & tables

Explore similar work

CardsList
  1. Near-Optimal Nonconvex Matrix Completion

    Sep 15, 2026Jian-Feng Cai, Xiliang Lu, Juntao YouRiemannian OptimizationNonconvex Optimization

  2. Strict-Saddle Landscapes and Multi-Rank Geometry in Low-Tubal-Rank Tensor Sensing

    Sep 29, 2026Eugene Agyei-Kodie, Longxiu Huang, Shuang Li +1Nonconvex OptimizationOptimization Convergence Analysis

  3. A Fine-Grained Analysis of the LoRA Fine-Tuning Landscape with Implications for Data Selection

    Oct 5, 2026Bowen Zhang, Changrui Fang, Xinsong Ma +2Low-Rank AdaptationTraining Data Selection