Bayesian Offline Multi-Agent Reinforcement Learning with Latent World Models
Organizations: British Open-ended Learning and Discovery Lab (BOLD) · Tongji University · University of Oxford
Abstract
Model-based offline multi-agent reinforcement learning (MARL) provides a promising approach to multi-agent decision-making under partial observability, where the global state is unavailable from offline data. However, limited dataset coverage can lead to substantial out-of-distribution (OOD) model errors, which may mislead policy optimization and degrade downstream performance. Existing model-based offline MARL methods typically rely on access to global states or mitigate model errors through pessimistic or conservative policy optimization, leaving the reliability and refinement of learned world models less explored. We propose a Bayesian offline MARL framework that infers latent global states from decentralized observation-action histories and iteratively refines a posterior world model using only offline data. Building on posterior information loss, we extend this criterion to the multi-agent setting as multi-agent posterior information loss (MPIL), which provides a reliability measure for world model refinement and offline evaluation. Theoretically, we establish an upper bound on policy regret that is monotonic in MPIL and further characterize its dependence on the size and state-joint-action coverage of the offline dataset. Experiments on partially observable multi-agent variants of D4RL MuJoCo tasks demonstrate competitive policy performance across diverse offline data conditions, while MPIL-guided refinement improves world model prediction and downstream policy performance. These results support a principled connection between world model reliability, offline data coverage, and policy performance in partially observable offline MARL.
Figures & tables
| Task | Dataset | BC | OMAR | MOMA-PPO | Our Work |
| Hopper | expert | ||||
| full-replay | |||||
| medium | |||||
| random | |||||
| Halfcheetah | expert | ||||
| full-replay |
Appendix figures & tables11 assets
Supplementary material from the paper’s appendix.
Appendix
| Hyperparameter | Value |
| Observation dimension | 17 |
| Joint action dimension | 6 |
| Latent state dimension | 64 |
| GRU hidden dimension | 64 |
| Encoder projection dimension | 256 |
| Decoder hidden dimension | 256 |
| Hyperparameter | Value |
| Ensemble size | 7 |
| Number of elite models | 5 |
| Hidden dimension | 300 |
| Probabilistic output | Mean and variance |
| Holdout ratio | 0.2 |
| Optimizer | Adam |
| Hyperparameter | Value |
| Maximum refinement rounds | 50 |
| Epochs per round | 10 |
| Batch size | 512 |
| Holdout ratio | 0.2 |
| Early-stopping patience | 5 |
| Optimizer | Adam |
| Hyperparameter | Value |
| Actor hidden dimensions | |
| Critic hidden dimensions | |
| Optimizer | Adam |
| Learning rate | |
| Activation function | ReLU; linear output; tanh squash |
| Discount factor | 0.99 |
| Hyperparameter | BC | OMAR | MOMA-PPO |
| Training steps | |||
| Batch size | 2048 | 512 | 256 |
| Hidden dimension | 128 | 300 | |
| Learning rate | |||
| Discount factor | – | 0.99 | 0.99 |
| Entropy coefficient | – | 0.02 | 0.05 |
| Task (dims.) | No. agents | Action dim.: indices | Local observation indices | Shared/overlap indices |
| HalfCheetah-v2 | 3 | |||
| Hopper-v2 | 3 | |||
| Walker2d-v2 | 2 |
| Task | Random | Medium | Expert | Full-replay |
| HalfCheetah | halfcheetah-random-v2 | halfcheetah-medium-v2 | halfcheetah-expert-v2 | halfcheetah-full-replay-v2 |
| Hopper | hopper-random-v2 | hopper-medium-v2 | hopper-expert-v2 | hopper-full-replay-v2 |
| Walker2d | walker2d-random-v2 | walker2d-medium-v2 | walker2d-expert-v2 | walker2d-full-replay-v2 |
| Task | Dimension | MAE_Initial | MAE_Tuned | MAE_Improvement (%) | _Inital | _Tuned | _Improvement (%) |
| Halfcheetah | 0 | 0.0029 | 0.0012 | 58.93 | 0.9994 | 0.9999 | 0.05 |
| 1 | 0.0054 | 0.0022 | 58.69 | 0.9999 | 1.0000 | 0.00 | |
| 2 | 0.0076 | 0.0030 | 59.99 | 0.9978 | 0.9996 | 0.18 | |
| 3 | 0.0088 | 0.0033 | 62.69 | 0.9967 | 0.9995 | 0.28 | |
| 4 | 0.0101 | 0.0040 | 60.54 | 0.9945 | 0.9991 | 0.45 | |
| 5 | 0.0100 | 0.0045 | 55.14 | 0.9973 | 0.9993 | 0.20 |
Offline MARL
Offline multi-agent reinforcement learning (MARL) learns coordinated policies from fixed interaction datasets without further environment exploration.
See all 30 papers