Flow Generator Matching
Zemin Huang, Zhengyang Geng, Weijian Luo, Guo-jun Qi

TL;DR
This paper introduces Flow Generator Matching (FGM), a novel method that accelerates flow-matching models to one-step generation with theoretical guarantees, achieving state-of-the-art results and efficient distillation for text-to-image tasks.
Contribution
The paper proposes FGM, a new approach that enables one-step sampling in flow-matching models while preserving performance, and demonstrates its effectiveness through benchmarks and distillation.
Findings
Achieved a new FID score of 3.08 on CIFAR10 with one-step FGM.
Successfully distilled Stable Diffusion 3 into a one-step model.
MM-DiT-FGM rivals multi-step models in quality with single-step efficiency.
Abstract
In the realm of Artificial Intelligence Generated Content (AIGC), flow-matching models have emerged as a powerhouse, achieving success due to their robust theoretical underpinnings and solid ability for large-scale generative modeling. These models have demonstrated state-of-the-art performance, but their brilliance comes at a cost. The process of sampling from these models is notoriously demanding on computational resources, as it necessitates the use of multi-step numerical ordinary differential equations (ODEs). Against this backdrop, this paper presents a novel solution with theoretical guarantees in the form of Flow Generator Matching (FGM), an innovative approach designed to accelerate the sampling of flow-matching models into a one-step generation, while maintaining the original performance. On the CIFAR10 unconditional generation benchmark, our one-step FGM model achieves a new…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics
MethodsDiffusion
