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.
The paper introduces CAT-Flow, a pair of lightweight, training‑free algorithms—CAT‑OV and CAT‑OT—that adapt step‑sizes during Flow Matching inference by estimating curvature in time or state space. These methods avoid extra neural evaluations and achieve constant‑order truncation error bounds. Experiments show that CAT‑OV and CAT‑OT improve image quality metrics across four text‑to‑image Flow Matching models, cutting the required generation steps by up to 40%.
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:2610.03202v1 Announce Type: cross Abstract: Flow Matching enables high-quality visual generation via continuous-time dynamics, but inference remains costly due to multiple sequential function e...
arXiv:2607. 26398v1 Announce Type: new Abstract: Diffusion and flow-based models benefit from simple regression losses, but inference incurs significant overhead because sampling requires integration.
We study path-flow alignment as a unified training objective for flow matching. Instead of fixing the interpolation path and learning only the velocity field, we jointly train an endpoint-preserving p...
arXiv:2606. 02177v1 Announce Type: new Abstract: Flow Matching typically relies on white noise sources, a choice often misaligned with the power spectra of natural data, which tend to decay with frequency.
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.
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:2610.08717v1 Announce Type: cross Abstract: We study path-flow alignment as a unified training objective for flow matching. Instead of fixing the interpolation path and learning only the veloci...
arXiv:2601.20250v2 Announce Type: replace Abstract: Recently, flow-based generative models have shown superior efficiency compared to diffusion models. In this paper, we study rectified flow models,...
The paper introduces data‑space iteration, a few‑step generation framework that eliminates the need for a fixed probability‑flow discretization. By refining predictions directly in data space with a shared generator, each iteration is trained to produce the best possible sample within its capacity. Experiments on class‑conditional ImageNet 256×256 show that data‑space iteration outperforms standard discretization baselines and matches or improves upon schedule‑searched variants without schedule‑specific training.
arXiv:2608.29208v1 Announce Type: cross Abstract: Vision-Language-Action (VLA) models, built upon Vision-Language Models (VLMs), have significantly enhanced robotic capabilities by leveraging interne...
Pixel-space generative models bypass lossy latent compression, yet necessitate joint learning of global structure and fine-grained details in a high-dimensional space. Standard flow matching interpolates noise toward a fixed clean-image endpoint, leaving the spectral evolution to be learned implicitly.