Fetching the paper…
Reading the bibliography…
We show how to efficiently project a vector onto the top principal components of a matrix, without explicitly computing these components.
The relations of the newer multivariate statistical methods to factor analysis
Harold Hotelling · 1957
Earlier work this paper cites.
Solution of incorrectly formulated problems and the regularization method
Andrey Tikhonov · 1963
Earlier work this paper cites.
A method for unconstrained convex minimization problem with the rate of convergence o ( 1 / k 2 ) o(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
The truncated SVD as a method for regularization
Per Christian Hansen · 1987
Earlier work this paper cites.
Computing truncated singular value decomposition least squares solutions by rank revealing qr-factorizations
Tony F. Chan and Per Christian Hansen · 1990
Earlier work this paper cites.
A statistical view of some chemometrics regression tools
Ildiko E. Frank and Jerome H. Friedman · 1993
Earlier work this paper cites.
Numerical methods for the QCD overlap operator I: Sign-function and error bounds
Jasper van den Eshof, Andreas Frommer, Thomas Lippert, Klaus Schilling, and Henk A. van der Vorst · 2002
Earlier work this paper cites.
Uniform approximation of s g n ( x ) sgn(x) by polynomials and entire functions
Alexandre Eremenko and Peter Yuditskii · 2007
Cited alongside, same era.
Random features for large-scale kernel machines
Ali Rahimi and Benjamin Recht · 2007
Cited alongside, same era.
Model Order Reduction: Theory, Research Aspects and Applications
Andreas Frommer and Valeria Simoncini · 2008
Cited alongside, same era.
Functions of Matrices: Theory and Computation
Nicholas J. Higham · 2008
Cited alongside, same era.
Polynomials of the best uniform approximation to s g n ( x ) sgn(x) on two intervals
Alexandre Eremenko and Peter Yuditskii · 2011
Cited alongside, same era.
A risk comparison of ordinary least squares vs ridge regression
Paramveer S. Dhillon, Dean P. Foster, Sham M. Kakade, and Lyle H. Ungar · 2013
Cited alongside, same era.
Faster SVD-truncated regularized least-squares
Christos Boutsidis and Malik Magdon-Ismail · 2014
Later among the works it cites.
An accelerated proximal coordinate gradient method
Qihang Lin, Zhaosong Lu, and Lin Xiao · 2014
Later among the works it cites.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2014
Later among the works it cites.
Faster algorithms via approximation theory
Sushant Sachdeva and Nisheeth K. Vishnoi · 2014
Later among the works it cites.
Uniform sampling for matrix approximation
Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2015
Later among the works it cites.
Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization
Roy Frostig, Rong Ge, Sham M. Kakade, and Aaron Sidford · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L. Nguyên · 2013
Cited alongside, same era.
Later among the works it cites.
MNIST handwritten digit database
Yann LeCun, Corinna Cortes, and Christopher J.C. Burges · 2015
Later among the works it cites.