Efficient Prototypical Classifier for Class-Incremental Learning

The nearest prototypical classifier faces challenges of semantic drift and prototype interference. Previous methods address these issues using data rehearsal and contrastive learning, but these approaches incur high memory costs and slow convergence. In this paper, we propose a novel prototypical minimum distance loss, along with a two-stage training pipeline, to mitigate prototype interference with low memory overhead and fast convergence. Leveraging task-specific prompts and a key-query mechanism, we significantly reduce semantic drift. Additionally, we introduce a continual exponential moving average to enhance model stability and minimize forgetting. Notably, our method is rehearsal-free and avoids generation processes, simplifying training and further reducing memory usage. We validate our approach on four challenging class-incremental learning datasets, achieving significant improvements over state-of-the-art methods.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10889169
Primary Topic
Text and Document Classification Technologies
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Efficient Prototypical Classifier for Class-Incremental Learning

Jingyang Qiao, Xin Tan, Wei Zhang, Zhizhong Zhang et al.
Text and Document Classification Technologies
article

Efficient Prototypical Classifier for Class-Incremental Learning

Jingyang Qiao, Xin Tan, Wei Zhang, Zhizhong Zhang, Yuan Xie
article en

Abstract

The nearest prototypical classifier faces challenges of semantic drift and prototype interference. Previous methods address these issues using data rehearsal and contrastive learning, but these approaches incur high memory costs and slow convergence. In this paper, we propose a novel prototypical minimum distance loss, along with a two-stage training pipeline, to mitigate prototype interference with low memory overhead and fast convergence. Leveraging task-specific prompts and a key-query mechanism, we significantly reduce semantic drift. Additionally, we introduce a continual exponential moving average to enhance model stability and minimize forgetting. Notably, our method is rehearsal-free and avoids generation processes, simplifying training and further reducing memory usage. We validate our approach on four challenging class-incremental learning datasets, achieving significant improvements over state-of-the-art methods.

East China Normal University (CN)
Natural Science Foundation of Shanghai, National Natural Science Foundation of China
Openalex Percentile: Top 98%
Text and Document Classification Technologies
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.

Efficient Prototypical Classifier for Class-Incremental Learning — Jingyang Qiao, Xin Tan, et al. · (2025) | TGRS Research Map | TGRS