Pith. sign in

REVIEW 2 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.05672 v3 pith:USS2CBKT submitted 2023-11-09 math.OC math.PRstat.COstat.ML

Conditional Optimal Transport on Function Spaces

classification math.OC math.PRstat.COstat.ML
keywords optimaltransportconditionalfunctioninferencemapsspacesamortized
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optimal Transport Q-Learning for Flow Policy Steering and Acceleration

    cs.RO 2026-07 conditional novelty 6.0

    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.

  2. Flow Matching: Markov Kernels, Stochastic Processes and Transport Plans

    cs.LG 2025-01 unverdicted novelty 2.0

    A mathematical review of flow matching techniques for generative models, showing characterizations via couplings, kernels, and processes, with application to inverse problems.