SD-KDE: Score-Debiased Kernel Density Estimation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911018147381248 |
|---|---|
| author | Epstein, Elliot L. Dwaraknath, Rajat Sornwanee, Thanawat Winnicki, John Liu, Jerry Weihong |
| author_facet | Epstein, Elliot L. Dwaraknath, Rajat Sornwanee, Thanawat Winnicki, John Liu, Jerry Weihong |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_19084 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | SD-KDE: Score-Debiased Kernel Density Estimation Epstein, Elliot L. Dwaraknath, Rajat Sornwanee, Thanawat Winnicki, John Liu, Jerry Weihong Machine Learning 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. |
| title | SD-KDE: Score-Debiased Kernel Density Estimation |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2504.19084 |