Fetching the paper…
Reading the bibliography…
Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning.
“On Lines and Planes of Closest Fit to Systems of Points in Space.”
Pearson K (1901) · 1901
Earlier work this paper cites.
“Analysis of a Complex of Statistical Variables into Principal Components.”
Hotelling H (1933) · 1933
Earlier work this paper cites.
“The Approximation of one Matrix by Another of Lower Rank.”
Eckart C, Young G (1936) · 1936
Earlier work this paper cites.
“Calculating the Singular Values and Pseudo-Inverse of a Matrix.”
Golub G, Kahan W (1965) · 1965
Earlier work this paper cites.
“Singular Value Decomposition and Least Squares Solutions.”
Golub GH, Reinsch C (1970) · 1970
Earlier work this paper cites.
“Extensions of Lipschitz Mappings into a Hilbert Space.”
Johnson WB, Lindenstrauss J (1984) · 1984
Earlier work this paper cites.
“On the Early History of the Singular Value Decomposition.”
Stewart GW (1993) · 1993
Earlier work this paper cites.
“An Implicitly Restarted Lanczos Method for Large Symmetric Eigenvalue Problems.”
Calvetti D, Reichel L, Sorensen DC (1994) · 1994
Earlier work this paper cites.
Randomized Algorithms
Motwani R, Raghavan P (1995) · 1995
Earlier work this paper cites.
Matrix Computations
Golub GH, Van Loan CF (1996) · 1996
Earlier work this paper cites.
Applied Numerical Linear Algebra
Demmel J (1997) · 1997
Earlier work this paper cites.
Numerical Linear Algebra
Trefethen LN, Bau D (1997) · 1997
Earlier work this paper cites.
“Lanczos Bidiagonalization with Partial Reorthogonalization.”
Larsen RM (1998) · 1998
Earlier work this paper cites.
“Gradient-Based Learning Applied to Document Recognition.”
Lecun Y, Bottou L, Bengio Y, Haffner P (1998) · 1998
Earlier work this paper cites.
Nonlinear programming
Bertsekas DP (1999) · 1999
Earlier work this paper cites.
“The Best of the 20th Century: Editors Name Top 10 Algorithms.”
Cipra BA (2000) · 2000
Earlier work this paper cites.
“High-Dimensional Data Analysis: The Curses and Blessings of Dimensionality.”
Donoho DL (2000) · 2000
Earlier work this paper cites.
Principal Component Analysis
Jolliffe I (2002) · 2002
Earlier work this paper cites.
Modern Applied Statistics with \proglang
Venables WN, Ripley BD (2002) · 2002
Earlier work this paper cites.
“Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations.”
Frieze A, Kannan R, Vempala S (2004) · 2004
Earlier work this paper cites.
“Augmented Implicitly Restarted Lanczos Bidiagonalization Methods.”
Baglama J, Reichel L (2005) · 2005
Cited alongside, same era.
“High Breakdown Estimators for Principal Components: The Projection-Pursuit Approach Revisited.”
Croux C, Ruiz-Gazen A (2005) · 2005
Cited alongside, same era.
“ROBPCA: A New Approach to Robust Principal Component Analysis.”
Hubert M, Rousseeuw PJ, Vanden Branden K (2005) · 2005
Cited alongside, same era.
“Very sparse random projections.”
Li P, Hastie TJ, Church KW (2006) · 2006
Cited alongside, same era.
“Improved Approximation Algorithms for Large Matrices via Random Projections.”
Sarlos T (2006) · 2006
Cited alongside, same era.
“The \pkg
Dray S, Dufour A (2007) · 2007
Cited alongside, same era.
“The Optimal Hard Threshold for Singular Values is 4 / 3 4/\sqrt{3} .”
Gavish M, Donoho DL (2014) · 2014
Later among the works it cites.
“An Implementation of a Randomized Algorithm for Principal Component Analysis.”
Szlam A, Kluger Y, Tygert M (2014) · 2014
Later among the works it cites.
“Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?”
Cardot H, Degras D (2015) · 2015
Later among the works it cites.
“Linear Dimensionality Reduction: Survey, Insights, and Generalizations.”
Cunningham JP, Ghahramani Z (2015) · 2015
Later among the works it cites.
“Subspace Iteration Randomization and Singular Value Problems.”
Gu M (2015) · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Randomized Algorithms for the Low-Rank Approximation of Matrices.”
Liberty E, Woolfe F, Martinsson PG, Rokhlin V, Tygert M (2007) · 2007
Cited alongside, same era.
“Caret package.”
Kuhn M (2008) · 2008
Cited alongside, same era.
“FactoMineR: An R Package for Multivariate Analysis.”
Lê S, Josse J, Husson F (2008) · 2008
Cited alongside, same era.
“A Fast Randomized Algorithm for the Approximation of Matrices.”
Woolfe F, Liberty E, Rokhlin V, Tygert M (2008) · 2008
Cited alongside, same era.
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
Hastie T, Tibshirani R, Friedman J (2009) · 2009
Cited alongside, same era.
“CUR Matrix Decompositions for Improved Data Analysis.”
Mahoney MW, Drineas P (2009) · 2009
Cited alongside, same era.
Voronin S, Martinsson PG (2015) · 2015
Later among the works it cites.
“Randomized algorithms for low-rank matrix factorizations: sharp performance bounds.”
Witten R, Candes E (2015) · 2015
Later among the works it cites.
“Decomposition into Low-Rank Plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Dataset.”
Bouwmans T, Sobral A, Javed S, Jung SK, Zahzah EH (2016) · 2016
Closest in time.
“RandNLA: Randomized Numerical Linear Algebra.”
Drineas P, Mahoney MW (2016) · 2016
Closest in time.
“Optimal Whitening and Decorrelation.”
Kessy A, Lewin A, Strimmer K (2018) · 2016
Closest in time.
“Randomized Methods for Matrix Computations and Analysis of High Dimensional Data.”
Martinsson PG (2016) · 2016
Closest in time.
“Randomized LU decomposition.”
Shabat G, Shmueli Y, Aizenbud Y, Averbuch A (2016) · 2016
Closest in time.
“Randomized Single-View Algorithms for Low-Rank Matrix Approximation.”
Tropp JA, Yurtsever A, Udell M, Cevher V (2016) · 2016
Closest in time.
“Statistical Properties of Sketching Algorithms.”
Ahfock D, Astle WJ, Richardson S (2017) · 2017
Closest in time.
“Optimal CUR Matrix Decompositions.”
Boutsidis C, Woodruff DP (2017) · 2017
Closest in time.
“Exact Dimensionality Selection for Bayesian PCA.”
Bouveyron C, Latouche P, Mattei PA (2017) · 2017
Closest in time.
“Randomized QR with Column Pivoting.”
Duersch JA, Gu M (2017) · 2017
Closest in time.
“Randomized Dynamic Mode Decomposition.”
Erichson NB, Brunton SL, Kutz JN (2017) · 2017
Closest in time.
“Efficient Algorithms for CUR and Interpolative Matrix Decompositions.”
Voronin S, Martinsson PG (2017) · 2017
Closest in time.
“Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization.”
Wright J, Ganesh A, Rao S, Peng Y, Ma Y (2009) · 2088
Closest in time.