Pith. sign in

REVIEW 3 cited by

Parameter-Level Soft-Masking for Continual 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 2306.14775 v1 pith:NMGR2HXE submitted 2023-06-26 cs.LG cs.CV

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

Existing research on task incremental learning in continual learning has primarily focused on preventing catastrophic forgetting (CF). Although several techniques have achieved learning with no CF, they attain it by letting each task monopolize a sub-network in a shared network, which seriously limits knowledge transfer (KT) and causes over-consumption of the network capacity, i.e., as more tasks are learned, the performance deteriorates. The goal of this paper is threefold: (1) overcoming CF, (2) encouraging KT, and (3) tackling the capacity problem. A novel technique (called SPG) is proposed that soft-masks (partially blocks) parameter updating in training based on the importance of each parameter to old tasks. Each task still uses the full network, i.e., no monopoly of any part of the network by any task, which enables maximum KT and reduction in capacity usage. To our knowledge, this is the first work that soft-masks a model at the parameter-level for continual learning. Extensive experiments demonstrate the effectiveness of SPG in achieving all three objectives. More notably, it attains significant transfer of knowledge not only among similar tasks (with shared knowledge) but also among dissimilar tasks (with little shared knowledge) while mitigating CF.

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.

  1. Fine-Tuning Regimes Define Distinct Continual Learning Problems

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    The relative rankings of continual learning methods are not preserved across different fine-tuning regimes defined by trainable parameter depth.

  2. Fine-Tuning Regimes Define Distinct Continual Learning Problems

    cs.LG 2026-04 conditional novelty 5.5 of 10

    Relative rankings of online EWC, LwF, SI and GEM are not consistently preserved across five trainable-depth regimes on five datasets and eleven task orders.

  3. C-Flat++: Towards a More Efficient and Powerful Framework for Continual Learning

    cs.LG 2025-08 conditional novelty 4.0 of 10

    Adding zeroth- and first-order flatness penalties to continual learning losses yields small consistent accuracy gains across seven methods, with the gated C-Flat++ variant at roughly 30% of the update cost.

Pith tools