Fetching the paper…
Reading the bibliography…
This paper describes Sparse Frequent Directions, a variant of Frequent Directions for sketching sparse matrices.
Newsweeder: Learning to filter netnews
Ken Lang · 1995
Earlier work this paper cites.
Incremental eigenanalysis for classification
Peter Hall, David Marshall, and Ralph Martin · 1998
Earlier work this paper cites.
Latent semantic indexing: A probabilistic analysis
Christos H. Papadimitriou, Hisao Tamaki, Prabhakar Raghavan, and Santosh Vempala · 1998
Earlier work this paper cites.
Sequential karhunen-loeve basis extraction and its application to images
A Levey and Michael Lindenbaum · 2000
Earlier work this paper cites.
Concept decompositions for large sparse text data using clustering
Inderjit S Dhillon and Dharmendra S Modha · 2001
Earlier work this paper cites.
Incremental singular value decomposition of uncertain data with missing values
Matthew Brand · 2002
Earlier work this paper cites.
Competitive recommendation systems
Petros Drineas, Iordanis Kerenidis, and Prabhakar Raghavan · 2002
Earlier work this paper cites.
Pass efficient algorithms for approximating large matrices
Petros Drineas and Ravi Kannan · 2003
Earlier work this paper cites.
Fast monte-carlo algorithms for finding low-rank approximations
Alan Frieze, Ravi Kannan, and Santosh Vempala · 2004
Earlier work this paper cites.
The random projection method
Santosh S Vempala · 2004
Earlier work this paper cites.
Adaptive sampling and fast low-rank matrix approximation
Amit Deshpande and Santosh Vempala · 2006
Earlier work this paper cites.
Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix
Petros Drineas, Ravi Kannan, and Michael W. Mahoney · 2006
Earlier work this paper cites.
Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition
Petros Drineas, Ravi Kannan, and Michael W Mahoney · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
Tamas Sarlos · 2006
Cited alongside, same era.
Randomized algorithms for the low-rank approximation of matrices
Edo Liberty, Franco Woolfe, Per-Gunnar Martinsson, Vladimir Rokhlin, and Mark Tygert · 2007
Cited alongside, same era.
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson and Roman Vershynin · 2007
Cited alongside, same era.
Relative-error cur matrix decompositions
Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan · 2008
Cited alongside, same era.
On variants of the johnson–lindenstrauss lemma
Jiří Matoušek · 2008
Cited alongside, same era.
Incremental learning for robust visual tracking
David A Ross, Jongwoo Lim, Ruei-Sung Lin, and Ming-Hsuan Yang · 2008
Cited alongside, same era.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
Nathan Halko, Per-Gunnar Martinsson, and Joel A Tropp · 2011
Later among the works it cites.
Matrix computations
Gene H Golub and Charles F Van Loan · 2012
Later among the works it cites.
Low rank approximation and regression in input sparsity time
Kenneth L. Clarkson and David P. Woodruff · 2013
Later among the works it cites.
Simple and deterministic matrix sketching
Edo Liberty · 2013
Later among the works it cites.
Simple and deterministic matrix sketching
Edo Liberty · 2013
Later among the works it cites.
OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L. Nguyen · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A fast randomized algorithm for the approximation of matrices
Franco Woolfe, Edo Liberty, Vladimir Rokhlin, and Mark Tygert · 2008
Cited alongside, same era.
An improved approximation algorithm for the column subset selection problem
Christos Boutsidis, Michael W Mahoney, and Petros Drineas · 2009
Cited alongside, same era.
Cur matrix decompositions for improved data analysis
Michael W Mahoney and Petros Drineas · 2009
Cited alongside, same era.
A randomized algorithm for principal component analysis
Vladimir Rokhlin, Arthur Szlam, and Mark Tygert · 2009
Cited alongside, same era.
Near optimal column-based matrix reconstruction
Christos Boutsidis, Petros Drineas, and Malik Magdon-Ismail · 2011
Cited alongside, same era.
Faster least squares approximation
Petros Drineas, Michael W Mahoney, S Muthukrishnan, and Tamás Sarlós · 2011
Cited alongside, same era.
Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
Rafi Witten and Emmanuel Candès · 2013
Later among the works it cites.
Optimal cur matrix decompositions
Christos Boutsidis and David P Woodruff · 2014
Later among the works it cites.
Relative errors for deterministic low-rank matrix approximations
Mina Ghashami and Jeff M Phillips · 2014
Later among the works it cites.
Improved practical matrix sketching with guarantees
Amey Desai, Mina Ghashami, and Jeff M Phillips · 2015
Later among the works it cites.
Frequent directions: Simple and deterministic matrix sketching
Mina Ghashami, Edo Liberty, Jeff M Phillips, and David P Woodruff · 2015
Later among the works it cites.
Stronger approximate singular value decomposition via the block lanczos and power methods
Cameron Musco and Christopher Musco · 2015
Later among the works it cites.