Concentration of the missing mass in metric spaces

06/04/2022
by   Andreas Maurer, et al.
0

We study the estimation of the probability to observe data further than a specified distance from a given iid sample in a metric space. The problem extends the classical problem of estimation of the missing mass in discrete spaces. We show that estimation is difficult in general and identify conditions on the distribution, under which the Good-Turing estimator and the conditional missing mass concentrate on their expectations. Applications to supervised learning are sketched.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2018

On consistent estimation of the missing mass

Given n samples from a population of individuals belonging to different ...
research
05/19/2020

Revisiting Concentration of Missing Mass

We revisit the problem of missing mass concentration, deriving Bernstein...
research
02/27/2019

Consistent estimation of the missing mass for feature models

Feature models are popular in machine learning and they have been recent...
research
03/12/2015

On the Impossibility of Learning the Missing Mass

This paper shows that one cannot learn the probability of rare events wi...
research
06/26/2023

Optimal estimation of high-order missing masses, and the rare-type match problem

Consider a random sample (X_1,…,X_n) from an unknown discrete distributi...
research
02/06/2022

Missing Mass Estimation from Sticky Channels

Distribution estimation under error-prone or non-ideal sampling modelled...
research
09/09/2020

The Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxation

Comparing metric measure spaces (i.e. a metric space endowed with a prob...

Please sign up or login with your details

Forgot password? Click here to reset