Fetching the paper…
Reading the bibliography…
Saddle-point optimization problems are an important class of optimization problems with applications to game theory, multi-agent reinforcement learning and machine learning.
An algorithm for quadratic programming
Marguerite Frank and Philip Wolfe · 1956
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
GM Korpelevich · 1976
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R. Tyrrell Rockafellar · 1976
Earlier work this paper cites.
Stochastic games
Jean-François Mertens and Abraham Neyman · 1981
Earlier work this paper cites.
Solving asymmetric variational inequality problems and systems of equations with generalized nonlinear programming algorithms
Janice Hammond · 1984
Earlier work this paper cites.
The absolute-value estimate for symmetric multilinear forms
William Waterhouse · 1990
Earlier work this paper cites.
On the convergence of the proximal point algorithm for convex minimization
Osman Güler · 1991
Earlier work this paper cites.
On convex body chasing
Joel Friedman and Nathan Linial · 1993
Earlier work this paper cites.
On linear convergence of iterative methods for the variational inequality problem
Paul Tseng · 1995
Earlier work this paper cites.
Equilibrium programming using proximal-like algorithms
Sjur Didrik Flåm and Anatoly S Antipin · 1996
Earlier work this paper cites.
Tracking a small set of experts by mixing past posteriors
Olivier Bousquet and Manfred K Warmuth · 2002
Earlier work this paper cites.
Prox-method with rate of convergence o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham Flaxman, Adam Kalai, and H. Brendan McMahan · 2005
Earlier work this paper cites.
Prediction, learning, and games
Nicolò Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Finite-dimensional variational inequalities and complementarity problems
Francisco Facchinei and Jong-Shi Pang · 2007
Earlier work this paper cites.
Subgradient methods for saddle-point problems
Angelia Nedić and Asuman Ozdaglar · 2009
Earlier work this paper cites.
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
Renato Monteiro and Benar Fux Svaiter · 2010
Earlier work this paper cites.
Online markov decision processes under bandit feedback
Gergely Neu, Andras Antos, András György, and Csaba Szepesvári · 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.
Online bandit learning against an adaptive adversary: from regret to policy regret
Raman Arora, Ofer Dekel, and Ambuj Tewari · 2012
Earlier work this paper cites.
Competitive Markov decision processes
Jerzy Filar and Koos Vrieze · 2012
Earlier work this paper cites.
Optimization, learning, and games with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Earlier work this paper cites.
Stochastic multi-armed-bandit problem with non-stationary rewards
Omar Besbes, Yonatan Gur, and Assaf Zeevi · 2014
Cited alongside, same era.
Online learning in markov decision processes with changing cost sequences
Travis Dick, Andras Gyorgy, and Csaba Szepesvari · 2014
Cited alongside, same era.
Online markov decision processes with kullback–leibler control cost
Peng Guan, Maxim Raginsky, and Rebecca M Willett · 2014
Cited alongside, same era.
Non-stationary stochastic optimization
Omar Besbes, Yonatan Gur, and Assaf Zeevi · 2015
Cited alongside, same era.
Optimal rates for zero-order convex optimization: The power of two function evaluations
John Duchi, Michael I Jordan, Martin J Wainwright, and Andre Wibisono · 2015
Cited alongside, same era.
Online convex optimization in dynamic environments
Eric Hall and Rebecca Willett · 2015
Online learning with non-convex losses and non-stationary regret
Xiand Gao, Xiaobo Li, and Shuzhong Zhang · 2018
Later among the works it cites.
Fictitious gan: Training gans with historical models
Hao Ge, Yin Xia, Xu Chen, Randall Berry, and Ying Wu · 2018
Later among the works it cites.
Adversarial bandits with knapsacks
Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, and Aleksandrs Slivkins · 2018
Later among the works it cites.
Non-convex min-max optimization: Provable algorithms and applications in machine learning
Hassan Rafique, Mingrui Liu, Qihang Lin, and Tianbao Yang · 2018
Later among the works it cites.
The Online Saddle Point Problem: Applications to Online Convex Optimization with Knapsacks
Adrian Rivera, He Wang, and Huan Xu · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Online nonparametric regression with general loss functions
Alexander Rakhlin and Karthik Sridharan · 2015
Cited alongside, same era.
Fast convergence of regularized learning in games
Vasilis Syrgkanis, Alekh Agarwal, Haipeng Luo, and Robert Schapire · 2015
Cited alongside, same era.
Introduction to online convex optimization
Elad Hazan · 2016
Cited alongside, same era.
Chasing demand: Learning and earning in a changing environment
Bora Keskin and Assaf Zeevi · 2016
Cited alongside, same era.
Stochastic variance reduction methods for saddle-point problems
Balamurugan Palaniappan and Francis Bach · 2016
Cited alongside, same era.
Stochastic online auc maximization
Yiming Ying, Longyin Wen, and Siwei Lyu · 2016
Cited alongside, same era.
Later among the works it cites.
On the convergence and robustness of training gans with regularized optimal transport
Maziar Sanjabi, Jimmy Ba, Meisam Razaviyayn, and Jason D Lee · 2018
Later among the works it cites.
Chasing convex bodies with linear competitive ratio
CJ Argue, Anupam Gupta, Guru Guruganesh, and Ziye Tang · 2019
Closest in time.
Krishnakumar Balasubramanian and Saeed Ghadimi · 2019
Closest in time.
Competitively chasing convex bodies
Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, and Mark Sellke · 2019
Closest in time.
Online forecasting of total-variation-bounded sequences
Dheeraj Baby and Yu-Xiang Wang · 2019
Closest in time.
Competing against equilibria in zero-sum games with evolving payoffs
Adrian Rivera Cardoso, Jacob D. Abernethy, He Wang, and Huan Xu · 2019
Closest in time.
Conditional gradients: A surve
A. Carderera, C. W. Combette, and S. Pokutt · 2019
Closest in time.
Nonstationary stochastic optimization under L p , q {L}_{p,q} -variation measures
Xi Chen, Yining Wang, and Yu-Xiang Wang · 2019
Closest in time.
Lampros Flokas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, and Georgios Piliouras · 2019
Closest in time.
Minmax optimization: Stable limit points of gradient descent ascent are locally optimal
Chi Jin, Praneeth Netrapalli, and Michael I Jordan · 2019
Closest in time.
On gradient descent ascent for nonconvex-concave minimax problems
Tianyi Lin, Chi Jin, and Michael I Jordan · 2019
Closest in time.
Aryan Mokhtari, Asuman Ozdaglar, and Sarath Pattathil · 2019
Closest in time.
Solving a class of non-convex min-max games using iterative first order methods
Maher Nouiehed, Maziar Sanjabi, Tianjian Huang, Jason Lee, and Meisam Razaviyayn · 2019
Closest in time.
Multi-point bandit algorithms for nonstationary online nonconvex optimization
Abhishek Roy, Krishnakumar Balasubramanian, Saeed Ghadimi, and Prasant Mohapatra · 2019
Closest in time.
Chasing convex bodies optimally
Mark Sellke · 2019
Closest in time.
Efficient algorithms for smooth minimax optimization
Kiran Thekumparampil, Prateek Jain, Praneeth Netrapalli, and Sewoong Oh · 2019
Closest in time.