stat.MLMay 21, 2026

Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation

Authors: Benedikt Lütke SchwienhorstNadja KleinJohannes Lederer

Organizations: Department of Mathematics University of Hamburg Hamburg, Germany · Scientific Computing Center Karlsruhe Institute of Technology2026 Karlsruhe, Germany · Department of MathematicsMay University of Hamburg Hamburg, Germany21

Abstract

Score matching is an alternative to maximum likelihood estimation when the normalizing constant is unknown or too costly to evaluate. However, vanilla score matching has shown to be inefficient relative to maximum likelihood estimation for multimodal distributions with well-separated modes, which are commonly encountered in practical applications. We compare a novel diffusion-based denoising score matching estimator (DDSME) to the vanilla score matching estimator (SME) in this scenario. In particular, we prove statistical guarantees for both estimators, showing that the error bound for the vanilla SME worsens when the separation between the modes increases, which can be avoided in case of the DDSME with suitable hyperparameter tuning. This provides a novel theoretical explanation for the superior behavior of diffusion-based score matching over the vanilla version.

Explore similar work

Sep 11, 2026cs.LG

Generalized Score Matching for Parameter Estimation on Convex Domains

Maximum likelihood (ML) estimation is a principled and statistically efficient approach for learning probabilistic models. However, for unnormalized models, ML estimation requires evaluating the partition function and differentiating through it, which may not always be tractable. Score matching provides a practically viable alternative that circumvents this obstacle by fitting the score in a way that eliminates dependence on the normalizing constant. We derive the generalized score matching objective on a convex subset of Rd\mathbb{R}^{d} constructively starting from Minimum Probability Flow (MPF) learning, and show how classical score matching as well as domain-adapted variants for non-negative data arise naturally within the proposed framework. We show that the resulting objective is a {\it proper local scoring rule} of second-order, which provides the theoretical guarantee that the true density is recovered when the objective is minimized. Furthermore, for a model belonging to the exponential family, we establish convexity of the objective together with consistency of the finite-sample estimator under standard regularity conditions. Our derivation sheds new light on the scope and applicability of generalized score matching in various problem settings. We compare generalized score matching-based estimators on constrained domains, where the partition function is analytically intractable. We provide experimental results on parameter estimation for model densities belonging to the exponential family defined over convex subsets of Rd\mathbb{R}^{d}, and a generative modeling use-case to demonstrate broader applicability of the proposed generalized score matching framework.
Nishanth Shetty, Saisuchith Mahajan, Chandra Sekhar Seelamantula
Jul 5, 2026stat.ML

Tightening the Score Matching Gap for Diffusion Models

Diffusion models (DMs) are a state-of-the-art generative method to approximately sample from an unknown distribution. Their training and evaluation primarily rely on an Evidence Lower Bound (ELBO), which relates the Kullback-Leibler (KL) divergence of model samples to the score matching loss along the path, which serves as a tractable surrogate. The difference between sample quality and the score matching loss produced by this bound leads to the \emph{score matching gap}, which is known to be tight in the worst-case but not descriptive of sample quality in general. In this work, we provide a theoretical analysis of this gap, developing tighter bounds for three metrics: KL divergence, reverse KL divergence, and Wasserstein distance, effectively exploiting the regularity of the class of score estimators. Our results suggest that the quality of the score approximation has more impact on closing the score matching gap for low noise scales. To obtain these bounds, our key technical insight is to exploit the contraction properties of the backward processes. In particular, we rely on entropy flows, logarithmic Sobolev inequalities and reflection couplings, rigorously linking the ergodicity of the Langevin diffusion to the score matching gap problem.
Benjamin Dupuis, Tyler Farghly, Maxime Haddouche +2
May 25, 2026stat.ML

Rao-Blackwellized Score Matching on Manifolds

We study denoising score matching (DSM) when the latent distribution is supported on a smooth embedded manifold MRDM \subset \mathbb{R}^D. Under ambient Gaussian corruption, the tangent denoising target contains a singular normal-fiber noise channel whose variance diverges as d/σ2d/σ^2 as σ0+σ\to 0^+. We show that conditioning on the nearest-point projection π(X)π(X) canonically removes this singularity: the resulting conditional expectation is the unique L2L^2-optimal Rao-Blackwellized predictor of the tangent DSM target among all estimators depending only on the projected observation π(X)π(X). We then compute the small-noise expansion of this canonical target and show that it equals the intrinsic Riemannian score up to an explicit order-σ2σ^2 correction that decomposes into an intrinsic Tweedie term and an extrinsic curvature term involving the Weingarten and Ricci operators. In the flat case, the construction reduces exactly to ordinary lower-dimensional Gaussian DSM, while on SdS^d the extrinsic correction simplifies to the scalar factor (1d/2)Mlogq(1-d/2)\nabla_M \log q; this extrinsic σ2σ^2 correction cancels identically on S2S^2, though the intrinsic Tweedie term remains.
Divit Rawal