6 papers
When and Why is Optimistic Multiplicative Weights Slow? The Geometry of Energy Dissipation
John Lazarsfeld, Anas Barakat, Georgios Piliouras +2
This paper studies the convergence of the Optimistic Multiplicative Weights Update algorithm (OMWU) in two player zero-sum games. Recent works have identified instances on which th…
Optimistic Online Learning in Symmetric Cone Games
Anas Barakat, Wayne Lin, John Lazarsfeld +1
We introduce symmetric cone games (SCGs), a broad class of multi-player games where each player's strategy lies in a generalized simplex (the trace-one slice of a symmetric cone).…
Optimism Without Regularization: Constant Regret in Zero-Sum Games
John Lazarsfeld, Georgios Piliouras, Ryann Sim +1
This paper studies the optimistic variant of Fictitious Play for learning in two-player zero-sum games. While it is known that Optimistic FTRL -- a regularized algorithm with a bou…
Online Multi-Agent Control with Adversarial Disturbances
Anas Barakat, John Lazarsfeld, Georgios Piliouras +1
Online multi-agent control problems, where many agents pursue competing and time-varying objectives, are widespread in domains such as autonomous robotics, economics, and energy sy…
Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
John Lazarsfeld, Georgios Piliouras, Ryann Sim +1
This paper investigates the sublinear regret guarantees of two non-no-regret algorithms in zero-sum games: Fictitious Play, and Online Gradient Descent with constant stepsizes. In…
Simple Opinion Dynamics for No-Regret Learning
John Lazarsfeld, Dan Alistarh
We study a cooperative multi-agent bandit setting in the distributed GOSSIP model: in every round, each of agents chooses an action from a common set, observes the action's cor…