Graphics Processing Units in Acceleration of Bandwidth Selection for Kernel Density Estimation
Institute of Computer Science, Poznan University of Technology, Piotrowo 2, 60-965 Poznan, Poland
Int. J. Appl. Math. Comput. Sci., Vol. 23, No. 4, 869-885, 2013
@article{andrzejewski2013graphics,
title={GRAPHICS PROCESSING UNITS IN ACCELERATION OF BANDWIDTH SELECTION FOR KERNEL DENSITY ESTIMATION},
author={ANDRZEJEWSKI, WITOLD and GRAMACKI, ARTUR and GRAMACKI, JAROS{L}AW},
journal={Int. J. Appl. Math. Comput. Sci},
volume={23},
number={4},
pages={869–885},
year={2013}
}
The Probability Density Function (PDF) is a key concept in statistics. Constructing the most adequate PDF from the observed data is still an important and interesting scientific problem, especially for large datasets. PDFs are often estimated using nonparametric data-driven methods. One of the most popular nonparametric method is the Kernel Density Estimator (KDE). However, a very serious drawback of using KDEs is the large number of calculations required to compute them, especially to find the optimal bandwidth parameter. In this paper we investigate the possibility of utilizing Graphics Processing Units (GPUs) to accelerate the finding of the bandwidth. The contribution of this paper is threefold: (a) we propose algorithmic optimization to one of bandwidth finding algorithms, (b) we propose efficient GPU versions of three bandwidth finding algorithms and (c) we experimentally compare three of our GPU implementations with the ones which utilize only CPUs. Our experiments show orders of magnitude improvements over CPU implementations of classical algorithms.
December 24, 2013 by hgpu
