Fetching the paper…
Reading the bibliography…
We describe a new algorithm called Frequent Directions for deterministic matrix sketching in the row-updates model.
Finding repeated elements
J. Misra and D. Gries · 1982
Earlier work this paper cites.
Introduction to finite fields and their applications
R. Lidl and H. Niederreiter · 1986
Earlier work this paper cites.
Elements of Information Theory
Thomas M. Cover and Joy Thomas · 1991
Earlier work this paper cites.
A stable and fast algorithm for updating the singular value decomposition
M. Gu and S. C. Eisenstat · 1993
Earlier work this paper cites.
Communication Complexity
Eyal Kushilevitz and Noam Nisan · 1997
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.
Synopsis data structures for massive data sets
Phillip B Gibbons and Yossi Matias · 1999
Earlier work this paper cites.
On randomized one-round communication complexity
Ilan Kremer, Noam Nisan, and Dana Ron · 1999
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.
Database-friendly random projections
Dimitris Achlioptas · 2001
Earlier work this paper cites.
Fast computation of low rank matrix approximations
Dimitris Achlioptas and Frank McSherry · 2001
Earlier work this paper cites.
Strong converse for identification via quantum channels
Rudolf Ahlswede and Andreas Winter · 2002
Earlier work this paper cites.
Incremental singular value decomposition of uncertain data with missing values
Matthew Brand · 2002
Earlier work this paper cites.
Finding frequent items in data streams
Moses Charikar, Kevin Chen, and Martin Farach-Colton · 2002
Earlier work this paper cites.
Frequency estimation of internet packet streams with limited space
Erik D Demaine, Alejandro López-Ortiz, and J. Ian Munro · 2002
Earlier work this paper cites.
Pass efficient algorithms for approximating large matrices
Petros Drineas and Ravi Kannan · 2003
Earlier work this paper cites.
Identifying frequent items in sliding windows over on-line packet streams
Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro Lopez-Ortiz, and J. Ian Munro · 2003
Earlier work this paper cites.
A simple algorithm for finding frequent elements in streams and bags
Richard M. Karp, Scott Shenker, and Christos H. Papadimitriou · 2003
Earlier work this paper cites.
Fast Monte-Carlo algorithms for finding low-rank approximations
Alan Frieze, Ravi Kannan, and Santosh Vempala · 2004
Cited alongside, same era.
The random projection method
Santosh S Vempala · 2004
Cited alongside, same era.
Data Streams: Algorithms and Applications
S. Muthukrishnan · 2005
Cited alongside, same era.
On the largest principal angle between random subspaces
P.A. Absil, A. Edelman, and P. Koev · 2006
Cited alongside, same era.
A fast random sampling algorithm for sparsifying matrices
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2006
Cited alongside, same era.
Adaptive sampling and fast low-rank matrix approximation
Amit Deshpande and Santosh Vempala · 2006
Cited alongside, same era.
A sparse Johnson-Lindenstrauss transform
Anirban Dasgupta, Ravi Kumar, and Tamás Sarlós · 2010
Later among the works it cites.
Sums of random hermitian matrices and an inequality by rudelson
Roberto Imbuzeiro Oliveira · 2010
Later among the works it cites.
Non-asymptotic theory of random matrices: extreme singular values
Mark Rudelson and Roman Vershynin · 2010
Later among the works it cites.
http://www.vision.caltech.edu/visipedia/cub-200-2011.html
2011
Later among the works it cites.
Near optimal column-based matrix reconstruction
Christos Boutsidis, Petros Drineas, and Malik Magdon-Ismail · 2011
Later among the works it cites.
Faster least squares approximation
Petros Drineas, Michael W Mahoney, S Muthukrishnan, and Tamás Sarlós · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast monte carlo algorithms for matrices II: Computing a low-rank approximation to a matrix
Petros Drineas, Ravi Kannan, and Michael W. Mahoney · 2006
Cited alongside, same era.
An integrated efficient solution for computing frequent and top-k elements in data streams
Ahmed Metwally, Divyakant Agrawal, and Amr El. Abbadi · 2006
Cited alongside, same era.
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.
A note on element-wise matrix sparsification via a matrix-valued bernstein inequality
Petros Drineas and Anastasios Zouzias · 2011
Later among the works it cites.
Spectral norm of products of random and deterministic matrices
Roman Vershynin · 2011
Later among the works it cites.
Matrix computations
Gene H Golub and Charles F Van Loan · 2012
Later among the works it cites.
Sparser Johnson-Lindenstrauss transforms
Daniel M Kane and Jelani Nelson · 2012
Later among the works it cites.
Mergeable summaries
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi · 2013
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.
Turning big data into tiny data: Constant-size coresets for k
Dan Feldman, Melanie Schmidt, and Christian Sohler · 2013
Later among the works it cites.
On differentially private low rank approximation
Michael Kapralov and Kunal Talwar · 2013
Later among the works it cites.
Simple and deterministic matrix sketching
Edo Liberty · 2013
Later among the works it cites.
Improved practical matrix sketching with guarantees
Mina Ghashami, Amey Desai, and Jeff M. Phillips · 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.
Low rank approximation lower bounds in row-update streams
David P. Woodruff · 2014
Later among the works it cites.