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.

Yupeng Xiong

dblp:184/4880 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Computer networks · 1 · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed machine learning
federated learning
0.912025
LCEFL: A Lightweight Contribution Evaluation Approach for Federated Learning · IEEE Trans. Mob. Comput. 2025
Distributed systems › peer-to-peer systems
incentive mechanisms
0.312025
LCEFL: A Lightweight Contribution Evaluation Approach for Federated Learning · IEEE Trans. Mob. Comput. 2025

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

shapley value · 0.9model projection theory · 0.9model compression · 0.9
YearPublicationVenuePosition
2025 LCEFL: A Lightweight Contribution Evaluation Approach for Federated Learning
abstract
The prerequisite for implementing incentive mechanisms and reliable participant selection schemes in federated learning is to obtain the contribution of each participant. Available evaluation methods for participant contributions require the server to possess a test dataset, often impractical. Additionally, the excessively high complexity of these works is unacceptable when training complex models in large-scale federated learning system. To address these issues, we propose a lightweight contribution evaluation method for federated learning participants, named LCEFL, based on model projection theory, which does not require the server to provide a test dataset. In addition, a model compression method is designed to be used in LCEFL to reduce the computational complexity. Furthermore, a trusted aggregation method based on LCEFL is proposed, where the weight of each participant's local model is determined by its trust level, which can be calculated using its contribution evaluation result. Experimental results show that LCEFL can achieve nearly the same accuracy as schemes based on Shapley Value, while significantly reducing computational overhead by more than 50%. Compared to available aggregation methods, the proposed trusted aggregation scheme is able to accelerate the convergence speed of the global model and improve its accuracy by 2% to 45%.
Jiaxing Li 0004, Zhiquan Liu 0001, Yupeng Xiong, Yong Ma 0005, Athanasios V. Vasilakos, Xinghua Li 0001, Jianfeng Ma 0001
IEEE Trans. Mob. Comput.4