mlsanityData to 7 Oct 2026

AdaHAT: Adaptive Hard Attention to the Task in Task-Incremental Learning

arXiv 2608.01252 ↗First posted 2 Aug 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Catastrophic forgetting is a major problem in task-incremental learning, where neural networks tend to overwrite previously learned knowledge when trained on new tasks. A number of architecture-based approaches have been proposed to address this problem. However, the architecture-based approaches suffer from another problem related to network capacity when the networks learn long task sequences: As a network is trained on an increasing number of new tasks in a long task sequence, a growing proportion of active parameters becomes static to prevent forgetting of previously learned knowledge. In this paper, we propose Adaptive Hard Attention to the Task (AdaHAT) with an adaptive attention mechanism which allows adaptive updates to static parameters by taking into account the information about previous tasks on both the importance of these parameters to previous tasks and the current network capacity. Based on this idea, we develop a new neural network architecture incorporating our proposed AdaHAT mechanism. AdaHAT extends an existing architecture-based approach, Hard Attention to the Task (HAT), to better support task-incremental learning over long task sequences. We conduct experiments on a number of datasets and compare AdaHAT with task-incremental learning baselines including HAT. Our experimental results show that AdaHAT achieves better average performance across tasks than these baselines, especially on long task sequences, demonstrating the benefits from balancing the trade-off between stability and plasticity of a network when learning such sequences of tasks, alleviating the network capacity problem. Our code is available at pengxiang-wang.com/projects/continual-learning-arena.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 25 references that are in the map. First posted on arXiv 2 Aug 2026.

Builds on

19 of 25 references.

References · 19

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  4. 2016Learning without Forgettingcited by 2,465
  5. 2017Gradient Episodic Memory for Continual Learningcited by 1,871
  6. 2016Progressive Neural Networkscited by 1,332
  7. 2017Continual Learning with Deep Generative Replaycited by 1,152
  8. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  9. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  10. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 860
  11. 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 711
  12. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
7 more
  1. 2019Three scenarios for continual learningcited by 610
  2. 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 362
  3. 2017Variational Continual Learningcited by 335
  4. 2017Overcoming Catastrophic Forgetting by Incremental Moment Matchingcited by 243
  5. 2020Supermasks in Superpositioncited by 223
  6. 2019Compacting, Picking and Growing for Unforgetting Continual Learningcited by 207
  7. 2021Understanding Catastrophic Forgetting and Remembering in Continual Learning with Optimal Relevance Mappingcited by 47

Built on by

Not cited yet.