arXiv AI By Bingyan Han

Volterra Generative Models via Markovian Lifting

Read the original on arXiv AI →

The paper introduces Volterra generative models that extend diffusion-based generative models by incorporating Volterra processes, which provide more flexible temporal dependence than traditional Brownian-motion-driven Markov processes. To address the non-Markovian challenges, the authors develop Markovian approximations and Gaussian conditioning, reducing the denoising problem to the original data dimension and enabling connections to variance-exploding and variance-preserving frameworks. The resulting models, trained from scratch or with pretrained denoisers, achieve competitive FID scores on MNIST, conditional CIFAR-10, and ImageNet datasets, demonstrating the practical viability of the approach.

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 AI.

arXiv AI
Jun 17

Volterra Generative Models

arXiv:2606. 18071v1 Announce Type: cross Abstract: Score-based diffusion models typically use Brownian perturbations, which provide tractable reverse-time dynamics but impose memoryless noising.

By Yusen Jia, Bingyan Han
arXiv Machine Learning
Sep 30

Improved Distributional Diffusion Models

arXiv:2609.37147v1 Announce Type: cross Abstract: Distributional Diffusion Models (DDMs) replace the standard mean-prediction denoiser with a \emph{distributional} denoiser trained via a scoring rule...

By Tommaso Martorella, Alexandre Galashov, Felix Krause, Stefan Andreas Baumann, Valentin De Bortoli, Arthur Gretton, Bj\"orn Ommer
arXiv Statistics ML
Oct 28

Latent Nonlinear Denoising Score Matching for Enhanced Learning of Structured Distributions

The paper introduces Latent Nonlinear Denoising Score Matching (LNDSM), a method that integrates nonlinear, structure-informed latent diffusions with a variational autoencoder framework. LNDSM designs the forward diffusion to admit a chosen reference distribution, such as a Gaussian mixture, and derives a computable approximation to a cross‑entropy upper bound using Euler‑Maruyama discretization. Experiments on benchmark image datasets show that LNDSM improves sample quality, mode balance, and training efficiency compared to conventional latent score‑based generative models.

By Kaichen Shen, Wei Zhu