analiza aiqbench
Composing insight from the full article — this may take a moment.
TRIP-Shapley: Propagation-Aware Contribution Attribution Framework for Peer-to-Peer Federated Learning
arXiv:2505.23246v3 Announce Type: replace Abstract: Contribution attribution is a fundamental problem in federated learning (FL), yet it remains challenging in peer-to-peer FL (P2PFL), where participant influence propagates through repeated model exchanges. Recent work, DICE, addresses this issue by directly tracking multi-round propagation paths. However, its practical deployment is hindered by two challenges: (i) communication explosion caused by multi-hop propagation path tracking, and (ii) vulnerability to misreporting attacks. To overcome these challenges, we consider contribution attribution in P2PFL with a model-free coordinator used solely for auditing. Based on this setting, we propose TRIP-Shapley, a propagation-aware Shapley-inspired surrogate for contribution attribution. Instead of explicitly tracking multi-round paths, TRIP-Shapley computes round-wise contribution scores independently and propagates only scalar contribution values. This enables attribution of influence accumulated throughout the entire training process while maintaining practical communication costs. In addition, we introduce lightweight mechanisms to detect and mitigate misreporting attacks. Rather than theoretically approximating Shapley values, TRIP-Shapley is empirically evaluated against Shapley values as a reference. Experiments demonstrate communication savings of up to $45.8\times$ relative to the compared DICE configurations, with favorable cost--reference-alignment trade-offs overall, although alignment is weaker in some FMNIST and 25-client settings. The proposed defenses reduce contribution inflation under the two evaluated attacks.
Abstract:Contribution attribution is a fundamental problem in federated learning (FL), yet it remains challenging in peer-to-peer FL (P2PFL), where participant influence propagates through repeated model exchanges. Recent work, DICE, addresses this issue by directly tracking multi-round propagation paths. However, its practical deployment is hindered by two challenges: (i) communication explosion caused by multi-hop propagation path tracking, and (ii) vulnerability to misreporting attacks. To overcome these challenges, we consider contribution attribution in P2PFL with a model-free coordinator used solely for auditing. Based on this setting, we propose TRIP-Shapley, a propagation-aware Shapley-inspired surrogate for contribution attribution. Instead of explicitly tracking multi-round paths, TRIP-Shapley computes round-wise contribution scores independently and propagates only scalar contribution values. This enables attribution of influence accumulated throughout the entire training process while maintaining practical communication costs. In addition, we introduce lightweight mechanisms to detect and mitigate misreporting attacks. Rather than theoretically approximating Shapley values, TRIP-Shapley is empirically evaluated against Shapley values as a reference. Experiments demonstrate communication savings of up to $45.8\times$ relative to the compared DICE configurations, with favorable cost--reference-alignment trade-offs overall, although alignment is weaker in some FMNIST and 25-client settings. The proposed defenses reduce contribution inflation under the two evaluated attacks.
Machine Learning (cs.LG)
arXiv:2505.23246 [cs.LG]
(or arXiv:2505.23246v3 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2505.23246 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 288 cuvinte
Subiecte conexe

AI Agent Protocol Standard Vote Arrives Thursday at IETF 126 in Vienna
techtimes.com · 22 iul. 2026

Validate GPU Cluster Readiness Before AI Workloads Land
NVIDIA · 23 sept. 2026
RHEA: Reliability-Harmonized Reconstruction and Assignment for Robust Multimodal-Attributed Graph Clustering
arXiv · 4 aug. 2026
IMPACT-VLA: Interaction-aware Multimodal Propagation Attribution via Counterfactual Trajectories for Vision-Language-Action Policies
arXiv · 16 sept. 2026