Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning
Barna P\'asztor, Ilija Bogunovic, Andreas Krause

TL;DR
This paper introduces a model-based reinforcement learning algorithm for multi-agent mean-field control, providing the first regret bounds and demonstrating its effectiveness in large-scale systems with unknown dynamics.
Contribution
It proposes $M^3-UCRL$, a novel algorithm with theoretical guarantees for learning in mean-field control problems with unknown dynamics.
Findings
First regret bounds for model-based RL in MFC
Algorithm effectively balances exploration and exploitation
Flexible with various statistical models like neural networks
Abstract
Learning in multi-agent systems is highly challenging due to several factors including the non-stationarity introduced by agents' interactions and the combinatorial nature of their state and action spaces. In particular, we consider the Mean-Field Control (MFC) problem which assumes an asymptotically infinite population of identical agents that aim to collaboratively maximize the collective reward. In many cases, solutions of an MFC problem are good approximations for large systems, hence, efficient learning for MFC is valuable for the analogous discrete agent setting with many agents. Specifically, we focus on the case of unknown system dynamics where the goal is to simultaneously optimize for the rewards and learn from experience. We propose an efficient model-based reinforcement learning algorithm, , that runs in episodes, balances between exploration and exploitation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
