Pith. sign in

REVIEW 1 cited by

Self-Composing Policies for Scalable Continual Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2506.14811 v1 pith:BQTHOEFG submitted 2025-06-04 cs.LG

Self-Composing Policies for Scalable Continual Reinforcement Learning

classification cs.LG
keywords learningapproachcontinualnetworkneuralnumberpoliciesprevious
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. When Robots Sleep: Offline Skill Consolidation for Shared-Policy Robot Learning

    cs.RO 2026-06 unverdicted novelty 7.0

    Sleeping Robots uses frozen critics and actor snapshots as compact memories to define surrogate objectives combined via Nash bargaining for offline consolidation of shared robot policies in sequential skill learning.