Pith. sign in

REVIEW 8 cited by

Maintaining Plasticity in Continual Learning via Regenerative Regularization

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 2308.11958 v3 pith:VGJRTLVI submitted 2023-08-23 cs.LG cs.AI

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

In continual learning, plasticity refers to the ability of an agent to quickly adapt to new information. Neural networks are known to lose plasticity when processing non-stationary data streams. In this paper, we propose L2 Init, a simple approach for maintaining plasticity by incorporating in the loss function L2 regularization toward initial parameters. This is very similar to standard L2 regularization (L2), the only difference being that L2 regularizes toward the origin. L2 Init is simple to implement and requires selecting only a single hyper-parameter. The motivation for this method is the same as that of methods that reset neurons or parameter values. Intuitively, when recent losses are insensitive to particular parameters, these parameters should drift toward their initial values. This prepares parameters to adapt quickly to new tasks. On problems representative of different types of nonstationarity in continual supervised learning, we demonstrate that L2 Init most consistently mitigates plasticity loss compared to previously proposed approaches.

Discussion (0). Sign in to comment.

Forward citations

Cited by 8 Pith papers

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

  1. Beyond Single-Model Optimization: Preserving Plasticity in Continual Reinforcement Learning

    cs.LG 2026-04 unverdicted novelty 7.0 of 10

    TeLAPA preserves behaviorally diverse policy neighborhoods in a shared latent space, improving MiniGrid continual RL transfer, revisit recovery, and retention over single-model preservation.

  2. Local Redundancy: An Information-Theoretic Measure of Plasticity from Synthetic Memorization

    cs.LG 2026-07 conditional novelty 6.0 of 10

    An information-theoretic 'local redundancy' is lower-bounded, via an entropy-cancellation argument, by the expected squared gradient norm on synthetic probe data, and this proxy modestly out-predicts existing plastici...

  3. Weight Decay Improves Language Model Plasticity

    cs.LG 2026-02 conditional novelty 6.0 of 10

    Pretrained models trained with larger weight decay fine-tune better on downstream tasks, so the best pretraining checkpoint by loss is not always the best starting point for later training.

  4. Balancing Expressivity and Robustness: Constrained Rational Activations for Reinforcement Learning

    cs.LG 2025-07 conditional novelty 6.0 of 10

    A constrained rational activation with denominator degree one larger than numerator and no constant term stabilizes high-UTD continuous control, while trading off long-term plasticity.

  5. Calibrated Partial Resets: Preventing Policy Collapse in Continual Reinforcement Learning

    cs.LG 2026-07 conditional novelty 5.5 of 10

    Utility-scaled partial neuron resets prevent policy collapse in long-horizon continual RL while matching or beating binary-reset and uniform-decay baselines on several benchmarks.

  6. Continual-RL for Generalization in Autonomous Racing on the RoboRacer Platform

    cs.RO 2026-07 conditional novelty 5.0 of 10

    SAC plus Continual Backpropagation, trained only on real multi-track data, fine-tunes in ~15 minutes on an unseen lower-friction RoboRacer track and outperforms MAP and MPC.

  7. A Forget-and-Grow Strategy for Deep Reinforcement Learning Scaling in Continuous Control

    cs.LG 2025-07 conditional novelty 5.0 of 10

    Forget and Grow (FoG) combines decaying replay weights for old experiences with progressive critic-network expansion to improve continuous-control reinforcement learning, beating BRO, SimBa, and TD-MPC2 on most of 41 ...

  8. Recovering Plasticity of Neural Networks via Soft Weight Rescaling

    cs.LG 2025-07 conditional novelty 4.0 of 10

    Soft Weight Rescaling shrinks each layer's weights toward their initialization at every step, bounding weight norms and improving plasticity and test accuracy in continual, warm-start, and single-task learning.

Pith tools