Fetching the paper…
Reading the bibliography…
In many machine learning and data related applications, it is required to have the knowledge of approximate ranks of large data matrices at hand.
Applied analysis. 1956, 1956
C. Lanczos · 1956
Earlier work this paper cites.
Methods of mathematical physics
R. Courant and D. Hilbert · 1966
Earlier work this paper cites.
Calculation of gauss quadrature rules
G. H. Golub and J. H. Welsch · 1969
Earlier work this paper cites.
Rank degeneracy and least squares problems
G. Golub, V. Klema, and G. W. Stewart · 1976
Earlier work this paper cites.
The symmetric eigenvalue problem
B. N. Parlett · 1980
Earlier work this paper cites.
Detection of signals by information theoretic criteria
M. Wax and T. Kailath · 1985
Earlier work this paper cites.
Rank revealing QR factorizations
T. F. Chan · 1987
Earlier work this paper cites.
A maximum-entropy approach to the density of states within the recursion method
I. Turek · 1988
Earlier work this paper cites.
Tracking a few extreme singular values and vectors in signal processing
P. Comon and G. H. Golub · 1990
Earlier work this paper cites.
A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines
M. F. Hutchinson · 1990
Earlier work this paper cites.
Eigenfaces for recognition
M. Turk and A. Pentland · 1991
Earlier work this paper cites.
Information theoretic criteria for the determination of the number of signals in spatially correlated noise
Q. Zhang and K. M. Wong · 1993
Earlier work this paper cites.
Matrices, moments, and quadrature
G. H. Golub and G. Meurant · 1994
Earlier work this paper cites.
Densities of states of mega-dimensional Hamiltonian matrices
R. Silver and H. Röder · 1994
Earlier work this paper cites.
Calculating the density of states and optical-absorption spectra of large quantum systems by the plane-wave moments method
L.-W. Wang · 1994
Earlier work this paper cites.
On the asymptotic properties of ldu-based tests of the rank of a matrix
J. G. Cragg and S. G. Donald · 1996
Earlier work this paper cites.
Dimension reduction by local principal component analysis
N. Kambhatla and T. K. Leen · 1997
Earlier work this paper cites.
Rank-Deficient and Discrete Ill-Posed Problems
P. Hansen · 1998
Earlier work this paper cites.
Multivariate reduced-rank regression
G. C. Reinsel and R. P. Velu · 1998
Earlier work this paper cites.
Electronic structure calculations for plane-wave codes without diagonalization
L. O. Jay, H. Kim, Y. Saad, and J. R. Chelikowsky · 1999
Earlier work this paper cites.
Tests of rank
J.-M. Robin and R. J. Smith · 2000
Earlier work this paper cites.
Development of a digital array radar (DAR)
B. Cantrell, J. De Graaf, L. Leibowitz, F. Willwerth, G. Meurer, C. Parris, and R. Stapleton · 2001
Earlier work this paper cites.
From few to many: Illumination cone models for face recognition under variable lighting and pose
A. Georghiades, P. Belhumeur, and D. Kriegman · 2001
Earlier work this paper cites.
Principal component analysis
I. Jolliffe · 2002
Earlier work this paper cites.
Chebyshev polynomials
J. C. Mason and D. C. Handscomb · 2002
Cited alongside, same era.
Lambertian reflectance and linear subspaces
R. Basri and D. W. Jacobs · 2003
Cited alongside, same era.
Laplacian eigenmaps for dimensionality reduction and data representation
M. Belkin and P. Niyogi · 2003
Cited alongside, same era.
Rank estimation in reduced-rank regression
E. Bura and R. D. Cook · 2003
Cited alongside, same era.
Statistical modeling of complex backgrounds for foreground object detection
L. Li, W. Huang, I.-H. Gu, and Q. Tian · 2004
Cited alongside, same era.
Acquiring linear subspaces for face recognition under variable lighting
K. Lee, J. Ho, and D. Kriegman · 2005
Cited alongside, same era.
Optimal selection of reduced rank estimators of high-dimensional matrices
F. Bunea, Y. She, M. H. Wegkamp, et al · 2011
Later among the works it cites.
Robust principal component analysis?
E. J. Candès, X. Li, Y. Ma, and J. Wright · 2011
Later among the works it cites.
The University of Florida sparse matrix collection
T. A. Davis and Y. Hu · 2011
Later among the works it cites.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P. Martinsson, and J. Tropp · 2011
Later among the works it cites.
Rank estimation in missing data matrix problems
C. Julià, A. D. Sappa, F. Lumbreras, J. Serrat, and A. López · 2011
Later among the works it cites.
Low rank approximation: algorithms, implementation, applications
I. Markovsky · 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…
A signal processing application of randomized low-rank approximations
P. Parker, P. J. Wolfe, and V. Tarokh · 2005
Cited alongside, same era.
Generalized low rank approximations of matrices
J. Ye · 2005
Cited alongside, same era.
Online passive-aggressive algorithms
K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer · 2006
Cited alongside, same era.
Fast monte carlo algorithms for matrices II: Computing a low-rank approximation to a matrix
P. Drineas, R. Kannan, and M. W. Mahoney · 2006
Cited alongside, same era.
A randomized algorithm for the approximation of matrices
P.-G. Martinsson, V. Rockhlin, and M. Tygert · 2006
Cited alongside, same era.
Gaussian processes for machine learning
C. E. Rasmussen and C. K. I. Williams · 2006
Cited alongside, same era.
Numerical Methods for Large Eigenvalue Problems- classics edition
Y. Saad · 2011
Later among the works it cites.
Stochastic optimization for PCA and PLS
R. Arora, A. Cotter, K. Livescu, and N. Srebro · 2012
Later among the works it cites.
Matrix computations
G. H. Golub and C. F. Van Loan · 2012
Later among the works it cites.
Least squares data fitting with applications
P. C. Hansen, V. Pereyra, and G. Scherer · 2012
Later among the works it cites.
Active subspace: Toward scalable low-rank learning
G. Liu and S. Yan · 2012
Later among the works it cites.
Optimal estimation and rank detection for sparse spiked covariance matrices
T. Cai, Z. Ma, and Y. Wu · 2013
Later among the works it cites.
A parallel tree code for computing matrix-vector products with the Matérn kernel
J. Chen, L. Wang, and M. Anitescu · 2013
Later among the works it cites.
Efficient estimation of eigenvalue counts in an interval
E. Di Napoli, E. Polizzi, and Y. Saad · 2013
Later among the works it cites.
Matrix Computations, 4th edition
G. H. Golub and C. F. V. Loan · 2013
Later among the works it cites.
Approximation theory and approximation practice
L. N. Trefethen · 2013
Later among the works it cites.
Improved bounds on sample size for implicit matrix trace estimators
F. Roosta-Khorasani and U. Ascher · 2014
Later among the works it cites.
A novel m-estimator for robust PCA
T. Zhang and G. Lerman · 2014
Later among the works it cites.
Low rank approximation using error correcting coding matrices
S. Ubaru, A. Mazumdar, and Y. Saad · 2015
Later among the works it cites.
Relations among some low-rank subspace recovery models
H. Zhang, Z. Lin, C. Zhang, and J. Gao · 2015
Later among the works it cites.
Approximating Spectral Densities of Large Matrices
L. Lin, Y. Saad, and C. Yang · 2016
Closest in time.
Analysis of subspace iteration for eigenvalue problems with evolving matrices
Y. Saad · 2016
Closest in time.
Fast methods for estimating the numerical rank of large matrices
S. Ubaru and Y. Saad · 2016
Closest in time.