Pith. sign in

REVIEW 1 cited by

Continual Learning with Adaptive Weights (CLAW)

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 1911.09514 v2 pith:6LHTKN5Q submitted 2019-11-21 stat.ML cs.LG

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

Approaches to continual learning aim to successfully learn a set of related tasks that arrive in an online manner. Recently, several frameworks have been developed which enable deep learning to be deployed in this learning scenario. A key modelling decision is to what extent the architecture should be shared across tasks. On the one hand, separately modelling each task avoids catastrophic forgetting but it does not support transfer learning and leads to large models. On the other hand, rigidly specifying a shared component and a task-specific part enables task transfer and limits the model size, but it is vulnerable to catastrophic forgetting and restricts the form of task-transfer that can occur. Ideally, the network should adaptively identify which parts of the network to share in a data driven way. Here we introduce such an approach called Continual Learning with Adaptive Weights (CLAW), which is based on probabilistic modelling and variational inference. Experiments show that CLAW achieves state-of-the-art performance on six benchmarks in terms of overall continual learning performance, as measured by classification accuracy, and in terms of addressing catastrophic forgetting.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Optimal Empirical Risk Minimization under Temporal Distribution Shifts

    stat.ME 2025-07 conditional novelty 6.0 of 10

    Under a random temporal shift model, the asymptotically optimal ERM weights solve a bias-variance trade-off, and pooling, most-recent, and exponential weighting emerge as special cases.

Pith tools