Tight Query Complexity Lower Bounds for PCA via Finite Sample Deformed
Wigner Law

v1v2 (latest)

Tight Query Complexity Lower Bounds for PCA via Finite Sample Deformed Wigner Law

4 April 2018

Max Simchowitz

Benjamin Recht

ArXiv (abs)PDF HTML

Papers citing "Tight Query Complexity Lower Bounds for PCA via Finite Sample Deformed Wigner Law"

16 / 16 papers shown

Title
Query Efficient Structured Matrix Learning Noah Amsel Pratyush Avi Tyler Chen Feyza Duman Keles Chinmay Hegde Cameron Musco Christopher Musco David Persson 69 0 0 25 Jul 2025
Simultaneous analysis of approximate leave-one-out cross-validation and mean-field inference Pierre C Bellec 269 1 0 05 Jan 2025
Sharper Bounds for Chebyshev Moment Matching, with Applications Cameron Musco Christopher Musco Lucas Rosenblatt A. Singh FedML 262 2 0 22 Aug 2024
Memory-Query Tradeoffs for Randomized Convex OptimizationIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 Xinyu Chen Binghui Peng 180 8 0 21 Jun 2023
Krylov Methods are (nearly) Optimal for Low-Rank ApproximationIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 Ainesh Bakshi Shyam Narayanan 153 10 0 06 Apr 2023
Query lower bounds for log-concave samplingIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 Sinho Chewi Jaume de Dios Pont Jerry Li Chen Lu Shyam Narayanan 301 13 0 05 Apr 2023
Optimal Query Complexities for Dynamic Trace EstimationNeural Information Processing Systems (NeurIPS), 2022 David P. Woodruff Fred Zhang Qiuyi Zhang 123 7 0 30 Sep 2022
Efficient Convex Optimization Requires Superlinear MemoryAnnual Conference Computational Learning Theory (COLT), 2022 A. Marsden Willie Neiswanger Aaron Sidford Gregory Valiant 176 16 0 29 Mar 2022
Improved analysis of randomized SVD for top-eigenvector approximationInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2022 Ruo-Chun Tzeng Po-An Wang Florian Adriaens Aristides Gionis Chi-Jen Lu 116 2 0 16 Feb 2022
$Low-Rank Approximation with $1/ε^{1/3}$ Matrix-Vector Products$ Low-Rank Approximation with $1/ε^{1/3}$ Matrix-Vector ProductsSymposium on the Theory of Computing (STOC), 2022 Ainesh Bakshi K. Clarkson David P. Woodruff 333 20 0 10 Feb 2022
Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updatesAnnual Conference Computational Learning Theory (COLT), 2021 De Huang Jonathan Niles-Weed Rachel A. Ward 104 22 0 06 Feb 2021
Hutch++: Optimal Stochastic Trace EstimationSIAM Symposium on Simplicity in Algorithms (SOSA), 2020 R. A. Meyer Cameron Musco Christopher Musco David P. Woodruff 346 125 0 19 Oct 2020
Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph ProblemsInternational Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2020 Cyrus Rashtchian David P. Woodruff Hanlin Zhu 100 26 0 24 Jun 2020
Scaling-up Distributed Processing of Data Streams for Machine Learning M. Nokleby Haroon Raja W. Bajwa 181 17 0 18 May 2020
The gradient complexity of linear regressionAnnual Conference Computational Learning Theory (COLT), 2019 M. Braverman Elad Hazan Max Simchowitz Blake E. Woodworth 252 28 0 06 Nov 2019
On the Randomized Complexity of Minimizing a Convex Quadratic Function Max Simchowitz 369 12 0 24 Jul 2018