Theoretical guarantees in KL for Diffusion Flow Matching

Marta Gentiloni Silveri, Giovanni Conforti, Alain Durmus
9/12/2024
stat.MLcs.LGmath.PR

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Flow Matching (FM) (also referred to as stochastic interpolants or rectified flows) stands out as a class of generative models that aims to bridge in finite time the target distribution $ν^\star$ with an auxiliary distribution $μ$, leveraging a fixed coupling $π$ and a bridge which can either be deterministic or stochastic. These two ingredients define a path measure which can then be approximated by learning the drift of its Markovian projection. The main contribution of this paper is to provide relatively mild assumptions on $ν^\star$, $μ$ and $π$ to obtain non-asymptotics guarantees for Diffusion Flow Matching (DFM) models using as bridge the conditional distribution associated with the Brownian motion. More precisely, we establish bounds on the Kullback-Leibler divergence between the target distribution and the one generated by such DFM models under moment conditions on the score of $ν^\star$, $μ$ and $π$, and a standard $L^2$-drift-approximation error assumption.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{silveri2024theoretical,
  title  = {Theoretical guarantees in KL for Diffusion Flow Matching},
  author = {Marta Gentiloni Silveri and Giovanni Conforti and Alain Durmus},
  year   = {2024},
  eprint = {2409.08311},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2409.08311},
  url    = {http://arxiv.org/abs/2409.08311v1},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.08311.svg)](https://codeofpaper.com/paper/2409.08311)

Discussion