Generalised Transportability via Causal Abstractions

• URL: http://arxiv.org/abs/2608.15645v1
• Date: Sun, 16 Aug 2026 09:19:16 GMT
• Title: Generalised Transportability via Causal Abstractions
• Abstract summary: Transporting a causal conclusion from a source study population to a target one is a fundamental problem in causal inference.<n>We take a model-level perspective grounded in Causal Abstraction theory.<n>Instead of asking whether one query transports, we ask whether a single map aligns the source and target.
• Score: 10.794433595853668
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Transporting a causal conclusion from a source study population to a target one is a fundamental problem in causal inference. The theory of transportability provides a criterion for when this is possible: given experimental data from the source and observational data from the target, it determines whether a target query is identifiable and does so completely; i.e. if the query can be transported, the criterion finds the exact formula. However, it works one query at a time and returns an expression rather than the value itself. It is also silent in two practically important regimes: when the query is not transportable and when no target data exist at all. To tackle both, we take a model-level perspective grounded in Causal Abstraction theory. Source and target share variables, graph, and interventions, differing only at a known set of mechanisms, which makes transportability a special case of same-level abstraction. Thus, instead of asking whether one query transports, we ask whether a single map aligns the source and target across their interventional behaviour. We characterise when such a map exists in both the Markovian and semi-Markovian settings; when it does, every target query transports at once. Our main contribution lies in the approximate case. When no exact map exists, the best approximate one still yields certified query intervals, recasting abstraction error as a quantitative notion of approximate transportability. We formulate model-level transport as distributionally robust optimisation over mechanism and environment perturbations of the unseen target and derive certificates for both challenging regimes: bounds for non-transportable queries, and guarantees under target-agnostic settings. We evaluate our framework on synthetic Markovian and semi-Markovian benchmarks and a real ecological dataset, and we show that the certified intervals bracket the true interventional query.

Related papers

• The Fundamental Limits of Valid Transport Map Estimation [8.610170779272432]
  We formalize the task of estimating any valid transport map in a rigorous minimax framework.<n>We show that, though strong, stability assumptions from the OT literature, estimating any valid transport map is statistically as hard as estimating the OT map.<n>Our minimax framing provides a rigorous foundation for understanding the statistical limits of modern transport-based generative methods.
  arXiv  Detail & Related papers  (2026-06-29T17:17:55Z)
• Counterfactual Identifiability via Dynamic Optimal Transport [15.637845261800463]
  We argue that counterfactuals must be identifiable to justify causal claims.<n>A recent line of work on counterfactual inference shows promising results but lacks identification.
  arXiv  Detail & Related papers  (2025-10-09T14:45:13Z)
• What is a good matching of probability measures? A counterfactual lens on transport maps [3.4090089330250724]
  Coupling probability measures lies at the core of many problems in statistics and machine learning.<n>We first carry a comparative analysis of three constructions of transport maps: cyclically monotone, quantile-preserving and triangular monotone maps.<n>We identify conditions on causal graphs and structural equations under which counterfactual maps coincide with classical statistical transports.
  arXiv  Detail & Related papers  (2025-09-19T14:33:55Z)
• Counterfactual Realizability [52.85109506684737]
  We introduce a formal definition of realizability, the ability to draw samples from a distribution, and then develop a complete algorithm to determine whether an arbitrary counterfactual distribution is realizable.<n>We illustrate the implications of this new framework for counterfactual data collection using motivating examples from causal fairness and causal reinforcement learning.
  arXiv  Detail & Related papers  (2025-03-14T20:54:27Z)
• Towards Understanding Extrapolation: a Causal Lens [53.15488984371969]
  We provide a theoretical understanding of when extrapolation is possible and offer principled methods to achieve it.<n>Under this formulation, we cast the extrapolation problem into a latent-variable identification problem.<n>Our theory reveals the intricate interplay between the underlying manifold's smoothness and the shift properties.
  arXiv  Detail & Related papers  (2025-01-15T21:29:29Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)
• Semi-supervised Learning of Pushforwards For Domain Translation & Adaptation [3.800498098285222]
  Given two probability densities on related data spaces, we seek a map pushing one density to the other. For maps to have utility in a broad application space, the map must be available to apply on out-of-sample data points. We introduce a novel pushforward map learning algorithm that utilizes normalizing flows to parameterize the map.
  arXiv  Detail & Related papers  (2023-04-18T00:35:32Z)
• Relational Proxies: Emergent Relationships as Fine-Grained Discriminators [52.17542855760418]
  We propose a novel approach that leverages information between the global and local part of an object for encoding its label. We design Proxies based on our theoretical findings and evaluate it on seven challenging fine-grained benchmark datasets. We also experimentally validate our theory and obtain consistent results across multiple benchmarks.
  arXiv  Detail & Related papers  (2022-10-05T11:08:04Z)
• Causal Transportability for Visual Recognition [70.13627281087325]
  We show that standard classifiers fail because the association between images and labels is not transportable across settings. We then show that the causal effect, which severs all sources of confounding, remains invariant across domains. This motivates us to develop an algorithm to estimate the causal effect for image classification.
  arXiv  Detail & Related papers  (2022-04-26T15:02:11Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)

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.