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. 04092v1 Announce Type: cross Abstract: Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution.
The paper introduces Flow Divergence Sampler (FDS), a training‑free method that refines intermediate states in flow‑matching models by using the divergence of the marginal velocity field to detect and correct misguidance toward low‑density regions. FDS operates during inference, requires no additional training, and can be applied as a plug‑and‑play module with standard solvers and existing flow backbones. Experiments show that FDS consistently improves fidelity in tasks such as text‑to‑image synthesis and inverse problems.
The paper introduces the Variational Incompressible Optimal Transport (VIOT) operator, a generative neural operator that predicts divergence‑free velocity fields for incompressible density transport. VIOT combines a stream‑function representation, a regularized transport objective, and a Fourier Neural Operator backbone to amortize the solve across new source‑target pairs and grid resolutions. Experiments on 2D and 3D benchmarks show that VIOT produces full transport trajectories in seconds, achieving roughly a $10^4 imes$ speedup over per‑instance baselines that require hours of optimization.
arXiv:2607. 14652v1 Announce Type: new Abstract: Topology optimisation (TO) often requires repeated finite element analysis and sensitivity-based material updates, which can be costly when multiple candidate designs are needed under varying physical and design conditions.
arXiv:2607. 14424v1 Announce Type: cross Abstract: In recent years Flow Matching has become a prominent method for generative modeling robot motion generation.
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:2610.01408v1 Announce Type: new Abstract: Trajectory crossing remains a critical bottleneck in Flow Matching (FM), and previous works typically view these crossings from a theoretical optimizat...
The paper introduces Quantile AlignTree Flow Matching (QAT‑FM), a structured coupling method that builds a hierarchical, quantile‑aligned tree to connect a Gaussian prior with a target distribution. QAT‑FM achieves efficient coupling construction in ≠ Nd log N time and allows per‑pair source sampling in ≠ d time, enabling scalable training for high‑dimensional generative tasks. The authors prove that the coupling preserves marginal consistency, produces non‑crossing interpolation paths, and improves path separation compared to independent coupling, while also extending naturally to conditional generation.
arXiv:2608.21070v1 Announce Type: cross Abstract: Inferring continuous system evolution from sparse temporal snapshots is a key challenge in generative modeling and single-cell omics. While Optimal T...
The paper introduces COFM, a framework for consistent optimal transport flow matching that uses partially input convex neural networks (PICNN) to parameterize the transport potential. By adding a Hamilton‑Jacobi residual to the training objective, COFM enforces dynamical consistency and supports both one‑step transport and multi‑step ODE sampling without costly inner optimization. Experiments on benchmark datasets show that COFM achieves competitive performance while reducing L^2‑UVP by over 2× and cutting computational time by about 9× compared to state‑of‑the‑art models.
arXiv:2607. 12171v1 Announce Type: cross Abstract: In rectified-flow-based generative models, the neural network can be trained to predict two different targets, such as the instantaneous velocity or the data endpoint, to perform denoising.
Generative models for function-valued data, such as time series and solutions of partial differential equations, must learn distributions over infinite-dimensional spaces. Functional Flow Matching (FF...