Transport-based Counterfactual Models - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2023

Transport-based Counterfactual Models


Counterfactual frameworks have grown popular in machine learning for both explaining algorithmic decisions but also defining individual notions of fairness, more intuitive than typical group fairness conditions. However, state-of-the-art models to compute counterfactuals are either unrealistic or unfeasible. In particular, while Pearl's causal inference provides appealing rules to calculate counterfactuals, it relies on a model that is unknown and hard to discover in practice. We address the problem of designing realistic and feasible counterfactuals in the absence of a causal model. We define transport-based counterfactual models as collections of joint probability distributions between observable distributions, and show their connection to causal counterfactuals. More specifically, we argue that optimal-transport theory defines relevant transport-based counterfactual models, as they are numerically feasible, statistically-faithful, and can coincide under some assumptions with causal counterfactual models. Finally, these models make counterfactual approaches to fairness feasible, and we illustrate their practicality and efficiency on fair learning. With this paper, we aim at laying out the theoretical foundations for a new, implementable approach to counterfactual thinking.
Fichier principal
Vignette du fichier
delara2022transport.pdf (1.02 Mo) Télécharger le fichier
references.bib (32.68 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03216124 , version 1 (04-05-2021)
hal-03216124 , version 2 (28-08-2021)
hal-03216124 , version 3 (06-01-2023)



Lucas de Lara, Alberto González-Sanz, Nicholas Asher, Laurent Risser, Jean-Michel Loubes. Transport-based Counterfactual Models. 2023. ⟨hal-03216124v3⟩
539 View
625 Download



Gmail Mastodon Facebook X LinkedIn More