M3PO: Massively Multi-Task Model-Based Policy Optimization

Aditya Narendra, Dmitry Makarov, Aleksandr Panov
6/26/2025
cs.LGcs.RO

No confident code implementation found for this paper.

Abstract

We introduce Massively Multi-Task Model-Based Policy Optimization (M3PO), a scalable model-based reinforcement learning (MBRL) framework designed to address sample inefficiency in single-task settings and poor generalization in multi-task domains. Existing model-based approaches like DreamerV3 rely on pixel-level generative models that neglect control-centric representations, while model-free methods such as PPO suffer from high sample complexity and weak exploration. M3PO integrates an implicit world model, trained to predict task outcomes without observation reconstruction, with a hybrid exploration strategy that combines model-based planning and model-free uncertainty-driven bonuses. This eliminates the bias-variance trade-off in prior methods by using discrepancies between model-based and model-free value estimates to guide exploration, while maintaining stable policy updates through a trust-region optimizer. M3PO provides an efficient and robust alternative to existing model-based policy optimization approaches and achieves state-of-the-art performance across multiple benchmarks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{narendra2025mpo,
  title  = {M3PO: Massively Multi-Task Model-Based Policy Optimization},
  author = {Aditya Narendra and Dmitry Makarov and Aleksandr Panov},
  year   = {2025},
  eprint = {2506.21782},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.21782v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.21782.svg)](https://codeofpaper.com/paper/2506.21782)

Discussion