Fetching the paper…
Reading the bibliography…
Several important applications, such as streaming PCA and semidefinite programming, involve a large-scale positive-semidefinite (psd) matrix that is presented as a sequence of linear updates.
Matrix nearness problems and applications
N. J. Higham · 1989
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. X. Goemans and D. P. Williamson · 1995
Earlier work this paper cites.
Matrix analysis
R. Bhatia · 1997
Earlier work this paper cites.
Using the Nyström method to speed up kernel machines
C. K. I. Williams and M. Seeger · 2000
Earlier work this paper cites.
Spectral grouping using the Nyström method
C. Fowlkes, S. Belongie, F. Chung, and J. Malik · 2004
Earlier work this paper cites.
On the Nyström method for approximating a Gram matrix for improved kernel-based learning
P. Drineas and M. W. Mahoney · 2005
Earlier work this paper cites.
FastMap, MetricMap, and Landmark MDS are all Nyström algorithms
J. C. Platt · 2005
Earlier work this paper cites.
A fast randomized algorithm for the approximation of matrices
F. Woolfe, E. Liberty, V. Rokhlin, and M. Tygert · 2008
Earlier work this paper cites.
The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
N. Ailon and B. Chazelle · 2009
Earlier work this paper cites.
Numerical linear algebra in the streaming model
K. L. Clarkson and D. P. Woodruff · 2009
Earlier work this paper cites.
Accelerated dense random projections
E. Liberty · 2009
Earlier work this paper cites.
The University of Florida sparse matrix collection
T. A. Davis and Hu · 2011
Earlier work this paper cites.
The spectral norm error of the naïve Nyström extension
A. Gittens · 2011
Earlier work this paper cites.
Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P. G. Martinsson, and J. A. Tropp · 2011
Earlier work this paper cites.
Randomized algorithms for matrices and data
M. W. Mahoney · 2011
Cited alongside, same era.
A randomized algorithm for the decomposition of matrices
P.-G. Martinsson, V. Rokhlin, and M. Tygert · 2011
Cited alongside, same era.
Improved analysis of the subsampled randomized Hadamard transform
J. A. Tropp · 2011
Cited alongside, same era.
Sketched SVD: Recovering spectral features from compressed measurements
A. C. Gilbert, J. Y. Park, and M. B. Wakin · 2012
Cited alongside, same era.
Sampling methods for the Nyström method
S. Kumar, M. Mohri, and A. Talwalkar · 2012
Cited alongside, same era.
Nyström method vs random Fourier features: A theoretical and empirical comparison
T. Yang, Y.-F. Li, M. Mahdavi, R. Jin, and Z.-H. Zhou · 2012
Online principal components analysis
C. Boutsidis, D. Garber, Z. Karnin, and E. Liberty · 2015
Later among the works it cites.
Dimensionality reduction for k-means clustering and low rank approximation
M. B. Cohen, S. Elder, C. Musco, C. Musco, and M. Persu · 2015
Later among the works it cites.
Subspace iteration randomization and singular value problems
M. Gu · 2015
Later among the works it cites.
Optimal principal component analysis in distributed and streaming models
C. Boutsidis, D. Woodruff, and P. Zhong · 2016
Later among the works it cites.
Optimal Approximate Matrix Product in Terms of Stable Rank
M. B. Cohen, J. Nelson, and D. P. Woodruff · 2016
Later among the works it cites.
Dimensionality reduction of massive sparse datasets using coresets
D. Feldman, M. Volkov, and D. Rus · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Improved matrix algorithms via the subsampled randomized Hadamard transform
C. Boutsidis and A. Gittens · 2013
Cited alongside, same era.
Sublinear randomized algorithms for skeleton decompositions
J. Chiu and L. Demanet · 2013
Cited alongside, same era.
Topics in Randomized Numerical Linear Algebra
A. Gittens · 2013
Cited alongside, same era.
Revisiting the Nyström method for improved large-scale machine learning
A. Gittens and M. W. Mahoney · 2013
Cited alongside, same era.
Memory limited, streaming PCA
I. Mitliagkas, C. Caramanis, and P. Jain · 2013
Cited alongside, same era.
Turnstile streaming algorithms might as well be linear sketches
Y. Li, H. L. Nguyen, and D. P. Woodruff · 2014
Cited alongside, same era.
Frequent directions: Simple and deterministic matrix sketching
M. Ghasemi, E. Liberty, J. M. Phillips, and D. P. Woodruff · 2016
Later among the works it cites.
Revisiting the Nyström method for improved large-scale machine learning
A. Gittens and M. W. Mahoney · 2016
Later among the works it cites.
Streaming PCA: Matching matrix Bernstein and near-optimal finite sample guarantees for Oja’s algorithm
P. Jain, C. Jin, S. M. Kakade, P. Netrapalli, and A. Sidford · 2016
Later among the works it cites.
Low-rank PSD approximation in input-sparsity time
K. Clarkson and D. Woodruff · 2017
Closest in time.
Algorithm 971: An implementation of a randomized algorithm for principal component analysis
H. Li, G. C. Linderman, A. Szlam, K. P. Stanton, Y. Kluger, and M. Tygert · 2017
Closest in time.
Sublinear time low-rank approximation of positive semidefinite matrices
C. Musco and D. Woodruff · 2017
Closest in time.
Randomized single-view algorithms for low-rank matrix approximation
J. A. Tropp, A. Yurtsever, M. Udell, and V. Cevher · 2017
Closest in time.
Sketchy decisions: Convex low-rank matrix optimization with optimal storage
A. Yurtsever, M. Udell, J. A. Tropp, and V. Cevher · 2017
Closest in time.