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

Jianan Chen 0009

dblp:302/1294 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0001-9331-3513ORCID · verified

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

Computer networks · 2 · 1 first-author · 2 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 · 100%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
0.912025
Utility-Enhanced Personalized Privacy Preservation in Hierarchical Federated Learning · IEEE Trans. Mob. Comput. 2025
Machine learning › Efficient and distributed learning › federated learning
hierarchical federated learning
0.912025
Utility-Enhanced Personalized Privacy Preservation in Hierarchical Federated Learning · IEEE Trans. Mob. Comput. 2025
Privacy and data protection
differential privacy
0.912025
Utility-Enhanced Personalized Privacy Preservation in Hierarchical Federated Learning · IEEE Trans. Mob. Comput. 2025
Privacy and data protection › privacy-preserving machine learning › federated learning privacy
client-level privacy
0.312025
Utility-Enhanced Personalized Privacy Preservation in Hierarchical Federated Learning · IEEE Trans. Mob. Comput. 2025
Privacy and data protection
privacy-preserving machine learning
0.312025
Utility-Enhanced Personalized Privacy Preservation in Hierarchical Federated Learning · IEEE Trans. Mob. Comput. 2025

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

shuffling · 1.7sampling-randomizing-shuffling mechanism · 1.7randomized response · 1.7
YearPublicationVenuePosition
2025 Utility-Enhanced Personalized Privacy Preservation in Hierarchical Federated Learning
abstract
Federated learning (FL) is a distributed learning framework that allows clients to jointly train a model by uploading parameter updates rather than sharing local data. FL deployed on a client-edge-cloud hierarchical architecture, named Hierarchical Federated Learning (HFL), can accelerate model training and accommodate more clients with reduced communication cost via edge aggregation. Unfortunately, HFL suffers from privacy risks since the submitted parameters from clients are vulnerable to privacy attacks. To address this issue, we propose a novel Differential Privacy (DP) definition tailored for HFL, i.e., Group Local Differential Privacy (GLDP). We design the Sampling-Randomizing-Shuffling (SRS) mechanism to implement GLDP in HFL, where the sampling process is employed to achieve a stronger level of privacy protection with less noise added. By combining the randomized response and the shuffling mechanism, our proposed SRS mechanism can achieve client-level personalization within$\rho _{k}$-GLDP for privacy preservation while balancing model performance and privacy protection in HFL. Privacy analysis and convergence analysis are conducted to provide theoretical performance guarantees. Experimental results based on real-world datasets verify the effectiveness of SRS.
Jianan Chen 0009, Honglu Jiang, Qin Hu 0001
IEEE Trans. Mob. Comput.1
2022 Social Welfare Maximization in Cross-Silo Federated Learning
abstract
As one of the typical settings of Federated Learning (FL), cross-silo FL allows organizations to jointly train an optimal Machine Learning (ML) model. In this case, some organizations may try to obtain the global model without contributing their local training, lowering the social welfare. In this paper, we model the interactions among organizations in cross-silo FL as a public goods game for the first time and theoretically prove that there exists a social dilemma where the maximum social welfare is not achieved in Nash equilibrium. To over-come this social dilemma, we employ the Multi-player Multi-action Zero-Determinant (MMZD) strategy to maximize the social welfare. With the help of the MMZD, an individual organization can unilaterally control the social welfare without extra cost. Experimental results validate that the MMZD strategy is effective in maximizing the social welfare.
Jianan Chen 0009, Qin Hu 0001, Honglu Jiang
ICASSP1
2022 Strategic signaling for utility control in audit games
Jianan Chen 0009, Qin Hu 0001, Honglu Jiang
Comput. Secur.1
2021 Energy-Efficient Device Selection in Federated Edge Learning
abstract
Due to the increasing demand from mobile devices for the real-time response of cloud computing services, federated edge learning (FEL) emerges as a new computing paradigm, which utilizes edge devices to achieve efficient machine learning while protecting their data privacy. Implementing efficient FEL suffers from the challenges of devices’ limited computing and communication resources, as well as unevenly distributed datasets, which inspires several existing research focusing on device selection to optimize time consumption and data diversity. However, these studies fail to consider the energy consumption of edge devices given their limited power supply, which can seriously affect the cost-efficiency of FEL with unexpected device dropouts. To fill this gap, we propose a device selection model capturing both energy consumption and data diversity optimization, under the constraints of time consumption and training data amount. Then we solve the optimization problem by reformulating the original model and designing a novel algorithm, named E2DS, to reduce the time complexity greatly. By comparing with two classical FEL schemes, we validate the superiority of our proposed device selection mechanism for FEL with extensive experimental results.
Qin Hu 0001, Jianan Chen 0009, Kyubyung Kang, Feng Li 0001, Xukai Zou
ICCCN3