Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1704.04548
Cited By
On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation
14 April 2017
Max Simchowitz
A. Alaoui
Benjamin Recht
Re-assign community
ArXiv
PDF
HTML
Papers citing
"On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation"
12 / 12 papers shown
Title
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime
Max Simchowitz
Kevin Jamieson
Benjamin Recht
112
66
0
16 Feb 2017
Oracle Complexity of Second-Order Methods for Finite-Sum Problems
Yossi Arjevani
Ohad Shamir
77
24
0
15 Nov 2016
Matrix Completion has No Spurious Local Minimum
Rong Ge
Jason D. Lee
Tengyu Ma
85
599
0
24 May 2016
Dropping Convexity for Faster Semi-definite Optimization
Srinadh Bhojanapalli
Anastasios Kyrillidis
Sujay Sanghavi
63
173
0
14 Sep 2015
Simple, Efficient, and Neural Algorithms for Sparse Coding
Sanjeev Arora
Rong Ge
Tengyu Ma
Ankur Moitra
94
193
0
02 Mar 2015
Phase Retrieval via Wirtinger Flow: Theory and Algorithms
Emmanuel Candes
Xiaodong Li
Mahdi Soltanolkotabi
183
1,285
0
03 Jul 2014
Phase Retrieval using Alternating Minimization
Praneeth Netrapalli
Prateek Jain
Sujay Sanghavi
193
632
0
02 Jun 2013
Query Complexity of Derivative-Free Optimization
Kevin Jamieson
Robert D. Nowak
Benjamin Recht
149
159
0
11 Sep 2012
On the Fundamental Limits of Adaptive Sensing
E. Arias-Castro
Emmanuel J. Candes
Mark A. Davenport
140
137
0
20 Nov 2011
Computing a Nonnegative Matrix Factorization -- Provably
Sanjeev Arora
Rong Ge
R. Kannan
Ankur Moitra
284
398
0
03 Nov 2011
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
Alekh Agarwal
Peter L. Bartlett
Pradeep Ravikumar
Martin J. Wainwright
171
250
0
03 Sep 2010
On combinatorial testing problems
L. Addario-Berry
N. Broutin
Luc Devroye
Gábor Lugosi
112
113
0
24 Aug 2009
1