Long-term Fairness For Real-time Decision Making: A Constrained Online Optimization Approach

• URL: http://arxiv.org/abs/2401.02552v1
• Date: Thu, 4 Jan 2024 21:55:50 GMT
• Title: Long-term Fairness For Real-time Decision Making: A Constrained Online Optimization Approach
• Authors: Ruijie Du, Deepan Muthirayan, Pramod P. Khargonekar and Yanning Shen
• Abstract summary: We introduce a framework for ensuring long-term fairness within dynamic decision-making systems characterized by time-varying fairness constraints. A novel online algorithm, named LoTFair, is presented that solves the problem 'on the fly'
• Score: 14.098628848491146
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Machine learning (ML) has demonstrated remarkable capabilities across many real-world systems, from predictive modeling to intelligent automation. However, the widespread integration of machine learning also makes it necessary to ensure machine learning-driven decision-making systems do not violate ethical principles and values of society in which they operate. As ML-driven decisions proliferate, particularly in cases involving sensitive attributes such as gender, race, and age, to name a few, the need for equity and impartiality has emerged as a fundamental concern. In situations demanding real-time decision-making, fairness objectives become more nuanced and complex: instantaneous fairness to ensure equity in every time slot, and long-term fairness to ensure fairness over a period of time. There is a growing awareness that real-world systems that operate over long periods and require fairness over different timelines. However, existing approaches mainly address dynamic costs with time-invariant fairness constraints, often disregarding the challenges posed by time-varying fairness constraints. To bridge this gap, this work introduces a framework for ensuring long-term fairness within dynamic decision-making systems characterized by time-varying fairness constraints. We formulate the decision problem with fairness constraints over a period as a constrained online optimization problem. A novel online algorithm, named LoTFair, is presented that solves the problem 'on the fly'. We prove that LoTFair can make overall fairness violations negligible while maintaining the performance over the long run.

Related papers

• Machine Learning for Equitable Load Shedding: Real-time Solution via Learning Binding Constraints [1.3345486884341395]
  We present an efficient machine learning algorithm to enable millisecond-level computation for the optimization-based load shedding problem. Numerical studies on both a 3-bus toy example and a realistic RTS-GMLC system have demonstrated the validity and efficiency of the proposed algorithm.
  arXiv  Detail & Related papers  (2024-07-25T08:47:11Z)
• The Impossibility of Fair LLMs [59.424918263776284]
  The need for fair AI is increasingly clear in the era of large language models (LLMs) We review the technical frameworks that machine learning researchers have used to evaluate fairness. We develop guidelines for the more realistic goal of achieving fairness in particular use cases.
  arXiv  Detail & Related papers  (2024-05-28T04:36:15Z)
• Fair Enough? A map of the current limitations of the requirements to have fair algorithms [43.609606707879365]
  We argue that there is a hiatus between what the society is demanding from Automated Decision-Making systems, and what this demand actually means in real-world scenarios. We outline the key features of such a hiatus and pinpoint a set of crucial open points that we as a society must address in order to give a concrete meaning to the increasing demand of fairness in Automated Decision-Making systems.
  arXiv  Detail & Related papers  (2023-11-21T08:44:38Z)
• Resilient Constrained Learning [94.27081585149836]
  This paper presents a constrained learning approach that adapts the requirements while simultaneously solving the learning task. We call this approach resilient constrained learning after the term used to describe ecological systems that adapt to disruptions by modifying their operation.
  arXiv  Detail & Related papers  (2023-06-04T18:14:18Z)
• Fairness in Matching under Uncertainty [78.39459690570531]
  algorithmic two-sided marketplaces have drawn attention to the issue of fairness in such settings. We axiomatize a notion of individual fairness in the two-sided marketplace setting which respects the uncertainty in the merits. We design a linear programming framework to find fair utility-maximizing distributions over allocations.
  arXiv  Detail & Related papers  (2023-02-08T00:30:32Z)
• Stochastic Methods for AUC Optimization subject to AUC-based Fairness Constraints [51.12047280149546]
  A direct approach for obtaining a fair predictive model is to train the model through optimizing its prediction performance subject to fairness constraints. We formulate the training problem of a fairness-aware machine learning model as an AUC optimization problem subject to a class of AUC-based fairness constraints. We demonstrate the effectiveness of our approach on real-world data under different fairness metrics.
  arXiv  Detail & Related papers  (2022-12-23T22:29:08Z)
• Causal Fairness Analysis [68.12191782657437]
  We introduce a framework for understanding, modeling, and possibly solving issues of fairness in decision-making settings. The main insight of our approach will be to link the quantification of the disparities present on the observed data with the underlying, and often unobserved, collection of causal mechanisms. Our effort culminates in the Fairness Map, which is the first systematic attempt to organize and explain the relationship between different criteria found in the literature.
  arXiv  Detail & Related papers  (2022-07-23T01:06:34Z)
• Fairness in Machine Learning [15.934879442202785]
  We show how causal Bayesian networks can play an important role to reason about and deal with fairness. We present a unified framework that encompasses methods that can deal with different settings and fairness criteria.
  arXiv  Detail & Related papers  (2020-12-31T18:38:58Z)
• Group-Fair Online Allocation in Continuous Time [27.32936573198251]
  We consider continuous-time online learning problem with fairness considerations. We show that this formulation recovers reward-maximizing, max-min fair and proportionally fair allocation rules. We propose a novel online learning algorithm based on dual ascent optimization for time averages.
  arXiv  Detail & Related papers  (2020-06-11T21:56:53Z)
• On Consequentialism and Fairness [64.35872952140677]
  We provide a consequentialist critique of common definitions of fairness within machine learning. We conclude with a broader discussion of the issues of learning and randomization.
  arXiv  Detail & Related papers  (2020-01-02T05:39:48Z)

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.