Pith. sign in

REVIEW 2 cited by

Efficient Continual Learning with Modular Networks and Task-Driven Priors

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 2012.12631 v2 pith:4WGMSVBH submitted 2020-12-23 cs.LG

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

Existing literature in Continual Learning (CL) has focused on overcoming catastrophic forgetting, the inability of the learner to recall how to perform tasks observed in the past. There are however other desirable properties of a CL system, such as the ability to transfer knowledge from previous tasks and to scale memory and compute sub-linearly with the number of tasks. Since most current benchmarks focus only on forgetting using short streams of tasks, we first propose a new suite of benchmarks to probe CL algorithms across these new axes. Finally, we introduce a new modular architecture, whose modules represent atomic skills that can be composed to perform a certain task. Learning a task reduces to figuring out which past modules to re-use, and which new modules to instantiate to solve the current task. Our learning algorithm leverages a task-driven prior over the exponential search space of all possible ways to combine modules, enabling efficient learning on long streams of tasks. Our experiments show that this modular architecture and learning algorithm perform competitively on widely used CL benchmarks while yielding superior performance on the more challenging benchmarks we introduce in this work.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. GRID: Scaling Task-Agnostic Inference in Continual Prompt Tuning

    cs.LG 2025-07 conditional novelty 6.0 of 10

    GRID combines output-space constrained decoding with gradient-guided prompt compression for task-agnostic, bounded-memory continual prompt tuning.

  2. Studying Cross-cluster Modularity in Neural Networks

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A clusterability regularizer creates strongly separated clusters in neural networks, shrinking effective circuit size by up to 90% on CIFAR-10, but it does not create task-specialized modules.

Pith tools