提出自适应注意力机制,缓解任务增量学习中遗忘与容量不足问题。
AdaHAT: Adaptive Hard Attention to the Task in Task-Incremental Learning
- 通过动态调整静态参数更新,实现对历史任务的自适应关注。
- 在长序列任务上平均性能优于基线,尤其在10个以上任务时提升显著。
- 适合需要持续学习新任务且资源受限的场景,如边缘设备部署。
灾难性遗忘是任务增量学习中的主要问题,神经网络在学习新任务时容易覆盖先前知识。现有基于结构的方法虽能缓解此问题,但在长期任务序列下会因网络容量限制而出现越来越多的静态参数,阻碍进一步学习。本文提出自适应硬注意力机制AdaHAT,通过评估参数对旧任务的重要性及当前网络容量,动态决定是否更新静态参数。该机制扩展了已有方法HAT,提升了模型在长序列任务上的稳定性与可塑性平衡能力。在多个数据集上的实验表明,相较于HAT等基线方法,AdaHAT在长期任务序列中取得更优的平均性能,有效缓解了容量瓶颈问题。代码已公开于pengxiang-wang.com/projects/continual-learning-arena。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。