atlas

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

Near-Optimal $\Phi$-Regret Learning in Extensive-Form Games

ICML 2023 · Bandits and online learning › Online convex optimization and games · approach: Fast no-regret dynamics in games

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 log-regularized OFTRL (LRL-OFTRL) local regret minimizers combined via a regret circuit preserving RVU propertytrigger-deviation regret minimizer for EFCE · multiplayer imperfect-information EFGstrigger regret growth in T: O(T^{1/4}) to O(log T)Helped
Refined regret circuit for convex hull that bounds by sum of nonnegative regrets instead of maxconvex hull combination of local regret minimizers · theoryRVU property preservationHelped
Use CFR with regret matching and CFR+ with RM+ instead of the proposed dynamics on Kuhn, Goofspiel, Sheriffbaseline regret minimizers · Kuhn poker, Goofspiel, Sherifftrigger regret growthHurt

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