Sequential Conditional Transport on Probabilistic Graphs for Interpretable Counterfactual Fairness

• URL: http://arxiv.org/abs/2408.03425v1
• Date: Tue, 6 Aug 2024 20:02:57 GMT
• Title: Sequential Conditional Transport on Probabilistic Graphs for Interpretable Counterfactual Fairness
• Authors: Agathe Fernandes Machado, Arthur Charpentier, Ewen Gallic,
• Abstract summary: We use a counterfactual approach, referred to as sequential transport, to discuss individual fairness. We demonstrate its application through numerical experiments on both synthetic and real datasets.
• Score: 0.3749861135832073
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we link two existing approaches to derive counterfactuals: adaptations based on a causal graph, as suggested in Ple\v{c}ko and Meinshausen (2020) and optimal transport, as in De Lara et al. (2024). We extend "Knothe's rearrangement" Bonnotte (2013) and "triangular transport" Zech and Marzouk (2022a) to probabilistic graphical models, and use this counterfactual approach, referred to as sequential transport, to discuss individual fairness. After establishing the theoretical foundations of the proposed method, we demonstrate its application through numerical experiments on both synthetic and real datasets.

Related papers

• von Mises Quasi-Processes for Bayesian Circular Regression [57.88921637944379]
  We explore a family of expressive and interpretable distributions over circle-valued random functions. The resulting probability model has connections with continuous spin models in statistical physics. For posterior inference, we introduce a new Stratonovich-like augmentation that lends itself to fast Markov Chain Monte Carlo sampling.
  arXiv  Detail & Related papers  (2024-06-19T01:57:21Z)
• Conditional Optimal Transport on Function Spaces [53.9025059364831]
  We develop a theory of constrained optimal transport problems that describe block-triangular Monge maps. This generalizes the theory of optimal triangular transport to separable infinite-dimensional function spaces with general cost functions. We present numerical experiments that demonstrate the computational applicability of our theoretical results for amortized and likelihood-free inference of functional parameters.
  arXiv  Detail & Related papers  (2023-11-09T18:44:42Z)
• How to Estimate Model Transferability of Pre-Trained Speech Models? [84.11085139766108]
  "Score-based assessment" framework for estimating transferability of pre-trained speech models. We leverage upon two representation theories, Bayesian likelihood estimation and optimal transport, to generate rank scores for the PSM candidates. Our framework efficiently computes transferability scores without actual fine-tuning of candidate models or layers.
  arXiv  Detail & Related papers  (2023-06-01T04:52:26Z)
• Averaging Spatio-temporal Signals using Optimal Transport and Soft Alignments [110.79706180350507]
  We show that our proposed loss can be used to define temporal-temporal baryechecenters as Fr'teche means duality. Experiments on handwritten letters and brain imaging data confirm our theoretical findings.
  arXiv  Detail & Related papers  (2022-03-11T09:46:22Z)
• GAN Estimation of Lipschitz Optimal Transport Maps [0.0]
  This paper introduces the first statistically consistent estimator of the optimal transport map between two probability distributions, based on neural networks. We demonstrate that, under regularity assumptions, the obtained generator converges uniformly to the optimal transport map as the sample size increases to infinity. In contrast to previous work tackling either statistical guarantees or practicality, we provide an expressive and feasible estimator which paves way for optimal transport applications.
  arXiv  Detail & Related papers  (2022-02-16T10:15:56Z)
• Obtaining Dyadic Fairness by Optimal Transport [40.88844078769325]
  This paper considers obtaining fairness for link prediction tasks, which can be measured by dyadic fairness. We propose a pre-processing methodology to obtain dyadic fairness through data repairing and optimal transport. The optimal transport-based dyadic fairness algorithm is proposed for graph link prediction.
  arXiv  Detail & Related papers  (2022-02-09T15:33:59Z)
• Branching Time Active Inference with Bayesian Filtering [3.5450828190071655]
  Branching Time Active Inference (Champion et al., 2021b,a) is a framework proposing to look at planning as a form of Bayesian model expansion. In this paper, we harness the efficiency of an alternative method for inference called Bayesian Filtering.
  arXiv  Detail & Related papers  (2021-12-14T14:01:07Z)
• Quantized Conditional COT-GAN for Video Prediction [3.8073142980733]
  Causal Optimal Transport (COT) results from imposing a temporal causality constraint on classic optimal transport problems. We develop a conditional version of COT-GAN suitable for sequence prediction. The resulting quantized conditional COT-GAN algorithm is illustrated with an application for video prediction.
  arXiv  Detail & Related papers  (2021-06-10T11:10:53Z)
• On the Existence of Optimal Transport Gradient for Learning Generative Models [8.602553195689513]
  Training of Wasserstein Generative Adversarial Networks (WGAN) relies on the calculation of the gradient of the optimal transport cost. We first demonstrate that such gradient may not be defined, which can result in numerical instabilities during gradient-based optimization. By exploiting the discrete nature of empirical data, we formulate the gradient in a semi-discrete setting and propose an algorithm for the optimization of the generative model parameters.
  arXiv  Detail & Related papers  (2021-02-10T16:28:20Z)
• Hawkes Processes on Graphons [85.6759041284472]
  We study Hawkes processes and their variants that are associated with Granger causality graphs. We can generate the corresponding Hawkes processes and simulate event sequences. We learn the proposed model by minimizing the hierarchical optimal transport distance between the generated event sequences and the observed ones.
  arXiv  Detail & Related papers  (2021-02-04T17:09:50Z)
• Comparing Probability Distributions with Conditional Transport [63.11403041984197]
  We propose conditional transport (CT) as a new divergence and approximate it with the amortized CT (ACT) cost. ACT amortizes the computation of its conditional transport plans and comes with unbiased sample gradients that are straightforward to compute. On a wide variety of benchmark datasets generative modeling, substituting the default statistical distance of an existing generative adversarial network with ACT is shown to consistently improve the performance.
  arXiv  Detail & Related papers  (2020-12-28T05:14:22Z)

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.