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

• URL: http://arxiv.org/abs/2501.06148v1
• Date: Fri, 10 Jan 2025 18:18:25 GMT
• Title: From discrete-time policies to continuous-time diffusion samplers: Asymptotic equivalences and faster training
• Abstract summary: We study the problem of training neural differential equations, or diffusion models, to sample from a Boltzmann distribution without access to target samples.<n>Existing methods for training such models enforce time-reversal of the generative and noising processes.<n>We show that an appropriate choice of coarse time discretization during training allows greatly improved sample efficiency and the use of time-local objectives.
• Score: 16.299508349934754
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Integration Matters: Rollout-Based Training for Constrained Diffusion Models [16.46255955344152]
  Constrained generative models aim to produce samples that satisfy complex feasibility constraints while remaining faithful to the data distribution.<n>Existing constrained generation methods enforce constraints either through training-time optimization or sampling-time correction.<n>We propose a fine-tuning framework that incorporates constraint guidance obtained through online rollout into the training process.
  arXiv  Detail & Related papers  (2026-07-15T22:25:59Z)
• Temporal Difference Learning for Diffusion Models [19.82560792699663]
  We introduce a temporal difference (TD) objective that penalizes inconsistency of the model's multi-step progress along the denoising path.<n>We propose a principled sample-based reweighting method that stabilizes training.
  arXiv  Detail & Related papers  (2026-06-13T01:34:04Z)
• Few-Step Diffusion Sampling Through Instance-Aware Discretizations [16.93105640007355]
  Diffusion and flow matching models generate high-fidelity data by simulating paths defined by Ordinary or Differential Equations (ODEs/SDEs)<n>We propose an instance-aware discretization framework, which learns to adapt timestep allocations based on input-dependent priors.<n>Our method consistently improves generation quality with marginal tuning cost compared to training and negligible inference overhead.
  arXiv  Detail & Related papers  (2026-03-18T12:49:38Z)
• Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching [60.37045080890305]
  We provide the first analysis of the sample complexity for flow-matching based generative models.<n>We decompose the velocity field estimation error into neural-network approximation error, statistical error due to the finite sample size, and optimization error due to the finite number of optimization steps for estimating the velocity field.
  arXiv  Detail & Related papers  (2025-12-01T05:14:25Z)
• Data Unlearning Beyond Uniform Forgetting via Diffusion Time and Frequency Selection [5.350009804371616]
  Data unlearning aims to remove the influence of specific training samples from a trained model without requiring full retraining.<n>We argue that forgetting occurs disproportionately across time and frequency, depending on the model and scenarios.<n>By selectively focusing on specific time-frequency ranges during training, we achieve samples with higher aesthetic quality and lower noise.
  arXiv  Detail & Related papers  (2025-10-20T02:00:12Z)
• Inference-Time Scaling of Diffusion Language Models with Particle Gibbs Sampling [62.640128548633946]
  We introduce a novel inference-time scaling approach based on particle Gibbs sampling for discrete diffusion models.<n>Our method consistently outperforms prior inference-time strategies on reward-guided text generation tasks.
  arXiv  Detail & Related papers  (2025-07-11T08:00:47Z)
• Adaptive Destruction Processes for Diffusion Samplers [12.446080077998834]
  This paper explores the challenges and benefits of a trainable destruction process in diffusion samplers.<n>We show that, when the number of steps is limited, training both generation and destruction processes results in faster convergence and improved sampling quality.
  arXiv  Detail & Related papers  (2025-06-02T11:07:27Z)
• Generative Latent Neural PDE Solver using Flow Matching [8.397730500554047]
  We propose a latent diffusion model for PDE simulation that embeds the PDE state in a lower-dimensional latent space. Our framework uses an autoencoder to map different types of meshes onto a unified structured latent grid, capturing complex geometries. Numerical experiments show that the proposed model outperforms several deterministic baselines in both accuracy and long-term stability.
  arXiv  Detail & Related papers  (2025-03-28T16:44:28Z)
• Neural Flow Samplers with Shortcut Models [19.81513273510523]
  Flow-based samplers generate samples by learning a velocity field that satisfies the continuity equation. While importance sampling provides an approximation, it suffers from high variance.
  arXiv  Detail & Related papers  (2025-02-11T07:55:41Z)
• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework. We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points. Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• On the Trajectory Regularity of ODE-based Diffusion Sampling [79.17334230868693]
  Diffusion-based generative models use differential equations to establish a smooth connection between a complex data distribution and a tractable prior distribution. In this paper, we identify several intriguing trajectory properties in the ODE-based sampling process of diffusion models.
  arXiv  Detail & Related papers  (2024-05-18T15:59:41Z)
• Improved off-policy training of diffusion samplers [93.66433483772055]
  We study the problem of training diffusion models to sample from a distribution with an unnormalized density or energy function. We benchmark several diffusion-structured inference methods, including simulation-based variational approaches and off-policy methods. Our results shed light on the relative advantages of existing algorithms while bringing into question some claims from past work.
  arXiv  Detail & Related papers  (2024-02-07T18:51:49Z)
• Fast Sampling via Discrete Non-Markov Diffusion Models with Predetermined Transition Time [49.598085130313514]
  We propose discrete non-Markov diffusion models (DNDM), which naturally induce the predetermined transition time set.<n>This enables a training-free sampling algorithm that significantly reduces the number of function evaluations.<n>We study the transition from finite to infinite step sampling, offering new insights into bridging the gap between discrete and continuous-time processes.
  arXiv  Detail & Related papers  (2023-12-14T18:14:11Z)
• Reflected Diffusion Models [93.26107023470979]
  We present Reflected Diffusion Models, which reverse a reflected differential equation evolving on the support of the data. Our approach learns the score function through a generalized score matching loss and extends key components of standard diffusion models.
  arXiv  Detail & Related papers  (2023-04-10T17:54:38Z)
• Applying Regularized Schr\"odinger-Bridge-Based Stochastic Process in Generative Modeling [0.0]
  This study tries to reduce the number of timesteps and training time required and proposed regularization terms to make bidirectional processes consistent with a reduced number of timesteps. Applying this regularization to various tasks, the possibility of generative modeling based on a process with faster sampling speed could be confirmed.
  arXiv  Detail & Related papers  (2022-08-15T11:52:33Z)
• Continuous-Time Modeling of Counterfactual Outcomes Using Neural Controlled Differential Equations [84.42837346400151]
  Estimating counterfactual outcomes over time has the potential to unlock personalized healthcare. Existing causal inference approaches consider regular, discrete-time intervals between observations and treatment decisions. We propose a controllable simulation environment based on a model of tumor growth for a range of scenarios.
  arXiv  Detail & Related papers  (2022-06-16T17:15:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.