Fetching the paper…
Reading the bibliography…
We examine the problem of regret minimization when the learner is involved in a continuous game with other optimizing agents: in this case, if all players follow a no-regret algorithm, it is possible to achieve significantly lower regret relative to fully adversarial environments.
An analog of the minimax theorem for vector payoffs
David Blackwell · 1956
Earlier work this paper cites.
Approximation to bayes risk in repeated play
James Hannan · 1957
Earlier work this paper cites.
A convergence theorem for nonnegative almost supermartingales and some applications
Herbert Robbins and David Sigmund · 1971
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. M. Korpelevich · 1976
Earlier work this paper cites.
Martingale Limit Theory and Its Application
P. Hall and C. C. Heyde · 1980
Earlier work this paper cites.
A modification of the Arrow–Hurwicz method for search of saddle points
Leonid Denisovich Popov · 1980
Earlier work this paper cites.
Introduction to Optimization
Boris Teodorovich Polyak · 1987
Earlier work this paper cites.
Adaptive and self-confident on-line learning algorithms
Peter Auer, Nicolo Cesa-Bianchi, and Claudio Gentile · 2002
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
Prox-method with rate of convergence O ( 1 / t ) {O}(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Arkadi Semen Nemirovski · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yurii Nesterov · 2004
Earlier work this paper cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Yurii Nesterov · 2007
Earlier work this paper cites.
The complexity of computing a Nash equilibrium
Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Semen Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Yurii Nesterov · 2009
Earlier work this paper cites.
Convex optimization, game theory, and variational inequality theory
Gesualdo Scutari, Daniel P Palomar, Francisco Facchinei, and Jong-Shi Pang · 2010
Earlier work this paper cites.
Dual averaging methods for regularized stochastic learning and online optimization
Lin Xiao · 2010
Earlier work this paper cites.
Near-optimal no-regret algorithms for zero-sum games
Constantinos Daskalakis, Alan Deckelbaum, and Anthony Kim · 2011
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2011
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm
Anatoli Juditsky, Arkadi Semen Nemirovski, and Claire Tauvel · 2011
Cited alongside, same era.
Online learning and online convex optimization
Shai Shalev-Shwartz · 2011
Cited alongside, same era.
Online optimization with gradual variations
Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, and Shenghuo Zhu · 2012
Cited alongside, same era.
Regularized iterative stochastic approximation methods for stochastic variational inequality problems
Jayash Koshal, Angelia Nedic, and Uday V Shanbhag · 2012
Cited alongside, same era.
Optimization, learning, and games with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Cited alongside, same era.
Introduction to online convex optimization
Elad Hazan · 2016
Cited alongside, same era.
Explore aggressively, update conservatively: Stochastic extragradient methods with variable stepsize scaling
Yu-Guan Hsieh, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 2020
Later among the works it cites.
Robust reinforcement learning via adversarial training with langevin dynamics
Parameswaran Kamalaruban, Yu-Ting Huang, Ya-Ping Hsieh, Paul Rolland, Cheng Shi, and Volkan Cevher · 2020
Later among the works it cites.
Finite-time last-iterate convergence for multi-agent learning in games
Tianyi Lin, Zhengyuan Zhou, Panayotis Mertikopoulos, and Michael I Jordan · 2020
Later among the works it cites.
Convergence of gradient methods on bilinear zero-sum games
Guojun Zhang and Yaoliang Yu · 2020
Later among the works it cites.
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, and Tuomas Sandholm · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Extragradient method with variance reduction for stochastic variational inequalities
Alfredo N. Iusem, Alejandro Jofré, Roberto I. Oliveira, and Philip Thompson · 2017
Cited alongside, same era.
Training GANs with optimism
Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng · 2018
Cited alongside, same era.
Let’s be honest: An optimal no-regret framework for zero-sum games
Ehsan Asadi Kangarshahi, Ya-Ping Hsieh, Mehmet Fatih Sahin, and Volkan Cevher · 2018
Cited alongside, same era.
Scale-free online learning
Francesco Orabona and Dávid Pál · 2018
Cited alongside, same era.
An adaptive mirror-prox method for variational inequalities with singular operators
Kimon Antonakopoulos, Veronica Belmega, and Panayotis Mertikopoulos · 2019
Cited alongside, same era.
A universal algorithm for variational inequalities adaptive to smoothness and noise
Francis Bach and Kfir Y Levy · 2019
Cited alongside, same era.
The last-iterate convergence rate of optimistic mirror descent in stochastic variational inequalities
Waïss Azizian, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 2021
Later among the works it cites.
Minibatch forward-backward-forward methods for solving stochastic variational inequalities
Radu Ioan Boţ, Panayotis Mertikopoulos, Mathias Staudigl, and Phan Tu Vuong · 2021
Later among the works it cites.
Near-optimal no-regret learning in general games
Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich · 2021
Later among the works it cites.
Efficient methods for structured nonconvex-nonconcave min-max optimization
Jelena Diakonikolas, Constantinos Daskalakis, and Michael I Jordan · 2021
Later among the works it cites.
Forward looking best-response multiplicative weights update methods
Michail Fasoulakis, Evangelos Markakis, Yannis Pantazis, and Constantinos Varsos · 2021
Later among the works it cites.
Online learning with optimism and delay
Genevieve E Flaspohler, Francesco Orabona, Judah Cohen, Soukayna Mouatadid, Miruna Oprescu, Paulo Orenstein, and Lester Mackey · 2021
Later among the works it cites.
Adaptive learning in continuous games: Optimal regret bounds and convergence to nash equilibrium
Yu-Guan Hsieh, Kimon Antonakopoulos, and Panayotis Mertikopoulos · 2021
Later among the works it cites.
Fast extra gradient methods for smooth structured nonconvex-nonconcave minimax problems
Sucheol Lee and Donghwan Kim · 2021
Later among the works it cites.
Uncoupled learning dynamics with o ( l o g t ) o(logt) swap regret in multiplayer games
Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, and Tuomas Sandholm · 2022
Closest in time.
A stochastic halpern iteration with variance reduction for stochastic monotone inclusion problems
Xufeng Cai, Chaobing Song, Cristóbal Guzmán, and Jelena Diakonikolas · 2022
Closest in time.
Adaptive and universal algorithms for variational inequalities with optimal convergence
Alina Ene and Huy L Nguyen · 2022
Closest in time.
Multi-agent online optimization with delays: Asynchronicity, adaptivity, and optimism
Yu-Guan Hsieh, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 2022
Closest in time.
Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems
Thomas Pethick, Puya Latafat, Panagiotis Patrinos, Olivier Fercoq, and Volkan Cevhera · 2022
Closest in time.