atlas

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

Recovery guarantee of weighted low-rank approximation via alternating minimization

ICML 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Matrix completion and factorization · 14 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
Add clipping step (zero out rows of X/Y with squared l2 norm above 2*mu*k/n) to vanilla alternating minimizationalternating minimization for weighted low-rank approximation · theoretical analysis (matrix completion special case)recovery error bound ||M_hat - M*||_2Helped
Use random initialization (random sign matrix scaled by 1/sqrt(n)) instead of SVD initializationalternating minimization with clipping · theoretical analysisrecovery error bound and required spectral gap gammaNo clear effect
Replace SVD-based initialization with random initializationalternating minimization with clipping · theoretical analysisspectral gap requirement on gamma: gamma order 1/(mu^{3/2} k^2) vs 1/(mu^2 k^{5/2})Hurt

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