Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dulan Zhou

dblp:376/5368 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Learning paradigms · 36% Trustworthy machine learning · 22% Efficient and distributed learning · 20%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms › continual learning
class-incremental learning
1.122025
Knowledge Memorization and Rumination for Pre-trained Model-based Class-Incremental Learning · CVPR 2025
Maintaining Fairness in Logit-based Knowledge Distillation for Class-Incremental Learning · AAAI 2025
Machine learning › Learning paradigms
continual learning
1.012026
Perturbing to Preserve: Defending Fragile Knowledge in Online Continual Learning · AAAI 2026
Natural language and speech › Language models and text generation › large language model › knowledge in language models
knowledge retention
1.012026
Perturbing to Preserve: Defending Fragile Knowledge in Online Continual Learning · AAAI 2026
Machine learning › Learning paradigms › continual learning
online continual learning
1.012026
Perturbing to Preserve: Defending Fragile Knowledge in Online Continual Learning · AAAI 2026
Machine learning › Trustworthy machine learning
robustness
1.012026
Perturbing to Preserve: Defending Fragile Knowledge in Online Continual Learning · AAAI 2026
Machine learning › Trustworthy machine learning
fairness
0.912025
Maintaining Fairness in Logit-based Knowledge Distillation for Class-Incremental Learning · AAAI 2025
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.912025
Maintaining Fairness in Logit-based Knowledge Distillation for Class-Incremental Learning · AAAI 2025
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
model distillation
0.912025
Maintaining Fairness in Logit-based Knowledge Distillation for Class-Incremental Learning · AAAI 2025
Machine learning › Transfer learning and domain adaptation › foundation model adaptation
pre-trained model adaptation
0.912025
Knowledge Memorization and Rumination for Pre-trained Model-based Class-Incremental Learning · CVPR 2025

Methods — techniques the papers use, named apart from their topics

structured perturbation · 1.0exponential moving averaging · 1.0consistency constraint · 1.0momentum-based adapter weight interpolation · 0.9logit normalization · 0.9knowledge rumination · 0.9knowledge distillation · 0.9cross-entropy loss · 0.9analytical learning · 0.9
YearPublicationVenuePosition
2026 Perturbing to Preserve: Defending Fragile Knowledge in Online Continual Learning
abstract
Online continual learning requires models to learn from non‑stationary data streams while retaining prior knowledge. We identify an overlooked phenomenon—knowledge fragility—where correctly learned instances are rapidly forgotten after minor parameter updates. Our analysis attributes this fragility to a temporal–spatial dual mechanism: temporal instability, high-frequency parameter oscillations cause forgetting to outpace adaptation; and spatial vulnerability, fragile instances lie in sharp, high‑curvature regions of the loss landscape that are extremely sensitive to optimization noise. These insights motivate PDFK (Perturbing to Defend Fragile Knowledge), a unified framework that defends fragile knowledge along both dimensions. Temporally, we apply exponential moving averaging to smooth parameter evolution and stabilize long‑term memory. Spatially, we inject minimal structured perturbations with a consistency constraint to flatten sharp regions and enhance robustness. PDFK requires no task‑boundary annotations. Extensive experiments demonstrate that PDFK substantially improves knowledge retention and outperforms strong baselines under diverse and challenging continual learning settings.
Dulan Zhou, Zijian Gao, Kele Xu
AAAI1
2025 Maintaining Fairness in Logit-based Knowledge Distillation for Class-Incremental Learning
abstract
Logit-based knowledge distillation (KD) is commonly used to mitigate catastrophic forgetting in class-incremental learning (CIL) caused by data distribution shifts. However, the strict match of logit values between student and teacher models conflicts with the cross-entropy (CE) loss objective of learning new classes, leading to significant recency bias (i.e. unfairness). To address this issue, we rethink the overlooked limitations of KD-based methods through empirical analysis. Inspired by our findings, we introduce a plug-and-play pre-process method that normalizes the logits of both the student and teacher across all classes, rather than just the old classes, before distillation. This approach allows the student to focus on both old and new classes, capturing intrinsic inter-class relations from the teacher. By doing so, our method avoids the inherent conflict between KD and CE, maintaining fairness between old and new classes. Additionally, recognizing that overconfident teacher predictions can hinder the transfer of inter-class relations (i.e., dark knowledge), we extend our method to capture intra-class relations among different instances, ensuring fairness within old classes. Our method integrates seamlessly with existing logit-based KD approaches, consistently enhancing their performance across multiple CIL benchmarks without incurring additional training costs.
Zijian Gao, Shanhao Han, Xingxing Zhang 0001, Kele Xu, Dulan Zhou, Xinjun Mao, Yong Dou, Huaimin Wang 0001
AAAI5
2025 Knowledge Memorization and Rumination for Pre-trained Model-based Class-Incremental Learning
abstract
Class-Incremental Learning (CIL) enables models to continuously learn new classes while mitigating catastrophic forgetting. Recently, Pre-Trained Models (PTMs) have greatly enhanced CIL performance, even when fine-tuning is limited to the first task. This advantage is particularly beneficial for CIL methods that freeze the feature extractor after first-task fine-tuning, such as analytic learning-based approaches using a least squares solution-based classification head to acquire knowledge recursively. In this work, we revisit the analytical learning approach combined with PTMs and identify its limitations in adapting to new classes, leading to sub-optimal performance. To address this, we propose the Momentum-based Analytical Learning (MoAL) approach. MoAL achieves robust knowledge memorization via an analytical classification head and improves adaptivity to new classes through momentum-based adapter weight interpolation, leading to forgetting outdated knowledge. Importantly, we introduce a knowledge rumination mechanism that leverages refined adaptivity, allowing the model to revisit and reinforce old knowledge, thereby improving performance on old classes. MoAL facilitates the acquisition of new knowledge and consolidates old knowledge, achieving a win-win outcome between plasticity and stability. Extensive experiments on various incremental settings show MoAL’s state-of-the-art performance1.
Zijian Gao, Wangwang Jia, Xingxing Zhang 0001, Dulan Zhou, Kele Xu, Yong Dou, Xinjun Mao, Huaimin Wang 0001
CVPR4