Learning Straight Flows: Variational Flow Matching for Efficient Generation

Chenrui Ma, Xi Xiao, Tianyang Wang, Xiao Wang, Yanning Shen
11/15/2025
cs.LGcs.CV

No official code found. Best implementation: merry7cherry/S-VFM (6 stars, last commit 2025-12-02).

Abstract

Flow Matching has limited ability in achieving one-step generation due to its reliance on learned curved trajectories. Previous studies have attempted to address this limitation by either modifying the coupling distribution to prevent interpolant intersections or introducing consistency and mean-velocity modeling to promote straight trajectory learning. However, these approaches often suffer from discrete approximation errors, training instability, and convergence difficulties. To tackle these issues, in the present work, we propose \textbf{S}traight \textbf{V}ariational \textbf{F}low \textbf{M}atching (\textbf{S-VFM}), which integrates a variational latent code representing the ``generation overview'' into the Flow Matching framework. \textbf{S-VFM} explicitly enforces trajectory straightness, ideally producing linear generation paths. The proposed method achieves competitive performance across three challenge benchmarks and demonstrates advantages in both training and inference efficiency compared with existing methods.

View on arXivView PDF

Code Implementations(1)

merry7cherry/S-VFMCommunity71%

Learning Straight Flows: Variational Flow Matching for Efficient Generation

60Dec 2, 202510 months ago

Similar Papers

Cite this paper

@article{ma2025learning,
  title  = {Learning Straight Flows: Variational Flow Matching for Efficient Generation},
  author = {Chenrui Ma and Xi Xiao and Tianyang Wang and Xiao Wang and Yanning Shen},
  year   = {2025},
  eprint = {2511.17583},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.17583v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.17583.svg)](https://codeofpaper.com/paper/2511.17583)

Discussion