saddle point

Doubly Greedy Primal-Dual Coordinate Descent for Sparse Empirical Risk Minimization ICML 2017 Dualing GANs NeurIPS 2017 Frank-Wolfe Algorithms for Saddle Point Problems AISTATS 2017 Gradient Descent Can Take Exponential Time to Escape Saddle Points NeurIPS 2017 How to Escape Saddle Points Efficiently ICML 2017 On Frank-Wolfe and Equilibrium Computation NeurIPS 2017 Deep Learning without Poor Local Minima NeurIPS 2016 Efficient approaches for escaping higher order saddle points in non-convex optimization COLT 2016 Local Maxima in the Likelihood of Gaussian Mixture Models: Structural Results and Algorithmic Consequences NeurIPS 2016 Stochastic Variance Reduction Methods for Saddle-Point Problems NeurIPS 2016 Beyond Convexity: Stochastic Quasi-Convex Optimization NeurIPS 2015 Equilibrated adaptive learning rates for non-convex optimization NeurIPS 2015 Escaping From Saddle Points — Online Stochastic Gradient for Tensor Decomposition COLT 2015 Open Problem: The landscape of the loss surfaces of multilayer networks COLT 2015 Semi-Proximal Mirror-Prox for Nonsmooth Composite Minimization NeurIPS 2015 Identifying and attacking the saddle point problem in high-dimensional non-convex optimization NeurIPS 2014 Saddle Points and Accelerated Perceptron Algorithms ICML 2014 Efficient Methods for Robust Classification Under Uncertainty in Kernel Matrices JMLR 2012 Sparse Metric Learning via Smooth Optimization NeurIPS 2009