arXiv:2607. 10067v1 Announce Type: new Abstract: While autoregressive models optimize the exact data likelihood via the chain rule, diffusion models are typically trained with denoising objectives.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
The paper introduces Moment Guided Diffusion (MGD), a new method that blends diffusion-based generative modeling with classical maximum entropy techniques. MGD samples maximum entropy distributions by solving a stochastic differential equation that steers moments toward specified values in finite time, thereby avoiding the slow mixing of traditional MCMC or Langevin dynamics. The authors prove convergence to the maximum entropy distribution in the large-volatility limit and provide a tractable entropy estimator, demonstrating the method on financial time series, turbulent flows, and cosmological fields using wavelet scattering moments.
The paper addresses the challenge of guiding conditioned generative models that are diffusion processes with singular diffusion coefficients, where traditional conditional densities may be nonexistent or non‑smooth. It proposes using causal optimal transport to construct approximate loss functions that identify a minimum‑entropy control for guidance, relying on the predictable representation property of conditioned diffusion processes and well‑posed martingale problems à la Üstünel.
The paper introduces a new method for conditioning degenerate diffusion models, which are generative models that rely on diffusion processes with singular diffusion coefficients. Traditional approaches use score functions for guidance, but this work employs causal optimal transport to define approximate loss functions that can identify a minimum‑entropy control even when conditional densities are non‑existent or non‑smooth. The method hinges on the predictable representation property of conditioned diffusion processes and the well‑posedness of their martingale problem, following the framework of "Ust"unel.
arXiv:2409. 18804v3 Announce Type: replace-cross Abstract: Denoising Diffusion Probabilistic Models (DDPM) are powerful state-of-the-art methods used to generate synthetic data from high-dimensional data distributions and are widely used for image, audio, and video generation as well as many more applications in science and beyond.
arXiv:2508. 03636v3 Announce Type: replace-cross Abstract: We propose a Likelihood Matching approach for training diffusion models by first establishing an equivalence between the likelihood of the target data distribution and a likelihood along the sample path of the reverse diffusion.
arXiv:2602. 09639v2 Announce Type: replace Abstract: Denoising diffusion models (DDMs) are state-of-the-art methods for learning densities from data across numerous domains, yet many aspects of the training and sampling pipeline remain poorly understood.