FRAPPE: A Group Fairness Framework for Post-Processing Everything

• URL: http://arxiv.org/abs/2312.02592v4
• Date: Thu, 20 Jun 2024 15:26:42 GMT
• Title: FRAPPE: A Group Fairness Framework for Post-Processing Everything
• Authors: Alexandru Tifrea, Preethi Lahoti, Ben Packer, Yoni Halpern, Ahmad Beirami, Flavien Prost,
• Abstract summary: We propose a framework that turns any regularized in-processing method into a post-processing approach. We show theoretically and through experiments that our framework preserves the good fairness-error trade-offs achieved with in-processing.
• Score: 48.57876348370417
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Despite achieving promising fairness-error trade-offs, in-processing mitigation techniques for group fairness cannot be employed in numerous practical applications with limited computation resources or no access to the training pipeline of the prediction model. In these situations, post-processing is a viable alternative. However, current methods are tailored to specific problem settings and fairness definitions and hence, are not as broadly applicable as in-processing. In this work, we propose a framework that turns any regularized in-processing method into a post-processing approach. This procedure prescribes a way to obtain post-processing techniques for a much broader range of problem settings than the prior post-processing literature. We show theoretically and through extensive experiments that our framework preserves the good fairness-error trade-offs achieved with in-processing and can improve over the effectiveness of prior post-processing methods. Finally, we demonstrate several advantages of a modular mitigation strategy that disentangles the training of the prediction model from the fairness mitigation, including better performance on tasks with partial group labels.

Related papers

• Multi-Output Distributional Fairness via Post-Processing [47.94071156898198]
  We introduce a post-processing method for multi-output models to enhance a model's distributional parity, a task-agnostic fairness measure. Our method employs an optimal transport mapping to move a model's outputs across different groups towards their empirical Wasserstein barycenter.
  arXiv  Detail & Related papers  (2024-08-31T22:41:26Z)
• FairRR: Pre-Processing for Group Fairness through Randomized Response [11.748613469340071]
  We show that measures of group fairness can be directly controlled for with optimal model utility. We propose a pre-processing algorithm called FairRR that yields excellent downstream model utility and fairness.
  arXiv  Detail & Related papers  (2024-03-12T16:08:47Z)
• Towards Better Understanding Attribution Methods [77.1487219861185]
  Post-hoc attribution methods have been proposed to identify image regions most influential to the models' decisions. We propose three novel evaluation schemes to more reliably measure the faithfulness of those methods. We also propose a post-processing smoothing step that significantly improves the performance of some attribution methods.
  arXiv  Detail & Related papers  (2022-05-20T20:50:17Z)
• Prescriptive Process Monitoring: Quo Vadis? [64.39761523935613]
  The paper studies existing methods in this field via a Systematic Literature Review ( SLR) The SLR provides insights into challenges and areas for future research that could enhance the usefulness and applicability of prescriptive process monitoring methods.
  arXiv  Detail & Related papers  (2021-12-03T08:06:24Z)
• Conditional Meta-Learning of Linear Representations [57.90025697492041]
  Standard meta-learning for representation learning aims to find a common representation to be shared across multiple tasks. In this work we overcome this issue by inferring a conditioning function, mapping the tasks' side information into a representation tailored to the task at hand. We propose a meta-algorithm capable of leveraging this advantage in practice.
  arXiv  Detail & Related papers  (2021-03-30T12:02:14Z)
• Application-Driven Learning: A Closed-Loop Prediction and Optimization Approach Applied to Dynamic Reserves and Demand Forecasting [41.94295877935867]
  We present application-driven learning, a new closed-loop framework in which the processes of forecasting and decision-making are merged and co-optimized. We show that the proposed methodology is scalable and yields consistently better performance than the standard open-loop approach.
  arXiv  Detail & Related papers  (2021-02-26T02:43:28Z)
• Impact of Data Processing on Fairness in Supervised Learning [30.419675300470573]
  We study the impact of pre and post processing for reducing discrimination in data-driven decision makers. We show that under some mild conditions, pre-processing outperforms post-processing.
  arXiv  Detail & Related papers  (2021-02-03T04:11:39Z)
• Learning the Truth From Only One Side of the Story [58.65439277460011]
  We focus on generalized linear models and show that without adjusting for this sampling bias, the model may converge suboptimally or even fail to converge to the optimal solution. We propose an adaptive approach that comes with theoretical guarantees and show that it outperforms several existing methods empirically.
  arXiv  Detail & Related papers  (2020-06-08T18:20: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.