Maximizing Global Model Appeal in Federated Learning
Not on the map. Why?
Abstract (arXiv)
Federated learning typically considers collaboratively training a global model using local data at edge clients. Clients may have their own individual requirements, such as having a minimal training loss threshold, which they expect to be met by the global model. However, due to client heterogeneity, the global model may not meet each client's requirements, and only a small subset may find the global model appealing. In this work, we explore the problem of the global model lacking appeal to the clients due to not being able to satisfy local requirements. We propose MaxFL, which aims to maximize the number of clients that find the global model appealing. We show that having a high global model appeal is important to maintain an adequate pool of clients for training, and can directly improve the test accuracy on both seen and unseen clients. We provide convergence guarantees for MaxFL and show that MaxFL achieves a 22-40% and 18-50% test accuracy improvement for the training clients and unseen clients respectively, compared to a wide range of FL modeling approaches, including those that tackle data heterogeneity, aim to incentivize clients, and learn personalized or fair models.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 25 of its 42 references that are in the map. First posted on arXiv 30 May 2022.
Builds on
25 of 42 references.
References · 25
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2019On the Convergence of FedAvg on Non-IID Datacited by 1,220
- 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 897
- 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 836
- 2017Federated Multi-Task Learningcited by 669
- 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 665
- 2020Personalized Federated Learning with Moreau Envelopescited by 612
- 2018Local SGD Converges Fast and Communicates Littlecited by 595
- 2019Agnostic Federated Learningcited by 451
13 more
- 2019Fair Resource Allocation in Federated Learningcited by 389
- 2021A Field Guide to Federated Optimizationcited by 312
- 2019Improving Federated Learning Personalization via Model Agnostic Meta Learningcited by 264
- 2017EMNIST: an extension of MNIST to handwritten letterscited by 212
- 2019SCAFFOLD: Stochastic Controlled Averaging for Federated Learningcited by 174
- 2020Salvaging Federated Learning by Local Adaptationcited by 142
- 2021Fast Federated Learning in the Presence of Arbitrary Device Unavailabilitycited by 72
- 2020Model-sharing Games: Analyzing Federated Learning Under Voluntary Participationcited by 60
- 2019Incentive Design for Efficient Federated Learning in Mobile Networks: A Contract Theory Approachcited by 45
- 2021Optimality and Stability in Federated Learning: A Game-theoretic Approachcited by 40
- 2021One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learningcited by 39
- 2021Faithful Edge Federated Learning: Scalability and Privacycited by 13
- 2018A geometric integration approach to nonsmooth, nonconvex optimisationcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.