Kernel Density Estimators in Large Dimensions

This paper studies Kernel Density Estimation for a high-dimensional distribution ρ(x). Traditional approaches have focused on the limit of large number of data points n and fixed dimension d. We analyze instead the regime where both the number n of data points yi and their dimensionality d grow with a fixed ratio α=(log n)/d. Our study reveals three distinct statistical regimes for the kernel-based estimate of the density hat ρh^mathcal D(x)=frac1n hdsumi=1n Kleft(fracx-yihright), depending on the bandwidth h: a classical regime for large bandwidth where the Central Limit Theorem (CLT) holds, which is akin to the one found in traditional approaches. Below a certain value of the bandwidth, hCLT(α), we find that the CLT breaks down. The statistics of hatρh^mathcal D(x) for a fixed x drawn from ρ(x) is given by a heavy-tailed distribution (an alpha-stable distribution). In particular below a value hG(α), we find that hatρh^mathcal D(x) is governed by extreme value statistics: only a few points in the database matter and give the dominant contribution to the density estimator. We provide a detailed analysis for high-dimensional multivariate Gaussian data. We show that the optimal bandwidth threshold based on Kullback-Leibler divergence lies in the new statistical regime identified in this paper. As known by practitioners, when decreasing the bandwidth a Kernel-estimated estimated changes from a smooth curve to a collections of peaks centred on the data points. Our findings reveal that this general phenomenon is related to sharp transitions between phases characterized by different statistical properties, and offer new insights for Kernel density estimation in high-dimensional settings.