Demo Data from VLDB 2026 / reviewers in the wild / expert
Alysa Ziying Tan
dblp:286/8370
· DBLP profile ↗
7ranked-venue papers
2as first author
7since 2021 · last 2026
0000-0003-0084-3473ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Computer networks · 2 · 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
2 papers |
Efficient and distributed learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computing education · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
federated learning |
1.9 | 2 | 2026 | Federated Learning Playground · AAAI 2026 pFedMxF: Personalized Federated Class-Incremental Learning with Mixture of Frequency Aggregation · CVPR 2025 |
Computing education › AI education
machine learning education |
1.0 | 1 | 2026 | Federated Learning Playground · AAAI 2026 |
Machine learning › Efficient and distributed learning › federated learning › federated continual learning
federated class-incremental learning |
0.9 | 1 | 2025 | pFedMxF: Personalized Federated Class-Incremental Learning with Mixture of Frequency Aggregation · CVPR 2025 |
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning |
0.9 | 1 | 2025 | pFedMxF: Personalized Federated Class-Incremental Learning with Mixture of Frequency Aggregation · CVPR 2025 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.3 | 1 | 2025 | pFedMxF: Personalized Federated Class-Incremental Learning with Mixture of Frequency Aggregation · CVPR 2025 |
Methods — techniques the papers use, named apart from their topics
interactive visualization · 2.0mixture of frequency aggregation · 0.9frequency-domain decomposition · 0.9auto-task agnostic classifier · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Federated Learning PlaygroundabstractWe present Federated Learning Playground, an interactive browser-based platform inspired by and extends TensorFlow Playground that teaches core Federated Learning (FL) concepts. Users can experiment with heterogeneous client data distributions, model hyperparameters, and aggregation algorithms directly in the browser without coding or system setup, and observe their effects on client and global models through real-time visualizations, gaining intuition for challenges such as non-IID data, local overfitting, and scalability. The playground serves as an easy to use educational tool, lowering the entry barrier for newcomers to distributed AI while also offering a sandbox for rapidly prototyping and comparing FL methods. By democratizing exploration of FL, it promotes broader understanding and adoption of this important paradigm. Bryan Shan Guanrong, Alysa Ziying Tan, Han Yu 0001 |
AAAI | 2 |
| 2025 | pFedMxF: Personalized Federated Class-Incremental Learning with Mixture of Frequency AggregationabstractFederated learning (FL) has emerged as a promising paradigm for privacy-preserving collaborative machine learning. However, extending FL to class incremental learning settings introduces three key challenges: 1) spatial heterogeneity due to non-IID data distributions across clients, 2) temporal heterogeneity due to sequential arrival of tasks, and 3) resource heterogeneity due to diverse client capabilities. Existing approaches generally address these challenges in isolation, potentially leading to interference between updates, catastrophic forgetting or excessive communication overhead. In this paper, we propose personalized Federated class-incremental parameter efficient fine-tuning with Mixture of Frequency aggregation (pFedMxF), a novel framework that simultaneously addresses all three heterogeneity challenges through frequency domain decomposition. Our key insight is that assigning orthogonal frequency components to different clients and tasks enables interference-free learning to be achieved with minimal communication costs. We further design an Auto-task Agnostic Classifier that automatically routes samples to task-specific classifiers while adapting to heterogeneous class distributions. We conduct extensive experiments on three benchmark datasets, comparing our approach with eight state-of-the-art methods. The results demonstrate that pFedMxF achieves comparable test accuracy, while requiring less model parameters and incurring significantly lower communication costs than baseline methods. Hao Zhu 0010, Alysa Ziying Tan, Dianzhi Yu, Longtao Huang, Han Yu 0001 |
CVPR | 3 |
| 2025 | Representative-exploring Replay for Online Class-Incremental Continual LearningabstractOnline Class-Incremental Continual Learning (CICL) methods often rely on data replay, where a fixed-size memory buffer stores a small subset of previous data to mitigate catastrophic forgetting. However, as incremental tasks progress, the fixed buffer size reduces the number of exemplars stored per class, weakening their representativeness. We argue that preserving classification centers is more effective than maintaining decision boundaries with limited exemplars. This highlights the dual challenges of selecting high-quality exemplars for storage and addressing the imbalance between old and new classes. To tackle these issues, we propose the Representative Exploration Replay (RER) framework. Our approach evaluates exemplar representativeness using a novel metric based on the model’s classification performance, ensuring that more representative exemplars are prioritized for storage. Additionally, it mitigates class imbalance through mutual information gradient masking and knowledge distillation. Comprehensive experiments on three datasets demonstrate that RER achieves an average performance improvement of 9% over 13 state-of-the-art methods. Libang Zhao, Alysa Ziying Tan, Siwei Feng, Han Yu 0001, Tao Deng 0003, Yuanlu Chen, Mengyuan Song |
IJCNN | 2 |
| 2025 | Federated Class-Incremental Learning via Weighted Aggregation and DistillationabstractFederated Class-Incremental Learning (FCIL) aims to design privacy-preserving collaborative training methods to continuously learn new classes from distributed datasets. In these scenarios, federated clients face the challenge of encountering new classes while being constrained by limited memory capacity, which can lead to catastrophic forgetting in the resulting global model. Existing FCIL approaches tend to overlook the challenges posed by the heterogeneity of dataset label distribution among clients, thereby constraining the generalization capacity of the global model they learn. Some of these methods also suffer from excessive computational burdens when addressing catastrophic forgetting problems. Furthermore, certain approaches are constrained to handling only straightforward data, posing significant difficulties in managing complex datasets and tackling more intricate scenarios. In this article, we propose the Weighted Aggregation and Distillation-based FCIL (WAD-FCIL) method to address these limitations. To address data heterogeneity arising from class imbalance, we first introduce a task-aware client clustering method to identify clients with extreme class deviations before global model aggregation to eliminate potential impact on the global model. Then, we propose a multisampling weighted aggregation approach during the global FL model update that integrates knowledge from different clients and dynamically adjusts the weight of each client model to facilitate model update. To mitigate catastrophic forgetting, we propose a multimodel distillation strategy that involves selecting multiple teacher models for knowledge distillation. Extensive experiments comparingWAD-FCILwith ten state-of-the-art methods demonstrate that it significantly outperforms the baselines by 0.8%–3.2% in terms of average test accuracy on three representative benchmark datasets. The code of this work is available athttps://github.com/wufeng10010/WAD-FCIL. Alysa Ziying Tan, Siwei Feng, Han Yu 0001, Tao Deng 0003, Libang Zhao, Yuanlu Chen |
IEEE Internet Things J. | 2 |
| 2024 | FL-Clip: Bridging Plasticity and Stability in Pre-Trained Federated Class-Incremental Learning ModelsabstractFederated learning (FL) is the prevailing paradigm in privacy-preserving machine learning. Despite recent advances yielding state-of-the-art outcomes, FL systems face challenges in adapting to dynamic real-world scenarios, where the local data distributions of clients may shift over time. This limitation stems from the common assumption of data stationarity in existing FL methods. In this paper, we propose the Federated Learning framework for CLass Incremental Pretrained models (FL-CLIP) to bridge this gap, by enabling continuous adaptation to changes in underlying FL client data distributions. The focus is on the incremental adaptation of existing FL models, trained on a substantial number of base classes, to newly arriving classes. To address the issue of catastrophic forgetting, the concepts of plasticity and stability are integrated into two distinct stages of FL-CLIP. Additionally, a task-weighted auxiliary loss is designed to tackle the class imbalance problem, and we propose a lightweight distillation method to enable FL-CLIP to adapt to resource-constrained environments. Extensive experiments demonstrate that FL-CLIP significantly outperforms 7 state-of-theart baselines in terms of average task accuracy, achieving a balanced performance across base and novel classes with a smaller memory footprint. Alysa Ziying Tan, Siwei Feng, Han Yu 0001 |
ICME | 1 |
| 2024 | General Federated Class-Incremental Learning With Lightweight Generative ReplayabstractFederated class-incremental learning (FCIL) aims to allow federated learning (FL) systems to consistently learn new tasks with classes that change dynamically, without forgetting knowledge from previous classes. In FCIL scenarios, both heterogeneity in both label and data distribution across clients and catastrophic forgetting caused by continual emergence of new classes can significantly affect the performance of a FL system. Existing FCIL methods assume only changes in class distribution over time for each single client while ignoring class-specific domain distribution. Furthermore, these methods often rely on storing old class exemplars to mitigate catastrophic forgetting, potentially raising privacy concerns and computational burdens. In this article, we propose a FCIL framework called generative federated class-incremental learning (GenFCIL) that effectively addresses the aforementioned challenges. First, we introduce a lightweight generator that promotes knowledge sharing among clients and preserves the accumulated knowledge from all clients. By collecting classes and their associated data from each client, the generator effectively tackles data heterogeneity, facilitating information transfer across clients, and mitigating catastrophic forgetting in a replay-free manner. Importantly, the lightweight nature of the generator ensures that it does not impose excessive memory and computation requirements. Second, to tackle challenges from shifts in both class distribution and class-specific domain distribution in general FCIL scenarios, which may exacerbate catastrophic forgetting, we incorporate and update multiple logit scores from clients focusing on their old and new overlapping classes to incorporate more intraclass information. Experimental results show that GenFCIL effectively alleviates the impact of catastrophic forgetting and heterogeneity. Yuanlu Chen, Alysa Ziying Tan, Siwei Feng, Han Yu 0001, Tao Deng 0003, Libang Zhao |
IEEE Internet Things J. | 2 |
| 2023 | Towards Personalized Federated LearningabstractIn parallel with the rapid adoption of artificial intelligence (AI) empowered by advances in AI research, there has been growing awareness and concerns of data privacy. Recent significant developments in the data regulation landscape have prompted a seismic shift in interest toward privacy-preserving AI. This has contributed to the popularity of Federated Learning (FL), the leading paradigm for the training of machine learning models on data silos in a privacy-preserving manner. In this survey, we explore the domain of personalized FL (PFL) to address the fundamental challenges of FL on heterogeneous data, a universal characteristic inherent in all real-world datasets. We analyze the key motivations for PFL and present a unique taxonomy of PFL techniques categorized according to the key challenges and personalization strategies in PFL. We highlight their key ideas, challenges, opportunities, and envision promising future trajectories of research toward a new PFL architectural design, realistic PFL benchmarking, and trustworthy PFL approaches. Alysa Ziying Tan, Han Yu 0001, Li-Zhen Cui 0001, Qiang Yang 0001 |
IEEE Trans. Neural Networks Learn. Syst. | 1 |