arXiv Statistics ML

Training-Free Generative Sampling via Moment-Matched Score Smoothing

The paper introduces MM‑SOLD, a training‑free sampling method that uses moment‑matched score‑smoothed overdamped Langevin dynamics to generate samples without training a neural diffusion model. It enforces target moments during sampling, proving convergence to a Gibbs–Boltzmann density that matches the mean and covariance of a training Gaussian mixture model, even for rank‑deficient data. Experiments demonstrate fast, robust latent‑space image generation on CPUs with fidelity and diversity comparable to neural diffusion baselines.

Hugging Face Trending Papers
Aug 6

The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexity

We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex. We introduce the Subgradient Tamed Unadjusted Langevin Algorithm (SG-TULA), a discretisation of the Langevin diffusion that operates directly on subgradients, without relying on computationally demanding smoothing procedures.

arXiv AI
Jun 2

Efficient Weighted Sampling via Score-based Generative Models

arXiv:2502. 04646v2 Announce Type: replace-cross Abstract: Weighted sampling -- sampling from a probability density function (PDF) proportional to the product of a base PDF and a weight function -- is a fundamental technique with wide-ranging applications in variance reduction, biased sampling, data augmentation, and more.

By Heasung Kim, Taekyun Lee, Hyeji Kim, Gustavo de Veciana
arXiv Machine Learning
Sep 11

Particle GFlowNets: Rethinking Generative Marginalization Models

The paper introduces Particle GFlowNets, showing that Generative Marginalization Models (MaMs) are equivalent to Generative Flow Networks. It extends MaMs to non‑autoregressive sampling and proposes an automatic full‑state rejuvenation criterion based on the Gelman‑Rubin statistic to accelerate learning. Experiments demonstrate significant training speedups in large combinatorial spaces.

By Tiago da Silva, Diego Mesquita, Salem Lahlou
Hugging Face Trending Papers
Jul 8

Gradient-free Riemannian Langevin Sampler

We address the problem of efficiently sampling multimodal probability distributions, where standard Markov Chain Monte Carlo methods often suffer from poor mixing and mode trapping. To mitigate these issues, we propose Gradient-free Riemannian Langevin Sampler (GRiLS), a novel proposal that improves exploration without requiring gradient evaluations of the target density.

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
arXiv Machine Learning
Oct 8

Kinetic Langevin Meets Split Gibbs: Accelerated Posterior Sampling for Imaging Inverse Problems with Diffusion Priors

The paper introduces RED-KLwSGS, a new posterior sampling method for Bayesian imaging inverse problems that combines exact Gaussian updates for the data variable with underdamped (kinetic) Langevin diffusion for the auxiliary variable, driven by a one‑shot denoising score. It achieves the same per‑iteration cost as existing Langevin‑within‑SGS samplers while providing non‑asymptotic Wasserstein‑2 convergence guarantees for strongly log‑concave priors. A further variant, Joint-RED-KLwSGS, applies kinetic Langevin diffusion to both variables, and experiments using denoising diffusion probabilistic models on FFHQ and ImageNet demonstrate faster convergence and high‑quality image reconstruction.

By Dai Hai Nguyen, Duc Dung Nguyen
arXiv Machine Learning
Sep 16

Training Energy-Based Models with Non-MCMC Samplers and Efficient Temperature Estimation

The paper introduces Langevin simulated bifurcation (LSB), a fast, parallel Boltzmann sampler that matches the accuracy of sequential MCMC methods. It also proposes conditional expectation matching (CEM), an efficient technique for estimating the effective temperature of samples from energy‑based models with conditional independence. Building on these, the authors develop sampler adaptive learning (SAL), which adjusts the model temperature to align with the distribution produced by LSB, enabling efficient training of semi‑restricted Boltzmann machines (SRBMs) and outperforming conventional methods on synthetic spin‑glass datasets.

By Kentaro Kubo, Hayato Goto