Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation

v1v2v3v4v5 (latest)

Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation

9 December 2019

Nadiia Chepurko

David P. Woodruff

ArXiv (abs)PDF HTML

Papers citing "Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation"

10 / 10 papers shown

Title
Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products Tamás Sarlós Xingyou Song David P. Woodruff Qiuyi Qiuyi Zhang 80 4 0 03 Nov 2023
Krylov Methods are (nearly) Optimal for Low-Rank Approximation Ainesh Bakshi Shyam Narayanan 56 7 0 06 Apr 2023
Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation Ainesh Bakshi Piotr Indyk Praneeth Kacham Sandeep Silwal Samson Zhou 97 4 0 01 Dec 2022
Asymptotics of the Sketched Pseudoinverse Daniel LeJeune Pratik V. Patil Hamid Javadi Richard G. Baraniuk Robert Tibshirani 54 10 0 07 Nov 2022
$Low-Rank Approximation with $1/ε^{1/3}$ Matrix-Vector Products$ Low-Rank Approximation with $1/ε^{1/3}$ Matrix-Vector Products Ainesh Bakshi K. Clarkson David P. Woodruff 70 16 0 10 Feb 2022
Learning a Latent Simplex in Input-Sparsity Time Ainesh Bakshi Chiranjib Bhattacharyya R. Kannan David P. Woodruff Samson Zhou 135 10 0 17 May 2021
Sampling Matrices from Harish-Chandra-Itzykson-Zuber Densities with Applications to Quantum Inference and Differential Privacy Jonathan Leake Colin S. McSwiggen Nisheeth K. Vishnoi 30 4 0 10 Nov 2020
Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra Nadiia Chepurko K. Clarkson L. Horesh Honghao Lin David P. Woodruff 60 24 0 09 Nov 2020
Training (Overparametrized) Neural Networks in Near-Linear Time Jan van den Brand Binghui Peng Zhao Song Omri Weinstein ODL 91 83 0 20 Jun 2020
Sketching Transformed Matrices with Applications to Natural Language Processing Yingyu Liang Zhao Song Mengdi Wang Lin F. Yang Xin Yang 113 4 0 23 Feb 2020