Pith. sign in

REVIEW 3 major objections 5 minor 26 references

Dynamic Continual Learning: Harnessing Parameter Uncertainty for Improved Network Adaptation

T0 review · 3 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Learned parameter uncertainty alone can prevent catastrophic forgetting on task-incremental benchmarks.

desk verdict Moment-propagation CL is empirically serious, but the variational objective in Eq. 6 is mis-stated and the uncertainty story needs re-derivation. read the letter →

arxiv 2501.10861 v1 pith:P5WI7PJ4 submitted 2025-01-18 cs.LG cs.AI

Christopher Angelini , Nidhal Bouaynaya This is my paper · ORCID
classification cs.LGcs.AI
keywords ContinuallearningCatastrophicforgettingParameteruncertaintyMomentpropagationVariationalinferencerateadaptationBayesianregularizationTaskincremental
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that parameter uncertainty learned by a Moment Propagation network can act as a reliable importance signal for continual learning, letting a single network adapt to a stream of tasks without catastrophically forgetting earlier ones. It proposes two training regularizers—one that lowers learning rates for important parameters, one that raises the Bayesian KL penalty for them—and reports that both beat sampling-based Bayesian continual learning baselines and match the state of the art on several task-incremental benchmarks. A sympathetic reader should care because the approach replaces costly Monte Carlo sampling with a closed-form uncertainty estimate, potentially making uncertainty-driven continual learning practical for larger networks.

What carries the argument

The Moment Propagation (MP) framework carries the argument. It is a variational-inference scheme where each network weight is a Normal random variable; the network propagates means and covariances through convolutional, linear, batch-normalization, and activation layers, using a first-order Taylor expansion of nonlinearities to get an analytical predictive mean and covariance. That yields a closed-form ELBO, so the network log-likelihood is directly differentiable and no Monte Carlo samples are needed. From the learned posterior, parameter importance is defined as either inverse variance $1/\sigma_{\omega_i}^2$ or signal-to-noise ratio $|\mu_{\omega_i}|/\sigma_{\omega_i}^2$, and these values are remapped across the whole network to per-parameter learning rates or per-parameter KL weights.

What would settle it

Train an MP network on task A, rank parameters by inverse variance or SNR, then reinitialize or add noise to only the top-ranked "important" parameters while leaving the rest untouched. If accuracy on task A drops no more than when the same number of least-important parameters is disturbed, then the uncertainty signal is not identifying the parameters that carry task A's function, and the regularization mechanism in LRA and PPBI loses its justification.

Watch

Extended reading notes

Core claim

The paper's central claim is that in a network trained with Moment Propagation, the posterior variance of each weight is a self-learned measure of that weight's functional importance: weights that matter for a task end up with small variance, while dispensable weights revert toward the standard-normal prior with variance near one. Using this map, the paper defines two continual-learning rules: Learning Rate Adaptation maps importance to per-parameter learning rates so critical weights move little, and Per-Parameter Bayesian Inference maps importance to per-parameter KL weights so critical weights are pulled back toward the previous task's posterior. The authors show that on seven task-incremental benchmarks, these two rules outperform the sampling-based UCB and UCL predecessors and land within a few points of Hard Attention to Task, without needing rehearsal, network expansion, or task-specific feature masks.

Load-bearing premise

The load-bearing premise is that the variance produced by Moment Propagation's first-order Taylor approximation is an accurate and stable measure of a parameter's true contribution to the network's learned function, and that this importance ranking transfers from one task to the next; the pruning experiments test this only on a single task, not across a sequence.

Editorial extensions

If this is right

  • The two MP-based regularizers—Learning Rate Adaptation and Per-Parameter Bayesian Inference—improve average test accuracy and backward transfer over the sampling-based UCB and UCL methods on the evaluated benchmarks.
  • MP networks can identify unimportant parameters: around 95% of parameters are pushed toward the prior and can be pruned before accuracy drops, indicating that the uncertainty map is a usable importance signal.
  • On task-incremental split and permuted MNIST, Per-Parameter Bayesian Inference reaches 98–99% average test accuracy, while on split CIFAR10 and mixed CIFAR10/100, Learning Rate Adaptation reaches 77–92%.
  • The methods work without rehearsal, architecture expansion, or task-specific masks; they only adjust learning rates or KL weights according to the current importance map.
  • Feature freezing is a strong baseline: LRA and PPBI improve only marginally over hyperparameter-tuned freezing, except on mixed CIFAR10/100 where freezing underperforms.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the importance signal transfers across task orderings, the same uncertainty map could be reused as a task arrives later; reversing the task order and checking whether the protected parameters stay the same would test this directly.
  • Because MP gives a deterministic, differentiable covariance, the importance mask could be combined with feature-level freezing or masking approaches, potentially recovering HAT-like backward transfer without task-specific propagation masks.
  • The first-order Taylor approximation treats layer inputs as independent, so the importance measure ignores correlations between parameters; a second-order correction to the propagated covariance would reveal whether interaction effects materially change which parameters are flagged as important.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. This paper proposes two continual learning regularizers, Learning Rate Adaptation (LRA) and Per-Parameter Bayesian Inference (PPBI), built on a Moment Propagation (MP) variational framework. The MP network learns per-parameter means and variances and propagates the first two moments through the network, allowing the ELBO to be evaluated without sampling. Parameter variance or SNR is then used as an importance measure to set per-parameter learning rates (LRA) or per-parameter KL regularization weights (PPBI) when training subsequent tasks. The authors evaluate on seven task-incremental benchmarks, reporting Average Test Accuracy and Backward Transfer, and compare against EWC, SI, MAS, UCL, UCB, and HAT, concluding that their methods outperform sampling-based uncertainty methods and are competitive with HAT.

Significance. If the uncertainty estimates are correct, the paper would make a useful contribution: it offers a sampling-free Bayesian route to continual learning and reports competitive or better ACC/BWT than the UCL/UCB baselines and several standard regularizers. The explicit comparison with the Feature Freezing baseline is honest and informative, and the pruning analysis in Section III is a sensible sanity check for the importance measure. However, the contribution is conditional: the incorrect KL term in Eq. (6) means the learned uncertainties do not correspond to the claimed variational posterior, and the absence of seeds, error bars, and cross-task importance validation limits the support for the central transferability claim.

major comments (3)
  1. [II-A, Eq. (6)] The KL term in Eq. (6) is not the Gaussian KL required by Eq. (1). For q(ω)=N(μ_q,σ_q²) and p(ω)=N(μ_p,σ_p²), the per-parameter KL is 1/2[(μ_q−μ_p)²/σ_p² + σ_q²/σ_p² − 1 + ln(σ_p²/σ_q²)]. Equation (6) instead divides the mean-difference term by σ_q²; with the stated prior σ_p=1, μ_p=0, this penalizes low-variance parameters far more heavily than the true KL. Because the paper's importance measures are read directly from the optimized posterior variances and SNRs, the learned uncertainties do not correspond to the claimed Bayesian posterior, and the central regularizer is misspecified. The authors should correct the formula and re-run the experiments, or alternatively justify the modified objective as a deliberate regularizer and validate the importance measure independently of the ELBO derivation.
  2. [II-B] The claim that 'the maximum variance of a parameter present in the network will be σ²=1' is not a consequence of the sparsity-inducing prior. In variational inference, the ELBO trades off the KL term against the expected log-likelihood; if the data likelihood is improved by predictive variance, individual posterior variances can exceed the prior variance. The subsequent pruning analysis in Section III relies on this bound to interpret variance as importance, so this assertion needs a proof or a corrected, empirically supported statement.
  3. [Table I and Section III] The empirical central claim is not supported with uncertainty quantification. Table I reports a single run per method and no seeds, yet many comparisons are within a few tenths of a percent (e.g., 99.40% vs 99.37% for the two PPBI variants). Moreover, the pruning experiments in Section III are performed on a single trained network and do not test whether importance scores computed after task t predict damage on task t when training on task t+1; this transferability is exactly the load-bearing property for LRA and PPBI. Please provide multiple seeds with error bars and a direct cross-task validation of the importance measure, otherwise the observed gains may reflect hyperparameter selection rather than a transferable uncertainty signal.
minor comments (5)
  1. [IV-A, Eq. (7)] The text below Eq. (7) says the learning-rate range is defined by 'αmin and αmin'; the second occurrence should presumably be αmax.
  2. [VI] The conclusion contains a typo: 'both mitigate catastrophic forgetting through regulariz the learning' should read 'through regularizing the learning'.
  3. [III] The definition SNR = |μ|/σ² is unconventional; SNR is usually defined with the standard deviation, not the variance, in the denominator. Please clarify why the variance is used and whether this choice affects comparability with UCB/UCL.
  4. [References] Several references are incomplete, missing volume, page, or venue information (e.g., [1], [2], [3], [6], [7], [8]); these should be completed for a journal submission.
  5. [IV-C] The experimental setup does not clearly state whether task identity is provided during inference for the multi-head network on each benchmark; please specify the task-incremental protocol for all compared methods.

Circularity Check

0 steps flagged · score 2.0 of 10

No definitional circularity; the central continual-learning claim is tested against external benchmarks, and the Moment Propagation machinery is restated in-paper rather than assumed from the self-citation.

full rationale

The paper's derivation chain is not circular in the sense this pass targets. LRA and PPBI map learned per-parameter variance or SNR to learning rates and KL weights through Equations (7) and (8), but the reported ACC and BWT values in Table I are comparisons to independently published methods on standard benchmarks, not quantities reconstructed from the fitted importance scores. The self-citation to the authors' Moment Propagation paper [18] is the origin of the framework, but the paper restates the covariance propagation equations (2)-(5) and the closed-form ELBO, so the subsequent continual-learning argument does not reduce to an unverified citation. The pruning evidence in Section III validates the importance measure against random and magnitude baselines on a single task; while it does not prove cross-task transfer, that is an empirical limitation rather than circularity. The KL expression in Equation (6) differs from the standard Gaussian KL form, which is a potential correctness issue about which posterior is actually optimized, but it does not make any reported prediction equal to an input by construction. Grid-searched hyperparameters create selection pressure, but selection pressure is not definitional circularity. Accordingly, no specific circular step can be quoted; the score reflects only the minor self-citation and not a circular reduction.

Assumptions & free parameters 6 free parameters · 5 assumptions · 0 invented entities

The paper's central claim rests on the Moment Propagation uncertainty estimate, which is taken from the authors' prior work (ref. 18), plus a set of grid-searched hyperparameters. The free parameters are the initialization scales and bounds for the per-parameter learning-rate and KL-weight remappings; the axioms include the accuracy of the Taylor approximation, the independence assumptions in the moment propagation, and the correctness of the paper's ELBO expression. No new physical or architectural entities are introduced.

free parameters (6)
  • Initial parameter variance (log scale) = searched in [-18, -10]
    Grid-searched to maximize performance; the posterior variance initialization directly shapes the predictive covariance and therefore the importance estimates used for regularization.
  • Initial KL weighting tau_0 = searched in [1e-3, 1e-8]
    Controls the strength of the pull toward the prior at the start of each task; values above 1e-3 reportedly cause too much regularization.
  • Maximum learning rate alpha_max = searched in [1e-3, 1e-5]
    Upper bound for LRA's per-parameter learning rate remapping; paired with a fixed alpha_min of 1e-12.
  • Maximum KL weighting tau_max = searched in [1e-2, 1e-7]
    Upper bound for PPBI's per-parameter regularization remapping; paired with a fixed tau_min of 1e-12.
  • Epochs and batch size = 250 epochs, batch size 500
    Fixed hyperparameters; the large batch size was chosen because it retained more performance in deterministic baselines and was computationally efficient.
  • Importance metric (variance or SNR) = both reported; best used per dataset
    The paper reports results for both variance-based and SNR-based importance, and the better choice varies by benchmark, effectively a free selection.
assumptions (5)
  • domain assumption First-order Taylor approximation is accurate enough for propagating predictive covariance through nonlinear activations.
    Section II.4, Eq 5; the entire Moment Propagation machinery rests on this approximation, and its bias is not quantified or validated in the continual learning setting.
  • domain assumption Network parameters are independent of each other and of the inputs.
    Section II, assumption list; the variance propagation formulas (Eqs 2, 3) rely on this independence to ignore cross-covariance terms.
  • ad hoc to paper The sparsity-inducing prior N(0,1) bounds every posterior variance to at most 1.
    Section II.B states the maximum variance will be 1, but nothing in the ELBO enforces a hard upper bound; gradients can push variance above 1 before the KL penalty dominates.
  • ad hoc to paper Equation (6) is the correct ELBO for the variational objective.
    The KL term in Eq 6 uses (mu_q - mu_p)^2 / sigma_q^2 instead of the standard (mu_q - mu_p)^2 / sigma_p^2; this is not the standard Gaussian KL, and the paper does not justify the substitution.
  • domain assumption Grid-selected hyperparameters generalize from validation to test sets.
    Section IV.C.2 says the search 'maximizes performance across all tasks' but does not describe how validation was used to pick final values or prevent test-set leakage.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Dynamic Continual Learning: Harnessing Parameter Uncertainty for Improved Network Adaptation." pith.science (2026). https://pith.science/paper/P5WI7PJ4

@misc{pith2026250110861,
  author       = {Pith},
  title        = {Pith review of: Dynamic Continual Learning: Harnessing Parameter Uncertainty for Improved Network Adaptation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/P5WI7PJ4}},
  note         = {Machine review of arXiv:2501.10861}
}
read the original abstract

When fine-tuning Deep Neural Networks (DNNs) to new data, DNNs are prone to overwriting network parameters required for task-specific functionality on previously learned tasks, resulting in a loss of performance on those tasks. We propose using parameter-based uncertainty to determine which parameters are relevant to a network's learned function and regularize training to prevent change in these important parameters. We approach this regularization in two ways: (1), we constrain critical parameters from significant changes by associating more critical parameters with lower learning rates, thereby limiting alterations in those parameters; (2), important parameters are restricted from change by imposing a higher regularization weighting, causing parameters to revert to their states prior to the learning of subsequent tasks. We leverage a Bayesian Moment Propagation framework which learns network parameters concurrently with their associated uncertainties while allowing each parameter to contribute uncertainty to the network's predictive distribution, avoiding the pitfalls of existing sampling-based methods. The proposed approach is evaluated for common sequential benchmark datasets and compared to existing published approaches from the Continual Learning community. Ultimately, we show improved Continual Learning performance for Average Test Accuracy and Backward Transfer metrics compared to sampling-based methods and other non-uncertainty-based approaches.

Figures

Figures reproduced from arXiv: 2501.10861 by the authors.

Figure 1
Figure 1. Analysis of parameter uncertainty from a two 800-node hidden layer fully connected network (A) Cumulative Distribution Function plot of the [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Loss in performance from the original validation accuracy as a result of various pruning methods. Moment Propagation performance is presented in [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

26 extracted references · 19 canonical work pages

  1. [1]

    Learning in nonsta- tionary environments: A survey,

    G. Ditzler, M. Roveri, C. Alippi, and R. Polikar, “Learning in nonsta- tionary environments: A survey,” vol. 10, no. 4, pp. 12–25. Conference Name: IEEE Computational Intelligence Magazine

    work page

  2. [2]

    Overcoming catastrophic forgetting in neural networks,

    J. Kirkpatrick, R. Pascanu, N. Rabinowitz, J. Veness, G. Desjardins, A. A. Rusu, K. Milan, J. Quan, T. Ramalho, A. Grabska-Barwinska, D. Hassabis, C. Clopath, D. Kumaran, and R. Hadsell, “Overcoming catastrophic forgetting in neural networks,” vol. 114, no. 13, pp. 3521– 3526

    work page

  3. [3]

    Continual lifelong learning with neural networks: A review,

    G. I. Parisi, R. Kemker, J. L. Part, C. Kanan, and S. Wermter, “Continual lifelong learning with neural networks: A review,” vol. 113, pp. 54–71

    work page

  4. [4]

    Catastrophic interference in connec- tionist networks: The sequential learning problem,

    M. McCloskey and N. J. Cohen, “Catastrophic interference in connec- tionist networks: The sequential learning problem,” in Psychology of Learning and Motivation (G. H. Bower, ed.), vol. 24, pp. 109–165, Academic Press

    work page

  5. [5]

    Catastrophic forgetting in connectionist networks,

    R. M. French, “Catastrophic forgetting in connectionist networks,” vol. 3, no. 4, pp. 128–135

    work page

  6. [6]

    Continual learning through synaptic intelligence

    F. Zenke, B. Poole, and S. Ganguli, “Continual learning through synaptic intelligence.”

    work page

  7. [7]

    Memory aware synapses: Learning what (not) to forget

    R. Aljundi, F. Babiloni, M. Elhoseiny, M. Rohrbach, and T. Tuytelaars, “Memory aware synapses: Learning what (not) to forget.”

    work page

  8. [8]

    Overcoming catas- trophic forgetting with hard attention to the task

    J. Serr `a, D. Sur ´ıs, M. Miron, and A. Karatzoglou, “Overcoming catas- trophic forgetting with hard attention to the task.”

    work page

Show all 26 references
  1. [9]

    Lifelong Learning with Dynamically Expandable Networks,

    J. Yoon, E. Yang, J. Lee, and S. J. Hwang, “Lifelong Learning with Dynamically Expandable Networks,” June 2018. arXiv:1708.01547 [cs]

    2018 arXiv

  2. [10]

    Progressive Neural Networks,

    A. A. Rusu, N. C. Rabinowitz, G. Desjardins, H. Soyer, J. Kirkpatrick, K. Kavukcuoglu, R. Pascanu, and R. Hadsell, “Progressive Neural Networks,” Oct. 2022. arXiv:1606.04671 [cs]

    2022 arXiv

  3. [11]

    iCaRL: Incremental Classifier and Representation Learning,

    S.-A. Rebuffi, A. Kolesnikov, G. Sperl, and C. H. Lampert, “iCaRL: Incremental Classifier and Representation Learning,” Apr. 2017. arXiv:1611.07725 [cs, stat]

    2017 arXiv

  4. [12]

    Memory Population in Continual Learning via Outlier Elimination,

    J. Hurtado, A. Raymond-Saez, V . Araujo, V . Lomonaco, A. Soto, and D. Bacciu, “Memory Population in Continual Learning via Outlier Elimination,” Oct. 2023. arXiv:2207.01145 [cs]

    2023 arXiv

  5. [13]

    IL2M: Class Incremental Learning With Dual Memory,

    E. Belouadah and A. Popescu, “IL2M: Class Incremental Learning With Dual Memory,” in 2019 IEEE/CVF International Conference on Computer Vision (ICCV) , pp. 583–592, Oct. 2019. ISSN: 2380-7504

    2019

  6. [14]

    FearNet: Brain-Inspired Model for Incre- mental Learning,

    R. Kemker and C. Kanan, “FearNet: Brain-Inspired Model for Incre- mental Learning,” Feb. 2018. arXiv:1711.10563 [cs]

    2018 arXiv

  7. [15]

    Efficient Lifelong Learning with A-GEM,

    A. Chaudhry, M. Ranzato, M. Rohrbach, and M. Elhoseiny, “Efficient Lifelong Learning with A-GEM,” Jan. 2019. arXiv:1812.00420 [cs, stat]

    2019 arXiv

  8. [16]

    Gradient Episodic Memory for Contin- ual Learning,

    D. Lopez-Paz and M. Ranzato, “Gradient Episodic Memory for Contin- ual Learning,” Sept. 2022. arXiv:1706.08840 [cs]

    2022 arXiv

  9. [17]

    Continual Learning with Deep Generative Replay,

    H. Shin, J. K. Lee, J. Kim, and J. Kim, “Continual Learning with Deep Generative Replay,” Dec. 2017. arXiv:1705.08690 [cs]

    2017 arXiv

  10. [18]

    PremiUm-CNN: Propagating uncertainty towards ro- bust convolutional neural networks,

    D. Dera, N. C. Bouaynaya, G. Rasool, R. Shterenberg, and H. M. Fathallah-Shaykh, “PremiUm-CNN: Propagating uncertainty towards ro- bust convolutional neural networks,” vol. 69, pp. 4669–4684. Conference Name: IEEE Transactions on Signal Processing

  11. [19]

    Auto-encoding variational bayes

    D. P. Kingma and M. Welling, “Auto-encoding variational bayes.”

  12. [20]

    Weight uncertainty in neural network,

    C. Blundell, J. Cornebise, K. Kavukcuoglu, and D. Wierstra, “Weight uncertainty in neural network,” in Proceedings of the 32nd International Conference on Machine Learning , pp. 1613–1622, PMLR. ISSN: 1938- 7228

    1938

  13. [21]

    Keeping the neural networks simple by minimizing the description length of the weights,

    G. E. Hinton and D. van Camp, “Keeping the neural networks simple by minimizing the description length of the weights,” in Proceedings of the sixth annual conference on Computational learning theory , COLT ’93, pp. 5–13, Association for Computing Machinery

  14. [22]

    Continual Learning from the Perspective of Compression,

    X. He and M. Lin, “Continual Learning from the Perspective of Compression,” arXiv e-prints , p. arXiv:2006.15078, June 2020. doi: 10.48550/arXiv.2006.15078

    2006 doi arXiv

  15. [23]

    Three types of incremental learning,

    G. M. van de Ven, T. Tuytelaars, and A. S. Tolias, “Three types of incremental learning,” vol. 4, no. 12, pp. 1185–1197. Number: 12 Publisher: Nature Publishing Group

  16. [24]

    Uncertainty- guided continual learning with bayesian neural networks

    S. Ebrahimi, M. Elhoseiny, T. Darrell, and M. Rohrbach, “Uncertainty- guided continual learning with bayesian neural networks.”

  17. [25]

    Uncertainty-based continual learning with adaptive regularization,

    H. Ahn, S. Cha, D. Lee, and T. Moon, “Uncertainty-based continual learning with adaptive regularization,” in Advances in Neural Informa- tion Processing Systems , vol. 32, Curran Associates, Inc

  18. [26]

    Variational continual learning

    C. V . Nguyen, Y . Li, T. D. Bui, and R. E. Turner, “Variational continual learning.”

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.