Restricted Orthogonal Gradient Projection for Continual Learning

Zeyuan Yang, Zonghan Yang, Peng Li, Yang Liu
1/28/2023
cs.LG

No official code found. Best implementation: THUNLP-MT/ROGO (5 stars, MIT, last commit 2023-10-23).

Abstract

Continual learning aims to avoid catastrophic forgetting and effectively leverage learned experiences to master new knowledge. Existing gradient projection approaches impose hard constraints on the optimization space for new tasks to minimize interference, which simultaneously hinders forward knowledge transfer. To address this issue, recent methods reuse frozen parameters with a growing network, resulting in high computational costs. Thus, it remains a challenge whether we can improve forward knowledge transfer for gradient projection approaches using a fixed network architecture. In this work, we propose the Restricted Orthogonal Gradient prOjection (ROGO) framework. The basic idea is to adopt a restricted orthogonal constraint allowing parameters optimized in the direction oblique to the whole frozen space to facilitate forward knowledge transfer while consolidating previous knowledge. Our framework requires neither data buffers nor extra parameters. Extensive experiments have demonstrated the superiority of our framework over several strong baselines. We also provide theoretical guarantees for our relaxing strategy.

View on arXivView PDF

Code Implementations(1)

THUNLP-MT/ROGOCommunity67%
MIT

This repo contains the codes for our work “Restricted orthogonal gradient projection for continual learning”.

50Shell, PythonOct 22, 20232 years agoMIT

Similar Papers

Cite this paper

@article{yang2023restricted,
  title  = {Restricted Orthogonal Gradient Projection for Continual Learning},
  author = {Zeyuan Yang and Zonghan Yang and Peng Li and Yang Liu},
  year   = {2023},
  eprint = {2301.12131},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.12131v1}
}

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

Discussion