AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Tight last-iterate convergence rates for no-regret learning in multi-player games

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Last-iterate convergence in games · 16 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use optimistic gradient with a constant step size and adaptive potential functionsLearning in smooth monotone games · Smooth monotone gamesgradient gap convergence rate: O(1/\sqrt{T})Helped
Use optimistic gradient with a constant step sizeLearning in smooth monotone games · Smooth monotone gamestotal gap convergence rate: \frac{180 KD^2}{\eta \sqrt{T}}Helped
Restrict the algorithm to the p-SCLI classLast-iterate methods for monotone games · Bilinear gamestotal gap convergence rate: \frac{c_\MA \ell D^2}{\sqrt{T}}Hurt
Implement extragradient using alternating online actionsOnline multi-agent learning · Adversarial lossesregret: \Omega(T)Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy