Dynamic Conditional Optimal Transport through Simulation-Free Flows
Gavin Kerrigan, Giosue Migliorini, Padhraic Smyth
TL;DR
We address conditional sampling for complex or infinite-dimensional problems by developing a dynamic, geometric theory of conditional optimal transport (COT) that extends the Benamou–Brenier formulation. The authors integrate this framework with triangular transport maps and flow matching to produce a simulation-free, flow-based conditional generator (COT-FM) that operates in function spaces and other high-dimensional settings. Theoretical contributions include a conditional Wasserstein space with constant-speed geodesics, a conditional Benamou–Brenier theorem, and a flow-matching scheme that learns a triangular velocity field to interpolate between source and target measures. Empirically, the method competes with or surpasses state-of-the-art COT approaches on 2D synthetic tasks, a Lotka–Volterra inverse problem, and a Darcy flow inverse problem, highlighting its applicability to Bayesian inverse problems and amortized likelihood-free inference.
Abstract
We study the geometry of conditional optimal transport (COT) and prove a dynamical formulation which generalizes the Benamou-Brenier Theorem. Equipped with these tools, we propose a simulation-free flow-based method for conditional generative modeling. Our method couples an arbitrary source distribution to a specified target distribution through a triangular COT plan, and a conditional generative model is obtained by approximating the geodesic path of measures induced by this COT plan. Our theory and methods are applicable in infinite-dimensional settings, making them well suited for a wide class of Bayesian inverse problems. Empirically, we demonstrate that our method is competitive on several challenging conditional generation tasks, including an infinite-dimensional inverse problem.
