Content tagged with adaptive methods

• [C82] No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation
• [C78] AdaGrad avoids saddle points
• [C77] UnderGrad: A universal black-box optimization method with almost dimension-free convergence rate guarantees
• [C73] Fast routing under uncertainty: Adaptive learning in congestion games with exponential weights
• [C71] Sifting through the noise: Universal first-order methods for stochastic variational inequalities
• [C70] Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements
• [C68] Optimization in open networks via dual averaging
• [C67] Adaptive learning in continuous games: Optimal regret bounds and convergence to Nash equilibrium
• [C61] Adaptive extra-gradient methods for min-max optimization and games
• [C56] A new regret analysis for Adam-type algorithms
• [C54] Finite-time last-iterate convergence for multi-agent learning in games
• [C49] An adaptive mirror-prox algorithm for variational inequalities with singular operators