Self-Composing Policies for Scalable Continual Reinforcement Learning

Mikel Malagón, Josu Ceberio, Jose A. Lozano
6/4/2025
cs.LG

No official code found. Best implementation: mikelma/componet (29 stars, GPL-3.0, PyTorch, last commit 2024-07-20).

Abstract

This work introduces a growable and modular neural network architecture that naturally avoids catastrophic forgetting and interference in continual reinforcement learning. The structure of each module allows the selective combination of previous policies along with its internal policy, accelerating the learning process on the current task. Unlike previous growing neural network approaches, we show that the number of parameters of the proposed approach grows linearly with respect to the number of tasks, and does not sacrifice plasticity to scale. Experiments conducted in benchmark continuous control and visual problems reveal that the proposed approach achieves greater knowledge transfer and performance than alternative methods.

View on arXivView PDF

Code Implementations(1)

mikelma/componetCommunity62%
PyTorchGPL-3.0

Source code of the ICML24 paper "Self-Composing Policies for Scalable Continual Reinforcement Learning" (selected for oral presentation)

294PythonMay 6, 20242 years agoGPL-3.0
continual-learningcontinual-reinforcement-learningdeep-learningicmlicml-2024+2 more

Similar Papers

Cite this paper

@article{malagn2025selfcomposing,
  title  = {Self-Composing Policies for Scalable Continual Reinforcement Learning},
  author = {Mikel Malagón and Josu Ceberio and Jose A. Lozano},
  year   = {2025},
  eprint = {2506.14811},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.14811v1}
}

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

Discussion