Finite-Sample Convergence in Networked Average Reward MARL: Decentralization Pitfalls and Entropy Remedies
Organizations: The University of Texas at Austin · Johns Hopkins University
Abstract
We study the problem of average reward Multi-Agent Reinforcement Learning (MARL) where agents interact within a network. Each agent in the network conducts local updates with information within its -hop neighborhood and collaboratively maximizes the overall reward of the entire network. We first provide impossibility results in achieving convergence to the global optimal joint policies in our setting. These impossibility results highlight the challenges of decentralized learning with local information in multi-agent systems, namely the issues of multiagency, where each agent independently optimizes its policy, and partial observability, where agents have limited visibility into the global state. Given these challenges which indicate that decentralized policy optimization can generally be certified only up to stationarity, we provide finite-sample convergence guarantees for a decentralized actor-critic algorithm with linear function approximation that converges to an approximate stationary point with small gradient norm. To overcome such impossibility results, we further show that adding fixed-state entropy regularization reshapes the objective landscape which leads to even stronger global convergence guarantees for our proposed actor-critic algorithm.
Figures & tables
Appendix figures & tables12 assets
Supplementary material from the paper’s appendix.
Appendix
| Symbol | Meaning |
|---|---|
| Network and state-action spaces | |
| Undirected interaction graph; is the set of agents and is the edge set. | |
| , | Agent indices and total number of agents. |
| , | The one-hop neighborhood of agent , including itself, and the -hop neighborhood of . |
| Agents outside , i.e., . | |
| Localization radius. | |
| Features | Path ( ) | Grid ( ) | |
|---|---|---|---|
| Additive | 4 | ||
| Additive | 8 | ||
| Additive | 16 | ||
| Additive | 32 | ||
| Additive | 64 | ||
| Additive | 128 |
| Graph | Representation | |||||
|---|---|---|---|---|---|---|
| Path | Pairwise hashed | 16 | ||||
| Grid | Additive hashed | 16 | ||||
| Grid | Pairwise hashed | 8 | ||||
| Grid | Pairwise hashed | 64 | ||||
| Path | Tabular | – | ||||
| Grid | Tabular | – |
| Grid | Agents | |||||
|---|---|---|---|---|---|---|
| 4 | ||||||
| 8 | ||||||
| 16 | ||||||
| 32 | ||||||
| 64 | ||||||
| 4 |
Decentralized MARL
Decentralized multi-agent reinforcement learning studies how autonomous agents learn coordinated behavior from local information, with or without communication.
See all 128 papers