mlsanityData to 14 Oct 2026

Federating for Learning Group Fair Models

arXiv 2110.01999 ↗First posted 5 Oct 2021cs.LG cs.CYcited by 9

Not on the map. Why?

Abstract (arXiv)

Federated learning is an increasingly popular paradigm that enables a large number of entities to collaboratively learn better models. In this work, we study minmax group fairness in paradigms where different participating entities may only have access to a subset of the population groups during the training phase. We formally analyze how this fairness objective differs from existing federated learning fairness criteria that impose similar performance across participants instead of demographic groups. We provide an optimization algorithm -- FedMinMax -- for solving the proposed problem that provably enjoys the performance guarantees of centralized learning algorithms. We experimentally compare the proposed approach against other methods in terms of group fairness in various federated learning setups.

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

Builds on

14 of 24 references.

References · 14

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2019Advances and Open Problems in Federated Learningcited by 3,046
  4. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  5. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
  6. 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 564
  7. 2019Agnostic Federated Learningcited by 456
  8. 2019Fair Resource Allocation in Federated Learningcited by 394
  9. 2015The Variational Fair Autoencodercited by 223
  10. 2020Minimax Pareto Fairness: A Multi Objective Perspectivecited by 153
  11. 2020Tilted Empirical Risk Minimizationcited by 106
  12. 2021Distributionally Robust Federated Averagingcited by 104
2 more
  1. 2017Robust Optimization for Non-Convex Objectivescited by 35
  2. 2020Minimax Group Fairness: Algorithms and Experimentscited by 17

Built on by

Cited by year

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

9 papers.