Minimax Hausdorff estimation of density level sets

05/07/2019
by   Alberto Rodríguez-Casal, et al.
0

Given a random sample of points from some unknown density, we propose a data-driven method for estimating density level sets under the r-convexity assumption. This shape condition generalizes the convexity property. However, the main problem in practice is that r is an unknown geometric characteristic of the set related to its curvature. A stochastic algorithm is proposed for selecting its optimal value from the data. The resulting reconstruction of the level set is able to achieve minimax rates for Hausdorff metric and distance in measure, up to log factors, uniformly on the level of the set.

READ FULL TEXT
research
07/19/2019

Extent of occurrence reconstruction using a new data-driven support estimator

Given a random sample of points from some unknown distribution, we propo...
research
03/12/2020

Level set and density estimation on manifolds

Given an iid sample of a distribution supported on a smooth manifold M^d...
research
10/17/2021

On minimax estimation problem for stationary stochastic sequences from observations in special sets of points

The problem of the mean-square optimal estimation of the linear function...
research
03/10/2017

Density Level Set Estimation on Manifolds with DBSCAN

We show that DBSCAN can estimate the connected components of the λ-densi...
research
11/02/2019

Estimating Certain Integral Probability Metric (IPM) is as Hard as Estimating under the IPM

We study the minimax optimal rates for estimating a range of Integral Pr...
research
06/07/2018

On the rate of convergence of empirical barycentres in metric spaces: curvature, convexity and extendible geodesics

This paper provides rates of convergence for empirical barycentres of a ...
research
07/01/2023

On the notion of polynomial reach: a statistical application

The volume function V(t) of a compact set S∈R^d is just the Lebesgue mea...

Please sign up or login with your details

Forgot password? Click here to reset