Fast Estimation of Approximate Matrix Ranks Using Spectral Densities

DOI10.1162/NECO_a_00951zbMath1474.68318arXiv1608.05754WikidataQ38883489 ScholiaQ38883489MaRDI QIDQ5380703

Yousef Saad, Shashanka Ubaru, Abd-Krim Seghouane

Publication date: 6 June 2019

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.05754

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Numerical linear algebra (65F99) Computational aspects of data analysis and big data (68T09)

Related Items

Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature, Fast randomized numerical rank estimation for numerically low-rank matrices

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Bi-cross-validation of the SVD and the nonnegative matrix factorization
• Optimal selection of reduced rank estimators of high-dimensional matrices
• Rang revealing QR factorizations
• Improved bounds on sample size for implicit matrix trace estimators
• Multivariate reduced-rank regression
• Rank estimation in reduced-rank regression
• Electronic structure calculations for plane-wave codes without diagonalization
• Low-rank approximation. Algorithms, implementation, applications
• Principal component analysis.
• Rank estimation in missing data matrix problems
• Optimal estimation and rank detection for sparse spiked covariance matrices
• Approximating Spectral Densities of Large Matrices
• Active Subspace: Toward Scalable Low-Rank Learning
• A Novel M-Estimator for Robust PCA
• Efficient estimation of eigenvalue counts in an interval
• The university of Florida sparse matrix collection
• Numerical Methods for Large Eigenvalue Problems
• Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
• Robust principal component analysis?
• The kernel polynomial method
• Statistical Tests and Estimators of the Rank of a Matrix and Their Applications in Econometric Modelling
• Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
• On the Asymptotic Properties of LDU-Based Tests of the Rank of a Matrix
• TESTS OF RANK
• Fast and Stable Subspace Tracking
• Non-Parametric Detection of the Number of Signals: Hypothesis Testing and Random Matrix Theory
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Filtered Conjugate Residual‐type Algorithms with Applications
• Relations Among Some Low-Rank Subspace Recovery Models
• Dimension Selection for Feature Selection and Dimension Reduction with Principal and Independent Component Analysis
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
• Generalized low rank approximations of matrices