Dealing with unbounded gradients in stochastic saddle-point optimization

21 February 2024

Papers citing "Dealing with unbounded gradients in stochastic saddle-point optimization"

9 / 9 papers shown

Title
Lipschitz and Comparator-Norm Adaptivity in Online Learning Zakaria Mhammedi Wouter M. Koolen 37 56 0 27 Feb 2020
Revisiting Stochastic Extragradient Konstantin Mishchenko D. Kovalev Egor Shulgin Peter Richtárik Yura Malitsky 33 67 0 27 May 2019
Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes Ronan Fruit Matteo Pirotta A. Lazaric 30 61 0 06 Jul 2018
Primal-Dual $π$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems Mengdi Wang 69 69 0 17 Oct 2017
On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities Alexander Rakhlin Karthik Sridharan 40 48 0 13 Oct 2015
Optimization, Learning, and Games with Predictable Sequences Alexander Rakhlin Karthik Sridharan 54 377 0 08 Nov 2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization H. B. McMahan 56 42 0 08 Feb 2013
No-Regret Algorithms for Unconstrained Online Convex Optimization Matthew J. Streeter H. B. McMahan ODL 63 89 0 09 Nov 2012
Online Learning with Predictable Sequences Alexander Rakhlin Karthik Sridharan 112 355 0 18 Aug 2012