TL;DR
This paper extends the fast sum updating method for kernel density estimation to multivariate data, improving speed and stability for large-scale problems with various kernels and adaptive bandwidths.
Contribution
It introduces a multivariate extension of the fast sum updating approach, applicable to general data, kernels, and adaptive bandwidths, enhancing efficiency and accuracy.
Findings
Method is fast, accurate, and stable in multivariate regression and density estimation.
Extension to multiple kernels and adaptive bandwidths improves versatility.
Numerical tests confirm the method's effectiveness for large datasets.
Abstract
Kernel density estimation and kernel regression are powerful but computationally expensive techniques: a direct evaluation of kernel density estimates at evaluation points given input sample points requires a quadratic operations, which is prohibitive for large scale problems. For this reason, approximate methods such as binning with Fast Fourier Transform or the Fast Gauss Transform have been proposed to speed up kernel density estimation. Among these fast methods, the Fast Sum Updating approach is an attractive alternative, as it is an exact method and its speed is independent of the input sample and the bandwidth. Unfortunately, this method, based on data sorting, has for the most part been limited to the univariate case. In this paper, we revisit the fast sum updating approach and extend it in several ways. Our main contribution is to extend it to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
