stat.MLNov 19, 2026

Flow Matching from Non-Gaussian Sources: A Theory of Efficient Sampling

Authors: Yuchen Zhou, Lili Zheng, Yuxin Chen, Gen Li

Organizations: Department of Statistics, University of Illinois Urbana-Champaign. · Department of Statistics and Data Science, the Wharton School, University of Pennsylvania. · Department of Statistics and Data Science, Chinese University of Hong Kong.

Abstract

Flow matching is a versatile framework for generative modeling that transports a source distribution to a target data distribution. A key advantage is its flexibility in the choice of source distribution, such as heavy-tailed and multimodal sources. Yet finite-step sampling guarantees for non-Gaussian sources remain limited. We establish a nonasymptotic convergence theory for Euler discretization of flow matching with linear interpolation. Suppose the source distribution on Rd\mathbb{R}^d has an everywhere positive, continuously differentiable density, finite total variance TotVarbase\mathsf{TotVar}_{\mathsf{base}}, and an LL-Lipschitz score. Using the population velocity field and a suitable time grid, this sampler achieves total variation error at most ε\varepsilon in O~(LdTotVarbase/ε)\widetilde{O}(Ld\mathsf{TotVar}_{\mathsf{base}}/\varepsilon) iterations, provided the target distribution satisfies a mild second-moment condition. These assumptions cover, among many examples, source distributions such as multivariate Student's tt distributions with more than two degrees of freedom and finite Gaussian mixtures with shared covariance, while accommodating target distributions with neither a smooth density nor bounded support.

Explore similar work

Nov 1, 2026

Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching

Flow matching has emerged as a promising alternative to diffusion-based generative modeling, offering a continuous-time ordinary differential equation formulation with fast sampling and a simple regression-based training objective. Despite its empirical success, some theoretical analyses idealize the learning procedure by assuming that the velocity field is obtained by exact empirical risk minimization. This assumption does not reflect the practical finite-dataset setting, where the empirical flow-matching loss is only approximately minimized by a finite number of stochastic-gradient updates. We develop an empirical-risk-minimizer-free analysis for flow matching that explicitly accounts for both finite-sample statistical error and finite-time empirical optimization error. Our analysis considers a finite dataset of NN flow-matching samples and a learned parameter θTθ_T obtained after TT stochastic gradient updates on the empirical objective. Under regularity assumptions on the interpolation path, sub-exponential source and target distributions, approximation by a bounded-parameter smooth neural velocity class, empirical-loss optimization, and uniform flow stability, we prove a guarantee that holds with high probability over the finite training dataset and in expectation over the stochastic-gradient randomness. The resulting bound separates approximation error, statistical error from the finite dataset, tail error from unbounded source and target distributions, and empirical optimization error from approximate minimization of the finite-sample objective.
May 9, 2026

Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions

Flow Matching has recently emerged as a popular class of generative models for simulating a target distribution μ1μ_1 from samples drawn from a source distribution μ0μ_0. This framework relies on a fixed coupling between μ0μ_0 and μ1μ_1, and on a deterministic or stochastic bridge to define an interpolating process between the two distributions. The time marginals of this process can then be approximately sampled by estimating the transition rates, or more generally the generator, of its Markovian projection. This framework has recently been extended to the case of discrete source and target distributions, under the name Discrete Flow Matching (DFM). However, theoretical guarantees for such models remain scarce. In this paper, we study two DFM models on Zmd={0,…,m−1}d\mathbb{Z}_m^d = \{0,\ldots,m-1\}^d, sampled through time discretization, and derive non-asymptotic associated bounds for both of them. In contrast to previous work, we establish non-asymptotic bounds in Kullback--Leibler divergence for the early-stopped version of the target distribution. We also derive explicit convergence guarantees in total variation distance with respect to the true target distribution. Importantly, these bounds rely only on an approximation error assumption, relaxing standard score assumptions used in earlier works, while also yielding improved dependence on the vocabulary size mm and the dimension dd.
Sep 30, 2026

Correcting CondOT: Exact Finite-Step Sampling in Gaussian Flow Matching

Flow matching generates samples by gradually transforming noise into data. In practice, using a finite number of sampling steps introduces a numerical error that depends on the chosen schedule. We study this dependence for Gaussian targets and the explicit midpoint sampling method, using the exact flow field. We measure sampling error by the squared Wasserstein distance between the target distribution and the final distribution produced by the midpoint sampler. We show that the standard conditional optimal transport (CondOT) schedule cancels the leading midpoint error and improves the general convergence bound, even when the sampling steps are unequally spaced. On a uniform grid of SS sampling steps, we fix the signal schedule at αt=tα_t=t and prove the existence of scalar noise schedules βtβ_t that approach the CondOT noise schedule 1−t1-t at rate 1/S1/S and yield exact Gaussian sampling for every sufficiently large SS. Controlled Gaussian experiments illustrate the convergence rates and exact calibration.