paper-with-me

Papers

Generalization error bound for denoising score matching under relaxed manifold assumption

2025-02-19 · Konstantin Yakovlev, Nikita Puchkin

We examine theoretical properties of the denoising score matching estimate. We model the density of observations with a nonparametric Gaussian mixture. We significantly relax the standard manifold assumption allowing the samples step away from the manifold. At the same time, we are still able to leverage a nice distribution structure. We derive non-asymptotic bounds on the approximation and generalization errors of the denoising score matching estimate. The rates of convergence are determined by the intrinsic dimension. Furthermore, our bounds remain valid even if we allow the ambient dimension grow polynomially with the sample size.

📄 PDF Abstract BibTeX arXiv:2502.13662

Code (0)

등록된 구현이 없습니다.

Tasks

Denoisingvalid

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.

Similar Papers 제목 키워드 기반

Maximum Likelihood Training for Score-Based Diffusion ODEs by High-Order Denoising Score Matching

2022-06-16 · Cheng Lu, Kaiwen Zheng, Fan Bao, Jianfei Chen 외

Score-based generative models have excellent performance in terms of generation quality and likelihood. They model the data distribution by matching a parameterized score network with first-order data score functions. Th…

Denoising

Recovering Hidden Reward in Diffusion-Based Policies

2026-05-01 · Yanbiao Ji, Qiuchang Li, Yuting Hu, Shaokai Wu 외 arxiv

This paper introduces EnergyFlow, a framework that unifies generative action modeling with inverse reinforcement learning by parameterizing a scalar energy function whose gradient is the denoising field. We establish tha…

Reinforcement Learning

Neural Network-Based Score Estimation in Diffusion Models: Optimization and Generalization

2024-01-28 · Yinbin Han, Meisam Razaviyayn, Renyuan Xu

Diffusion models have emerged as a powerful tool rivaling GANs in generating high-quality samples with improved fidelity, flexibility, and robustness. A key component of these models is to learn the score function throug…

Denoisingregression

Concentration Inequalities for the Stochastic Optimization of Unbounded Objectives with Application to Denoising Score Matching

2025-02-12 · Jeremiah Birrell

We derive novel concentration inequalities that bound the statistical error for a large class of stochastic optimization problems, focusing on the case of unbounded objective functions. Our derivations utilize the follow…

DenoisingStochastic Optimization

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

2026-05-21 · Benedikt Lütke Schwienhorst, Nadja Klein, Johannes Lederer arxiv

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 likeli…