What is a good matching of probability measures? A counterfactual lens on transport maps

• URL: http://arxiv.org/abs/2509.16027v1
• Date: Fri, 19 Sep 2025 14:33:55 GMT
• Title: What is a good matching of probability measures? A counterfactual lens on transport maps
• Authors: Lucas De Lara, Luca Ganassali,
• Abstract summary: 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.
• Score: 3.4090089330250724
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Coupling probability measures lies at the core of many problems in statistics and machine learning, from domain adaptation to transfer learning and causal inference. Yet, even when restricted to deterministic transports, such couplings are not identifiable: two atomless marginals admit infinitely many transport maps. The common recourse to optimal transport, motivated by cost minimization and cyclical monotonicity, obscures the fact that several distinct notions of multivariate monotone matchings coexist. In this work, we first carry a comparative analysis of three constructions of transport maps: cyclically monotone, quantile-preserving and triangular monotone maps. We establish necessary and sufficient conditions for their equivalence, thereby clarifying their respective structural properties. In parallel, we formulate counterfactual reasoning within the framework of structural causal models as a problem of selecting transport maps between fixed marginals, which makes explicit the role of untestable assumptions in counterfactual reasoning. Then, we are able to connect these two perspectives by identifying conditions on causal graphs and structural equations under which counterfactual maps coincide with classical statistical transports. In this way, we delineate the circumstances in which causal assumptions support the use of a specific structure of transport map. Taken together, our results aim to enrich the theoretical understanding of families of transport maps and to clarify their possible causal interpretations. We hope this work contributes to establishing new bridges between statistical transport and causal inference.

Related papers

• Estimation of Stochastic Optimal Transport Maps [20.559434126392205]
  We introduce a novel metric for evaluating the transportation quality of maps.<n>Under this metric, we develop computationally efficient map estimators with near-optimal finite-sample risk bounds.<n>These contributions constitute the first general-purpose theory for map estimation, compatible with a wide spectrum of real-world applications.
  arXiv  Detail & Related papers  (2025-12-10T10:23:40Z)
• A friendly introduction to triangular transport [0.0]
  Decision making under uncertainty is a cross-cutting challenge in science and engineering.<n>Most approaches to this challenge employ probabilistic representations of uncertainty.<n>We discuss how to characterize and manipulate such representations using triangular transport maps.
  arXiv  Detail & Related papers  (2025-03-27T16:41:14Z)
• A primer on optimal transport for causal inference with observational data [0.0]
  The goal of this review is to offer an introduction to the surprisingly deep existing connections between optimal transport and the identification of causal effects with observational data.<n>As a result, this review is intended to unify the language and notation between different areas of statistics, mathematics, and econometrics.
  arXiv  Detail & Related papers  (2025-03-10T19:51:37Z)
• 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)
• Stochastic interpolants with data-dependent couplings [31.854717378556334]
  We use the framework of interpolants to formalize how to itcouple the base and the target densities. We show that these transport maps can be learned by solving a simple square loss regression problem analogous to the standard independent setting.
  arXiv  Detail & Related papers  (2023-10-05T17:46:31Z)
• Learning Causal Graphs via Monotone Triangular Transport Maps [1.6752182911522522]
  We study the problem of causal structure learning from data using optimal transport (OT) We provide an algorithm for causal discovery up to Markov Equivalence with no assumptions on the structural equations/noise distributions. We provide experimental results to compare the proposed approach with the state of the art on both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2023-05-26T13:24:17Z)
• 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)
• Interplay between transport and quantum coherences in free fermionic systems [58.720142291102135]
  We study the quench dynamics in free fermionic systems. In particular, we identify a function, that we dub emphtransition map, which takes the value of the stationary current as input and gives the value of correlation as output.
  arXiv  Detail & Related papers  (2021-03-24T17:47:53Z)
• Time-Dependent Dephasing and Quantum Transport [68.8204255655161]
  We show that non-Markovian dephasing assisted transport manifests only in the non-symmetric configuration. We find similar results by considering a controllable and experimentally implementable system.
  arXiv  Detail & Related papers  (2021-02-20T22:44:08Z)
• Localisation in quasiperiodic chains: a theory based on convergence of local propagators [68.8204255655161]
  We present a theory of localisation in quasiperiodic chains with nearest-neighbour hoppings, based on the convergence of local propagators. Analysing the convergence of these continued fractions, localisation or its absence can be determined, yielding in turn the critical points and mobility edges. Results are exemplified by analysing the theory for three quasiperiodic models covering a range of behaviour.
  arXiv  Detail & Related papers  (2021-02-18T16:19:52Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)

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.