Low-Rank PSD Approximation in Input-Sparsity Time
DOI10.1137/1.9781611974782.134zbMATH Open1411.68186OpenAlexW4250224698MaRDI QIDQ4575882FDOQ4575882
Authors: Kenneth L. Clarkson, David P. Woodruff 
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974782.134
Recommendations
- Input sparsity time low-rank approximation via ridge leverage score sampling
- A PTAS for ℓp-Low Rank Approximation
- Structured low-rank approximation and its applications
- Structured low rank approximation
- Low-rank approximation. Algorithms, implementation, applications
- Compressed sensing of low-rank plus sparse matrices
- Low-rank approximations with sparse factors. I: Basic algorithms and error analysis
- Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization
Computational methods for sparse matrices (65F50) Analysis of algorithms (68W40) Approximation algorithms (68W25) Positive matrices and their generalizations; cones of matrices (15B48)
Cited In (10)
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
- Random projections for conic programs
- Randomized signal processing with continuous frames
- SPSD matrix approximation vis column selection: theories, algorithms, and extensions
- Practical sketching algorithms for low-rank matrix approximation
- Computing approximate PSD factorizations
- Input sparsity time low-rank approximation via ridge leverage score sampling
- Energy-based sequential sampling for low-rank PSD-matrix approximation
- Optimal eigenvalue approximation via sketching
- A PTAS for ℓp-Low Rank Approximation
This page was built for publication: Low-Rank PSD Approximation in Input-Sparsity Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575882)
