AI Paper Atlas

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

Near-Optimal Weighted Matrix Completion

Oscar López

JMLR 2023 · Learning theory and algorithms › Matrix and tensor methods · approach: Matrix completion and factorization · 1 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 the T1 subspace weighted program instead of the original weighted program when prior subspace is accurateweighted nuclear norm minimization · Synthetic matrix completion, PABS 0.1, 1% observedaverage relative error: relative error approx .1 with 1% of observed entriesImproved
use the T1 subspace weighted program when prior subspace is less accurateweighted nuclear norm minimization · Synthetic matrix completion, PABS 0.2, 15% observedaverage relative errorHurt
increase sampling percentage so T2 and original program approach T1weighted programs with accurate subspaces · Synthetic matrix completion, PABS 0.1average relative error: comparable relative errors from as little as 8% of observed entriesImproved

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