REVIEW 3 cited by
Randomized Numerical Linear Algebra: Foundations & Algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper treats both the theoretical foundations of the subject and the practical computational issues. Topics covered include norm estimation; matrix approximation by sampling; structured and unstructured random embeddings; linear regression problems; low-rank approximation; subspace iteration and Krylov methods; error estimation and adaptivity; interpolatory and CUR factorizations; Nystr\"om approximation of positive-semidefinite matrices; single view ("streaming") algorithms; full rank-revealing factorizations; solvers for linear systems; and approximation of kernel matrices that arise in machine learning and in scientific computing.
Forward citations
Cited by 3 Pith papers
-
High-dimensional reliability-oriented Shapley effect estimation with Normalizing Flows
Target Shapley effects for high-dimensional correlated reliability problems can be estimated from a single failing sample by rewriting closed target Sobol indices via conditional densities and fitting those densities ...
-
Estimating eigenvectors and eigenspaces of covariance matrices: Optimal Bounds and Conditions for Consistency
Sample-covariance eigenvector and eigenspace errors are determined up to constant factors by the effective rank and the signal-to-gap ratio, giving near-optimal consistency thresholds.
-
Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
SLSE-FRS solves least squares through increasingly larger random sketches, reaching exact least-squares accuracy at roughly linear cost.
Discussion (0). Continue with ORCID to comment.