English

Flash-SD-KDE: Accelerating SD-KDE with Tensor Cores

Distributed, Parallel, and Cluster Computing 2026-02-12 v1 Machine Learning

Abstract

Score-debiased kernel density estimation (SD-KDE) achieves improved asymptotic convergence rates over classical KDE, but its use of an empirical score has made it significantly slower in practice. We show that by re-ordering the SD-KDE computation to expose matrix-multiplication structure, Tensor Cores can be used to accelerate the GPU implementation. On a 32k-sample 16-dimensional problem, our approach runs up to 47×47\times faster than a strong SD-KDE GPU baseline and 3,300×3{,}300\times faster than scikit-learn's KDE. On a larger 1M-sample 16-dimensional task evaluated on 131k queries, Flash-SD-KDE completes in 2.32.3 s on a single GPU, making score-debiased density estimation practical at previously infeasible scales.

Keywords

Cite

@article{arxiv.2602.10378,
  title  = {Flash-SD-KDE: Accelerating SD-KDE with Tensor Cores},
  author = {Elliot L. Epstein and Rajat Vadiraj Dwaraknath and John Winnicki},
  journal= {arXiv preprint arXiv:2602.10378},
  year   = {2026}
}

Comments

11 pages

R2 v1 2026-07-01T10:30:57.229Z