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.

Aojun Lu

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

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

Artificial intelligence and machine learning · 5 · 3 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 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
4 papers
Learning paradigms · 80% Transfer learning and domain adaptation · 13% Efficient and distributed learning · 4%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
continual learning
3.442026
Adapt Before Continual Learning · AAAI 2026
Rethinking the Stability-Plasticity Trade-off in Continual Learning from an Architectural Perspective · ICML 2025
Make Continual Learning Stronger via C-Flat · NeurIPS 2024
Machine learning › Learning paradigms › continual learning
stability-plasticity trade-off
1.922026
Adapt Before Continual Learning · AAAI 2026
Rethinking the Stability-Plasticity Trade-off in Continual Learning from an Architectural Perspective · ICML 2025
Machine learning › Transfer learning and domain adaptation › foundation model adaptation
pre-trained model adaptation
1.012026
Adapt Before Continual Learning · AAAI 2026
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
0.812024
Make Continual Learning Stronger via C-Flat · NeurIPS 2024
Machine learning › Efficient and distributed learning
model compression
0.312025
Rethinking the Stability-Plasticity Trade-off in Continual Learning from an Architectural Perspective · ICML 2025
Machine learning › Deep learning architectures and training
loss landscape
0.212024
Make Continual Learning Stronger via C-Flat · NeurIPS 2024

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

prototype alignment · 1.0dual-architecture framework · 0.9sharpness-aware minimization · 0.8flatness regularization · 0.8
YearPublicationVenuePosition
2026 Adapt Before Continual Learning
abstract
Continual Learning (CL) seeks to enable neural networks to incrementally acquire new knowledge (plasticity) while retaining existing knowledge (stability). Although pre-trained models (PTMs) have provided a strong foundation for CL, existing approaches face a fundamental challenge in balancing these two competing objectives. Current methods typically address stability by freezing the PTM backbone, which severely limits the model's plasticity, particularly when incoming data distribution diverges largely from the pre-training data. Alternatively, sequentially fine-tuning the entire PTM can adapt to new knowledge but often leads to catastrophic forgetting, highlighting the critical stability-plasticity trade-off in PTM-based CL. To address this limitation, we propose Adapting PTMs before the core CL process (ACL), a novel framework that introduces a plug-and-play adaptation phase prior to learning each new task. During this phase, ACL refines the PTM backbone by aligning embeddings with their original class prototypes while distancing them from irrelevant classes. This mechanism theoretically and empirically demonstrates desirable balance between stability and plasticity, significantly improving CL performance across benchmarks and integrated methods.
Aojun Lu, Tao Feng 0014, Hangjie Yuan, Chunhui Ding, Yanan Sun 0001
AAAI1
2025 Rethinking the Stability-Plasticity Trade-off in Continual Learning from an Architectural Perspective
abstract
The quest for Continual Learning (CL) seeks to empower neural networks with the ability to learn and adapt incrementally. Central to this pursuit is addressing the stability-plasticity dilemma, which involves striking a balance between two conflicting objectives: preserving previously learned knowledge and acquiring new knowledge. While numerous CL methods aim to achieve this trade-off, they often overlook the impact of network architecture on stability and plasticity, restricting the trade-off to the parameter level. In this paper, we delve into the conflict between stability and plasticity at the architectural level. We reveal that under an equal parameter constraint, deeper networks exhibit better plasticity, while wider networks are characterized by superior stability. To address this architectural-level dilemma, we introduce a novel framework denoted Dual-Arch, which serves as a plug-in component for CL. This framework leverages the complementary strengths of two distinct and independent networks: one dedicated to plasticity and the other to stability. Each network is designed with a specialized and lightweight architecture, tailored to its respective objective. Extensive experiments demonstrate that Dual-Arch enhances the performance of existing CL methods while being up to 87% more compact in terms of parameters.
Aojun Lu, Hangjie Yuan, Tao Feng 0014, Yanan Sun 0001
ICML1
2025 Enhancing Replay-Based Continual Learning via Predictive Uncertainty Controller
Chunhui Ding, Aojun Lu, Yanan Sun 0001
PRICAI2
2024 Revisiting Neural Networks for Continual Learning: An Architectural Perspective
Aojun Lu, Tao Feng 0014, Hangjie Yuan, Xiaotian Song, Yanan Sun 0001
IJCAI1
2024 Make Continual Learning Stronger via C-Flat
abstract
How to balance the learning ’sensitivity-stability’ upon new task training and memory preserving is critical in CL to resolve catastrophic forgetting. Improving model generalization ability within each learning phase is one solution to help CL learning overcome the gap in the joint knowledge space. Zeroth-order loss landscape sharpness-aware minimization is a strong training regime improving model generalization in transfer learning compared with optimizer like SGD. It has also been introduced into CL to improve memory representation or learning efficiency. However, zeroth-order sharpness alone could favors sharper over flatter minima in certain scenarios, leading to a rather sensitive minima rather than a global optima. To further enhance learning stability, we propose a Continual Flatness (C-Flat) method featuring a flatter loss landscape tailored for CL. C-Flat could be easily called with only one line of code and is plug-and-play to any CL methods. A general framework of C-Flat applied to all CL categories and a thorough comparison with loss minima optimizer and flat minima based CL approaches is presented in this paper, showing that our method can boost CL performance in almost all cases. Code is available at https://github.com/WanNaa/C-Flat.
Ang Bian, Wei Li 0313, Hangjie Yuan, Chengrong Yu, Mang Wang 0001, Zixiang Zhao, Aojun Lu, Pengliang Ji, Tao Feng 0014
NeurIPS7