atlas

Research map / Optimization / Nonconvex and smooth optimization

Stochastic PCA with $\ell_2$ and $\ell_1$ Regularization

ICML 2018 · Optimization › Nonconvex and smooth optimization · approach: Stochastic convex optimization complexity · 1 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 l2 regularization (strongly convex objective, step 1/(lambda t)) to MSGMSG convex relaxation of PCA · Synthetic and MNISTsuboptimality vs number of samplesHelped
Add l1 (trace) regularization that shifts spectrum by mu*eta_t IMSG · Synthetic and MNISTrank of iteratesHelped
Add l1 regularization to MSGMSG · Synthetic and MNISToverall CPU runtime to reach suboptimalityHelped
Add elastic-net (l1+l2) regularization to MSGMSG · Synthetic and MNISToverall CPU runtime and iteration complexityHelped
Use Oja's algorithm instead of regularized MSG variantsOja baseline · Synthetic and MNISTsuboptimality vs iterations and runtimeHurt
Choose regularization parameters within admissible range (lambda < gap, mu small)l1 and l2 regularized PCA · Theoryoptimum preservedNo clear effect

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