AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain

Zeyuan Allen-Zhu, Yuanzhi Li

NeurIPS 2016 · Optimization › Nonconvex and smooth optimization · approach: Stochastic variance reduction · 30 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 repeated single-vector 1-SVD instead of a block methodk-SVD · SNAP/amazon0302, SNAP/email-enron, news20, RCV1relative error versus running timeImproved
Use repeated single-vector 1-SVD instead of the block power methodk-SVD · SNAP/amazon0302, SNAP/email-enron, news20, RCV1relative error versus running timeImproved
Use unstable three-term recurrence for block KrylovBlock Krylov · selected experimentsperformance at small TMixed
Use alternating minimization in the NNZ algorithmNNZ k-SVD · k-SVD, NNZrunning time dependence on ε: 1/ε2Hurt
Subsample the matrix before applying LazySVDLazySVD · k-SVD, NNZrunning time dependence on ε: 1/ε2Improved

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