BézierFlow: Learning Bézier Stochastic Interpolant Schedulers for Few-Step Generation

KAIST
* Equal Contribution

TL;DR

BézierFlow optimizes the sampling trajectory to achieve a 2–3× performance improvement for few-step generation with ≤ 10 NFEs. As illustrated in the figure below, BézierFlow closely follows the sampling trajectory of the high-NFE teacher using only 3 NFEs. Training takes only ~15 minutes!

BézierFlow Teaser

Abstract

We introduce BézierFlow, a lightweight training approach for few-step generation with pretrained diffusion and flow models. BézierFlow achieves a 2–3× performance improvement for sampling with ≤ 10 NFEs while requiring only 15 minutes of training.

Recent lightweight training approaches have shown promise by learning optimal timesteps, but their scope remains restricted to ODE discretizations. To broaden this scope, we propose learning the optimal transformation of the sampling trajectory by parameterizing stochastic interpolant (SI) schedulers. The main challenge lies in designing a parameterization that satisfies critical desiderata, including boundary conditions, differentiability, and monotonicity of the SNR.

To effectively meet these requirements, we represent scheduler functions as Bézier functions, where control points naturally enforce these properties. This reduces the problem to learning an ordered set of points in the time range, while the interpretation of the points changes from ODE timesteps to Bézier control points. Across a range of pretrained diffusion and flow models, BézierFlow consistently outperforms prior timestep-learning methods, demonstrating the effectiveness of expanding the search space from discrete timesteps to Bézier-based trajectory transformations.

Qualitative Comparisons

For pretrained diffusion and flow models, BézierFlow consistently produces sharper details and fewer artifacts at low NFEs compared to baselines across various solvers and datasets.

ImageNet 256 x 256

NFE
Base (RK2)
DMN
GITS
Bespoke
LD3
BézierFlow
6
8

Stable Diffusion v3.5

Base Solver: RK1 (Euler)

NFE
Base (RK1)
DMN
GITS
Bespoke
LD3
BézierFlow
6
8

Base Solver: RK2 (Midpoint)

NFE
Base (RK2)
DMN
GITS
Bespoke
LD3
BézierFlow
6
8

Quantitative Comparisons

BézierFlow consistently achieves significantly lower FID scores compared to base solvers across various diffusion and flow models, demonstrating the effectiveness of Bézier-based trajectory transformations at low NFEs.

FID Comparison with Diffusion Models

FID Comparison with Diffusion Models

FID Comparison with Flow Models

FID Comparison with Flow Models

More Results on Different Domains

BézierFlow is a generic framework applicable not only to image generation but also to various generative tasks, such as 3D point cloud generation and layout generation.

3D Point Cloud Generation

NFE
Base (iPNDM)
DMN
GITS
LD3
BézierFlow
6
8

Layout Generation

NFE
Base (RK1)
DMN
GITS
Bespoke
LD3
BézierFlow
Teacher
6
8

Method Overview

Problem Definition

Our goal is to optimize a target path (student) that achieves high-quality generation with few NFEs by mimicking a source path (teacher) that uses many steps. We formulate this as a teacher-forcing objective:

$$ \min_\theta \mathcal{L}(\theta) = \mathbb{E}_{x_0 \sim p_0}\big[ d\big(\xi(x_0, \{t_i\}_{i=1}^N; S_\phi), \bar{\xi}_\theta(x_0, \{s_i\}_{i=1}^M; S_\phi)\big)\big] $$

where \(\xi\) and \(\bar{\xi}_\theta\) are the teacher (\(N\) steps) and student (\(M\) steps) solvers, respectively, and \(M \ll N\).

Bézier Stochastic Interpolant Scheduler

We propose BézierFlow, which parameterizes the target scheduler \((\bar\alpha^\theta_s, \bar\sigma^\theta_s)\) using Bézier curves. We relate the target and source schedulers via a scaling reparameterization \(\bar{x}_s = c_s x_{t_s}\), where:

$$ \begin{aligned} c_s &= \begin{cases} \frac{\bar\sigma^\theta_s}{\sigma_{t_s}} = \frac{\bar\alpha^\theta_s}{\alpha_{t_s}}, &0 < s< 1, \\ 1,&\text{otherwise}, \\ \end{cases} \\ t_s &=\rho^{-1}\big(\bar{\rho}^\theta_s\big), \qquad \rho(t)=\frac{\alpha_t}{\sigma_t},\,\, \bar\rho^\theta_s=\frac{\bar\alpha^\theta_s}{\bar\sigma^\theta_s} \end{aligned} $$

This ensures smoothness (\(C^2\) continuity) and allows for analytic computation of the transformed velocity field:

$$ \bar{u}_s(\bar{x}_s) = \Big(\partial_s\log c_s\Big)\,\bar x_s + c_s\,\frac{dt_s}{ds}\;u_{t_s}\!\Big(\frac{\bar x_s}{c_s}\Big) $$

This Bézier-based parameterization enables stable optimization of the sampling trajectory while preserving the endpoint marginals, effectively minimizing dicretization error of few-step generation.

Related Links

BibTeX

@article{min:2025bezierflow,
  title={B\'ezierFlow: Learning B\'ezier Stochastic Interpolant Schedulers for Few-Step Generation},
  author={Min, Yunhong and Koo, Juil and Yoo, Seungwoo and Sung, Minhyuk},
  journal={arXiv preprint arXiv:2512.13255},
  year={2025}
}