Who Trains Matters: Federated Learning under Enrollment and Participation Selection Biases

• URL: http://arxiv.org/abs/2604.26604v1
• Date: Wed, 29 Apr 2026 12:33:08 GMT
• Title: Who Trains Matters: Federated Learning under Enrollment and Participation Selection Biases
• Abstract summary: Federated learning trains a shared model from updates contributed by distributed clients.<n>In practice, this representativeness assumption can fail at two distinct stages, inducing selection bias.<n>We formalize FL under a two-stage selection model and derive textscFedIPW, an inverse-probability-weighted aggregation scheme.
• Score: 0.16921396880325776
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Federated learning (FL) trains a shared model from updates contributed by distributed clients, often implicitly assuming that contributing clients are representative of the target population. In practice, this representativeness assumption can fail at two distinct stages, inducing selection bias. First, eligibility rules such as device constraints, software requirements, or user consent determine which clients are ever enrolled and reachable for training, inducing \emph{enrollment bias}. Second, among enrolled clients, user and system factors such as battery state, network status, and local time determine which clients participate in each communication round, inducing \emph{participation bias}. Although existing work has largely addressed round-level participation bias, it has paid far less attention to population-level enrollment bias, which can induce a persistent mismatch between the training objective and the target-population objective. We formalize FL under a two-stage selection model and derive \textsc{FedIPW}, an inverse-probability-weighted aggregation scheme that recovers the target-population mean update under standard ignorability and positivity assumptions. Because client-level covariates are often unavailable for non-enrolled clients, we also introduce a limited-information aggregate-calibration extension that uses known target-population summaries to reweight the enrolled sample, partially correcting enrollment bias. We further provide an algorithm-agnostic optimization analysis under residual weighting error and show that incomplete selection correction can induce a non-vanishing bias floor. Finally, experiments on synthetic federated logistic regression validate the predicted objective mismatch and show that enrollment correction reduces target-population error under two-stage selection.

Related papers

• SP-CACW: Convergence-Aware Client Weighting for Selfish Personalized Learning [8.941998221680409]
  We study how a designated target client can use peer gradients to minimize its own risk while avoiding negative transfer.<n>We propose SP-CACW, a convergence-aware client-weighting framework that selects aggregation weights by minimizing an upper bound on the target client's convergence error.
  arXiv  Detail & Related papers  (2026-06-28T10:28:04Z)
• Generative Frontier Planning for Adaptive Peer-Referral Recruitment under Covariate-Dependent Arrivals [28.082278231005997]
  Peer-referral recruitment systems are critical for studying and intervening on hidden populations affected by infectious diseases.<n>We propose emphGenerative Frontier Planning (GFP), a model-based planner that replaces per-step Monte-Carlo sampling with a deterministic backup.<n>GFP outperforms random, reinforcement-learning, and i.i.d. dynamic-programming baselines across four discount factors.
  arXiv  Detail & Related papers  (2026-06-06T22:31:07Z)
• Choose Wisely and Privately: Proactive Client Selection for Fair and Efficient Federated Learning [0.9099663022952496]
  Federated Learning enables collaborative model training across decentralized data sources without data transfer.<n>Averaging-based FL is limited by the presence of non-IID data, which negatively impacts convergence speed and final model accuracy.<n>We propose a proactive client selection framework that aims to find an optimal federation of clients whose combined data match utility and fairness requirements before training begins.
  arXiv  Detail & Related papers  (2026-05-20T10:00:33Z)
• Evidence-based Distributional Alignment for Large Language Models [58.65469623911573]
  We propose Evi-DA, an evidence-based alignment technique that improves the fidelity and robustness of LLM-based distribution estimation.<n>Given a target country, Evi-DA retrieves related World Values Survey items and their answer distributions, predicts a coarse Welzel value signature for each option, and infers the country-conditioned answer distribution in a structured format.
  arXiv  Detail & Related papers  (2026-03-03T03:34:06Z)
• Judging with Confidence: Calibrating Autoraters to Preference Distributions [56.17041629492863]
  We argue that a reliable autorater must learn to model the full distribution of preferences defined by a target population.<n>We present two learning methods tailored to different data conditions.<n>Our results show that finetuning autoraters with a distribution-matching objective leads to verbalized probability predictions that are better aligned with the target preference distribution.
  arXiv  Detail & Related papers  (2025-09-30T20:36:41Z)
• BACSA: A Bias-Aware Client Selection Algorithm for Privacy-Preserving Federated Learning in Wireless Healthcare Networks [0.5524804393257919]
  We propose the Bias-Aware Client Selection Algorithm (BACSA), which detects user bias and strategically selects clients based on their bias profiles. BACSA is suitable for sensitive healthcare applications where Quality of Service (QoS), privacy and security are paramount.
  arXiv  Detail & Related papers  (2024-11-01T21:34:43Z)
• Submodular Maximization Approaches for Equitable Client Selection in Federated Learning [4.167345675621377]
  In a conventional Learning framework, client selection for training typically involves the random sampling of a subset of clients in each iteration. This paper introduces two novel methods, namely SUBTRUNC and UNIONFL, designed to address the limitations of random client selection.
  arXiv  Detail & Related papers  (2024-08-24T22:40:31Z)
• Identifying and Mitigating Social Bias Knowledge in Language Models [52.52955281662332]
  We propose a novel debiasing approach, Fairness Stamp (FAST), which enables fine-grained calibration of individual social biases.<n>FAST surpasses state-of-the-art baselines with superior debiasing performance.<n>This highlights the potential of fine-grained debiasing strategies to achieve fairness in large language models.
  arXiv  Detail & Related papers  (2024-08-07T17:14:58Z)
• Federated Class-Incremental Learning with Hierarchical Generative Prototypes [10.532838477096055]
  Federated Learning (FL) aims at unburdening the training of deep models by distributing computation across multiple devices (clients)<n>Our proposal constrains both biases in the last layer by efficiently finetuning a pre-trained backbone using learnable prompts.<n>Our method significantly improves the current State Of The Art, providing an average increase of +7.8% in accuracy.
  arXiv  Detail & Related papers  (2024-06-04T16:12:27Z)
• Delving into Identify-Emphasize Paradigm for Combating Unknown Bias [52.76758938921129]
  We propose an effective bias-conflicting scoring method (ECS) to boost the identification accuracy. We also propose gradient alignment (GA) to balance the contributions of the mined bias-aligned and bias-conflicting samples. Experiments are conducted on multiple datasets in various settings, demonstrating that the proposed solution can mitigate the impact of unknown biases.
  arXiv  Detail & Related papers  (2023-02-22T14:50:24Z)
• FedABC: Targeting Fair Competition in Personalized Federated Learning [76.9646903596757]
  Federated learning aims to collaboratively train models without accessing their client's local private data. We propose a novel and generic PFL framework termed Federated Averaging via Binary Classification, dubbed FedABC. In particular, we adopt the one-vs-all'' training strategy in each client to alleviate the unfair competition between classes.
  arXiv  Detail & Related papers  (2023-02-15T03:42:59Z)
• 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.