Flow matching (FM) has gained significant attention as a simulation-free generative model. Unlike diffusion models, which are based on stochastic differential equations, FM employs a simpler approach by solving an ordinary differential equation with an initial condition from a normal distribution, thus streamlining the sample generation process. This paper discusses the convergence properties of FM in terms of the $p$-Wasserstein distance, a measure of distributional discrepancy. We establish that FM can achieve the minmax optimal convergence rate for $1 \leq p \leq 2$, presenting the first theoretical evidence that FM can reach convergence rates comparable to those of diffusion models. Our analysis extends existing frameworks by examining a broader class of mean and variance functions for the vector fields and identifies specific conditions necessary to attain these optimal rates.

该论文讨论了流匹配在$p$-Wasserstein距离方面的收敛性质，通过研究一类更广泛的向量场的均值和方差函数，确定实现这些最优速率所必需的特定条件，并且证明了流匹配能够达到与扩散模型相当的收敛速率，从而为流匹配作为一种无需模拟的生成模型提供了第一条理论证据。

流匹配实现最小极大均衡收敛