Randomized low-rank approximations beyond Gaussian random matrices
From MaRDI portal
Cites work
- An elementary proof of a theorem of Johnson and Lindenstrauss
- An introduction to matrix concentration inequalities
- Concentration inequalities for polynomials in \(\alpha\)-sub-exponential random variables
- Covariance estimation for distributions with \({2+\varepsilon}\) moments
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Extensions of Lipschitz mappings into a Hilbert space
- Fast linear algebra is stable
- Finding frequent items in data streams
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 6026126 (Why is no real title available?)
- Improved analysis of the subsampled randomized Hadamard transform
- Low-rank approximation and regression in input sparsity time
- Matrix concentration inequalities via the method of exchangeable pairs
- Matrix decompositions using sub-Gaussian random matrices
- Nearly tight oblivious subspace embeddings by trace inequalities
- Numerical methods for large eigenvalue problems
- Parallel Randomized Tucker Decomposition Algorithms
- Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
- Random matrix theory
- Randomized Algorithms for Matrices and Data
- Randomized Algorithms for Rounding in the Tensor-Train Format
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Randomized matrix-free trace and log-determinant estimators
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
- Sketching as a tool for numerical linear algebra
- Some geometric applications of the beta distribution
- Some notes on concentration for -subexponential random variables
- Streaming low-rank matrix approximation with an application to scientific simulation
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Universality laws for randomized dimension reduction, with applications
This page was built for publication: Randomized low-rank approximations beyond Gaussian random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026067)
