Skip to content

Training-Free Refinement of Flow Matching with Divergence-based Sampling

Apr 2026 · arXiv.org · Vol abs/2604.04646 · 4 citations · 46 references
Computer Science

TL;DR

The Flow Divergence Sampler is proposed, a training-free framework that refines intermediate states before each solver step that consistently improves fidelity across various generation tasks including text-to-image synthesis, and inverse problems.

Abstract

Flow-based models learn a target distribution by modeling a marginal velocity field, defined as the average of sample-wise velocities connecting each sample from a simple prior to the target data. When sample-wise velocities conflict at the same intermediate state, however, this averaged velocity can misguide samples toward low-density regions, degrading generation quality. To address this issue, we propose the Flow Divergence Sampler (FDS), a training-free framework that refines intermediate states before each solver step. Our key finding reveals that the severity of this misguidance is quantified by the divergence of the marginal velocity field that is readily computable during inference with a well-optimized model. FDS exploits this signal to steer states toward less ambiguous regions. As a plug-and-play framework compatible with standard solvers and off-the-shelf flow backbones, FDS consistently improves fidelity across various generation tasks including text-to-image synthesis, and inverse problems.

View source

Similar papers

#machine learning Preprint Oct 2026

Few-Step Generation via Data-Space Iteration

Flow matching has emerged as a scalable paradigm for training high-quality generative models, but sampling from the learned probability flow requires many network evaluations. Distillation can reduce this cost to one or a few evaluations; however, one-step generation often sacrifices quality, making few-step generation...

Shanchuan Lin, Yan-Song Peng, Fu-Yun Wang et al. · 0 citations
#machine learning Preprint Sep 2026

Unifying Distributional Training for One-Step Visual Generation

A unified theoretical framework is introduced that separates distribution modeling from matching discrepancy and connects global objectives to pointwise feature updates through Wasserstein gradient flow and motivates MGFlow, which models feature distributions with Gaussian mixtures at an adjustable granularity between...

Chi Zhang, Hao-Yan Shi, Yue-Yi Liu et al. · 2 citations
Preprint Sep 2026

Classifier-Free Guidance in Flow Matching: Non-Autonomous Potentials, Overshoot, and Posterior-Mean Control

Classifier-free guidance (CFG) improves conditional generation in Flow Matching, but strong guidance can distort the generated distribution and reduce diversity. We provide a geometric account of this behavior by viewing Flow Matching as a time-varying gradient flow and characterizing how CFG reshapes its underlying po...

Ji-Shen Peng, Zheng Ma · 0 citations
Preprint Aug 2026

Off-Manifold Refinement: Guiding Video Generators with a Frozen World Model

Modern video generators routinely fail at physical dynamics: objects float, trajectories violate gravity, contacts vanish. Standard denoising and flow-matching objectives fit visual data distributions but do not explicitly penalize such physical violations. Existing remedies can improve physical consistency, but typica...

Hai Nguyen-Truong, Tuan-Anh Vu, Dang T. Huynh · 2 citations
Preprint Sep 2026

DecFlowEdit: Self-Localized Flow-based Image Editing via Guidance Decoupling

Flow-based image editing (FlowEdit) enables inversion-free semantic changes through the difference between source and target velocities. In this paper, we observe that FlowEdit's default classifier-free guidance (CFG) configuration, with asymmetric source and target scales, causes substantial background leakage. Matchi...

Zhe-Yuan Zhan, Can Wang, Jia-Wei Chen et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Contextual Flow Matching: Adaptive Step Selection in Flow Models for Efficient Visual Generation

Flow Matching enables high-quality visual generation via continuous-time dynamics, but inference remains costly due to multiple sequential function evaluations. Existing acceleration methods reduce the number of function evaluations but often introduce additional training overhead, degrade quality, or fail to account f...

D. J. Bajpai, Arun Verma, M. Hanawal · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.