The Control Variate Score Identity (CVSI) is introduced, an unbiased estimator with an analytically optimal, state- and time-dependent control coefficient that theoretically minimizes variance over the entire diffusion process in data-free sampler learning and training-free diffusion sampling.
Abstract
Sampling from unnormalized probability densities is a pervasive challenge across the computational and physical sciences. Diffusion models provide a powerful generative framework for this task, but their success relies on accurately estimating the score of the perturbed target distribution. Current approaches face a dichotomy between two standard estimation methods: the Denoising Score Identity (DSI) requires data samples and exhibits high variance at low noise levels, whereas the Target Score Identity (TSI) relies on the energy function and suffers from diverging variance at high noise levels. In this work, we reconcile both approaches by introducing the Control Variate Score Identity (CVSI), an unbiased estimator with an analytically optimal, state- and time-dependent control coefficient that theoretically minimizes variance over the entire diffusion process. CVSI serves as a robust plug-in estimator that significantly enhances performance and efficiency in data-free sampler learning and training-free diffusion sampling. These gains scale to complex, high-dimensional energy-based models.
Diffusion models are widely used as priors for linear inverse problems, yet endpoint quality does not reveal when measurement information enters reverse denoising or how it is allocated across signal directions. We study this process through the smoothed likelihood force, the difference between exact posterior and prio...
This work proposes a statistically consistent and scalable estimator for score differences based on Sobolev regularization and demonstrates its effectiveness on real-world tasks, including transfer learning for ECG signal generation, where it substantially outperforms non-regularized score difference estimators in down...
Chenghan Xie, Jose H. Blanchet, Renyuan Xu· 1 citation
This work studies robust score estimation under Wasserstein perturbations of a reference distribution of Ornstein--Uhlenbeck diffusion and characterize how finite data, intrinsic dimension, and distribution shift affect the robustness of score-based diffusion models.
Wei Luo, N. K. Chada, Shi-Jie Zhang et al.· 0 citations
FluxLite is introduced, a lightweight, training-free proposal-control framework for discrete diffusion, identifying a tilted-path coverage factor that governs robustness to score error, together with finite-particle convergence for a fixed controlled Feynman-Kac recursion.
Yinuo Ren, Haoxuan Chen, Grant M. Rotskoff et al.· 1 citation
This work develops a generative counterpart to the theory of benign overfitting and algorithmic regularization for overparameterized neural networks in the supervised lazy-training regime by studying denoising score matching in a vector-valued reproducing kernel Hilbert space with an inner-product kernel.
Hugo Latourelle-Vigeant, Sinho Chewi, Aram-Alexandre Pooladian et al.· 2 citations· ⚡1
This work establishes a minimax lower bound under the score-entropy loss, and proposes an MLE-based thresholding estimator that matches this lower bound up to constant and polylogarithmic factors that depend on neighboring density ratios.
Chol-Kyoon Cho, Yuchen Wu· 2 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.