No article text was recorded for this version.
constant learning rate convergence
Version 1 of 128 papers34 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
- Blog: Linear Last-iterate Convergence in Constrained Saddle-point Optimization
- Blog: Conjugate Gradient Method for Generative Adversarial Networks
- Blog: Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
- Blog: Tight last-iterate convergence rates for no-regret learning in multi-player games
- Blog: Convergence of adaptive algorithms for constrained weakly convex optimization
- Blog: Finite-Time Last-Iterate Convergence for Learning in Multi-Player Games
- Blog: Statistical Guarantees for High-Dimensional Stochastic Gradient Descent
- Blog: Appropriate Learning Rates of Adaptive Learning Rate Optimization Algorithms for Training Deep Neural Networks
- Blog: Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games
- Blog: Balancing Rates and Variance via Adaptive Batch-Size for Stochastic Optimization Problems
- Blog: Networked Aggregative Games with Linear Convergence
- Blog: Distributed Learning in Non-Convex Environments— Part II: Polynomial Escape From Saddle-Points
- Blog: Mini-batch k-means terminates within O(d/ϵ) iterations
- Blog: A unified stochastic approximation framework for learning in games
- Blog: Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games
- Blog: Training Deep Neural Networks Using Conjugate Gradient-like Methods
- Blog: A new regret analysis for Adam-type algorithms
- Blog: Follow-the-Regularized-Leader Routes to Chaos in Routing Games
- Blog: Particle Stochastic Dual Coordinate Ascent: Exponential convergent algorithm for mean field neural network optimization
- Blog: Convergence of Multi-Agent Learning with a Finite Step Size in General-Sum Games
- Blog: An ODE method to prove the geometric convergence of adaptive stochastic algorithms
- Blog: Distributed Dual Subgradient Methods with Averaging and Applications to Grid Optimization
- Blog: Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games
- Blog: Open Problem: Tight Convergence of SGD in Constant Dimension
- Blog: Follow-the-Regularized-Leader Routes to Chaos in Routing Games
- Blog: Distributed event-triggered algorithm for convex optimization with coupled constraints
- Blog: Theoretical Analysis of Auto Rate-Tuning by Batch Normalization
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_constant_learning_rate_convergence_0ebe3801,
title = {constant learning rate convergence},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/constant-learning-rate-convergence/rdr_0ebe3801221041acaf1f428dddf9448c},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_constant_learning_rate_convergence_0ebe3801_v1,
title = {constant learning rate convergence},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/constant-learning-rate-convergence/rdr_0ebe3801221041acaf1f428dddf9448c/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}