Optimal Transport Flow Matching by Design
arXiv:2606. 04092v1 Announce Type: cross Abstract: Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution.
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.
arXiv:2606. 04092v1 Announce Type: cross Abstract: Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution.
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.
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.
arXiv:2606. 02515v1 Announce Type: new Abstract: Optimal transport (OT) provides a principled framework for mapping between probability distributions.
arXiv:2608. 01692v1 Announce Type: new Abstract: We propose an instantiation of flow matching that relies on a time-independent velocity field (an \emph{autonomous flow}) to exactly map between two distributions, so long as the target is singular, i.
arXiv:2601. 22495v2 Announce Type: replace Abstract: Fine-tuning flow matching models is a central challenge in settings with limited data, evolving distributions, or computational constraints.
arXiv:2608. 03117v1 Announce Type: new Abstract: The performance of generative diffusion models is determined by the choice of the reference diffusion process connecting the empirical and prior distributions.
arXiv:2605. 00941v4 Announce Type: replace Abstract: Flow matching has become a leading framework for generative modeling, but quantifying the uncertainty of its samples remains an open problem.
arXiv:2602. 01179v2 Announce Type: replace Abstract: Gradual domain adaptation (GDA) aims to mitigate domain shift by progressively adapting models from the source domain to the target domain via intermediate domains.
arXiv:2606. 07481v1 Announce Type: new Abstract: While Computational Fluid Dynamics (CFD) provides high-fidelity flow fields for optimizing indoor environments, its computational cost limits rapid exploration.
Particle-based variational inference (ParVI) methods approximate an intractable target distribution by evolving an ensemble of interacting samples. Existing approaches rely predominantly on kernel-based repulsion (e.
Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields. While theoretical targets favor straight trajectories, empirical networks develop complex path deformations.