conftrace_

convergence rate

607 papers

Explore in graph

Co-occurring keywords

stochastic gradient descent (1091) convex optimization (1321) stochastic optimization (1060) gradient descent (1144) convergence analysis (395) non-convex optimization (547) nonconvex optimization (316) variance reduction (523) stochastic gradient (296) learning theory (519)

Papers

Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize Scaling NIPS 2020
Random Reshuffling: Simple Analysis with Vast Improvements NIPS 2020
SGD with shuffling: optimal rates without component convexity and large epoch requirements NIPS 2020
Hedging in games: Faster convergence of external and swap regrets NIPS 2020
Minibatch Stochastic Approximate Proximal Point Methods NIPS 2020
Optimistic Dual Extrapolation for Coherent Non-monotone Variational Inequalities NIPS 2020
Optimal Iterative Sketching Methods with the Subsampled Randomized Hadamard Transform NIPS 2020
An Improved Analysis of Stochastic Gradient Descent with Momentum NIPS 2020
On the Discrepancy between the Theoretical Analysis and Practical Implementations of Compressed Communication for Distributed Deep Learning AAAI 2020
Optimal Epoch Stochastic Gradient Descent Ascent Methods for Min-Max Optimization NIPS 2020
Adam with Bandit Sampling for Deep Learning NIPS 2020
Convergence of Meta-Learning with Task-Specific Adaptation over Partial Parameters NIPS 2020
A Lyapunov analysis for accelerated gradient methods: from deterministic to stochastic case AISTATS 2020
Sharp Analysis of Expectation-Maximization for Weakly Identifiable Models AISTATS 2020
Inexact Tensor Methods with Dynamic Accuracies ICML 2020
Adaptive Sketching for Fast and Convergent Canonical Polyadic Decomposition ICML 2020
Recht-Re Noncommutative Arithmetic-Geometric Mean Conjecture is False ICML 2020
Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games ICML 2020
Class-Weighted Classification: Trade-offs and Robust Approaches ICML 2020
Open Problem: Tight Convergence of SGD in Constant Dimension COLT 2020
Finite Time Analysis of Linear Two-timescale Stochastic Approximation with Markovian Noise COLT 2020
Accelerating Rescaled Gradient Descent: Fast Optimization of Smooth Functions NIPS 2019
More Efficient Off-Policy Evaluation through Regularized Targeted Learning ICML 2019
Convergence Rate of a Simulated Annealing Algorithm with Noisy Observations JMLR 2019
Random Shuffling Beats SGD after Finite Epochs ICML 2019