Understanding Fairness and Prediction Error through Subspace Decomposition and Influence Analysis

• URL: http://arxiv.org/abs/2510.23935v1
• Date: Mon, 27 Oct 2025 23:38:00 GMT
• Title: Understanding Fairness and Prediction Error through Subspace Decomposition and Influence Analysis
• Abstract summary: We propose a principled framework that adjusts data representations to balance predictive utility and fairness.<n>We provide a theoretical analysis of how prediction error and fairness gaps evolve as shared subspaces are added.<n>Experiments on both synthetic and real-world datasets validate our theoretical insights and show that the proposed method effectively improves fairness while preserving predictive performance.
• Score: 20.446739075831722
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Machine learning models have achieved widespread success but often inherit and amplify historical biases, resulting in unfair outcomes. Traditional fairness methods typically impose constraints at the prediction level, without addressing underlying biases in data representations. In this work, we propose a principled framework that adjusts data representations to balance predictive utility and fairness. Using sufficient dimension reduction, we decompose the feature space into target-relevant, sensitive, and shared components, and control the fairness-utility trade-off by selectively removing sensitive information. We provide a theoretical analysis of how prediction error and fairness gaps evolve as shared subspaces are added, and employ influence functions to quantify their effects on the asymptotic behavior of parameter estimates. Experiments on both synthetic and real-world datasets validate our theoretical insights and show that the proposed method effectively improves fairness while preserving predictive performance.

Related papers

• Fair Data Pre-Processing with Imperfect Attribute Space [9.017721212703352]
  LatentPre is a novel framework that enables principled and robust fair data processing in practical settings.<n>LatentPre augments the fairness policy with latent attributes that capture essential but subtle signals.<n>Experiments demonstrate that LatentPre consistently achieves strong fairness-utility trade-offs across diverse scenarios.
  arXiv  Detail & Related papers  (2026-03-27T14:27:13Z)
• Overcoming Fairness Trade-offs via Pre-processing: A Causal Perspective [0.0]
  Training machine learning models for fair decisions face two key challenges.<n>The emphfairness-accuracy trade-off results from enforcing fairness which weakens its predictive performance.<n>The incompatibility of different fairness metrics poses another trade-off -- also known as the emphimpossibility theorem.
  arXiv  Detail & Related papers  (2025-01-24T18:33:18Z)
• 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)
• Learning for Counterfactual Fairness from Observational Data [62.43249746968616]
  Fairness-aware machine learning aims to eliminate biases of learning models against certain subgroups described by certain protected (sensitive) attributes such as race, gender, and age. A prerequisite for existing methods to achieve counterfactual fairness is the prior human knowledge of the causal model for the data. In this work, we address the problem of counterfactually fair prediction from observational data without given causal models by proposing a novel framework CLAIRE.
  arXiv  Detail & Related papers  (2023-07-17T04:08:29Z)
• RobustFair: Adversarial Evaluation through Fairness Confusion Directed Gradient Search [8.278129731168127]
  Deep neural networks (DNNs) often face challenges due to their vulnerability to various adversarial perturbations. This paper introduces a novel approach, RobustFair, to evaluate the accurate fairness of DNNs when subjected to false or biased perturbations.
  arXiv  Detail & Related papers  (2023-05-18T12:07:29Z)
• Fairness through Aleatoric Uncertainty [18.95295731419523]
  We introduce the idea of leveraging aleatoric uncertainty (e.g., data ambiguity) to improve the fairness-utility trade-off. Our central hypothesis is that aleatoric uncertainty is a key factor for algorithmic fairness. We then propose a principled model to improve fairness when aleatoric uncertainty is high and improve utility elsewhere.
  arXiv  Detail & Related papers  (2023-04-07T13:50:57Z)
• Systematic Evaluation of Predictive Fairness [60.0947291284978]
  Mitigating bias in training on biased datasets is an important open problem. We examine the performance of various debiasing methods across multiple tasks. We find that data conditions have a strong influence on relative model performance.
  arXiv  Detail & Related papers  (2022-10-17T05:40:13Z)
• Measuring Fairness of Text Classifiers via Prediction Sensitivity [63.56554964580627]
  ACCUMULATED PREDICTION SENSITIVITY measures fairness in machine learning models based on the model's prediction sensitivity to perturbations in input features. We show that the metric can be theoretically linked with a specific notion of group fairness (statistical parity) and individual fairness.
  arXiv  Detail & Related papers  (2022-03-16T15:00:33Z)
• Increasing Fairness in Predictions Using Bias Parity Score Based Loss Function Regularization [0.8594140167290099]
  We introduce a family of fairness enhancing regularization components that we use in conjunction with the traditional binary-cross-entropy based accuracy loss. We deploy them in the context of a recidivism prediction task as well as on a census-based adult income dataset.
  arXiv  Detail & Related papers  (2021-11-05T17:42:33Z)
• Counterfactual Representation Learning with Balancing Weights [74.67296491574318]
  Key to causal inference with observational data is achieving balance in predictive features associated with each treatment type. Recent literature has explored representation learning to achieve this goal. We develop an algorithm for flexible, scalable and accurate estimation of causal effects.
  arXiv  Detail & Related papers  (2020-10-23T19:06:03Z)
• Double Robust Representation Learning for Counterfactual Prediction [68.78210173955001]
  We propose a novel scalable method to learn double-robust representations for counterfactual predictions. We make robust and efficient counterfactual predictions for both individual and average treatment effects. The algorithm shows competitive performance with the state-of-the-art on real world and synthetic data.
  arXiv  Detail & Related papers  (2020-10-15T16:39:26Z)

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.