Fetching the paper…
Reading the bibliography…
Learning from repeated play in a fixed two-player zero-sum game is a classic problem in game theory and online learning.
Zur theorie der gesellschaftsspiele
von Neumann, J · 1928
Earlier work this paper cites.
Convergence analysis of a proximal-like minimization algorithm using bregman functions
Chen, G. and Teboulle, M · 1993
Earlier work this paper cites.
Tracking the best expert
Herbster, M. and Warmuth, M. K · 1998
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Freund, Y. and Schapire, R. E · 1999
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Zinkevich, M · 2003
Earlier work this paper cites.
Mirror descent meets fixed share (and feels no regret)
Cesa-bianchi, N., Gaillard, P., Lugosi, G., and Stoltz, G · 2012
Earlier work this paper cites.
Mirror descent meets fixed share (and feels no regret)
Cesa-Bianchi, N., Gaillard, P., Lugosi, G., and Stoltz, G · 2012
Earlier work this paper cites.
Online optimization with gradual variations
Chiang, C.-K., Yang, T., Lee, C.-J., Mahdavi, M., Lu, C.-J., Jin, R., and Zhu, S · 2012
Earlier work this paper cites.
Optimization, learning, and games with predictable sequences
Rakhlin, A. and Sridharan, K · 2013
Earlier work this paper cites.
Non-stationary stochastic optimization
Besbes, O., Gur, Y., and Zeevi, A. J · 2015
Earlier work this paper cites.
Near-optimal no-regret algorithms for zero-sum games
Daskalakis, C., Deckelbaum, A., and Kim, A · 2015
Earlier work this paper cites.
Achieving all with no parameters: AdaNormalHedge
Luo, H. and Schapire, R. E · 2015
Cited alongside, same era.
Fast convergence of regularized learning in games
Syrgkanis, V., Agarwal, A., Luo, H., and Schapire, R. E · 2015
Cited alongside, same era.
Tracking the best expert in non-stationary stochastic environments
Wei, C.-Y., Hong, Y.-T., and Lu, C.-J · 2016
Cited alongside, same era.
Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient
Yang, T., Zhang, L., Jin, R., and Yi, J · 2016
Cited alongside, same era.
Adaptive online learning in dynamic environments
Zhang, L., Lu, S., and Zhou, Z.-H · 2018
Cited alongside, same era.
Competing against Nash equilibria in adversarially changing zero-sum games
Cardoso, A. R., Abernethy, J. D., Wang, H., and Xu, H · 2019
Dynamic regret of convex and smooth functions
Zhao, P., Zhang, Y.-J., Zhang, L., and Zhou, Z.-H · 2020
Later among the works it cites.
Zeroth-order nonconvex stochastic optimization: Handling constraints, high dimensionality, and saddle points
Balasubramanian, K. and Ghadimi, S · 2021
Later among the works it cites.
Impossible tuning made possible: A new expert algorithm and its applications
Chen, L., Luo, H., and Wei, C · 2021
Later among the works it cites.
Near-optimal no-regret learning in general games
Daskalakis, C., Fishelson, M., and Golowich, N · 2021
Later among the works it cites.
Multi-agent online learning in time-varying games
Duvocelle, B., Mertikopoulos, P., Staudigl, M., and Vermeulen, D · 2021
Later among the works it cites.
Online learning in periodic zero-sum games
Fiez, T., Sim, R., Skoulakis, S., Piliouras, G., and Ratliff, L. J · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Last-iterate convergence: Zero-sum games and constrained min-max optimization
Daskalakis, C. and Panageas, I · 2019
Cited alongside, same era.
On first-order bounds, variance and gap-dependent bounds for adversarial bandits
Pogodin, R. and Lattimore, T · 2019
Cited alongside, same era.
Online and bandit algorithms for nonstationary stochastic saddle-point optimization
Roy, A., Chen, Y., Balasubramanian, K., and Mohapatra, P · 2019
Cited alongside, same era.
Hedging in games: Faster convergence of external and swap regrets
Chen, X. and Peng, B · 2020
Cited alongside, same era.
A simple online algorithm for competing with dynamic comparators
Zhang, Y.-J., Zhao, P., and Zhou, Z.-H · 2020
Cited alongside, same era.
Later among the works it cites.
Adaptive learning in continuous games: Optimal regret bounds and convergence to Nash equilibrium
Hsieh, Y.-G., Antonakopoulos, K., and Mertikopoulos, P · 2021
Later among the works it cites.
Linear last-iterate convergence in constrained saddle-point optimization
Wei, C.-Y., Lee, C.-W., Zhang, M., and Luo, H · 2021
Later among the works it cites.
Improved analysis for dynamic regret of strongly convex and smooth functions
Zhao, P. and Zhang, L · 2021
Later among the works it cites.
Adaptivity and non-stationarity: Problem-dependent dynamic regret for online convex optimization
Zhao, P., Zhang, Y.-J., Zhang, L., and Zhou, Z.-H · 2021
Later among the works it cites.