Fetching the paper…
Reading the bibliography…
We consider the problem of principal component analysis (PCA) in a streaming stochastic setting, where our goal is to find a direction of approximate maximal variance, based on a stream of i.i.d.
Liii. on lines and planes of closest fit to systems of points in space
K. Pearson · 1901
Earlier work this paper cites.
Analysis of a complex of statistical variables into principal components
H. Hotelling · 1933
Earlier work this paper cites.
Simplified neuron model as a principal component analyzer
E. Oja · 1982
Earlier work this paper cites.
On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix
E. Oja and J. Karhunen · 1985
Earlier work this paper cites.
Estimating the largest eigenvalue by the power and lanczos algorithms with a random start
J. Kuczynski and H. Wozniakowski · 1992
Earlier work this paper cites.
Measure concentration lecture notes
A. Barvinok · 2005
Earlier work this paper cites.
Online variance minimization
M. Warmuth and D. Kuzmin · 2006
Earlier work this paper cites.
The tradeoffs of large scale learning
Olivier Bousquet and Léon Bottou · 2008
Earlier work this paper cites.
Randomized online pca algorithms with regret bounds that are logarithmic in the dimension
M. Warmuth and D. Kuzmin · 2008
Earlier work this paper cites.
Stochastic convex optimization
S. Shalev-Shwartz, O. Shamir, N. Srebro, and K. Sridharan · 2009
Earlier work this paper cites.
Stochastic optimization for PCA and PLS
R. Arora, A. Cotter, K. Livescu, and N. Srebro · 2012
Cited alongside, same era.
Making gradient descent optimal for strongly convex stochastic optimization
A. Rakhlin, O. Shamir, and K. Sridharan · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
J. Tropp · 2012
Cited alongside, same era.
Stochastic optimization of PCA with capped MSG
R. Arora, A. Cotter, and N. Srebro · 2013
Cited alongside, same era.
The fast convergence of incremental PCA
A. Balsubramani, S. Dasgupta, and Y. Freund · 2013
Cited alongside, same era.
Memory limited, streaming PCA
I. Mitliagkas, C. Caramanis, and P. Jain · 2013
Cited alongside, same era.
Online principal components analysis
C. Boutsidis, D. Garber, Z. Karnin, and E. Liberty · 2015
Closest in time.
Global convergence of stochastic gradient descent for some nonconvex matrix problems
C. De Sa, K. Olukotun, and C. Ré · 2015
Closest in time.
Fast and simple pca via convex optimization
D. Garber and E. Hazan · 2015
Closest in time.
Online learning of eigenvectors
D. Garber, E. Hazan, and T. Ma · 2015
Closest in time.
C. Jin, S. Kakade, C. Musco, P. Netrapalli, and A. Sidford · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Nie, W. Kotłowski, and M. Warmuth · 2013
Cited alongside, same era.
Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes
O. Shamir and T. Zhang · 2013
Cited alongside, same era.
The noisy power method: A meta algorithm with applications
M. Hardt and E. Price · 2014
Cited alongside, same era.
Understanding Machine Learning: From Theory to Algorithms
S. Shalev-Shwartz and S. Ben-David · 2014
Cited alongside, same era.
W. Kotłowski and M. Warmuth · 2015
Closest in time.
Stronger approximate singular value decomposition via the block lanczos and power methods
C. Musco and C. Musco · 2015
Closest in time.
Fast stochastic algorithms for svd and pca: Convergence properties and convexity
O. Shamir · 2015
Closest in time.
A stochastic PCA and SVD algorithm with an exponential convergence rate
O. Shamir · 2015
Closest in time.