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
- Optimal Transport on Categorical Data for Counterfactuals using Compositional Data and Dirichlet Transport [0.3749861135832073]
Optimal transport-based approaches have gained attention for deriving counterfactuals, e.g., to quantify algorithmic discrimination.
In this paper, we propose a novel approach to transport categorical variables with real datasets.
arXiv Detail & Related papers (2025-01-26T14:42:16Z) - 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) - 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) - MINIMALIST: Mutual INformatIon Maximization for Amortized Likelihood
Inference from Sampled Trajectories [61.3299263929289]
Simulation-based inference enables learning the parameters of a model even when its likelihood cannot be computed in practice.
One class of methods uses data simulated with different parameters to infer an amortized estimator for the likelihood-to-evidence ratio.
We show that this approach can be formulated in terms of mutual information between model parameters and simulated data.
arXiv Detail & Related papers (2021-06-03T12:59:16Z) - Congestion-aware Multi-agent Trajectory Prediction for Collision
Avoidance [110.63037190641414]
We propose to learn congestion patterns explicitly and devise a novel "Sense--Learn--Reason--Predict" framework.
By decomposing the learning phases into two stages, a "student" can learn contextual cues from a "teacher" while generating collision-free trajectories.
In experiments, we demonstrate that the proposed model is able to generate collision-free trajectory predictions in a synthetic dataset.
arXiv Detail & Related papers (2021-03-26T02:42:33Z) - Incremental Semi-Supervised Learning Through Optimal Transport [0.0]
We propose a novel approach for the transductive semi-supervised learning, using a complete bipartite edge-weighted graph.
The proposed approach uses the regularized optimal transport between empirical measures defined on labelled and unlabelled data points in order to obtain an affinity matrix from the optimal transport plan.
arXiv Detail & Related papers (2021-03-22T15:31: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) - Probing the topological Anderson transition with quantum walks [48.7576911714538]
We consider one-dimensional quantum walks in optical linear networks with synthetically introduced disorder and tunable system parameters.
The option to directly monitor the walker's probability distribution makes this optical platform ideally suited for the experimental observation of the unique signatures of the one-dimensional topological Anderson transition.
arXiv Detail & Related papers (2021-02-01T21:19:15Z) - 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) - Generalization Properties of Optimal Transport GANs with Latent
Distribution Learning [52.25145141639159]
We study how the interplay between the latent distribution and the complexity of the pushforward map affects performance.
Motivated by our analysis, we advocate learning the latent distribution as well as the pushforward map within the GAN paradigm.
arXiv Detail & Related papers (2020-07-29T07:31:33Z)
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.