paper-with-me

Papers

What's the score? Automated Denoising Score Matching for Nonlinear Diffusions

2024-07-10 · Raghav Singhal, Mark Goldstein, Rajesh Ranganath

Reversing a diffusion process by learning its score forms the heart of diffusion-based generative modeling and for estimating properties of scientific systems. The diffusion processes that are tractable center on linear processes with a Gaussian stationary distribution. This limits the kinds of models that can be built to those that target a Gaussian prior or more generally limits the kinds of problems that can be generically solved to those that have conditionally linear score functions. In this work, we introduce a family of tractable denoising score matching objectives, called local-DSM, built using local increments of the diffusion process. We show how local-DSM melded with Taylor expansions enables automated training and score estimation with nonlinear diffusion processes. To demonstrate these ideas, we use automated-DSM to train generative models using non-Gaussian priors on challenging low dimensional distributions and the CIFAR10 image dataset. Additionally, we use the automated-DSM to learn the scores for nonlinear processes studied in statistical physics.

📄 PDF Abstract BibTeX arXiv:2407.07998

Code (0)

등록된 구현이 없습니다.

Tasks

Denoising

Methods 이 논문이 사용한 방법론

Denoising Score Matching Training a denoiser on signals gives you a powerful prior over this signal that you can then use to sample examples of this signal.
Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Implicit score matching meets denoising score matching: improved rates of convergence and log-density Hessian estimation

2025-12-30 · Konstantin Yakovlev, Anna Markovich, Nikita Puchkin arxiv

We study the problem of estimating the score function using both implicit score matching and denoising score matching. Assuming that the data distribution exhibiting a low-dimensional structure, we prove that implicit sc…

Representation Learning in Continuous-Time Score-Based Generative Models

2021-06-02 · ICML Workshop INNF 2021 7 · Korbinian Abstreiter, Stefan Bauer, Arash Mehrjou

Score-based methods represented as stochastic differential equations on a continuous time domain have recently proven successful as a non-adversarial generative model. Training such models relies on denoising score match…

DenoisingRepresentation Learning

Optimizing Input of Denoising Score Matching is Biased Towards Higher Score Norm

2025-11-13 · Tongda Xu arxiv

Many recent works utilize denoising score matching to optimize the conditional input of diffusion models. In this workshop paper, we demonstrate that such optimization breaks the equivalence between denoising score match…

Image CompressionText to 3D

Regularized estimation of image statistics by Score Matching

2010-12-01 · NeurIPS 2010 12 · Durk P. Kingma, Yann L. Cun

Score Matching is a recently-proposed criterion for training high-dimensional density models for which maximum likelihood training is intractable. It has been applied to learning natural image statistics but has so-far b…

DenoisingImage DenoisingSuper-Resolution

Target Score Matching

2024-02-13 · Valentin De Bortoli, Michael Hutchinson, Peter Wirnsberger, Arnaud Doucet

Denoising Score Matching estimates the score of a noised version of a target distribution by minimizing a regression loss and is widely used to train the popular class of Denoising Diffusion Models. A well known limitati…

Denoisingregression