Flow Matching has recently emerged as a popular class of generative models for simulating a target distribution $μ_1$ from samples drawn from a source distribution $μ_0$. This framework relies on a fixed coupling between $μ_0$ and $μ_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 $\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 $m$ and the dimension $d$.
Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows
The University of Texas at Austin(德克萨斯大学奥斯汀分校);Stevens Institute of Technology(史蒂文斯理工学院);The University of Hong Kong(香港大学);University of Wisconsin-Madison(威斯康星大学麦迪逊分校);South China University of Technology(华南理工大学);The Simons Institute for the Theory of Computing(西蒙斯理论计算研究所)
Online Algorithms via Minimax and Posterior Matching
University of Bonn(波恩大学);Institute of Computer Science, University of Bonn(波恩大学计算机科学学院);Microsoft Research(微软研究院);PUC-Rio(里约热内卢天主教大学);Georgia Tech(佐治亚理工学院);School of Mathematics, Georgia Tech(佐治亚理工学院数学学院);School of Computer Science, Georgia Tech(佐治亚理工学院计算机科学学院)
Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation
Department of Computer Science, Carnegie Mellon University(计算机科学系,卡内基梅隆大学);Department of Surgery, Division of Cardiothoracic Surgery, Medical University of South Carolina(外科系,心胸外科 division,南卡罗来纳医学大学)
Match Made with Matrix Completion: Efficient Learning under Matching Interference
Naveen Jindal School of Management, University of Texas at Dallas(德克萨斯大学达拉斯分校纳维恩·金达尔管理学院);Foster School of Business, University of Washington(华盛顿大学福斯特商学院);W. P. Carey School of Business, Arizona State University(亚利桑那州立大学W.P.凯里商学院)
OPTIMUS-Prime: Minimal and Sufficient Concept Explanations for Deep Vision Models
Université de Lorraine(洛林大学);CentraleSupélec Loria(中央超导Loria);CNRS(国家科学研究中心);Metz, France(法国梅斯);Université de technologie de Compiègne UMR CNRS 7253 Heudiasyc(图卢兹技术大学UMR CNRS 7253 Heudiasyc);France(法国)