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

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

4 April 2018

Max Simchowitz

Benjamin Recht

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

7 / 7 papers shown

Title
Memory-Query Tradeoffs for Randomized Convex Optimization Xinyu Chen Binghui Peng 36 6 0 21 Jun 2023
Krylov Methods are (nearly) Optimal for Low-Rank Approximation Ainesh Bakshi Shyam Narayanan 31 6 0 06 Apr 2023
Query lower bounds for log-concave sampling Sinho Chewi Jaume de Dios Pont Jerry Li Chen Lu Shyam Narayanan 32 8 0 05 Apr 2023
Optimal Query Complexities for Dynamic Trace Estimation David P. Woodruff Fred Zhang Qiuyi Zhang 29 4 0 30 Sep 2022
Efficient Convex Optimization Requires Superlinear Memory A. Marsden Vatsal Sharan Aaron Sidford Gregory Valiant 29 14 0 29 Mar 2022
Hutch++: Optimal Stochastic Trace Estimation R. A. Meyer Cameron Musco Christopher Musco David P. Woodruff 18 104 0 19 Oct 2020
Adaptive sensing performance lower bounds for sparse signal detection and support estimation R. Castro 133 33 0 04 Jun 2012