AMAGO-2: Breaking the Multi-Task Barrier in Meta-Reinforcement Learning with Transformers

Jake Grigsby, Justin Sasek, Samyak Parajuli, Daniel Adebi, Amy Zhang +1 more
11/17/2024
cs.LG

No official code found. Best implementation: UT-Austin-RPL/amago (172 stars, MIT, last commit 2026-04-30).

Abstract

Language models trained on diverse datasets unlock generalization by in-context learning. Reinforcement Learning (RL) policies can achieve a similar effect by meta-learning within the memory of a sequence model. However, meta-RL research primarily focuses on adapting to minor variations of a single task. It is difficult to scale towards more general behavior without confronting challenges in multi-task optimization, and few solutions are compatible with meta-RL's goal of learning from large training sets of unlabeled tasks. To address this challenge, we revisit the idea that multi-task RL is bottlenecked by imbalanced training losses created by uneven return scales across different tasks. We build upon recent advancements in Transformer-based (in-context) meta-RL and evaluate a simple yet scalable solution where both an agent's actor and critic objectives are converted to classification terms that decouple optimization from the current scale of returns. Large-scale comparisons in Meta-World ML45, Multi-Game Procgen, Multi-Task POPGym, Multi-Game Atari, and BabyAI find that this design unlocks significant progress in online multi-task adaptation and memory problems without explicit task labels.

View on arXivView PDF

Code Implementations(1)

UT-Austin-RPL/amagoCommunity100%
MIT

off-policy RL on long sequences

17216PythonOct 14, 20235 months agoMIT

Similar Papers

Cite this paper

@article{grigsby2024amago,
  title  = {AMAGO-2: Breaking the Multi-Task Barrier in Meta-Reinforcement Learning with Transformers},
  author = {Jake Grigsby and Justin Sasek and Samyak Parajuli and Daniel Adebi and Amy Zhang and Yuke Zhu},
  year   = {2024},
  eprint = {2411.11188},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2411.11188},
  url    = {http://arxiv.org/abs/2411.11188v1},
  journal = {NEURIPS 2024 2024}
}

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/2411.11188.svg)](https://codeofpaper.com/paper/2411.11188)

Discussion