arXiv Machine Learning
Multiplicative Optimism for Constant Regret in Games
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 4
Constant regret in general games via higher-order optimism
The paper presents an uncoupled learning algorithm, higher-order optimism with discounting (HOOD), for arbitrary N-player normal form games with up to K actions per player. HOOD achieves an individual regret bound of O(N³ log² K) uniformly over the play horizon by combining a discounted (N+1)-th order predictor with entropic regularization over a lifted strategy space. This design mitigates large oscillations in play, addressing a key challenge in prior attempts to attain constant regret in general games.
arXiv Machine Learning
Sep 1
Constant Individual Regret in General Games
arXiv:2608. 31166v1 Announce Type: new Abstract: Uncoupled no-regret dynamics provide a decentralized route to equilibrium, but prior guarantees for individual regret retain a polylogarithmic dependence on the horizon.
arXiv Machine Learning
Sep 22
A Horizon-Independent Regret Bound for Optimistic Hedge in General-Sum Games
arXiv:2609.22839v1 Announce Type: cross Abstract: Can simple learning rules keep their regret bounded in self-play? Recent work achieves constant regret bounds through modified regularization and hig...
arXiv Machine Learning
Sep 22
Constant Swap Regret in General-Sum Games via Two-Scale Higher-Order Optimism
arXiv:2609.16751v2 Announce Type: replace-cross Abstract: We give deterministic and uncoupled learning dynamics for finite multiplayer general-sum games under full-information feedback that achieve c...
arXiv Machine Learning
Sep 16
Constant Swap Regret in General-Sum Games via Optimistic Transition Matrices
arXiv:2609. 16751v1 Announce Type: cross Abstract: We give deterministic and uncoupled learning dynamics for finite multiplayer general-sum games under full-information feedback that achieve constant individual swap regret, independent of the horizon $T$.
Hugging Face Trending Papers
Sep 15
Constant Swap Regret in General-Sum Games via Optimistic Transition Matrices
We give deterministic and uncoupled learning dynamics for finite multiplayer general-sum games under full-information feedback that achieve constant individual swap regret, independent of the horizon...