Graphical Modeling from Marginal Information via Optimal Transport
Abstract
A graphical model represents multivariate interactions through conditional independence, but requires jointly observed samples to be fitted to data. When individuals cannot be tracked and only marginal observations are available, as with destructive measurements leading to cross-sectional data, the problem of graphical modeling is confounded with that of assembling a joint law. We show how simultaneous graphical modeling and joint law assembly can be realized via a multi-marginal optimal transport problem with graphical cost. Focusing on Gaussian marginals, we generate a joint law satisfying the Markov properties prescribed by a given graph. Within the class of joint distributions respecting the graph and marginals constraints, our construction selects a member by making the interactions set by the graph as strong as possible under a dependence budget measured by relative entropy. In the empirical setting, where only estimates of the marginals are available, we examine the stability of the problem under perturbations of both the marginals and of the graph weights. The resulting error splits into an estimation term, vanishing with the sample size, and a specification term, which quantifies the cost of a misspecified graph. Finally, we illustrate these findings by numerical experiments.
Related
- Multi-marginal optimal transport on sub-Riemannian manifolds
- Multi-Marginal Inverse Optimal Transport for Contrastive Learning Via Explicit Anchor-Positive-Negative Coupling
- A Self-Coupling Gaussian Extremal Inequality for Information-Constrained Optimal Transport with Applications to Rate-Distortion-Perception
- One-Step Generative Modeling via Unbalanced Optimal Transport
- Barron Optimal Transport I: Generative Modeling
BibTeX
@misc{naepels2026graphical,
title = {{Graphical Modeling from Marginal Information via Optimal Transport}},
author = {Ulysse Naepels and Paul Freulon and Victor M. Panaretos},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.40070},
eprint = {2610.40070},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.40070},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Graphical Modeling from Marginal Information via Optimal Transport
AU - Ulysse Naepels
AU - Paul Freulon
AU - Victor M. Panaretos
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.40070
UR - https://arxiv.org/abs/2610.40070
AB - A graphical model represents multivariate interactions through conditional independence, but requires jointly observed samples to be fitted to data. When individuals cannot be tracked and only marginal observations are available, as with destructive measurements leading to cross-sectional data, the problem of graphical modeling is confounded with that of assembling a joint law. We show how simultaneous graphical modeling and joint law assembly can be realized via a multi-marginal optimal transport problem with graphical cost. Focusing on Gaussian marginals, we generate a joint law satisfying the Markov properties prescribed by a given graph. Within the class of joint distributions respecting the graph and marginals constraints, our construction selects a member by making the interactions set by the graph as strong as possible under a dependence budget measured by relative entropy. In the empirical setting, where only estimates of the marginals are available, we examine the stability of the problem under perturbations of both the marginals and of the graph weights. The resulting error splits into an estimation term, vanishing with the sample size, and a specification term, which quantifies the cost of a misspecified graph. Finally, we illustrate these findings by numerical experiments.
ER -