Toward Task Generalization via Memory Augmentation in Meta-Reinforcement Learning

Kaixi Bao, Chenhao Li, Yarden As, Andreas Krause, Marco Hutter
2/3/2025
cs.LGcs.AIcs.RO

No confident code implementation found for this paper.

Abstract

Agents trained via reinforcement learning (RL) often struggle to perform well on tasks that differ from those encountered during training. This limitation presents a challenge to the broader deployment of RL in diverse and dynamic task settings. In this work, we introduce memory augmentation, a memory-based RL approach to improve task generalization. Our approach leverages task-structured augmentations to simulate plausible out-of-distribution scenarios and incorporates memory mechanisms to enable context-aware policy adaptation. Trained on a predefined set of tasks, our policy demonstrates the ability to generalize to unseen tasks through memory augmentation without requiring additional interactions with the environment. Through extensive simulation experiments and real-world hardware evaluations on legged locomotion tasks, we demonstrate that our approach achieves zero-shot generalization to unseen tasks while maintaining robust in-distribution performance and high sample efficiency.

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{bao2025toward,
  title  = {Toward Task Generalization via Memory Augmentation in Meta-Reinforcement Learning},
  author = {Kaixi Bao and Chenhao Li and Yarden As and Andreas Krause and Marco Hutter},
  year   = {2025},
  eprint = {2502.01521},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.01521v2}
}

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

Discussion