Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks
Nurbek Tastan, Samuel Horváth, Karthik Nandakumar
Abstract
Collaborative learning enables multiple participants to learn a single global model by exchanging focused updates instead of sharing data. One of the core challenges in collaborative learning is ensuring that participants are rewarded fairly for their contributions, which entails two key subproblems: contribution assessment and reward allocation. This work focuses on fair reward allocation, where the participants are incentivized through model rewards -differentiated final models whose performance is commensurate with the contribution. In this work, we leverage the concept of slimmable neural networks to collaboratively learn a shared global model whose performance degrades gracefully with a reduction in model width. We also propose a post-training fair allocation algorithm that determines the model width for each participant based on their contributions. We theoretically study the convergence of our proposed approach and empirically validate it using extensive experiments on different datasets and architectures. We also extend our approach to enable training-time model reward allocation. The code can be found at https://github.com/tnurbek/aequa .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 045ddd5d-f8d5-46d0-9d76-b50dc7f64451Cited by top-tier papers1
Ask how each one uses itBuilds on15
- Ditto: Fair and Robust Federated Learning Through PersonalizationTian Li, Shengyuan Hu, Ahmad Beirami, Virginia SmithICML 2021 · 1,313 citations
- Universally Slimmable Networks and Improved Training TechniquesJiahui Yu, Thomas S. HuangICCV 2019 · 444 citations
- FjORD: Fair and Accurate Federated Learning under heterogeneous targets with Ordered DropoutSamuel Horváth, Stefanos Laskaridis, Mário Almeida, Ilias Leontiadis et al.NeurIPS 2021 · 390 citations
- Matryoshka Representation LearningAditya Kusupati, Gantavya Bhatt, Aniket Rege, Matthew Wallingford et al.NeurIPS 2022 · 364 citations
- Is Local SGD Better than Minibatch SGD?Blake E. Woodworth, Kumar Kshitij Patel, Sebastian U. Stich, Zhen Dai et al.ICML 2020 · 277 citations
Related papers
- FedRAC: Rolling Submodel Allocation for Collaborative Fairness in Federated LearningZihui Wang, Yuhang Fu, Mengmeng Du, Zhimin Yuan et al.CVPR 2026
- FedSAC: Dynamic Submodel Allocation for Collaborative Fairness in Federated LearningZihui Wang, Zheng Wang, Lingjuan Lyu, Zhaopeng Peng et al.KDD 2024 · 6 citations
- Trade-off between Payoff and Model Rewards in Shapley-Fair Collaborative Machine LearningQuoc Phong Nguyen, Bryan Kian Hsiang Low, Patrick JailletNeurIPS 2022 · 15 citations
- Incentive-Aware Federated Learning with Training-Time Model RewardsZhaoxuan Wu, Mohammad Mohammadi Amiri, Ramesh Raskar, Bryan Kian Hsiang LowICLR 2024 · 9 citations
- Neural Payoff Machines: Predicting Fair and Stable Payoff Allocations Among Team MembersDaphne Cornelisse, Thomas Rood, Yoram Bachrach, Mateusz Malinowski et al.NeurIPS 2022 · 10 citations
