Elucidating Rectified Flow with Deterministic Sampler: Polynomial Discretization Complexity for Multi and One-step Models
Ruofeng Yang, Zhaoyu Zhu, Bo Jiang, Cheng Chen, Shuai Li

TL;DR
This paper proves the first polynomial discretization complexity for rectified flow models with deterministic samplers, explaining their empirical success in multi-step and one-step generative tasks.
Contribution
It introduces a polynomial discretization complexity analysis for RF-based models, surpassing previous exponential bounds and comparing favorably to diffusion models.
Findings
RF models achieve better polynomial complexity than diffusion models.
The analysis explains RF models' empirical performance.
First polynomial complexity result for one-step RF models.
Abstract
Recently, rectified flow (RF)-based models have achieved state-of-the-art performance in many areas for both the multi-step and one-step generation. However, only a few theoretical works analyze the discretization complexity of RF-based models. Existing works either focus on flow-based models with stochastic samplers or establish complexity results that exhibit exponential dependence on problem parameters. In this work, under the realistic bounded support assumption, we prove the first polynomial discretization complexity for multi-step and one-step RF-based models with a deterministic sampler simultaneously. For the multi-step setting, inspired by the predictor-corrector framework of diffusion models, we introduce a Langevin process as a corrector and show that RF-based models can achieve better polynomial discretization complexity than diffusion models. To achieve this result, we…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Generative Adversarial Networks and Image Synthesis · Markov Chains and Monte Carlo Methods
