atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Local and Global Linear Convergence of General Low-Rank Matrix Recovery Problems

AAAI 2022 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization · 8 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
Use the perturbed gradient descent method with local improvement under the δ-RIP2r conditionSymmetric low-rank matrix recovery · Symmetric low-rank matrix recoveryiterations for ϵ-accuracy: O(log(1/ϵ))Helped
Use the perturbed gradient descent method with local improvement under the δ-RIP2r conditionAsymmetric low-rank matrix recovery · Asymmetric low-rank matrix recoveryiterations for ϵ-accuracy: O(log(1/ϵ))Helped
Use the PL inequality instead of the stronger local regularity conditionFactored low-rank matrix recovery · Local convergence regionRIP assumption and region sizeHelped
Perturb gradient steps and switch to local gradient descent once near a minimizerSymmetric low-rank matrix recovery · Symmetric low-rank matrix recoveryconvergence rate: O(log(1/ϵ))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