Co-occurring keywords · papers mentioning both
Papers
Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond
COLT 2020
Implicit Regularization of Accelerated Methods in Hilbert Spaces
NeurIPS 2019
PDE Acceleration for Active Contours
CVPR 2019
Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent
COLT 2018
Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm
ICML 2018
On Acceleration with Noise-Corrupted Gradients
ICML 2018
On the insufficiency of existing momentum schemes for Stochastic Optimization
ICLR 2018
Optimization Algorithm Inspired Deep Neural Network Structure Design
ACML 2018
Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression
JMLR 2017
Accelerated Stochastic Gradient Descent for Minimizing Finite Sums
AISTATS 2016
Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysis
ICML 2016
Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling
ICML 2016
On Lower and Upper Bounds in Smooth and Strongly Convex Optimization
JMLR 2016
Tight Complexity Bounds for Optimizing Composite Objectives
NeurIPS 2016