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

Chenxin Mao

dblp:432/6230 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0000-6011-8172ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 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
1 paper
Efficient and distributed learning · 50% Learning paradigms · 25% Reinforcement learning · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
continual learning
1.012026
Smaller but Better: Plasticity-Preserving Continual Learning for Embedded AI · WWW 2026
Machine learning › Efficient and distributed learning
model compression
1.012026
Smaller but Better: Plasticity-Preserving Continual Learning for Embedded AI · WWW 2026
Machine learning › Reinforcement learning
plasticity preservation
1.012026
Smaller but Better: Plasticity-Preserving Continual Learning for Embedded AI · WWW 2026
Machine learning › Efficient and distributed learning › model compression
pruning
1.012026
Smaller but Better: Plasticity-Preserving Continual Learning for Embedded AI · WWW 2026
Embedded and real-time systems
embedded AI
0.312026
Smaller but Better: Plasticity-Preserving Continual Learning for Embedded AI · WWW 2026

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

plasticity-aware pruning · 2.0continual pruning · 2.0
YearPublicationVenuePosition
2026 Distributed or Centralized: Edge-Cloud Collaborative Active Learning
Chenxin Mao, Shangyu Liu, Chen Gong 0006, Zhenzhe Zheng 0001, Huiyang Xu, Fan Wu 0006, Guihai Chen
IWQoS1
2026 Smaller but Better: Plasticity-Preserving Continual Learning for Embedded AI
abstract
Embedded AI applications usually require compact on-device models that can continually adapt to new tasks. However, recent studies have revealed that neural networks trained on non-stationary data streams gradually lose their ability to adapt to new tasks, a phenomenon known as plasticity loss. Moreover, to enable neural networks to run on resource-constrained embedded devices, model pruning is commonly applied for model compression, which may further affect their plasticity. To conduct efficient model adaptation on new tasks on embedded devices, we propose Plasticity-aware Continual Pruning (PaCP), a novel framework that operates in two stages. First, a pre-deployment stage uses a plasticity-aware strategy to prune the model while optimizing its initial structure for future adaptability. Second, during continual learning, the model's capacity is temporarily expanded at task boundaries to efficiently learn new information, before plasticity-aware pruning restores its compact form. Extensive experiments on multiple continual learning benchmarks demonstrate that PaCP significantly outperforms existing plasticity-maintenance methods and, remarkably, even surpasses non-pruned models lacking explicit plasticity preservation.
Chenxin Mao, Zhenzhe Zheng 0001, Fan Wu 0006, Guihai Chen
WWW1