mlsanityData to 7 Oct 2026

InTAct: Interval-based Task Activation Consolidation for Continual Learning

arXiv 2511.17439 ↗First posted 21 Nov 2025cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Continual learning is a fundamental challenge in artificial intelligence that requires networks to acquire new knowledge while preserving previously learned representations. Despite the success of various approaches, most existing paradigms do not provide rigorous mathematical guarantees against catastrophic forgetting. Current methods that offer such guarantees primarily focus on analyzing the parameter space using textitinterval arithmetic (IA), as seen in frameworks such as InterContiNet. However, restricting high-dimensional weight updates can be computationally expensive. In this work, we propose InTAct (Interval-based Task Activation Consolidation), a method that mitigates catastrophic forgetting by enforcing functional invariance at the neuron level. We identify specific activation intervals where previous tasks reside and constrain updates within these regions while allowing for flexible adaptation elsewhere. By ensuring that predictions remain stable within these nested activation intervals, we provide a tractable mathematical guarantee of functional invariance. We emphasize that regulating the activation space is significantly more efficient than parameter-based constraints, because the dimensionality of internal signals is much lower than that of the vast space of model weights. While our approach is architecture-agnostic and applicable to various continual learning settings, its integration with prompt-based methods enables it to achieve state-of-the-art performance on challenging benchmarks.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 45 of its 63 references that are in the map. First posted on arXiv 21 Nov 2025.

Builds on

45 of 63 references.

References · 45

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  4. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  5. 2016Learning without Forgettingcited by 2,465
  6. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  7. 2016Progressive Neural Networkscited by 1,332
  8. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
  9. 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
  10. 2017Continual Learning with Deep Generative Replaycited by 1,152
  11. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
  12. 2018Efficient Lifelong Learning with A-GEMcited by 1,044
33 more
  1. 2021Learning to Prompt for Continual Learningcited by 938
  2. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  3. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  4. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
  5. 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
  6. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
  7. 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 446
  8. 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 446
  9. 2020Semantic Drift Compensation for Class-Incremental Learningcited by 241
  10. 2018Re-evaluating Continual Learning Scenarios: A Categorization and Case for Strong Baselinescited by 228
  11. 2020Supermasks in Superpositioncited by 223
  12. 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 189
  13. 2021Training Networks in Null Space of Feature Covariance for Continual Learningcited by 139
  14. 2022FeTrIL: Feature Translation for Exemplar-Free Class-Incremental Learningcited by 120
  15. 2024Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learningcited by 115
  16. 2018Benchmarking Neural Network Robustness to Common Corruptions and Surface Variationscited by 99
  17. 2023FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learningcited by 86
  18. 2022Probing Representation Forgetting in Supervised and Unsupervised Continual Learningcited by 74
  19. 2022A Simple Baseline that Questions the Use of Pretrained-Models in Continual Learningcited by 54
  20. 2024Consistent Prompting for Rehearsal-Free Continual Learningcited by 52
  21. 2021Layerwise Optimization by Gradient Decomposition for Continual Learningcited by 51
  22. 2022Isolation and Impartial Aggregation: A Paradigm of Incremental Learning without Interferencecited by 44
  23. 2023Achieving a Better Stability-Plasticity Trade-off via Auxiliary Networks in Continual Learningcited by 41
  24. 2021Continuum: Simple Management of Complex Continual Learning Scenarioscited by 33
  25. 2024Resurrecting Old Classes with New Data for Exemplar-Free Continual Learningcited by 33
  26. 2022Balancing Stability and Plasticity through Advanced Null Space in Continual Learningcited by 29
  27. 2025LoRA Subtraction for Drift-Resistant Space in Exemplar-Free Continual Learningcited by 16
  28. 2025Componential Prompt-Knowledge Alignment for Domain Incremental Learningcited by 13
  29. 2023NAPA-VQ: Neighborhood Aware Prototype Augmentation with Vector Quantization for Continual Learningcited by 12
  30. 2022Continual Learning with Guarantees via Weight Interval Constraintscited by 10
  31. 2025Online Curvature-Aware Replay: Leveraging mathbf2nd Order Information for Online Continual Learningcited by 8
  32. 2025Learning without Isolation: Pathway Protection for Continual Learningcited by 6
  33. 2024HINT: Hypernetwork Approach to Training Weight Interval Regions in Continual Learningcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.