conftrace_

saddle point

95 papers

Explore in graph

Also known as

SP

Co-occurring keywords

non-convex optimization (547) stochastic gradient descent (1091) gradient descent (1144) nonconvex optimization (316) second-order stationary point (31) stochastic optimization (1060) convex optimization (1321) local minimum (61) critical point (24) gradient flow (142)

Papers

Revisiting the Landscape of Matrix Factorization AISTATS 2020
On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems NIPS 2020
Coarse Correlation in Extensive-Form Games AAAI 2020
Second Order Optimality in Decentralized Non-Convex Optimization via Perturbed Gradient Tracking NIPS 2020
Who is Afraid of Big Bad Minima? Analysis of gradient-flow in spiked matrix-tensor models NIPS 2019
Heavy-ball Algorithms Always Escape Saddle Points IJCAI 2019
A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networks ICML 2019
Escaping Saddle Points with Adaptive Gradient Methods ICML 2019
Non-Asymptotic Pure Exploration by Solving Games NIPS 2019
Efficiently escaping saddle points on manifolds NIPS 2019
Semi-flat minima and saddle points by embedding neural networks to overparameterization NIPS 2019
Sharp Analysis for Nonconvex SGD Escaping from Saddle Points COLT 2019
Efficient Nonconvex Empirical Risk Minimization via Adaptive Sample Size Methods AISTATS 2019
Defending Against Saddle Point Attack in Byzantine-Robust Distributed Learning ICML 2019
Efficiently avoiding saddle points with zero order methods: No gradients required NIPS 2019
Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods NIPS 2019
SSRGD: Simple Stochastic Recursive Gradient Descent for Escaping Saddle Points NIPS 2019
First-order methods almost always avoid saddle points: The case of vanishing step-sizes NIPS 2019
Escaping from saddle points on Riemannian manifolds NIPS 2019
Splitting Steepest Descent for Growing Neural Architectures NIPS 2019
Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layers NIPS 2019
Efficient Dictionary Learning with Gradient Descent ICML 2019
Escaping Saddle Points in Constrained Optimization NIPS 2018
An Alternative View: When Does SGD Escape Local Minima? ICML 2018
Fast Stochastic AUC Maximization with $O(1/n)$-Convergence Rate ICML 2018