Class Incremental Learning with Forward Memory

Prevalent dynamic network methods must provide additional task-IDs during inference with respect to class incremental learning. Otherwise, the classification accuracy will be significantly reduced. To tackle this issue, this work proposes a novel Class Incremental Learning with Forward Memory (CIL-FM) algorithm based on multi-head networks. The method learns and stores previously learned knowledge by introducing a forward branch, which then applies to new branches learning. A series of experiments confirm that forward branching can significantly improve the performance of dynamic network structures without task-IDs during inference. CIL-FM performs similarly to static network structures but excels in its continuous expansion as dynamic network structures without relying on task labeling cues in the inference phase. CIL-FM has better learning potential than static network structures.

Authors

Institutions

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1109/icis61260.2024.10778395
Primary Topic
Domain Adaptation and Few-Shot Learning
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Class Incremental Learning with Forward Memory

Mingzhu Hu, Mingjun Dai, Yadi Gu, Yonghao Kong
Domain Adaptation and Few-Shot Learning
article

Class Incremental Learning with Forward Memory

Mingzhu Hu, Mingjun Dai, Yadi Gu, Yonghao Kong
article en

Abstract

Prevalent dynamic network methods must provide additional task-IDs during inference with respect to class incremental learning. Otherwise, the classification accuracy will be significantly reduced. To tackle this issue, this work proposes a novel Class Incremental Learning with Forward Memory (CIL-FM) algorithm based on multi-head networks. The method learns and stores previously learned knowledge by introducing a forward branch, which then applies to new branches learning. A series of experiments confirm that forward branching can significantly improve the performance of dynamic network structures without task-IDs during inference. CIL-FM performs similarly to static network structures but excels in its continuous expansion as dynamic network structures without relying on task labeling cues in the inference phase. CIL-FM has better learning potential than static network structures.

Shenzhen University (CN)
Natural Science Foundation of Xinjiang Province, Natural Science Foundation of Shenzhen City, National Natural Science Foundation of China, Natural Science Foundation of Guangdong Province, Consiglio Nazionale delle Ricerche, National Key Research and Development Program of China
Openalex Percentile: Top 79%
Domain Adaptation and Few-Shot Learning
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Class Incremental Learning with Forward Memory — Mingzhu Hu, Mingjun Dai, et al. · (2024) | TGRS Research Map | TGRS