Flow Matching from Non-Gaussian Sources: A Theory of Efficient Sampling
Yuchen Zhou, Lili Zheng, Yuxin Chen, Gen Li
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 has an everywhere positive, continuously differentiable density, finite total variance TotVarbase, and an L-Lipschitz score. Using the population velocity field and a suitable time grid, this sampler achieves total variation error at most in O(LdTotVarbase/) iterations, provided the target distribution satisfies a mild second-moment condition. These assumptions cover, among many examples, source distributions such as multivariate Student's t 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.
Create a lesson
Related papers
Bayesian optimization on amortized search space
Tristan Fauvel, Federico Pavone, Titouan Guillou et al.
Exact Bayesian layers via characteristic functions
William H. W. Thompson, Guillaume St-Onge, Laurent Hébert-Dufresne et al.
Conformal Selection for Hierarchical Streaming Data
Zhenyuan Sun, Chengyao Yu, Ruixing Ming et al.
A Statistical Framework for Training Data Auditing of Large Language Models
Shengjie Niu, Yeheng Ge, Jian Huang
Hellinger Decision Trees for Density Ratio Estimation: Finite-Sample Guarantees
Ren-Rui Liu, Zheng-Chu Guo
Differentially Private Score Estimation with Applications to Score-Based Generative Models
Mengxiao Gao, Elly K. H. Hung, Yuchen Wu et al.