Random Dense Knowledge Distillation for Continual Learning

Continual learning, involving sequential training on diverse tasks, often faces catastrophic forgetting. While knowledge distillation- based approaches exhibit notable success in preventing forgetting, we pinpoint a limitation in their ability to distill the cumulative knowledge of all the previous tasks. To remedy this, we propose Random Dense Knowledge Distillation (RDKD). RDKD uses a task pool to track the model's capabilities. It partitions the output logits of the model into dense groups, each corresponding to a task in the task pool. It then distills all tasks’ knowledge using all groups. However, using all the groups can be computationally expensive, we also suggest random group selection in each optimization step. Moreover, we propose an adaptive weighting scheme, which balances the learning of new classes and the retention of old classes, based on the count and similarity of the classes. Our RDKD outperforms recent state-of-the-art baselines across diverse benchmarks and scenarios. Empirical analysis underscores RDKD's ability to enhance model stability, promote flatter minima for improved generalization, and remains robust across various memory budgets and task orders. Moreover, it seamlessly integrates with other CL methods to boost performance and proves versatile in offline scenarios like model compression.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Multimedia Computing Communications and Applications
Published
2026-05-27
DOI
https://doi.org/10.1145/3816731
Primary Topic
Domain Adaptation and Few-Shot Learning
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Random Dense Knowledge Distillation for Continual Learning

Zenglin Shi, Jie Chu, Y D Wu, Yu Song et al.
ACM Transactions on Multimedia Computing Communications and Applications
Domain Adaptation and Few-Shot Learning
article

Random Dense Knowledge Distillation for Continual Learning

Zenglin Shi, Jie Chu, Y D Wu, Yu Song, Pei Liu, Tong Su
article en

Abstract

Continual learning, involving sequential training on diverse tasks, often faces catastrophic forgetting. While knowledge distillation- based approaches exhibit notable success in preventing forgetting, we pinpoint a limitation in their ability to distill the cumulative knowledge of all the previous tasks. To remedy this, we propose Random Dense Knowledge Distillation (RDKD). RDKD uses a task pool to track the model's capabilities. It partitions the output logits of the model into dense groups, each corresponding to a task in the task pool. It then distills all tasks’ knowledge using all groups. However, using all the groups can be computationally expensive, we also suggest random group selection in each optimization step. Moreover, we propose an adaptive weighting scheme, which balances the learning of new classes and the retention of old classes, based on the count and similarity of the classes. Our RDKD outperforms recent state-of-the-art baselines across diverse benchmarks and scenarios. Empirical analysis underscores RDKD's ability to enhance model stability, promote flatter minima for improved generalization, and remains robust across various memory budgets and task orders. Moreover, it seamlessly integrates with other CL methods to boost performance and proves versatile in offline scenarios like model compression.

ACM Transactions on Multimedia Computing Communications and Applications
Hefei University of Technology (CN), Zhengzhou University (CN)
Openalex Percentile: Top 4%
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.