Paper Detail

Relative Parameter Importance in Task-Agnostic Replay-Free Continual Learning

Malavika Suresh, Ikechukwu Nkisi-Orji, Nirmalie Wiratunga

arxiv Score 10.0

Published 2026-08-01 · First seen 2026-08-04

Research Track A

Abstract

Achieving continual learning (CL) with deep neural networks requires balancing stability and plasticity while enabling knowledge transfer. In this work, we focus on offline learning algorithms under the constraints: (I) no access to training data from prior tasks (II) no access to task-id at inference time. We introduce a novel measure, the relative parameter-importance, which measures the relative importance of each parameter with respect to both the current and past tasks. Parameters with high relative importance are interpreted as more important for maintaining past-task stability and thus heavily regularised, whereas parameters with low relative-importance are allowed to be more freely updated. Unlike existing methods, our approach allows the update of parameters with high past-task importance when they have low relative-importance, thus enabling backward knowledge transfer in addition to tackling the stability-plasticity trade-off. We demonstrate improvements against state-of-the-art CL methods on both class-incremental and domain-incremental learning text classification problems and provide insights for extending our method to text generation problems. Code available at: https://github.com/itsmemala/LACL

Workflow Status

Review status
pending
Role
unreviewed
Read priority
now
Vote
Not set.
Saved
no
Collections
Not filed yet.
Next action
Not filled yet.

Reading Brief

No structured notes yet. Add `summary_sections`, `why_relevant`, `claim_impact`, or `next_action` in `papers.jsonl` to enrich this view.

Why It Surfaced

No ranking explanation is available yet.

Tags

No tags.

BibTeX

@article{suresh2026relative,
  title = {Relative Parameter Importance in Task-Agnostic Replay-Free Continual Learning},
  author = {Malavika Suresh and Ikechukwu Nkisi-Orji and Nirmalie Wiratunga},
  year = {2026},
  abstract = {Achieving continual learning (CL) with deep neural networks requires balancing stability and plasticity while enabling knowledge transfer. In this work, we focus on offline learning algorithms under the constraints: (I) no access to training data from prior tasks (II) no access to task-id at inference time. We introduce a novel measure, the relative parameter-importance, which measures the relative importance of each parameter with respect to both the current and past tasks. Parameters with high},
  url = {https://arxiv.org/abs/2608.00630},
  keywords = {cs.LG},
  eprint = {2608.00630},
  archiveprefix = {arXiv},
}

Metadata

{}