Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions
Le-Tuyet-Nhi Pham, Giovanni Conforti, Zhenjie Ren, Alain Durmus

TL;DR
This paper provides theoretical convergence guarantees for Discrete Flow Matching models on finite grids, with bounds in KL divergence and total variation that depend only on approximation error, not score assumptions.
Contribution
It establishes the first non-asymptotic convergence bounds for DFM models under minimal assumptions, improving dependence on vocabulary size and dimension.
Findings
Non-asymptotic KL divergence bounds for early-stopped DFM.
Explicit total variation convergence guarantees.
Bounds depend only on approximation error, not score assumptions.
Abstract
Flow Matching has recently emerged as a popular class of generative models for simulating a target distribution from samples drawn from a source distribution . This framework relies on a fixed coupling between and , 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 , sampled through time discretization, and derive non-asymptotic associated bounds for…
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.
