atlas

Research map / Optimization / Implicit bias and generalization

Sharp Restricted Isometry Property Bounds for Low-Rank Matrix Recovery Problems with Corrupted Measurements

AAAI 2022 · Optimization › Implicit bias and generalization · approach: Low-rank and single-index recovery · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Allow arbitrary noise distributions and use the event $\|\mathbf A^Tw\|\leq\epsilon$Global local-minimizer guarantee · Noisy low-rank matrix recoveryRIP constant threshold: $\delta<1/10$ -> $\delta<1/2$Helped
Reduce the RIP constantLow-rank matrix recovery · Noisy low-rank matrix recoverydistance from the ground truthHelped
Use the local guarantee rather than the global guarantee when the solution is in its specified neighborhoodLow-rank matrix recovery · Noisy low-rank matrix recovery, local neighborhoodRIP constant thresholdMixed
Use the exact Gaussian noise distribution to calculate the success probabilityGlobal local-minimizer guarantee · Isotropic Gaussian noisetightness of the boundHelped
Use perturbed gradient descent to find an approximate second-order critical pointStrict-saddle guarantee · Noisy low-rank matrix recoveryconvergence: $O(\mathrm{poly}(1/\kappa))$Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy