Tightening the Score Matching Gap for Diffusion Models
arXiv:2607. 04442v1 Announce Type: cross Abstract: Diffusion models (DMs) are a state-of-the-art generative method to approximately sample from an unknown distribution.
arXiv:2508. 01597v2 Announce Type: replace Abstract: Score Matching (SM) is a powerful framework for estimating the log-density derivatives of a distribution without calculating its normalizing constants.
arXiv:2607. 04442v1 Announce Type: cross Abstract: Diffusion models (DMs) are a state-of-the-art generative method to approximately sample from an unknown distribution.
arXiv:2605. 22950v2 Announce Type: replace-cross Abstract: Score matching is an alternative to maximum likelihood estimation when the normalizing constant is unknown or too costly to evaluate.
arXiv:2607. 15485v1 Announce Type: new Abstract: Score-based generative models exhibit a puzzling behavior: they often appear to cover all modes of a target multimodal distribution and yet may fail to learn the correct relative mode amplitudes, which can be interpreted as mixture weights.
arXiv:2609.05688v1 Announce Type: new Abstract: We study variance-preserving diffusion of the response in mixed linear regression (MLR) with unknown mixing weights. Our analysis separates the statist...
arXiv:2504.05161v2 Announce Type: replace-cross Abstract: Score estimation is the backbone of score-based generative models (SGMs), especially denoising diffusion probabilistic models (DDPMs). A key...
The paper introduces a generalized score matching objective for parameter estimation on convex subsets of ρ^d, derived from Minimum Probability Flow learning. It shows that this objective is a proper local scoring rule of second order, ensuring recovery of the true density when minimized, and proves convexity and consistency for exponential family models under standard conditions. Experiments demonstrate the method’s effectiveness on constrained domains where the partition function is intractable, including a generative modeling use‑case.
arXiv:2502. 00336v3 Announce Type: replace Abstract: We theoretically investigate the phenomena of generalization and memorization in diffusion models.
arXiv:2608.23916v1 Announce Type: new Abstract: Denoising score matching trains diffusion models by regressing onto a conditional score, although generation ultimately requires the marginal score. Th...
arXiv:2606. 06179v1 Announce Type: cross Abstract: Score-based diffusion models are typically trained by minimizing the $L^2$ score matching error, and standard theoretical analyses rely on this quantity to bound the sampling discrepancy between the learned and target distributions.
arXiv:2512.20003v2 Announce Type: replace Abstract: Sampling from unnormalized probability densities is a pervasive challenge across the computational and physical sciences. Diffusion models provide...
arXiv:2501. 12982v3 Announce Type: replace-cross Abstract: This paper investigates how diffusion generative models leverage (unknown) low-dimensional structure to accelerate sampling.
arXiv:2512. 23818v2 Announce Type: replace-cross Abstract: Denoising and score estimation are classically linked through Tweedie's formula, which relates the posterior mean under Gaussian noise to the Stein score of the noisy marginal.