Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2402.13903
Cited By
Dealing with unbounded gradients in stochastic saddle-point optimization
21 February 2024
Gergely Neu
Nneka Okolo
Re-assign community
ArXiv
PDF
HTML
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
41
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
74
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
57
377
0
08 Nov 2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization
H. B. McMahan
59
42
0
08 Feb 2013
No-Regret Algorithms for Unconstrained Online Convex Optimization
Matthew J. Streeter
H. B. McMahan
ODL
65
89
0
09 Nov 2012
Online Learning with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
112
355
0
18 Aug 2012
1