arXiv Statistics ML By Zhenyu Yao, Daniel Paulin

Training-Free Generative Sampling via Moment-Matched Score Smoothing

Read the original on arXiv Statistics ML →

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.

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 Statistics ML.

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