How to Evaluate Participant Contributions in Decentralized Federated Learning
Not on the map. Why?
Abstract (arXiv)
Federated learning (FL) enables multiple clients to collaboratively train machine learning models without sharing local data. In particular, decentralized FL (DFL), where clients exchange models without a central server, has gained attention for mitigating communication bottlenecks. Evaluating participant contributions is crucial in DFL to incentivize active participation and enhance transparency. However, existing contribution evaluation methods for FL assume centralized settings and cannot be applied directly to DFL due to two challenges: the inaccessibility of each client to non-neighboring clients' models, and the necessity to trace how contributions propagate in conjunction with peer-to-peer model exchanges over time. To address these challenges, we propose TRIP-Shapley, a novel contribution evaluation method for DFL. TRIP-Shapley formulates the clients' overall contributions by tracing the propagation of the round-wise local contributions. In this way, TRIP-Shapley accurately reflects the delayed and gradual influence propagation, as well as allowing a lightweight coordinator node to estimate the overall contributions without collecting models, but based solely on locally observable contributions reported by each client. Experiments demonstrate that TRIP-Shapley is sufficiently close to the ground-truth Shapley value, is scalable to large-scale scenarios, and remains robust in the presence of dishonest clients.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 41 references that are in the map. First posted on arXiv 29 May 2025.
Builds on
17 of 41 references.
References · 17
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 629
- 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 419
- 2017Network Topology and Communication-Computation Tradeoffs in Decentralized Optimizationcited by 122
- 2019BrainTorrent: A Peer-to-Peer Environment for Decentralized Federated Learningcited by 117
- 2020UVeQFed: Universal Vector Quantization for Federated Learningcited by 107
- 2019Measure Contribution of Participants in Federated Learningcited by 79
- 2021GTG-Shapley: Efficient and Accurate Participant Contribution Evaluation in Federated Learningcited by 74
- 2017Personalized and Private Peer-to-Peer Machine Learningcited by 54
- 2023Fair Federated Medical Image Segmentation via Client Contribution Estimationcited by 52
- 2020Toward Understanding the Influence of Individual Clients in Federated Learningcited by 16
5 more
- 2023Connectivity-Aware Semi-Decentralized Federated Learning over Time-Varying D2D Networkscited by 13
- 2022Adaptive Configuration for Heterogeneous Participants in Decentralized Federated Learningcited by 11
- 2021Data-Free Evaluation of User Contributions in Federated Learningcited by 10
- 2024Contribution Evaluation of Heterogeneous Participants in Federated Learning via Prototypical Representationscited by 3
- 2024Byzantine Reliable Broadcast with Low Communication and Time Complexitycited by 1
Built on by
Not cited yet.