Fast Stochastic Algorithms for SVD and PCA: Convergence Properties and Convexity

Abstract

We study the convergence properties of the VR-PCA algorithm introduced by \cite{shamir2015stochastic} for fast computation of leading singular vectors. We prove several new results, including a formal analysis of a block version of the algorithm, and convergence from random initialization. We also make a few observations of independent interest, such as how pre-initializing with just a single exact power iteration can significantly improve the runtime of stochastic methods, and what are the convexity and non-convexity properties of the underlying optimization problem.

35 pages, 2 figures

Cited by in corpus (8)

• Riemannian stochastic variance reduced gradient algorithm with retraction and vector transport
• Sub-Sampled Newton Methods II: Local Convergence Rates
• Fast and Simple PCA via Convex Optimization
• Solving Large-scale Systems of Random Quadratic Equations via Stochastic Truncated Amplitude Flow
• Averaging Stochastic Gradient Descent on Riemannian Manifolds
• Faster Eigenvector Computation via Shift-and-Invert Preconditioning
• Vector Transport-Free SVRG with General Retraction for Riemannian Optimization: Complexity Analysis and Practical Implementation
• Noisy Accelerated Power Method for Eigenproblems with Applications