Cumulative Utility Parity for Fair Federated Learning under Intermittent Client Participation

• URL: http://arxiv.org/abs/2602.13651v1
• Date: Sat, 14 Feb 2026 07:42:37 GMT
• Title: Cumulative Utility Parity for Fair Federated Learning under Intermittent Client Participation
• Authors: Stefan Behfar, Richard Mortier,
• Abstract summary: In real-world federated learning systems, client participation is intermittent, heterogeneous, and often correlated with data characteristics or resource constraints.<n>We propose cumulative utility parity, a fairness principle that evaluates whether clients receive comparable long-term benefit per participation opportunity, rather than per training round.
• Score: 0.04910937238451484
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In real-world federated learning (FL) systems, client participation is intermittent, heterogeneous, and often correlated with data characteristics or resource constraints. Existing fairness approaches in FL primarily focus on equalizing loss or accuracy conditional on participation, implicitly assuming that clients have comparable opportunities to contribute over time. However, when participation itself is uneven, these objectives can lead to systematic under-representation of intermittently available clients, even if per-round performance appears fair. We propose cumulative utility parity, a fairness principle that evaluates whether clients receive comparable long-term benefit per participation opportunity, rather than per training round. To operationalize this notion, we introduce availability-normalized cumulative utility, which disentangles unavoidable physical constraints from avoidable algorithmic bias arising from scheduling and aggregation. Experiments on temporally skewed, non-IID federated benchmarks demonstrate that our approach substantially improves long-term representation parity, while maintaining near-perfect performance.

Related papers

• Stragglers Can Contribute More: Uncertainty-Aware Distillation for Asynchronous Federated Learning [61.249748418757946]
  Asynchronous federated learning (FL) has recently gained attention for its enhanced efficiency and scalability.<n>We propose FedEcho, a novel framework that incorporates uncertainty-aware distillation to enhance the asynchronous FL performances.<n>We demonstrate that FedEcho consistently outperforms existing asynchronous federated learning baselines.
  arXiv  Detail & Related papers  (2025-11-25T06:25:25Z)
• Fairness Regularization in Federated Learning [1.4773243280881763]
  Federated Learning (FL) has emerged as a vital paradigm in modern machine learning.<n>This work focuses on performance equitable fairness, which aims to minimize differences in performance across clients.<n>We empirically show that FairGrad (approximate) and FairGrad* (exact) improve both fairness and overall model performance in heterogeneous data settings.
  arXiv  Detail & Related papers  (2025-08-16T13:32:41Z)
• Convergence of Agnostic Federated Averaging [0.0]
  Federated learning (FL) enables decentralized model training without centralizing raw data.<n>Clients participate intermittently in server aggregation and with unknown, possibly biased participation probabilities.
  arXiv  Detail & Related papers  (2025-07-14T14:32:46Z)
• FeDa4Fair: Client-Level Federated Datasets for Fairness Evaluation [5.195640929313995]
  Federated Learning (FL) enables collaborative model training across multiple clients without sharing clients' private data.<n>The diverse and often conflicting biases present across clients pose significant challenges to model fairness.<n>Current fairness-enhancing FL solutions often fall short, as they typically mitigate biases for a single, usually binary, sensitive attribute, while ignoring the heterogeneous fairness needs that exist in real-world settings.
  arXiv  Detail & Related papers  (2025-06-26T08:43:12Z)
• Remember, but also, Forget: Bridging Myopic and Perfect Recall Fairness with Past-Discounting [4.788163807490197]
  Dynamic resource allocation in multi-agent settings often requires balancing efficiency with fairness over time.<n>Motivated by behavioral insights that human judgments of fairness evolve with temporal distance, we introduce a novel framework for temporal fairness that incorporates past-discounting mechanisms.<n>We detail the formulation of discounted-recall fairness in both additive and averaged utility contexts, illustrate its benefits through practical examples, and discuss its implications for designing balanced, scalable resource allocation strategies.
  arXiv  Detail & Related papers  (2025-04-01T19:42:17Z)
• FedPCA: Noise-Robust Fair Federated Learning via Performance-Capacity Analysis [39.424995330773264]
  FedPCA identifies mislabeled clients via a Gaussian Mixture Model on loss-dispersion pairs.<n>It applies fairness and robustness strategies in global aggregation and local training by adjusting client weights and selectively using reliable data.
  arXiv  Detail & Related papers  (2025-03-13T17:18:18Z)
• Client-Centric Federated Adaptive Optimization [78.30827455292827]
  Federated Learning (FL) is a distributed learning paradigm where clients collaboratively train a model while keeping their own data private.<n>We propose Federated-Centric Adaptive Optimization, which is a class of novel federated optimization approaches.
  arXiv  Detail & Related papers  (2025-01-17T04:00:50Z)
• Achieving Fairness Across Local and Global Models in Federated Learning [9.902848777262918]
  This study introduces textttEquiFL, a novel approach designed to enhance both local and global fairness in Federated Learning environments. textttEquiFL incorporates a fairness term into the local optimization objective, effectively balancing local performance and fairness. We demonstrate that textttEquiFL not only strikes a better balance between accuracy and fairness locally at each client but also achieves global fairness.
  arXiv  Detail & Related papers  (2024-06-24T19:42:16Z)
• Emulating Full Participation: An Effective and Fair Client Selection Strategy for Federated Learning [50.060154488277036]
  In federated learning, client selection is a critical problem that significantly impacts both model performance and fairness.<n>We propose two guiding principles that tackle the inherent conflict between the two metrics while reinforcing each other.<n>Our approach adaptively enhances this diversity by selecting clients based on their data distributions, thereby improving both model performance and fairness.
  arXiv  Detail & Related papers  (2024-05-22T12:27:24Z)
• Relaxed Contrastive Learning for Federated Learning [48.96253206661268]
  We propose a novel contrastive learning framework to address the challenges of data heterogeneity in federated learning. Our framework outperforms all existing federated learning approaches by huge margins on the standard benchmarks.
  arXiv  Detail & Related papers  (2024-01-10T04:55:24Z)
• Personalized Federated Learning under Mixture of Distributions [98.25444470990107]
  We propose a novel approach to Personalized Federated Learning (PFL), which utilizes Gaussian mixture models (GMM) to fit the input data distributions across diverse clients. FedGMM possesses an additional advantage of adapting to new clients with minimal overhead, and it also enables uncertainty quantification. Empirical evaluations on synthetic and benchmark datasets demonstrate the superior performance of our method in both PFL classification and novel sample detection.
  arXiv  Detail & Related papers  (2023-05-01T20:04:46Z)
• Fairness in Matching under Uncertainty [78.39459690570531]
  algorithmic two-sided marketplaces have drawn attention to the issue of fairness in such settings. We axiomatize a notion of individual fairness in the two-sided marketplace setting which respects the uncertainty in the merits. We design a linear programming framework to find fair utility-maximizing distributions over allocations.
  arXiv  Detail & Related papers  (2023-02-08T00:30:32Z)
• Fed-CBS: A Heterogeneity-Aware Client Sampling Mechanism for Federated Learning via Class-Imbalance Reduction [76.26710990597498]
  We show that the class-imbalance of the grouped data from randomly selected clients can lead to significant performance degradation. Based on our key observation, we design an efficient client sampling mechanism, i.e., Federated Class-balanced Sampling (Fed-CBS) In particular, we propose a measure of class-imbalance and then employ homomorphic encryption to derive this measure in a privacy-preserving way.
  arXiv  Detail & Related papers  (2022-09-30T05:42:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.