mlsanityData to 14 Oct 2026

Unified Group Fairness on Federated Learning

arXiv 2111.04986 ↗First posted 9 Nov 2021cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

Federated learning (FL) has emerged as an important machine learning paradigm where a global model is trained based on the private data from distributed clients. However, most of existing FL algorithms cannot guarantee the performance fairness towards different groups because of data distribution shift over groups. In this paper, we formulate the problem of unified group fairness on FL, where the groups can be formed by clients (including existing clients and newly added clients) and sensitive attribute(s). To solve this problem, we first propose a general fair federated framework. Then we construct a unified group fairness risk from the view of federated uncertainty set with theoretical analyses to guarantee unified group fairness on FL. We also develop an efficient federated optimization algorithm named Federated Mirror Descent Ascent with Momentum Acceleration (FMDA-M) with convergence guarantee. We validate the advantages of the FMDA-M algorithm with various kinds of distribution shift settings in experiments, and the results show that FMDA-M algorithm outperforms the existing fair FL algorithms on unified group fairness.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 39 of its 59 references that are in the map. First posted on arXiv 9 Nov 2021.

Builds on

39 of 59 references.

References · 39

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  3. 2019Advances and Open Problems in Federated Learningcited by 3,046
  4. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  5. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
  6. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
  7. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
  8. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
  9. 2018Federated Learning with Non-IID Datacited by 1,108
  10. 2016Fair prediction with disparate impact: A study of bias in recidivism prediction instrumentscited by 672
  11. 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 672
  12. 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 564
27 more
  1. 2019Agnostic Federated Learningcited by 456
  2. 2019Fair Resource Allocation in Federated Learningcited by 394
  3. 2020Adaptive Personalized Federated Learningcited by 358
  4. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
  5. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
  6. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
  7. 2018A Hybrid Approach to Privacy-Preserving Federated Learningcited by 210
  8. 2020Federated Learning of a Mixture of Global and Local Modelscited by 210
  9. 2016Variance-based regularization with convex objectivescited by 155
  10. 2019Distributionally Robust Language Modelingcited by 143
  11. 2016Distributed Mean Estimation with Limited Communicationcited by 136
  12. 2019On the Apparent Conflict Between Individual and Group Fairnesscited by 126
  13. 2018Equity of Attention: Amortizing Individual Fairness in Rankingscited by 124
  14. 2018Deep Cocktail Network: Multi-source Unsupervised Domain Adaptation with Category Shiftcited by 109
  15. 2021Distributionally Robust Federated Averagingcited by 104
  16. 2018Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goalscited by 103
  17. 2020Fairness-aware Agnostic Federated Learningcited by 87
  18. 2019Multi-source Distilling Domain Adaptationcited by 73
  19. 2021Federated Learning with Fair Averagingcited by 61
  20. 2020Federated Learning with Only Positive Labelscited by 55
  21. 2020Two Simple Ways to Learn Individual Fairness Metrics from Datacited by 54
  22. 2019Average Individual Fairness: Algorithms, Generalization and Experimentscited by 46
  23. 2017Convergence Analysis of Proximal Gradient with Momentum for Nonconvex Optimizationcited by 18
  24. 2020Stable Adversarial Learning under Distributional Shiftscited by 16
  25. 2020Beyond Individual and Group Fairnesscited by 13
  26. 2021Communication-Efficient Agnostic Federated Averagingcited by 10
  27. 2016Local Convergence of the Heavy-ball Method and iPiano for Non-convex Optimizationcited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 6; 2023: 2; 2024: 4; 2025: 1; 2026: 1.

15 papers.

Sort:

By area: