Fetching the paper…
Reading the bibliography…
Most of machine learning deals with vector parameters.
The principle of minimized iterations in the solution of the matrix eigenvalue problem
Walter E. Arnoldi · 1951
Earlier work this paper cites.
Numerische Mathematik , 31(1):31–48, 1978/79
James R. Bunch, Christopher P. Nielsen, and Danny C. Sorensen · 1978
Earlier work this paper cites.
Lanczos Algorithms for Large Symmetric Eigenvalue Computations
Jane K. Cullum and Ralph A. Willoughby · 1985
Earlier work this paper cites.
Local operator theory, random matrices and Banach spaces
Kenneth R. Davidson and Stanislaw J. Szarek · 2001
Earlier work this paper cites.
Efficient algorithms for online decision problems
Adam Tauman Kalai and Santosh Vempala · 2005
Earlier work this paper cites.
Matrix exponentiated gradient updates for on-line learning and Bregman projections
Koji Tsuda, Gunnar Rätsch, and Manfred K. Warmuth · 2005
Earlier work this paper cites.
Prediction, learning, and games
Nicolò Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Online variance minimization
Manfred K. Warmuth and Dima Kuzmin · 2006
Earlier work this paper cites.
A combinatorial, primal-dual approach to semidefinite programs
Sanjeev Arora and Satyen Kale · 2007
Cited alongside, same era.
Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension
Manfred K. Warmuth and Dima Kuzmin · 2008
Cited alongside, same era.
On-line variance minimization in O ( n 2 ) {O}(n^{2}) per trial?
Elad Hazan, Satyen Kale, and Manfred K. Warmuth · 2010
Cited alongside, same era.
Stochastic optimization for PCA and PLS
Raman Arora, Andrew Cotter, Karen Livescu, and Nathan Srebro · 2012
Cited alongside, same era.
Projection-free online learning
Elad Hazan and Satyen Kale · 2012
Cited alongside, same era.
Topics in Random Matrix Theory
Terence Tao · 2012
Cited alongside, same era.
Prediction by random-walk perturbation
Luc Devroye, Gábor Lugosi, and Gergely Neu · 2013
Later among the works it cites.
Online PCA with optimal regrets
Nie Jiazhong, Wojciech Kotłowski, and Manfred K. Warmuth · 2013
Later among the works it cites.
Private communication, 2014
Gergely Neu and Gábor Lugosi · 2014
Later among the works it cites.
Follow the leader with dropout perturbations
Tim van Erven, Wojciech Kotłowski, and Manfred K. Warmuth · 2014
Later among the works it cites.
Online Principal Components Analysis
Christos Boutsidis, Dan Garber, Zohar Shay Karnin, and Edo Liberty · 2015
Closest in time.
Online learning of eigenvectors
Dan Garber, Elad Hazan, and Tengyu Ma · 2015
Closest in time.
A stochastic PCA and SVD algorithm with an exponential convergence rate
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stochastic optimization of PCA with capped MSG
Raman Arora, Andrew Cotter, and Nati Srebro · 2013
Cited alongside, same era.
The fast convergence of incremental PCA
Akshay Balsubramani, Sanjoy Dasgupta, and Yoav Freund · 2013
Cited alongside, same era.
Ohad Shamir · 2015
Closest in time.