aiqbench analysis
This research addresses a critical stability issue in federated learning by proving that standard capping mechanisms for client contributions can collapse model convergence under data heterogeneity. The authors propose a novel co-design of mechanism and architecture that ensures short-term participation guarantees without sacrificing overall performance, offering a robust theoretical framework for sustainable decentralized training.
Pathwise Individual Rationality in Federated Learning: A Mechanism-Architecture Co-Design
arXiv:2609.14591v1 Announce Type: new Abstract: Participation in federated learning (FL) comes at a cost. Clients trade off privacy, communication, and compute costs for potentially greater gains in model efficacy. This paper explores this tradeoff under the aegis of individual rationality (IR) versus autarky, the basic game-theoretic requirement that the federation provide utility no worse than local training. Using the above as the design target, we examine pathwise performance of FL, as a per-round bound on cumulative surplus, not just as an asymptotic equilibrium guarantee under different models of client data distribution heterogeneity. Along this path, clients can remain below their local-training baseline for hundreds of rounds. The natural remedy is to cap each client's per-round contribution so that this shortfall stays bounded, and we prove that it backfires, collapsing learning even at low-to-modest heterogeneity. We then propose a novel design that combines short-term participation guarantees with personalized model evaluation, while maintaining fair incentives. We provide a theoretical basis for this new approach and empirically demonstrate that clients can avoid short-term losses without harming overall performance, even under moderate data distribution heterogeneity; under severe heterogeneity, the design shows promising outcomes for clients compared to their local baseline at some cost in accuracy.
Abstract:Participation in federated learning (FL) comes at a cost. Clients trade off privacy, communication, and compute costs for potentially greater gains in model efficacy. This paper explores this tradeoff under the aegis of individual rationality (IR) versus autarky, the basic game-theoretic requirement that the federation provide utility no worse than local training. Using the above as the design target, we examine pathwise performance of FL, as a per-round bound on cumulative surplus, not just as an asymptotic equilibrium guarantee under different models of client data distribution heterogeneity. Along this path, clients can remain below their local-training baseline for hundreds of rounds. The natural remedy is to cap each client's per-round contribution so that this shortfall stays bounded, and we prove that it backfires, collapsing learning even at low-to-modest heterogeneity. We then propose a novel design that combines short-term participation guarantees with personalized model evaluation, while maintaining fair incentives. We provide a theoretical basis for this new approach and empirically demonstrate that clients can avoid short-term losses without harming overall performance, even under moderate data distribution heterogeneity; under severe heterogeneity, the design shows promising outcomes for clients compared to their local baseline at some cost in accuracy.
Machine Learning (cs.LG); Computer Science and Game Theory (cs.GT)
arXiv:2609.14591 [cs.LG]
(or arXiv:2609.14591v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.14591 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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.
Full text under the publisher's open licence · 296 words
Related coverage
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · Sep 18, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026
Causal Unlearning in Collaborative Optimization: Exact and Approximate Influence Reversal under Adversarial Contributions
arXiv · Jun 9, 2026

Tariffs didn’t bring manufacturing jobs back to the US
The Verge · Jul 27, 2026