Federated Measurement of Demographic Disparities from Quantile Sketches

• URL: http://arxiv.org/abs/2602.18870v1
• Date: Sat, 21 Feb 2026 15:34:44 GMT
• Title: Federated Measurement of Demographic Disparities from Quantile Sketches
• Abstract summary: Horizontal federated learning (FL) enables collaborative modeling across clients with aligned features without sharing raw data.<n>We study federated auditing of demographic parity through score distributions, measuring disparity as a Wasserstein--Frechet variance between sensitive-group score laws.<n>We propose a one-shot, communication-efficient protocol in which each silo shares only group counts and a quantile summary of its local score distributions.
• Score: 4.991212094743681
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Many fairness goals are defined at a population level that misaligns with siloed data collection, which remains unsharable due to privacy regulations. Horizontal federated learning (FL) enables collaborative modeling across clients with aligned features without sharing raw data. We study federated auditing of demographic parity through score distributions, measuring disparity as a Wasserstein--Frechet variance between sensitive-group score laws, and expressing the population metric in federated form that makes explicit how silo-specific selection drives local-global mismatch. For the squared Wasserstein distance, we prove an ANOVA-style decomposition that separates (i) selection-induced mixture effects from (ii) cross-silo heterogeneity, yielding tight bounds linking local and global metrics. We then propose a one-shot, communication-efficient protocol in which each silo shares only group counts and a quantile summary of its local score distributions, enabling the server to estimate global disparity and its decomposition, with $O(1/k)$ discretization bias ($k$ quantiles) and finite-sample guarantees. Experiments on synthetic data and COMPAS show that a few dozen quantiles suffice to recover global disparity and diagnose its sources.

Related papers

• Unbiased Open World Regularization for Fair Self-Supervised Learning [11.74837809839014]
  Self-supervised learning models are susceptible to learning spurious biases in the dataset.<n>We propose Unbiased Open World Regularization (UOWReg), an encoder-only framework.<n>We empirically validate this framework across both Gaussian and spherical latent spaces.
  arXiv  Detail & Related papers  (2026-07-24T09:51:22Z)
• SCOPE: Semantic Coreset with Orthogonal Projection Embeddings for Federated learning [0.7799711162530713]
  Current ML approaches either require impractical data aggregation or fail due to class imbalance.<n>We introduce SCOPE, a coreset framework for federated data that filters anomalies and adaptively prunes redundant data to long-tail skew.<n>SCOPE yields competitive global accuracy and robust convergence, all while achieving exceptional efficiency with a 128x to 512x reduction in uplink bandwidth.
  arXiv  Detail & Related papers  (2026-03-13T13:24:12Z)
• 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)
• Local distribution-based adaptive oversampling for imbalanced regression [0.0]
  Imbalanced regression occurs when continuous target variables have skewed distributions, creating sparse regions.<n>We propose LDAO (Local Distribution-based Adaptive Oversampling), a novel data-level approach that avoids categorizing individual samples as rare or frequent.<n> LDAO achieves a balanced representation across the entire target range while preserving the inherent statistical structure within each local distribution.
  arXiv  Detail & Related papers  (2025-04-19T14:36:41Z)
• Distributionally Robust Clustered Federated Learning: A Case Study in Healthcare [9.433126190164224]
  We introduce a novel algorithm, which we term Cross-silo Robust Clustered Federated Learning (CS-RCFL) We construct ambiguity sets around each client's empirical distribution that capture possible distribution shifts in the local data. We then propose a model-agnostic integer fractional program to determine the optimal distributionally robust clustering of clients into coalitions.
  arXiv  Detail & Related papers  (2024-10-09T16:25:01Z)
• Federated Impression for Learning with Distributed Heterogeneous Data [19.50235109938016]
  Federated learning (FL) provides a paradigm that can learn from distributed datasets across clients without requiring them to share data. In FL, sub-optimal convergence is common among data from different health centers due to the variety in data collection protocols and patient demographics across centers. We propose FedImpres which alleviates catastrophic forgetting by restoring synthetic data that represents the global information as federated impression.
  arXiv  Detail & Related papers  (2024-09-11T15:37:52Z)
• Collaborative Heterogeneous Causal Inference Beyond Meta-analysis [68.4474531911361]
  We propose a collaborative inverse propensity score estimator for causal inference with heterogeneous data. Our method shows significant improvements over the methods based on meta-analysis when heterogeneity increases.
  arXiv  Detail & Related papers  (2024-04-24T09:04:36Z)
• Estimating Unknown Population Sizes Using the Hypergeometric Distribution [1.03590082373586]
  We tackle the challenge of estimating discrete distributions when both the total population size and the sizes of its constituent categories are unknown. We develop our approach to account for a data generating process where the ground-truth is a mixture of distributions conditional on a continuous latent variable. Empirical data simulation demonstrates that our method outperforms other likelihood functions used to model count data.
  arXiv  Detail & Related papers  (2024-02-22T01:53:56Z)
• Federated Two Stage Decoupling With Adaptive Personalization Layers [5.69361786082969]
  Federated learning has gained significant attention due to its ability to enable distributed learning while maintaining privacy constraints. It inherently experiences significant learning degradation and slow convergence speed. It is natural to employ the concept of clustering homogeneous clients into the same group, allowing only the model weights within each group to be aggregated.
  arXiv  Detail & Related papers  (2023-08-30T07:46:32Z)
• Tackling Diverse Minorities in Imbalanced Classification [80.78227787608714]
  Imbalanced datasets are commonly observed in various real-world applications, presenting significant challenges in training classifiers. We propose generating synthetic samples iteratively by mixing data samples from both minority and majority classes. We demonstrate the effectiveness of our proposed framework through extensive experiments conducted on seven publicly available benchmark datasets.
  arXiv  Detail & Related papers  (2023-08-28T18:48:34Z)
• Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning [122.62311703151215]
  Divide and Contrast (DaC) aims to connect the good ends of both worlds while bypassing their limitations. DaC divides the target data into source-like and target-specific samples, where either group of samples is treated with tailored goals. We further align the source-like domain with the target-specific samples using a memory bank-based Maximum Mean Discrepancy (MMD) loss to reduce the distribution mismatch.
  arXiv  Detail & Related papers  (2022-11-12T09:21:49Z)
• A One-shot Framework for Distributed Clustered Learning in Heterogeneous Environments [54.172993875654015]
  The paper proposes a family of communication efficient methods for distributed learning in heterogeneous environments. One-shot approach, based on local computations at the users and a clustering based aggregation step at the server is shown to provide strong learning guarantees. For strongly convex problems it is shown that, as long as the number of data points per user is above a threshold, the proposed approach achieves order-optimal mean-squared error rates in terms of the sample size.
  arXiv  Detail & Related papers  (2022-09-22T09:04:10Z)
• Heterogeneous Federated Learning via Grouped Sequential-to-Parallel Training [60.892342868936865]
  Federated learning (FL) is a rapidly growing privacy-preserving collaborative machine learning paradigm. We propose a data heterogeneous-robust FL approach, FedGSP, to address this challenge. We show that FedGSP improves the accuracy by 3.7% on average compared with seven state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-01-31T03:15:28Z)
• Global Distance-distributions Separation for Unsupervised Person Re-identification [93.39253443415392]
  Existing unsupervised ReID approaches often fail in correctly identifying the positive samples and negative samples through the distance-based matching/ranking. We introduce a global distance-distributions separation constraint over the two distributions to encourage the clear separation of positive and negative samples from a global view. We show that our method leads to significant improvement over the baselines and achieves the state-of-the-art performance.
  arXiv  Detail & Related papers  (2020-06-01T07:05:39Z)

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.