arXiv Machine Learning
Oct 5

Adaptive Second-Order Solvers for Fast Stochastic Diffusion Sampling

The paper introduces adaptive second‑order solvers for diffusion models, employing a proportional‑integral (PI) step‑size controller based on a diffusion noise‑normalised error estimator. Unlike existing adaptive methods that react only to the current error, the PI solver incorporates past error information, producing smoother step adaptations. The authors also demonstrate that per‑sample trajectories share structure, allowing aggregation into a fixed schedule that largely preserves adaptive benefits. Experiments on natural‑image and language datasets show that the fixed schedule outperforms the commonly used EDM schedule for image sampling with the stochastic Heun sampler, and that the PI adaptive solver achieves lower FID than most baselines, though it does not surpass the EDM‑churn sampler at low neural‑network‑evaluation counts. In language diffusion, the PI solver improves perplexity over EDM and entropy schedules at low‑to‑medium NFE, albeit with reduced token entropy. The study concludes that per‑sample adaptivity is highly beneficial for simple 1D toy problems but only marginally useful for image and language data, where an average schedule can sometimes outperform the PI‑adaptive approach.

By Ella Kemperman, Luca Ambrogioni
arXiv Machine Learning
Oct 16

FlowBudget: Training-Free Sampling-Budget Estimation for Flow Matching Models

FlowBudget introduces a training‑free method to estimate the sampling budget—i.e., the number of function evaluations (NFEs)—required for flow‑matching models. By using simulation‑free interpolation probes to normalize one‑step discretization error, it derives estimators for common solvers (Euler, Heun, Euler–Maruyama) that map a numerical tolerance to a step budget. Experiments on several flow‑model architectures demonstrate that FlowBudget can predict the necessary NFE without generating samples at multiple budgets or conducting expensive FID‑versus‑NFE sweeps.

By Zahra Dehghani, Pablo Piantanida, Mohammadhadi Shateri
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