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.

Haoran Chen 0012

dblp:49/8410-12 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0004-8399-6030ORCID · conflict

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

Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 77% Information extraction and text analysis · 23%
Network and information security
2 papers
Privacy and data protection · 69% Security and privacy of machine learning · 31%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
1.922026
DIARY: Differentially Private Recovery with Adaptive Privacy Budgets in Federated Unlearning · WWW 2026
Dealing with Noisy Data in Federated Learning: An Incentive Mechanism with Flexible Pricing · WWW 2025
Machine learning › Efficient and distributed learning › federated learning
federated unlearning
1.012026
DIARY: Differentially Private Recovery with Adaptive Privacy Budgets in Federated Unlearning · WWW 2026
Privacy and data protection
differential privacy
1.012026
DIARY: Differentially Private Recovery with Adaptive Privacy Budgets in Federated Unlearning · WWW 2026
Security and privacy of machine learning › machine unlearning
federated unlearning
1.012026
DIARY: Differentially Private Recovery with Adaptive Privacy Budgets in Federated Unlearning · WWW 2026
Privacy and data protection › privacy-preserving machine learning › federated learning privacy
gradient inversion attack
1.012026
DIARY: Differentially Private Recovery with Adaptive Privacy Budgets in Federated Unlearning · WWW 2026
Natural language and speech › Information extraction and text analysis
noisy data handling
0.912025
Dealing with Noisy Data in Federated Learning: An Incentive Mechanism with Flexible Pricing · WWW 2025
Algorithmic game theory and mechanism design
incentive mechanism
0.912025
Dealing with Noisy Data in Federated Learning: An Incentive Mechanism with Flexible Pricing · WWW 2025
Privacy and data protection › privacy-preserving machine learning
federated learning privacy
0.312025
Dealing with Noisy Data in Federated Learning: An Incentive Mechanism with Flexible Pricing · WWW 2025

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

incentive mechanism design · 2.6contract theory · 2.6model rollback · 2.0differential privacy · 2.0anomaly detection · 2.0
YearPublicationVenuePosition
2026 DIARY: Differentially Private Recovery with Adaptive Privacy Budgets in Federated Unlearning
abstract
Federated Unlearning (FU) has emerged as a promising paradigm for effectively removing the influence of specific data of clients from the global model in federated learning. It can further enhance personal data privacy for individual clients and eliminate the impact of malicious attacks like poisoning. Due to these benefits, many FU methods have been analyzed and proposed. Yet, they largely overlook external threats against FU systems, such as gradient inversion attacks that reconstruct client data from shared gradients, posing serious privacy risks to other participating clients. Motivated by this, we propose DIARY, a Differential prIvacy IntegrAted fedeRated recoverY framework to address these dual threats. DIARY presents a privacy budget allocation method, whose insight lies in adaptively assigning appropriate privacy budgets to various training and recovery phases to fully utilize the global privacy budget of each client, balancing the trade-off between privacy and utility. Furthermore, DIARY introduces a novel Federated noise-Immune aNomaly Detection (FIND) module. The deep integration of FIND with two-level selective storage and model rollback mechanisms contributes to model recovery, while significantly reducing the associated overhead. Finally, both rigorous theoretical analysis and extensive simulations compared with state-of-the-art methods are conducted to validate the effectiveness of DIARY.
Hengzhi Wang, Xianliang Zhang, Haoran Chen 0012, Juncheng Hu 0002, Kun Yang 0001
WWW4
2025 Dealing with Noisy Data in Federated Learning: An Incentive Mechanism with Flexible Pricing
abstract
Federated Learning (FL) has emerged as a promising training framework that enables a server to effectively train a global model by coordinating multiple devices, i.e., clients, without sharing their raw data. Keeping data locally can ensure data privacy, but also makes the server difficult to assess data quality, leading to the noisy data issue. Specifically, for any given training task, only a portion of each client's data is relevant and beneficial, while the rest may be redundant or noisy. Training with excessive noisy data can degrade performance. Motivated by this, we investigate the limitations of existing studies and develop an incentive mechanism with flexible pricing tailored for noisy data settings. The insight lies in mitigating the impact of noisy data by selecting appropriate clients and incentivizing them to clean their data spontaneously. Further, both rigorous theoretical analysis and extensive simulations compared with state-of-the-art methods have been well-conducted to validate the effectiveness of the proposed mechanism.
Hengzhi Wang, Haoran Chen 0012, Minghe Ma, Laizhong Cui
WWW2