atlas

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

Online Partial Least Square Optimization: Dropping Convexity for Better Efficiency and Scalability

ICML 2017 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization · 6 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
Replace convex MSG (lifted nuclear-norm relaxation with Fantope projection) with nonconvex projected SGD on the unit sphere (PSG)Online PLS (rank-1) on MNIST subset (labels 3,4,5,9) · MNIST subset, n=23343, m=d=392iterations and wall-clock time to reach accuracy (log of 1 - (1/sqrt2)(u_k^T u_hHelped
Replace convex MSG with nonconvex projected SGD (no expensive Fantope projection per iteration)Online PLS wall-clock efficiency · MNIST subset, n=23343wall clock timeHelped
Use diminishing step size eta_k ~ k^-1 (lambda1-lambda2)^-1 log d instead of fixed step sizeNonconvex SGD for online PLS · synthetic and MNIST (empirical observation)empirical convergence performanceHelped
Theoretical iteration complexity of nonconvex SGD vs convex MSG (O(eps^-2 log(1/eps)))Online PLS · theoryiterations to eps-optimal: O(eps^-1 log(1/eps)) vs O(eps^-2 log(1/eps)), a factor of eps^-1Helped

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