Adaptive Density Estimation on Bounded Domains

10/25/2018
by   Karine Bertin, et al.
0

We study the estimation, in Lp-norm, of density functions defined on [0,1]^d. We construct a new family of kernel density estimators that do not suffer from the so-called boundary bias problem and we propose a data-driven procedure based on the Goldenshluger and Lepski approach that jointly selects a kernel and a bandwidth. We derive two estimators that satisfy oracle-type inequalities. They are also proved to be adaptive over a scale of anisotropic or isotropic Sobolev-Slobodetskii classes (which are particular cases of Besov or Sobolev classical classes). The main interest of the isotropic procedure is to obtain adaptive results without any restriction on the smoothness parameter.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2018

Adaptive optimal kernel density estimation for directional data

We focus on the nonparametric density estimation problem with directiona...
research
08/02/2023

A new adaptive local polynomial density estimation procedure on complicated domains

This paper presents a novel approach for pointwise estimation of multiva...
research
07/25/2019

Adaptive regression with Brownian path covariate

This paper deals with estimation with functional covariates. More precis...
research
02/26/2018

Averaging of density kernel estimators

Averaging provides an alternative to bandwidth selection for density ker...
research
04/14/2023

Robust Algorithms on Adaptive Inputs from Bounded Adversaries

We study dynamic algorithms robust to adaptive input generated from sour...
research
01/02/2019

Kernel Density Estimation Bias under Minimal Assumptions

Kernel Density Estimation is a very popular technique of approximating a...
research
06/11/2018

Adaptive Denoising of Signals with Shift-Invariant Structure

We study the problem of discrete-time signal denoising, following the li...

Please sign up or login with your details

Forgot password? Click here to reset