Pith. sign in

REVIEW 3 cited by

Modular Lifelong Reinforcement Learning via Neural Composition

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 2207.00429 v1 pith:WON7V7VS submitted 2022-07-01 cs.LG cs.AI

classification cs.LGcs.AI
keywords compositionalneuraltaskscompositionlearninglifelongproblemssolutions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Humans commonly solve complex problems by decomposing them into easier subproblems and then combining the subproblem solutions. This type of compositional reasoning permits reuse of the subproblem solutions when tackling future tasks that share part of the underlying compositional structure. In a continual or lifelong reinforcement learning (RL) setting, this ability to decompose knowledge into reusable components would enable agents to quickly learn new RL tasks by leveraging accumulated compositional structures. We explore a particular form of composition based on neural modules and present a set of RL problems that intuitively admit compositional solutions. Empirically, we demonstrate that neural composition indeed captures the underlying structure of this space of problems. We further propose a compositional lifelong RL method that leverages accumulated neural components to accelerate the learning of future tasks while retaining performance on previous tasks via off-line RL over replayed experiences.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Reinforcement Learning for Long-Horizon Unordered Tasks: From Boolean to Coupled Reward Machines

    cs.AI 2025-10 conditional novelty 6.0 of 10

    CoRM, a Q-learning variant using coupled reward machines, learns each unordered subtask as its own policy and orders them by observed step counts, scaling better than Boolean-RM baselines in three domains.

  2. LIMAO: A Framework for Lifelong Modular Learned Query Optimization

    cs.DB 2025-06 conditional novelty 6.0 of 10

    A modular lifelong-learning wrapper for learned cost prediction that reduces catastrophic forgetting and improves execution-time stability under dynamic workloads.

  3. Advancements and Challenges in Continual Reinforcement Learning: A Comprehensive Review

    cs.LG 2025-06 conditional novelty 2.0 of 10

    A survey that categorizes continual reinforcement learning methods, environments, and evaluation metrics for deep RL, with a focus on robotics.

Pith tools