Lixiang Yuan

dblp:342/7802 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0003-1215-6152ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Efficient and distributed learning · 78% Trustworthy machine learning · 22%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
1.822026
PRFL: Personalized and Robust Federated Learning for Non-IID Data With Malicious Participants · IEEE Trans. Mob. Comput. 2026
BM-FL: A Balanced Weight Strategy for Multi-Stage Federated Learning Against Multi-Client Data Skewing · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Efficient and distributed learning › federated learning
data heterogeneity
1.012026
PRFL: Personalized and Robust Federated Learning for Non-IID Data With Malicious Participants · IEEE Trans. Mob. Comput. 2026
Machine learning › Trustworthy machine learning
malicious experts
1.012026
PRFL: Personalized and Robust Federated Learning for Non-IID Data With Malicious Participants · IEEE Trans. Mob. Comput. 2026
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning
1.012026
PRFL: Personalized and Robust Federated Learning for Non-IID Data With Malicious Participants · IEEE Trans. Mob. Comput. 2026
Machine learning › Efficient and distributed learning › federated learning
robust federated learning
1.012026
PRFL: Personalized and Robust Federated Learning for Non-IID Data With Malicious Participants · IEEE Trans. Mob. Comput. 2026
Machine learning › Efficient and distributed learning › federated learning › data heterogeneity
non-IID federated learning
0.812024
BM-FL: A Balanced Weight Strategy for Multi-Stage Federated Learning Against Multi-Client Data Skewing · IEEE Trans. Knowl. Data Eng. 2024
Privacy and data protection
differential privacy
0.812024
BM-FL: A Balanced Weight Strategy for Multi-Stage Federated Learning Against Multi-Client Data Skewing · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Trustworthy machine learning › robustness
byzantine robustness
0.312026
PRFL: Personalized and Robust Federated Learning for Non-IID Data With Malicious Participants · IEEE Trans. Mob. Comput. 2026
Machine learning › Trustworthy machine learning
robustness
0.312026
PRFL: Personalized and Robust Federated Learning for Non-IID Data With Malicious Participants · IEEE Trans. Mob. Comput. 2026

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

laplace differential privacy · 1.5generative adversarial network · 1.5balanced weight strategy · 1.5model similarity-based division · 1.0knowledge distillation · 1.0dynamic weighted sharing · 1.0
YearPublicationVenuePosition
2026 PRFL: Personalized and Robust Federated Learning for Non-IID Data With Malicious Participants
abstract
Federated learning (FL) enables collaborative training of a global model while preserving participants' local data privacy, making it ideal for data-sensitive fields like Industrial Internet of Things (IIoT), finance, and healthcare. However, Non-IID data among participants and the presence of malicious participants pose significant challenges to the model's performance and convergence. The global model is difficult to achieve consistent performance across all participants. Therefore, this paper proposes personalized and robust federated learning (PRFL) to handle non-independently and identically distributed (Non-IID) data with malicious participants. First, to enhance the robustness and convergence, a model similarity-based division mechanism is employed. It groups participants with similar data and removes both independent and colluding malicious participants. Second, we propose a three-stage knowledge sharing personalized federated learning framework. Each participant undergoes inner-loop knowledge sharing, outer-loop knowledge sharing, and personalized knowledge distillation, incorporating performance-driven dynamic weighted sharing mechanism. Moreover, extensive experiments demonstrate that PRFL outper forms other advanced personalized federated learning methods across various benchmark datasets, particularly in scenarios with Non-IID data and malicious participants.
Lixiang Yuan, Jiapeng Zhang 0001, Mingxing Duan, Guoqing Xiao 0001, Zhuo Tang, Kenli Li 0001
IEEE Trans. Mob. Comput.1
2024 BM-FL: A Balanced Weight Strategy for Multi-Stage Federated Learning Against Multi-Client Data Skewing
abstract
Federated Learning (FL) combined with Differential Privacy (DP) is widespread in healthcare, finance, and IoT due to its advantages in multi-client data distribution. However, existing FL approaches overlook the differential impact levels among clients and data redundancy issues, resulting in high computational overhead and limited real-time applicability. Additionally, non-independent identical distribution (Non-IID) and imbalanced datasets in multi-clients pose challenges in privacy preservation and model overfitting. Therefore, we propose a balanced weight strategy for multi-stage federated learning against multi-client data skewing, called BM-FL, which involves clients, intermediate trust servers (ITSs), and the central server (CS). Firstly, to protect data privacy, an improved Laplace$\epsilon$-differential privacy method is employed. Secondly, a novel generative adversarial network (GAN) called BC-GAN is introduced. It is used to generate realistic fake samples and maintain a balanced proportion of samples across different categories. Then, to make full use of each client's valuable data, we designe a balanced weight strategy. Moreover, extensive experimental results clearly demonstrate the effectiveness of BM-FL in efficiently handling classification tasks involving Non-IID and imbalanced datasets while maintaining privacy and security. Furthermore, our method attains superior classification accuracy with fewer training epochs compared to relevant classical algorithms. The code is available athttps://github.com/ylxzjy/BMFL.git.
Lixiang Yuan, Mingxing Duan, Guoqing Xiao 0001, Zhuo Tang, Kenli Li 0001
IEEE Trans. Knowl. Data Eng.1
2023 A data balancing approach based on generative adversarial network
Lixiang Yuan, Siyang Yu, Zhibang Yang, Mingxing Duan, Kenli Li 0001
Future Gener. Comput. Syst.1