From discrete-time policies to continuous-time diffusion samplers: Asymptotic equivalences and faster training

Julius Berner, Lorenz Richter, Marcin Sendera, Jarrid Rector-Brooks, Nikolay Malkin
1/10/2025
cs.LGstat.ML

No official code found. Best implementation: GFNOrg/gfn-diffusion (38 stars, last commit 2025-03-29).

Abstract

We study the problem of training neural stochastic differential equations, or diffusion models, to sample from a Boltzmann distribution without access to target samples. Existing methods for training such models enforce time-reversal of the generative and noising processes, using either differentiable simulation or off-policy reinforcement learning (RL). We prove equivalences between families of objectives in the limit of infinitesimal discretization steps, linking entropic RL methods (GFlowNets) with continuous-time objects (partial differential equations and path space measures). We further show that an appropriate choice of coarse time discretization during training allows greatly improved sample efficiency and the use of time-local objectives, achieving competitive performance on standard sampling benchmarks with reduced computational cost.

View on arXivView PDF

Code Implementations(1)

387PythonFeb 5, 20241 years ago

Similar Papers

Cite this paper

@article{berner2025from,
  title  = {From discrete-time policies to continuous-time diffusion samplers: Asymptotic equivalences and faster training},
  author = {Julius Berner and Lorenz Richter and Marcin Sendera and Jarrid Rector-Brooks and Nikolay Malkin},
  year   = {2025},
  eprint = {2501.06148},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.06148v1}
}

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/2501.06148.svg)](https://codeofpaper.com/paper/2501.06148)

Discussion