AI Paper Atlas

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

Non-Convex Matrix Completion and Related Problems via Strong Duality

Maria-Florina Balcan, Yingyu Liang, Zhao Song, David P. Woodruff, Hongyang Zhang

JMLR 2019 · Learning theory and algorithms › Matrix and tensor methods · approach: Matrix completion and factorization · 7 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 r* minimization (known rank) instead of nuclear norm minimizationmatrix completion · Hopkins 155 (avg over 155 tasks, 5% observed)relative error: 0.8249 -> 0.8114Improved
use r* minimization instead of nuclear norm minimizationmatrix completion · Hopkins 155 (avg over 155 tasks, 10% observed)relative error: 0.5689 -> 0.5409Improved
use r* minimization instead of nuclear norm at 5% observations on individual tasksmatrix completion · Hopkins 155 tasks #1-#5 (5% observed)relative error: task #1: 0.7438 -> 0.5948; task #4: 0.8500 -> 0.9583Mixed
use r* minimization instead of nuclear norm at 10% observationsmatrix completion · Hopkins 155 tasks #1-#5 (10% observed)relative error: task #5: 0.4476 -> 0.4477No clear effect
use r* minimization instead of nuclear norm minimizationmatrix completion · Synthetic 100x100 and 200x200 exact recoverysuccess region of exact recoveryImproved

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