Incremental Task Learning with Incremental Rank Updates

Rakib Hyder, Ken Shao, Boyu Hou, Panos Markopoulos, Ashley Prater-Bennette +1 more
7/19/2022
cs.CVcs.LG

Official code: CSIPlab/task-increment-rank-update (7 stars, last commit 2022-08-26).

Abstract

Incremental Task learning (ITL) is a category of continual learning that seeks to train a single network for multiple tasks (one after another), where training data for each task is only available during the training of that task. Neural networks tend to forget older tasks when they are trained for the newer tasks; this property is often known as catastrophic forgetting. To address this issue, ITL methods use episodic memory, parameter regularization, masking and pruning, or extensible network structures. In this paper, we propose a new incremental task learning framework based on low-rank factorization. In particular, we represent the network weights for each layer as a linear combination of several rank-1 matrices. To update the network for a new task, we learn a rank-1 (or low-rank) matrix and add that to the weights of every layer. We also introduce an additional selector vector that assigns different weights to the low-rank matrices learned for the previous tasks. We show that our approach performs better than the current state-of-the-art methods in terms of accuracy and forgetting. Our method also offers better memory efficiency compared to episodic memory- and mask-based approaches. Our code will be available at https://github.com/CSIPlab/task-increment-rank-update.git

View on arXivView PDF

Code Implementations(1)

73Jupyter NotebookJul 16, 20224 years ago

Similar Papers

Cite this paper

@article{hyder2022incremental,
  title  = {Incremental Task Learning with Incremental Rank Updates},
  author = {Rakib Hyder and Ken Shao and Boyu Hou and Panos Markopoulos and Ashley Prater-Bennette and M. Salman Asif},
  year   = {2022},
  eprint = {2207.09074},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.09074v1}
}

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/2207.09074.svg)](https://codeofpaper.com/paper/2207.09074)

Discussion