Simple and Effective Specialized Representations for Fair Classifiers

• URL: http://arxiv.org/abs/2505.11740v1
• Date: Fri, 16 May 2025 22:59:46 GMT
• Title: Simple and Effective Specialized Representations for Fair Classifiers
• Authors: Alberto Sinigaglia, Davide Sartor, Marina Ceccon, Gian Antonio Susto,
• Abstract summary: We propose a novel approach to fair classification based on the characteristic function distance.<n>By utilizing characteristic functions, we achieve a more stable and efficient solution compared to traditional methods.<n>Our method maintains robustness and computational efficiency, making it a practical solution for real-world applications.
• Score: 4.264842065153012
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fair classification is a critical challenge that has gained increasing importance due to international regulations and its growing use in high-stakes decision-making settings. Existing methods often rely on adversarial learning or distribution matching across sensitive groups; however, adversarial learning can be unstable, and distribution matching can be computationally intensive. To address these limitations, we propose a novel approach based on the characteristic function distance. Our method ensures that the learned representation contains minimal sensitive information while maintaining high effectiveness for downstream tasks. By utilizing characteristic functions, we achieve a more stable and efficient solution compared to traditional methods. Additionally, we introduce a simple relaxation of the objective function that guarantees fairness in common classification models with no performance degradation. Experimental results on benchmark datasets demonstrate that our approach consistently matches or achieves better fairness and predictive accuracy than existing methods. Moreover, our method maintains robustness and computational efficiency, making it a practical solution for real-world applications.

Related papers

• Feature Space Perturbation: A Panacea to Enhanced Transferability Estimation [13.930288332118561]
  We introduce a feature perturbation method that enhances the transferability estimation process by systematically altering the feature space.<n>Our method includes a Spread operation that increases intra-class variability, adding complexity within classes, and an Attract operation that minimizes the distances between different classes, thereby blurring the class boundaries.
  arXiv  Detail & Related papers  (2025-02-23T07:07:49Z)
• Re-evaluating Group Robustness via Adaptive Class-Specific Scaling [47.41034887474166]
  Group distributionally robust optimization is a prominent algorithm used to mitigate spurious correlations and address dataset bias.<n>Existing approaches have reported improvements in robust accuracies but come at the cost of average accuracy due to inherent trade-offs.<n>We propose a class-specific scaling strategy, directly applicable to existing debiasing algorithms with no additional training.<n>We develop an instance-wise adaptive scaling technique to alleviate this trade-off, even leading to improvements in both robust and average accuracies.
  arXiv  Detail & Related papers  (2024-12-19T16:01:51Z)
• Navigating Towards Fairness with Data Selection [27.731128352096555]
  We introduce a data selection method designed to efficiently and flexibly mitigate label bias.<n>Our approach utilizes a zero-shot predictor as a proxy model that simulates training on a clean holdout set.<n>Our modality-agnostic method has proven efficient and effective in handling label bias and improving fairness across diverse datasets in experimental evaluations.
  arXiv  Detail & Related papers  (2024-12-15T06:11:05Z)
• Statistical Inference for Temporal Difference Learning with Linear Function Approximation [62.69448336714418]
  We study the consistency properties of TD learning with Polyak-Ruppert averaging and linear function approximation.<n>First, we derive a novel high-dimensional probability convergence guarantee that depends explicitly on the variance and holds under weak conditions.<n>We further establish refined high-dimensional Berry-Esseen bounds over the class of convex sets that guarantee faster rates than those in the literature.
  arXiv  Detail & Related papers  (2024-10-21T15:34:44Z)
• Fair Active Learning in Low-Data Regimes [22.349886628823125]
  In machine learning applications, ensuring fairness is essential to avoid perpetuating social inequities. In this work, we address the challenges of reducing bias and improving accuracy in data-scarce environments. We introduce an innovative active learning framework that combines an exploration procedure inspired by posterior sampling with a fair classification subroutine. We demonstrate that this framework performs effectively in very data-scarce regimes, maximizing accuracy while satisfying fairness constraints with high probability.
  arXiv  Detail & Related papers  (2023-12-13T23:14:55Z)
• Practical Approaches for Fair Learning with Multitype and Multivariate Sensitive Attributes [70.6326967720747]
  It is important to guarantee that machine learning algorithms deployed in the real world do not result in unfairness or unintended social consequences. We introduce FairCOCCO, a fairness measure built on cross-covariance operators on reproducing kernel Hilbert Spaces. We empirically demonstrate consistent improvements against state-of-the-art techniques in balancing predictive power and fairness on real-world datasets.
  arXiv  Detail & Related papers  (2022-11-11T11:28:46Z)
• Scalable Personalised Item Ranking through Parametric Density Estimation [53.44830012414444]
  Learning from implicit feedback is challenging because of the difficult nature of the one-class problem. Most conventional methods use a pairwise ranking approach and negative samplers to cope with the one-class problem. We propose a learning-to-rank approach, which achieves convergence speed comparable to the pointwise counterpart.
  arXiv  Detail & Related papers  (2021-05-11T03:38:16Z)
• Can Active Learning Preemptively Mitigate Fairness Issues? [66.84854430781097]
  dataset bias is one of the prevailing causes of unfairness in machine learning. We study whether models trained with uncertainty-based ALs are fairer in their decisions with respect to a protected class. We also explore the interaction of algorithmic fairness methods such as gradient reversal (GRAD) and BALD.
  arXiv  Detail & Related papers  (2021-04-14T14:20:22Z)
• Accurate and Robust Feature Importance Estimation under Distribution Shifts [49.58991359544005]
  PRoFILE is a novel feature importance estimation method. We show significant improvements over state-of-the-art approaches, both in terms of fidelity and robustness.
  arXiv  Detail & Related papers  (2020-09-30T05:29:01Z)
• Accuracy and Fairness Trade-offs in Machine Learning: A Stochastic Multi-Objective Approach [0.0]
  In the application of machine learning to real-life decision-making systems, the prediction outcomes might discriminate against people with sensitive attributes, leading to unfairness. The commonly used strategy in fair machine learning is to include fairness as a constraint or a penalization term in the minimization of the prediction loss. In this paper, we introduce a new approach to handle fairness by formulating a multi-objective optimization problem.
  arXiv  Detail & Related papers  (2020-08-03T18:51:24Z)
• Causal Feature Selection for Algorithmic Fairness [61.767399505764736]
  We consider fairness in the integration component of data management. We propose an approach to identify a sub-collection of features that ensure the fairness of the dataset.
  arXiv  Detail & Related papers  (2020-06-10T20:20:10Z)

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.