Mitigating Interference in the Knowledge Continuum through Attention-Guided Incremental Learning

Prashant Bhat, Bharath Renjith, Elahe Arani, Bahram Zonooz
5/22/2024
cs.LGcs.AIcs.CV

No official code found. Best implementation: NeurAI-Lab/AGILE (0 stars, last commit 2024-05-27).

Abstract

Continual learning (CL) remains a significant challenge for deep neural networks, as it is prone to forgetting previously acquired knowledge. Several approaches have been proposed in the literature, such as experience rehearsal, regularization, and parameter isolation, to address this problem. Although almost zero forgetting can be achieved in task-incremental learning, class-incremental learning remains highly challenging due to the problem of inter-task class separation. Limited access to previous task data makes it difficult to discriminate between classes of current and previous tasks. To address this issue, we propose `Attention-Guided Incremental Learning' (AGILE), a novel rehearsal-based CL approach that incorporates compact task attention to effectively reduce interference between tasks. AGILE utilizes lightweight, learnable task projection vectors to transform the latent representations of a shared task attention module toward task distribution. Through extensive empirical evaluation, we show that AGILE significantly improves generalization performance by mitigating task interference and outperforming rehearsal-based approaches in several CL scenarios. Furthermore, AGILE can scale well to a large number of tasks with minimal overhead while remaining well-calibrated with reduced task-recency bias.

View on arXivView PDF

Code Implementations(1)

NeurAI-Lab/AGILECommunity100%

AGILE

00PythonMay 10, 20232 years ago
continual-learninglifelong-learningprompt-based-learning

Similar Papers

Cite this paper

@article{bhat2024mitigating,
  title  = {Mitigating Interference in the Knowledge Continuum through Attention-Guided Incremental Learning},
  author = {Prashant Bhat and Bharath Renjith and Elahe Arani and Bahram Zonooz},
  year   = {2024},
  eprint = {2405.13978},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.13978v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.13978.svg)](https://codeofpaper.com/paper/2405.13978)

Discussion