The paper introduces multifidelity techniques for building triangular transport maps when high‑fidelity data are limited but low‑fidelity data are plentiful. Two strategies are proposed: a hierarchical approach that composes maps across fidelity levels, and a non‑hierarchical method that uses monotonicity‑preserving corrections to incorporate low‑fidelity information. Numerical tests show these methods outperform single‑fidelity transport and, when applied to amortized simulation‑based inference, improve conditional sampling and uncertainty quantification in data‑scarce regimes.
By Owen Davis, Daniel Sharp, Youssef Marzouk, Gianluca Geraci
arXiv:2606. 30574v1 Announce Type: new Abstract: Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map.
By Sivaraman Balakrishnan
Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map. In applications like generative modeling, the transport cost itself is irrelevant, and this makes it natural to target maps which are more tractable from either a statistical or computational standpoint.
The paper introduces Distribution‑Conditioned Transport (DCT), a framework that learns transport maps conditioned on embeddings of source and target distributions, allowing generalization to unseen distribution pairs. DCT supports semi‑supervised learning for distributional forecasting by leveraging distributions observed at only one condition. It is agnostic to the transport mechanism and is demonstrated on synthetic benchmarks and four biological applications, including batch effect transfer in single‑cell genomics and modeling T‑cell receptor sequence evolution.
By Nic Fishman, Gokul Gowri, Paolo L. B. Fischer, Marinka Zitnik, Omar Abudayyeh, Jonathan Gootenberg
arXiv:2606. 05327v1 Announce Type: new Abstract: Flow matching (FM) has emerged as a powerful framework for learning dynamic transport maps between two empirical distributions.
By Raghav Kansal, David Crair, Nghia Nguyen, Scott Pope, Bradley Parry
arXiv:2602.19600v2 Announce Type: replace
Abstract: Many high-dimensional datasets concentrate near a low-dimensional structure embedded in the ambient space. Generative models for such data must con...
By Xinyu Tian, Xiaotong Shen
arXiv:2606. 06272v1 Announce Type: new Abstract: Generative Flow Networks (GFlowNets) are a framework for sampling structured objects via stochastic trajectories in a directed graph.
By Ian Maksimov, Nikita Morozov, Denis Belomestny, Sergey Samsonov
arXiv:2606. 29724v1 Announce Type: new Abstract: Normalizing flows are powerful generative models that learn an invertible mapping between complex data distributions and simple latent distributions, typically a standard normal density.
By Liam A. Kruse, Houjun Liu, Alexandros E. Tzikas, Mansur M. Arief, Mykel J. Kochenderfer
arXiv:2605. 15407v3 Announce Type: replace-cross Abstract: We consider amortized Bayesian inference for nonlinear inverse problems using only samples from the joint distribution of parameters and observations, including problems with unknown functions in a Banach space.
By Ricardo Baptista, Hojjat Kaveh, Andrew M. Stuart
Normalizing flows are powerful generative models that learn an invertible mapping between complex data distributions and simple latent distributions, typically a standard normal density. However, this choice of latent density can impose unnecessary complexity on the learned flow transformation due to the topological mismatch between the latent and data densities, leading to slower training and suboptimal performance.
arXiv:2606. 04092v1 Announce Type: cross Abstract: Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution.
By Shimon Malnick, Matan Rusanovsky, Ohad Fried, Shai Avidan
arXiv:2606. 02515v1 Announce Type: new Abstract: Optimal transport (OT) provides a principled framework for mapping between probability distributions.
By Yeganeh Marghi, Kelly Jin, Uygar S\"umb\"ul