Advantage-weighted conditional optimal transport flow matching simultaneously steers flow policies toward high-value actions and straightens their integration paths, enabling 2-3 step inference while improving task success.
Conditional Optimal Transport on Function Spaces
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
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.
representative citing papers
A mathematical review of flow matching techniques for generative models, showing characterizations via couplings, kernels, and processes, with application to inverse problems.
citing papers explorer
-
Optimal Transport Q-Learning for Flow Policy Steering and Acceleration
Advantage-weighted conditional optimal transport flow matching simultaneously steers flow policies toward high-value actions and straightens their integration paths, enabling 2-3 step inference while improving task success.
-
Flow Matching: Markov Kernels, Stochastic Processes and Transport Plans
A mathematical review of flow matching techniques for generative models, showing characterizations via couplings, kernels, and processes, with application to inverse problems.