Achieving Long-Term Fairness in Sequential Decision Making

• URL: http://arxiv.org/abs/2204.01819v1
• Date: Mon, 4 Apr 2022 20:05:44 GMT
• Title: Achieving Long-Term Fairness in Sequential Decision Making
• Authors: Yaowei Hu and Lu Zhang
• Abstract summary: We propose a framework for achieving long-term fair sequential decision making. We take path-specific effects on the time-lagged causal graph as a quantitative tool for measuring long-term fairness.
• Score: 9.046461405943502
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we propose a framework for achieving long-term fair sequential decision making. By conducting both the hard and soft interventions, we propose to take path-specific effects on the time-lagged causal graph as a quantitative tool for measuring long-term fairness. The problem of fair sequential decision making is then formulated as a constrained optimization problem with the utility as the objective and the long-term and short-term fairness as constraints. We show that such an optimization problem can be converted to a performative risk optimization. Finally, repeated risk minimization (RRM) is used for model training, and the convergence of RRM is theoretically analyzed. The empirical evaluation shows the effectiveness of the proposed algorithm on synthetic and semi-synthetic temporal datasets.

Related papers

• Fair Risk Minimization under Causal Path-Specific Effect Constraints [3.0232957374216953]
  This paper introduces a framework for estimating fair optimal predictions using machine learning. We derive closed-form solutions for constrained optimization based on mean squared error and cross-entropy risk criteria.
  arXiv  Detail & Related papers  (2024-08-03T02:05:43Z)
• A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints [14.990988698038686]
  We consider a multi-stage dynamic assortment optimization problem with multi-nomial choice modeling (MNL) under resource knapsack constraints. With the exact optimal dynamic assortment solution being computationally intractable, a practical strategy is to adopt the re-solving technique that periodically re-optimizes deterministic linear programs. We propose a new epoch-based re-solving algorithm that effectively transforms the denominator of the objective into the constraint.
  arXiv  Detail & Related papers  (2024-07-08T02:40:20Z)
• Successive Refinement in Large-Scale Computation: Advancing Model Inference Applications [67.76749044675721]
  We introduce solutions for layered-resolution computation. These solutions allow lower-resolution results to be obtained at an earlier stage than the final result.
  arXiv  Detail & Related papers  (2024-02-11T15:36:33Z)
• Long-Term Fair Decision Making through Deep Generative Models [12.333165351086171]
  This paper studies long-term fair machine learning which aims to mitigate group disparity over the long term in sequential decision-making systems. We leverage the temporal causal graph and use the 1-Wasserstein distance between the interventional distributions of different demographic groups at a sufficiently large time step as the quantitative metric. We propose a three-phase learning framework where the decision model is trained on high-fidelity data generated by a deep generative model.
  arXiv  Detail & Related papers  (2024-01-20T17:44:50Z)
• Data-driven Piecewise Affine Decision Rules for Stochastic Programming with Covariate Information [5.054099828483128]
  We propose an empirical risk (M) method embedded within a non piecewise decision (PADR) We show that the proposed PADR-based method applies to a broad, non-class non-constrained problem with theoretical consistency.
  arXiv  Detail & Related papers  (2023-04-26T16:08:49Z)
• 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)
• Learning to Optimize with Stochastic Dominance Constraints [103.26714928625582]
  In this paper, we develop a simple yet efficient approach for the problem of comparing uncertain quantities. We recast inner optimization in the Lagrangian as a learning problem for surrogate approximation, which bypasses apparent intractability. The proposed light-SD demonstrates superior performance on several representative problems ranging from finance to supply chain management.
  arXiv  Detail & Related papers  (2022-11-14T21:54:31Z)
• False Correlation Reduction for Offline Reinforcement Learning [115.11954432080749]
  We propose falSe COrrelation REduction (SCORE) for offline RL, a practically effective and theoretically provable algorithm. We empirically show that SCORE achieves the SoTA performance with 3.1x acceleration on various tasks in a standard benchmark (D4RL)
  arXiv  Detail & Related papers  (2021-10-24T15:34:03Z)
• Modeling the Second Player in Distributionally Robust Optimization [90.25995710696425]
  We argue for the use of neural generative models to characterize the worst-case distribution. This approach poses a number of implementation and optimization challenges. We find that the proposed approach yields models that are more robust than comparable baselines.
  arXiv  Detail & Related papers  (2021-03-18T14:26:26Z)
• State-Visitation Fairness in Average-Reward MDPs [5.190207094732672]
  We study fairness in temporally extended decision-making settings, specifically those formulated as Markov Decision Processes (MDPs) Our proposed notion of fairness ensures that each state's long-term visitation frequency is more than a specified fraction. The proposed solution guarantees a simultaneous approximation on the expected average-reward and the long-term state-visitation frequency.
  arXiv  Detail & Related papers  (2021-02-14T10:20:53Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)

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.