Implementing Fair Regression In The Real World

• URL: http://arxiv.org/abs/2104.04353v1
• Date: Fri, 9 Apr 2021 13:31:16 GMT
• Title: Implementing Fair Regression In The Real World
• Authors: Boris Ruf, Marcin Detyniecki
• Abstract summary: We investigate the impact of such implementation of fair regression on the individual. We propose a set of post-processing algorithms to improve the utility of the existing fair regression approaches.
• Score: 3.723553383515688
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Most fair regression algorithms mitigate bias towards sensitive sub populations and therefore improve fairness at group level. In this paper, we investigate the impact of such implementation of fair regression on the individual. More precisely, we assess the evolution of continuous predictions from an unconstrained to a fair algorithm by comparing results from baseline algorithms with fair regression algorithms for the same data points. Based on our findings, we propose a set of post-processing algorithms to improve the utility of the existing fair regression approaches.

Related papers

• Direct Preference Optimization with Rating Information: Practical Algorithms and Provable Gains [67.71020482405343]
  We study how to design algorithms that can leverage additional information in the form of rating gap.<n>We present new algorithms that can achieve faster statistical rates than DPO in presence of accurate rating gap information.
  arXiv  Detail & Related papers  (2026-01-31T08:38:21Z)
• FairReweighing: Density Estimation-Based Reweighing Framework for Improving Separation in Fair Regression [2.4224069468449634]
  Lack of transparency has raised concerns about whether data-informed AI software decisions secure fairness against people of all racial, gender, or age groups.<n>Motivated by the Reweighing algorithm in fair classification, we proposed a FairReweighing pre-processing algorithm based on density estimation.<n>We show that the proposed FairReweighing algorithm can guarantee separation in the training data under a data independence assumption.
  arXiv  Detail & Related papers  (2025-11-14T16:31:21Z)
• Meta Optimality for Demographic Parity Constrained Regression via Post-Processing [4.106460421493345]
  We address the regression problem under the constraint of demographic parity, a commonly used fairness definition.<n>Recent studies have revealed fair minimax optimal regression algorithms, the most accurate algorithms that adhere to the fairness constraint.<n>We provide meta-theorems that can be applied to various situations to validate the fair minimax optimality of the corresponding regression algorithms.
  arXiv  Detail & Related papers  (2025-06-16T19:36:56Z)
• A Double Inertial Forward-Backward Splitting Algorithm With Applications to Regression and Classification Problems [0.0]
  This paper presents an improved forward-backward splitting algorithm with two inertial parameters.<n>It aims to find a point in the real Hilbert space at which the sum of a co-coercive operator and a maximal monotone operator vanishes.
  arXiv  Detail & Related papers  (2025-05-01T16:54:41Z)
• Fair and Accurate Regression: Strong Formulations and Algorithms [5.93858665501805]
  This paper introduces mixed-integer optimization methods to solve regression problems that incorporate metrics. We propose an exact formulation for training fair regression models. Numerical experiments conducted on fair least squares and fair logistic regression problems show competitive statistical performance.
  arXiv  Detail & Related papers  (2024-12-22T18:04:54Z)
• Optimal Group Fair Classifiers from Linear Post-Processing [10.615965454674901]
  We propose a post-processing algorithm for fair classification that mitigates model bias under a unified family of group fairness criteria. It achieves fairness by re-calibrating the output score of the given base model with a "fairness cost" -- a linear combination of the (predicted) group memberships.
  arXiv  Detail & Related papers  (2024-05-07T05:58:44Z)
• Boosting Fair Classifier Generalization through Adaptive Priority Reweighing [59.801444556074394]
  A performance-promising fair algorithm with better generalizability is needed. This paper proposes a novel adaptive reweighing method to eliminate the impact of the distribution shifts between training and test data on model generalizability.
  arXiv  Detail & Related papers  (2023-09-15T13:04:55Z)
• A Novel Framework for Improving the Breakdown Point of Robust Regression Algorithms [1.9594639581421422]
  We present an effective framework for improving the breakdown point of robust regression algorithms. We derive a consistent robust regression algorithm with iterative local search (CORALS)
  arXiv  Detail & Related papers  (2023-05-20T15:59:33Z)
• Interpretable Symbolic Regression for Data Science: Analysis of the 2022 Competition [0.0]
  Symbolic regression searches for analytic expressions that accurately describe studied phenomena. There has been a recent surge of new proposals that utilize approaches such as enumeration algorithms, mixed linear integer programming, neural networks, and Bayesian optimization. We present an in-depth analysis of the results obtained in this competition, discuss current challenges of symbolic regression algorithms and highlight possible improvements for future competitions.
  arXiv  Detail & Related papers  (2023-04-03T16:30:20Z)
• Offline Policy Optimization in RL with Variance Regularizaton [142.87345258222942]
  We propose variance regularization for offline RL algorithms, using stationary distribution corrections. We show that by using Fenchel duality, we can avoid double sampling issues for computing the gradient of the variance regularizer. The proposed algorithm for offline variance regularization (OVAR) can be used to augment any existing offline policy optimization algorithms.
  arXiv  Detail & Related papers  (2022-12-29T18:25:01Z)
• Regression with Label Differential Privacy [64.21020761920322]
  We derive a label DP randomization mechanism that is optimal under a given regression loss function. We prove that the optimal mechanism takes the form of a "randomized response on bins"
  arXiv  Detail & Related papers  (2022-12-12T17:41:32Z)
• Regularization Penalty Optimization for Addressing Data Quality Variance in OoD Algorithms [45.02465532852302]
  We theoretically reveal the relationship between training data quality and algorithm performance. A novel algorithm is proposed to alleviate the influence of low-quality data at both the sample level and the domain level.
  arXiv  Detail & Related papers  (2022-06-12T14:36:04Z)
• THOR: Threshold-Based Ranking Loss for Ordinal Regression [17.384197085002686]
  We present a regression-based ordinal regression algorithm for supervised classification of instances into ordinal categories. We add a novel threshold-based pairwise loss function that aims at minimizing the regression error, which in turn minimizes the Mean Absolute Error (MAE) measure. Experimental results on five real-world benchmarks demonstrate that the proposed algorithm achieves the best MAE results compared to state-of-the-art ordinal regression algorithms.
  arXiv  Detail & Related papers  (2022-05-10T13:04:09Z)
• Offline RL Without Off-Policy Evaluation [49.11859771578969]
  We show that simply doing one step of constrained/regularized policy improvement using an on-policy Q estimate of the behavior policy performs surprisingly well. This one-step algorithm beats the previously reported results of iterative algorithms on a large portion of the D4RL benchmark.
  arXiv  Detail & Related papers  (2021-06-16T16:04:26Z)
• 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)
• Variance Penalized On-Policy and Off-Policy Actor-Critic [60.06593931848165]
  We propose on-policy and off-policy actor-critic algorithms that optimize a performance criterion involving both mean and variance in the return. Our approach not only performs on par with actor-critic and prior variance-penalization baselines in terms of expected return, but also generates trajectories which have lower variance in the return.
  arXiv  Detail & Related papers  (2021-02-03T10:06:16Z)

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.