paper-with-me

Papers

Conditional Optimal Transport on Function Spaces

2023-11-09 · Bamdad Hosseini, Alexander W. Hsu, Amirhossein Taghvaei

We present a systematic study of conditional triangular transport maps in function spaces from the perspective of optimal transportation and with a view towards amortized Bayesian inference. More specifically, we develop a theory of constrained optimal transport problems that describe block-triangular Monge maps that characterize conditional measures along with their Kantorovich relaxations. This generalizes the theory of optimal triangular transport to separable infinite-dimensional function spaces with general cost functions. We further tailor our results to the case of Bayesian inference problems and obtain regularity estimates on the conditioning maps from the prior to the posterior. Finally, we present numerical experiments that demonstrate the computational applicability of our theoretical results for amortized and likelihood-free inference of functional parameters.

📄 PDF Abstract BibTeX arXiv:2311.05672

Code (1)

tadsgroup/conditionalot2023 공식 구현 pytorch

Tasks

Bayesian Inference

Similar Papers 제목 키워드 기반

Functional optimal transport: map estimation and domain adaptation for functional data

2021-02-07 · Jiacheng Zhu, Aritra Guha, Dat Do, Mengdi Xu 외

We introduce a formulation of optimal transport problem for distributions on function spaces, where the stochastic map between functional domains can be partially represented in terms of an (infinite-dimensional) Hilbert…

Domain AdaptationTransfer Learning

Minimax Rates of Estimation for Optimal Transport Map between Infinite-Dimensional Spaces

2025-05-19 · Donlapark Ponnoprat, Masaaki Imaizumi

We investigate the estimation of an optimal transport map between probability measures on an infinite-dimensional space and reveal its minimax optimal rate. Optimal transport theory defines distances within a space of pr…

Conditional Random Ordered Transport Spaces

2026-06-06 · Lei Luo, Jian Yang arxiv

A small Wasserstein distance does not certify that a transformation is admissible. In evidence-constrained, semantic, causal, physical, monotone, or risk-sensitive learning, one must ask not only how far two probability …

Relaxation of optimal transport problem via strictly convex functions

2021-02-15 · Asuka Takatsu

An optimal transport problem on finite spaces is a linear program. Recently, a relaxation of the optimal transport problem via strictly convex functions, especially via the Kullback--Leibler divergence, sheds new light o…

The Curse of Conditions: Analyzing and Improving Optimal Transport for Conditional Flow-Based Generation

2025-03-13 · Ho Kei Cheng, Alexander Schwing

Minibatch optimal transport coupling straightens paths in unconditional flow matching. This leads to computationally less demanding inference as fewer integration steps and less complex numerical solvers can be employed …