Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

We present two neural network approaches that approximate the solutions of static and dynamic unicodex1D450unicodex1D45Cunicodex1D45Bunicodex1D451unicodex1D456unicodex1D461unicodex1D456unicodex1D45Cunicodex1D45Bunicodex1D44Eunicodex1D459unicodex0020unicodex1D45Cunicodex1D45Dunicodex1D461unicodex1D456unicodex1D45Aunicodex1D44Eunicodex1D459unicodex0020unicodex1D461unicodex1D45Funicodex1D44Eunicodex1D45Bunicodex1D460unicodex1D45Dunicodex1D45Cunicodex1D45Funicodex1D461 (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inferenceunicodex2013particularly in the simulation-based (unicodex201Clikelihood-freeunicodex201D) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input-convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.