Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1809.10491
Cited By
On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA
27 September 2018
Dan Garber
ODL
Re-assign community
ArXiv
PDF
HTML
Papers citing
"On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA"
7 / 7 papers shown
Title
Introduction to Online Convex Optimization
Elad Hazan
OffRL
138
1,927
0
07 Sep 2019
Accelerated Stochastic Power Iteration
Christopher De Sa
Bryan D. He
Ioannis Mitliagkas
Christopher Ré
Peng Xu
72
90
0
10 Jul 2017
Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU
Zeyuan Allen-Zhu
Yuanzhi Li
43
44
0
06 Jan 2017
First Efficient Convergence for Streaming k-PCA: a Global, Gap-Free, and Near-Optimal Rate
Zeyuan Allen-Zhu
Yuanzhi Li
71
100
0
26 Jul 2016
Matrix Completion has No Spurious Local Minimum
Rong Ge
Jason D. Lee
Tengyu Ma
83
599
0
24 May 2016
Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problems
Christopher De Sa
K. Olukotun
Christopher Ré
70
150
0
05 Nov 2014
Provable Bounds for Learning Some Deep Representations
Sanjeev Arora
Aditya Bhaskara
Rong Ge
Tengyu Ma
BDL
89
335
0
23 Oct 2013
1