SD-KDE: Score-Debiased Kernel Density Estimation

Elliot L. Epstein, Rajat Dwaraknath, Thanawat Sornwanee, John Winnicki, Jerry Weihong Liu
4/27/2025
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{epstein2025sdkde,
  title  = {SD-KDE: Score-Debiased Kernel Density Estimation},
  author = {Elliot L. Epstein and Rajat Dwaraknath and Thanawat Sornwanee and John Winnicki and Jerry Weihong Liu},
  year   = {2025},
  eprint = {2504.19084},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.19084v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.19084.svg)](https://codeofpaper.com/paper/2504.19084)

Discussion