Bounding Means of Discrete Distributions

09/06/2021
by   Eric Bax, et al.
0

We introduce methods to bound the mean of a discrete distribution (or finite population) based on sample data, for random variables with a known set of possible values. In particular, the methods can be applied to categorical data with known category-based values. For small sample sizes, we show how to leverage knowledge of the set of possible values to compute bounds that are stronger than for general random variables such as standard concentration inequalities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2020

On Optimal Uniform Concentration Inequalities for Discrete Entropies in the High-dimensional Setting

We prove an exponential decay concentration inequality to bound the tail...
research
03/30/2020

Sharp Concentration Results for Heavy-Tailed Distributions

We obtain concentration and large deviation for the sums of independent ...
research
12/07/2020

Conditional independence structures over four discrete random variables revisited: conditional Ingleton inequalities

The paper deals with conditional linear information inequalities valid f...
research
06/15/2016

Network Maximal Correlation

We introduce Network Maximal Correlation (NMC) as a multivariate measure...
research
02/26/2020

Extremes of Censored and Uncensored Lifetimes in Survival Data

The i.i.d. censoring model for survival analysis assumes two independent...
research
02/28/2021

Finite Sample Smeariness on Spheres

Finite Sample Smeariness (FSS) has been recently discovered. It means th...
research
10/22/2020

Sharper convergence bounds of Monte Carlo Rademacher Averages through Self-Bounding functions

We derive sharper probabilistic concentration bounds for the Monte Carlo...

Please sign up or login with your details

Forgot password? Click here to reset