AI Paper Atlas

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

Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements

Tian Tong, Cong Ma, Ashley Prater-Bennette, Erin Tripp, Yuejie Chi

JMLR 2022 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank tensor completion · 25 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
scale the gradient with the factor-wise preconditioner (ScaledGD) instead of plain GDlow-rank tensor completion · Tensor completion, n=100, r=5, p=0.1, kappa=1,2,5,10iterations to convergence: ScaledGD takes 17 iterations over the entire range of kappa, while GD takes thousands of iterationsImproved
use ScaledGD instead of GD with the step size tuned for GDtensor completion · n=100, r=5, p=0.1, step size 0.1 to 0.9relative error after 80 iterationsImproved
random initialization instead of spectral initialization (ablation)ScaledGD · n=100, r=5, p=0.1, kappa=1,2,5,10convergence behaviorNo clear effect
random initialization instead of spectral initialization (ablation)GD · n=100, r=5, p=0.1, kappa=1,2,5,10convergence behaviorHurt

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