Skip to content

Control Variate Score Matching for Diffusion Models

Dec 2025 · arXiv.org · Vol abs/2512.20003 · 5 citations · ⚡ 1 influential · 44 references
Computer Science

TL;DR

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.

View source

Similar papers

Preprint Aug 2026

Posterior Information Dynamics of Diffusion Models for Linear Inverse Problems

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

Xiangming Meng · 1 citation
Preprint Aug 2026

Sobolev Regularized Score Difference Estimation in Diffusion Models

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 · 0 citations
#machine learning Preprint Sep 2026

Robustness of Diffusion Models under Distribution Shift

Score-based diffusion models are increasingly considered in settings where the underlying data distribution may differ from the training distribution, yet existing theoretical guarantees largely focus on the no-shift setting. In this work, we study robust score estimation under Wasserstein perturbations of a reference...

Wei Luo, N. K. Chada, Shi-Jie Zhang et al. · 0 citations
#data science Preprint Sep 2026

FluxLite: Inference-Time Proposal Control for Discrete Diffusion Models

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
Preprint Aug 2026

Generalization, memorization, and overfitting for diffusion models trained in the lazy high-dimensional regime

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. · 1 citation · ⚡1
#small language model Preprint Aug 2026

Minimax Optimality of Score-Entropy Discrete Diffusion

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 · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 7, 2026

Discovering the value of humanistic inquiry

Students in MIT’s Concourse program delve deeply into the human condition, debate challenging questions, and learn to develop judgment about issues that can’t be quantified.

Microsoft Research Blog Oct 7, 2026

Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses

Training AI agents with reinforcement learning can be challenging because their tools, context, and decision-making are managed by complex frameworks. Agent Lightning connects existing agents to RL training, making it easier to improve them without rebuilding them. The post Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.