Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minimax Hausdorff estimation of density level sets

Published 7 May 2019 in math.ST, stat.ME, and stat.TH | (1905.02897v1)

Abstract: 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.