Unveiling Group-Specific Distributed Concept Drift: A Fairness Imperative in Federated Learning

• URL: http://arxiv.org/abs/2402.07586v3
• Date: Thu, 13 Jun 2024 14:37:15 GMT
• Title: Unveiling Group-Specific Distributed Concept Drift: A Fairness Imperative in Federated Learning
• Authors: Teresa Salazar, João Gama, Helder Araújo, Pedro Henriques Abreu,
• Abstract summary: Group-specific concept drift refers to situations where one group experiences concept drift over time while another does not. Within the framework of federated learning, each client can experience group-specific concept drift independently while still sharing the same underlying concept. We adapt an existing distributed concept drift adaptation algorithm to tackle group-specific distributed concept drift.
• Score: 4.3310896118860445
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the evolving field of machine learning, ensuring fairness has become a critical concern, prompting the development of algorithms designed to mitigate discriminatory outcomes in decision-making processes. However, achieving fairness in the presence of group-specific concept drift remains an unexplored frontier, and our research represents pioneering efforts in this regard. Group-specific concept drift refers to situations where one group experiences concept drift over time while another does not, leading to a decrease in fairness even if accuracy remains fairly stable. Within the framework of federated learning, where clients collaboratively train models, its distributed nature further amplifies these challenges since each client can experience group-specific concept drift independently while still sharing the same underlying concept, creating a complex and dynamic environment for maintaining fairness. One of the significant contributions of our research is the formalization and introduction of the problem of group-specific concept drift and its distributed counterpart, shedding light on its critical importance in the realm of fairness. In addition, leveraging insights from prior research, we adapt an existing distributed concept drift adaptation algorithm to tackle group-specific distributed concept drift which utilizes a multi-model approach, a local group-specific drift detection mechanism, and continuous clustering of models over time. The findings from our experiments highlight the importance of addressing group-specific concept drift and its distributed counterpart to advance fairness in machine learning.

Related papers

• Fairness-Aware Grouping for Continuous Sensitive Variables: Application for Debiasing Face Analysis with respect to Skin Tone [3.3298048942057523]
  We propose a fairness-based grouping approach for continuous (possibly multidimensional) sensitive attributes.<n>By grouping data according to observed levels of discrimination, our method identifies the partition that maximizes a novel criterion.<n>We validate the proposed approach using multiple synthetic datasets and demonstrate its robustness under changing population distributions.
  arXiv  Detail & Related papers  (2025-07-15T12:21:52Z)
• Concept Reachability in Diffusion Models: Beyond Dataset Constraints [1.3654846342364308]
  In this work, we introduce a set of experiments to deepen our understanding of concept reachability.<n>We design a training data setup with three key obstacles: scarcity of concepts, underspecification of concepts in the captions, and data biases with tied concepts.<n>Our results show that certain concepts are reachable only at certain stages of transformation, and (iii) while prompting ability rapidly diminishes with a decrease in quality of the dataset, concepts often remain reliably reachable through steering.
  arXiv  Detail & Related papers  (2025-05-25T21:00:28Z)
• Classifier Clustering and Feature Alignment for Federated Learning under Distributed Concept Drift [5.566951183982973]
  In this work, we focus on real drift, where the conditional distribution $P(Y|X)$ changes. We propose FedCCFA, a federated learning framework with classifier clustering and feature alignment. Our results demonstrate that FedCCFA significantly outperforms existing methods under various concept drift settings.
  arXiv  Detail & Related papers  (2024-10-24T07:04:52Z)
• Distribution-Free Fair Federated Learning with Small Samples [54.63321245634712]
  FedFaiREE is a post-processing algorithm developed specifically for distribution-free fair learning in decentralized settings with small samples. We provide rigorous theoretical guarantees for both fairness and accuracy, and our experimental results further provide robust empirical validation for our proposed method.
  arXiv  Detail & Related papers  (2024-02-25T17:37:53Z)
• Federated Fairness without Access to Sensitive Groups [12.888927461513472]
  Current approaches to group fairness in federated learning assume the existence of predefined and labeled sensitive groups during training. We propose a new approach to guarantee group fairness that does not rely on any predefined definition of sensitive groups or additional labels.
  arXiv  Detail & Related papers  (2024-02-22T19:24:59Z)
• A Canonical Data Transformation for Achieving Inter- and Within-group Fairness [17.820200610132265]
  We introduce a formal definition of within-group fairness that maintains fairness among individuals from within the same group. We propose a pre-processing framework to meet both inter- and within-group fairness criteria with little compromise in accuracy. We apply this framework to the COMPAS risk assessment and Law School datasets and compare its performance to two regularization-based methods.
  arXiv  Detail & Related papers  (2023-10-23T17:00:20Z)
• DualFair: Fair Representation Learning at Both Group and Individual Levels via Contrastive Self-supervision [73.80009454050858]
  This work presents a self-supervised model, called DualFair, that can debias sensitive attributes like gender and race from learned representations. Our model jointly optimize for two fairness criteria - group fairness and counterfactual fairness.
  arXiv  Detail & Related papers  (2023-03-15T07:13:54Z)
• Learning Informative Representation for Fairness-aware Multivariate Time-series Forecasting: A Group-based Perspective [50.093280002375984]
  Performance unfairness among variables widely exists in multivariate time series (MTS) forecasting models. We propose a novel framework, named FairFor, for fairness-aware MTS forecasting.
  arXiv  Detail & Related papers  (2023-01-27T04:54:12Z)
• Federated Learning under Distributed Concept Drift [30.069809537266575]
  Federated Learning (FL) under distributed concept drift is a largely unexplored area. We first demonstrate that prior solutions to drift adaptation, with their single global model, are ill-suited to staggered drifts. We propose two new clustering algorithms for reacting to drifts based on local drift detection and hierarchical clustering.
  arXiv  Detail & Related papers  (2022-06-01T23:55:21Z)
• Heterogeneous Target Speech Separation [52.05046029743995]
  We introduce a new paradigm for single-channel target source separation where the sources of interest can be distinguished using non-mutually exclusive concepts. Our proposed heterogeneous separation framework can seamlessly leverage datasets with large distribution shifts.
  arXiv  Detail & Related papers  (2022-04-07T17:14:20Z)
• Fair Group-Shared Representations with Normalizing Flows [68.29997072804537]
  We develop a fair representation learning algorithm which is able to map individuals belonging to different groups in a single group. We show experimentally that our methodology is competitive with other fair representation learning algorithms.
  arXiv  Detail & Related papers  (2022-01-17T10:49:49Z)
• Unified Group Fairness on Federated Learning [22.143427873780404]
  Federated learning (FL) has emerged as an important machine learning paradigm where a global model is trained based on private data from distributed clients. Recent researches focus on achieving fairness among clients, but they ignore the fairness towards different groups formed by sensitive attribute(s) (e.g., gender and/or race) We propose a novel FL algorithm, named Group Distributionally Robust Federated Averaging (G-DRFA), which mitigates the distribution shift across groups with theoretical analysis of convergence rate.
  arXiv  Detail & Related papers  (2021-11-09T08:21:38Z)
• Group-disentangled Representation Learning with Weakly-Supervised Regularization [13.311886256230814]
  GroupVAE is a simple yet effective Kullback-Leibler divergence-based regularization to enforce consistent and disentangled representations. We demonstrate that learning group-disentangled representations improve upon downstream tasks, including fair classification and 3D shape-related tasks such as reconstruction, classification, and transfer learning.
  arXiv  Detail & Related papers  (2021-10-23T10:01:05Z)
• FairFed: Enabling Group Fairness in Federated Learning [22.913999279079878]
  Federated learning has been viewed as a promising solution for learning machine learning models among multiple parties. We propose FairFed, a novel algorithm to enhance group fairness via a fairness-aware aggregation method. Our proposed method outperforms the state-of-the-art fair federated learning frameworks under a high heterogeneous sensitive attribute distribution.
  arXiv  Detail & Related papers  (2021-10-02T17:55:20Z)
• Measuring Fairness Under Unawareness of Sensitive Attributes: A Quantification-Based Approach [131.20444904674494]
  We tackle the problem of measuring group fairness under unawareness of sensitive attributes. We show that quantification approaches are particularly suited to tackle the fairness-under-unawareness problem.
  arXiv  Detail & Related papers  (2021-09-17T13:45:46Z)
• MultiFair: Multi-Group Fairness in Machine Learning [52.24956510371455]
  We study multi-group fairness in machine learning (MultiFair) We propose a generic end-to-end algorithmic framework to solve it. Our proposed framework is generalizable to many different settings.
  arXiv  Detail & Related papers  (2021-05-24T02:30:22Z)
• When Relation Networks meet GANs: Relation GANs with Triplet Loss [110.7572918636599]
  Training stability is still a lingering concern of generative adversarial networks (GANs) In this paper, we explore a relation network architecture for the discriminator and design a triplet loss which performs better generalization and stability. Experiments on benchmark datasets show that the proposed relation discriminator and new loss can provide significant improvement on variable vision tasks.
  arXiv  Detail & Related papers  (2020-02-24T11:35:28Z)

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.