Numerical performance of Penalized Comparison to Overfitting for multivariate kernel density estimation

02/04/2019
by   Suzanne Varet, et al.
0

Kernel density estimation is a well known method involving a smoothing parameter (the bandwidth) that needs to be tuned by the user. Although this method has been widely used the bandwidth selection remains a challenging issue in terms of balancing algorithmic performance and statistical relevance. The purpose of this paper is to compare a recently developped bandwidth selection method for kernel density estimation to those which are commonly used by now (at least those which are implemented in the R-package). This new method is called Penalized Comparison to Overfitting (PCO). It has been proposed by some of the authors of this paper in a previous work devoted to its statistical relevance from a purely theoretical perspective. It is compared here to other usual bandwidth selection methods for univariate and also multivariate kernel density estimation on the basis of intensive simulation studies. In particular, cross-validation and plug-in criteria are numerically investigated and compared to PCO. The take home message is that PCO can outperform the classical methods without algorithmic additionnal cost.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2017

Bandwidth selection for nonparametric modal regression

In the context of estimating local modes of a conditional density based ...
research
06/28/2023

Application of Multivariate Selective Bandwidth Kernel Density Estimation for Data Correction

This paper presents an intuitive application of multivariate kernel dens...
research
05/28/2020

Composition Estimation via Shrinkage

In this note, we explore a simple approach to composition estimation, us...
research
05/22/2023

Complexity measure, kernel density estimation, bandwidth selection, and the efficient market hypothesis

We are interested in the nonparametric estimation of the probability den...
research
03/09/2016

Optimized Kernel Entropy Components

This work addresses two main issues of the standard Kernel Entropy Compo...
research
12/07/2015

Clustering by Deep Nearest Neighbor Descent (D-NND): A Density-based Parameter-Insensitive Clustering Method

Most density-based clustering methods largely rely on how well the under...

Please sign up or login with your details

Forgot password? Click here to reset