AI Paper Atlas

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

Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence

Yun Kuen Cheung, Georgios Piliouras

ICML 2021 · Bandits and online learning › Online convex optimization and games · approach: Last-iterate convergence in games · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 a finitely passive learning dynamicContinuous-time learning dynamics · Arbitrary payoff sequencesregretImproved
Use an FTRL learning dynamicContinuous-time learning dynamics · Arbitrary payoff sequencesregretImproved
Take a convex combination of finitely lossless learning dynamicsLearning dynamics · Arbitrary payoff sequencesregretImproved
Use a convex combination of FTRL dynamicsAgents in a graphical constant-sum game · Graphical constant-sum game with a fully-mixed Nash equilibriumPoincaré recurrenceImproved
Use Replicator Dynamics, Online Gradient Descent, or their convex combinationLearning dynamics · Cyclic Matching PenniesPoincaré recurrenceImproved
Use Replicator Dynamics, Online Gradient Descent, or their convex combinationLearning dynamics · Rock-Paper-Scissorsdistance to initial strategy: 10^{-3}Improved

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