mlsanityData to 7 Oct 2026

SD-KDE: Score-Debiased Kernel Density Estimation

arXiv 2504.19084 ↗First posted 27 Apr 2025cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

We propose a novel method for density estimation that leverages an estimated score function to debias kernel density estimation (SD-KDE). In our approach, each data point is adjusted by taking a single step along the score function with a specific choice of step size, followed by standard KDE with a modified bandwidth. The step size and modified bandwidth are chosen to remove the leading order bias in the KDE. Our experiments on synthetic tasks in 1D, 2D and on MNIST, demonstrate that our proposed SD-KDE method significantly reduces the mean integrated squared error compared to the standard Silverman KDE, even with noisy estimates in the score function. These results underscore the potential of integrating score-based corrections into nonparametric density estimation.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 25 references that are in the map. First posted on arXiv 27 Apr 2025.

Builds on

9 of 25 references.

References · 9

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  4. 2015Variational Inference with Normalizing Flowscited by 2,161
  5. 2016Density estimation using Real NVPcited by 2,029
  6. 2017A Tutorial on Kernel Density Estimation and Recent Advancescited by 100
  7. 2018Sylvester Normalizing Flows for Variational Inferencecited by 71
  8. 2016Kernel Density Estimation for Dynamical Systemscited by 4
  9. 2020Roundtrip: A Deep Generative Neural Density Estimatorcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.