Divide and not forget: Ensemble of selectively trained experts in Continual Learning

Grzegorz Rypeść, Sebastian Cygert, Valeriya Khan, Tomasz Trzciński, Bartosz Zieliński +1 more
1/18/2024
cs.LGcs.CV

No official code found. Best implementation: grypesc/SEED (37 stars, MIT, last commit 2024-04-21).

Abstract

Class-incremental learning is becoming more popular as it helps models widen their applicability while not forgetting what they already know. A trend in this area is to use a mixture-of-expert technique, where different models work together to solve the task. However, the experts are usually trained all at once using whole task data, which makes them all prone to forgetting and increasing computational burden. To address this limitation, we introduce a novel approach named SEED. SEED selects only one, the most optimal expert for a considered task, and uses data from this task to fine-tune only this expert. For this purpose, each expert represents each class with a Gaussian distribution, and the optimal expert is selected based on the similarity of those distributions. Consequently, SEED increases diversity and heterogeneity within the experts while maintaining the high stability of this ensemble method. The extensive experiments demonstrate that SEED achieves state-of-the-art performance in exemplar-free settings across various scenarios, showing the potential of expert diversification through data in continual learning.

View on arXivView PDF

Code Implementations(1)

grypesc/SEEDCommunity100%
MIT

ICLR2024 paper on Continual Learning

377Shell, PythonDec 18, 20232 years agoMIT
class-incrementalclass-incremental-learningcomputer-visioncontinual-learningfacil+1 more

Similar Papers

Cite this paper

@article{rype2024divide,
  title  = {Divide and not forget: Ensemble of selectively trained experts in Continual Learning},
  author = {Grzegorz Rypeść and Sebastian Cygert and Valeriya Khan and Tomasz Trzciński and Bartosz Zieliński and Bartłomiej Twardowski},
  year   = {2024},
  eprint = {2401.10191},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.10191v3},
  journal = {ICLR 2024 2024}
}

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

Discussion