LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain

12 July 2016

Papers citing "LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain"

26 / 26 papers shown

Title
Mean of Means: A 10-dollar Solution for Human Localization with Calibration-free and Unconstrained Camera Settings Tianyi Zhang Wengyu Zhang Xu-Lu Zhang Jiaxin Wu Xiao Wei Jiannong Cao Qing Li 37 0 0 28 Jan 2025
Black-Box $k$ -to- $1$ -PCA Reductions: Theory and Applications A. Jambulapati Syamantak Kumar Jerry Li Shourya Pandey Ankit Pensia Kevin Tian 39 2 0 06 Mar 2024
Decentralized Sum-of-Nonconvex Optimization Zhuanghua Liu K. H. Low 21 0 0 04 Feb 2024
Compression-aware Training of Neural Networks using Frank-Wolfe Max Zimmer Christoph Spiegel Sebastian Pokutta 31 9 0 24 May 2022
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition Samuel B. Hopkins T. Schramm Jonathan Shi 33 23 0 05 Mar 2022
Fast algorithm for overcomplete order-3 tensor decomposition Jingqiu Ding Tommaso dÓrsi Chih-Hung Liu Stefan Tiegel David Steurer 21 9 0 14 Feb 2022
HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisation Alexander I. Cowen-Rivers Wenlong Lyu Rasul Tutunov Zhi Wang Antoine Grosnit ... A. Maraval Hao Jianye Jun Wang Jan Peters H. Ammar 27 74 0 07 Dec 2020
Learning Deep ReLU Networks Is Fixed-Parameter Tractable Sitan Chen Adam R. Klivans Raghu Meka 22 36 0 28 Sep 2020
Distributed Estimation for Principal Component Analysis: an Enlarged Eigenspace Analysis Xi Chen J. Lee He Li Yun Yang 23 6 0 05 Apr 2020
Learning-Based Low-Rank Approximations Piotr Indyk A. Vakilian Yang Yuan 39 67 0 30 Oct 2019
$Streaming Kernel PCA with $\tilde{O}(\sqrt{n})$ Random Features$ Streaming Kernel PCA with $\tilde{O}(\sqrt{n})$ Random Features Enayat Ullah Poorya Mianjy T. V. Marinov R. Arora 33 20 0 02 Aug 2018
A Nonconvex Projection Method for Robust PCA Aritra Dutta Filip Hanzely Peter Richtárik 20 24 0 21 May 2018
Tight Query Complexity Lower Bounds for PCA via Finite Sample Deformed Wigner Law Max Simchowitz A. Alaoui Benjamin Recht 30 38 0 04 Apr 2018
Katyusha X: Practical Momentum Method for Stochastic Sum-of-Nonconvex Optimization Zeyuan Allen-Zhu ODL 44 52 0 12 Feb 2018
Neon2: Finding Local Minima via First-Order Oracles Zeyuan Allen-Zhu Yuanzhi Li 21 130 0 17 Nov 2017
On Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization Mingrui Liu Tianbao Yang 36 23 0 25 Sep 2017
Natasha 2: Faster Non-Convex Optimization Than SGD Zeyuan Allen-Zhu ODL 28 245 0 29 Aug 2017
Accelerated Stochastic Power Iteration Christopher De Sa Bryan D. He Ioannis Mitliagkas Christopher Ré Peng Xu 37 89 0 10 Jul 2017
On the Power of Truncated SVD for General High-rank Matrix Estimation Problems S. Du Yining Wang Aarti Singh 27 16 0 22 Feb 2017
Natasha: Faster Non-Convex Stochastic Optimization Via Strongly Non-Convex Parameter Zeyuan Allen-Zhu 23 80 0 02 Feb 2017
Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU Zeyuan Allen-Zhu Yuanzhi Li 22 44 0 06 Jan 2017
Finding Approximate Local Minima Faster than Gradient Descent Naman Agarwal Zeyuan Allen-Zhu Brian Bullins Elad Hazan Tengyu Ma 43 83 0 03 Nov 2016
Faster Principal Component Regression and Stable Matrix Chebyshev Approximation Zeyuan Allen-Zhu Yuanzhi Li 19 20 0 16 Aug 2016
Doubly Accelerated Methods for Faster CCA and Generalized Eigendecomposition Zeyuan Allen-Zhu Yuanzhi Li 14 50 0 20 Jul 2016
Katyusha: The First Direct Acceleration of Stochastic Gradient Methods Zeyuan Allen-Zhu ODL 17 577 0 18 Mar 2016
Improved SVRG for Non-Strongly-Convex or Sum-of-Non-Convex Objectives Zeyuan Allen-Zhu Yang Yuan 29 195 0 05 Jun 2015