Causal Input--Output Modeling with Prior Information

We study the problem of inferring a causal input--output model from unpaired marginal observations and a given prior coupling. We formulate this problem using entropic causal optimal transport, which seeks a coupling that preserves the observed marginals, satisfies a one--sided causality constraint, and remains close to the prior. For Gaussian marginals and general quadratic costs, we prove that the optimal coupling is Gaussian and reduce the problem to a finite--dimensional optimization over covariance matrices. Using a Cholesky transformation to simplify the causality constraint, we derive a Lagrangian dual formulation and develop a block coordinate descent algorithm with explicit update formulas. We establish linear convergence of the algorithm, with explicit convergence rates, and prove stability of the optimal coupling under marginal covariance perturbations and derive a statistical error bound. We further show its equivalence to Sinkhorn iterations. Numerical experiments demonstrate the computational efficiency of the proposed algorithm and illustrate the predictive advantages of causal couplings.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22025
Primary Topic
Geometric Analysis and Curvature Flows
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Causal Input--Output Modeling with Prior Information

Amirhossein Taghvaei, Daran Xu
arXiv (Cornell University)
Geometric Analysis and Curvature Flows
preprint

Causal Input--Output Modeling with Prior Information

Amirhossein Taghvaei, Daran Xu
preprint en

Abstract

We study the problem of inferring a causal input--output model from unpaired marginal observations and a given prior coupling. We formulate this problem using entropic causal optimal transport, which seeks a coupling that preserves the observed marginals, satisfies a one--sided causality constraint, and remains close to the prior. For Gaussian marginals and general quadratic costs, we prove that the optimal coupling is Gaussian and reduce the problem to a finite--dimensional optimization over covariance matrices. Using a Cholesky transformation to simplify the causality constraint, we derive a Lagrangian dual formulation and develop a block coordinate descent algorithm with explicit update formulas. We establish linear convergence of the algorithm, with explicit convergence rates, and prove stability of the optimal coupling under marginal covariance perturbations and derive a statistical error bound. We further show its equivalence to Sinkhorn iterations. Numerical experiments demonstrate the computational efficiency of the proposed algorithm and illustrate the predictive advantages of causal couplings.

arXiv (Cornell University)
Geometric Analysis and Curvature Flows
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon