A Constructive Proof of a Concentration Bound for Real-Valued Random Variables

05/03/2019
by   Wolfgang Mulzer, et al.
0

Almost 10 years ago, Impagliazzo and Kabanets (2010) gave a new combinatorial proof of Chernoff's bound for sums of bounded independent random variables. Unlike previous methods, their proof is constructive. This means that it provides an efficient randomized algorithm for the following task: given a set of Boolean random variables whose sum is not concentrated around its expectation, find a subset of statistically dependent variables. However, the algorithm of Impagliazzo and Kabanets (2010) is given only for the Boolean case. On the other hand, the general proof technique works also for real-valued random variables, even though for this case, Impagliazzo and Kabanets (2010) obtain a concentration bound that is slightly suboptimal. Here, we address both these issues: we show how to extend the Impagliazzo-Kabanets algorithm to real-valued random variables, and we improve the corresponding concentration bound by a constant factor.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2021

A Simple Necessary Condition For Independence of Real-Valued Random Variables

The standard method to check for the independence of two real-valued ran...
research
03/30/2020

Sharp Concentration Results for Heavy-Tailed Distributions

We obtain concentration and large deviation for the sums of independent ...
research
05/15/2022

A Note on the Chernoff Bound for Random Variables in the Unit Interval

The Chernoff bound is a well-known tool for obtaining a high probability...
research
02/12/2018

Randomized Empirical Processes and Confidence Bands via Virtual Resampling

Let X,X_1,X_2,... be independent real valued random variables with a com...
research
02/02/2019

Itemsets for Real-valued Datasets

Pattern mining is one of the most well-studied subfields in exploratory ...
research
11/23/2022

A Calculus for Amortized Expected Runtimes

We develop a weakest-precondition-style calculus à la Dijkstra for reaso...
research
12/12/2021

Interpreting Lambda Calculus in Domain-Valued Random Variables

We develop Boolean-valued domain theory and show how the lambda-calculus...

Please sign up or login with your details

Forgot password? Click here to reset