Singletons for Simpletons: Revisiting Windowed Backoff using Chernoff Bounds

08/27/2019
by   Qian M. Zhou, et al.
0

For the well-known problem of balls dropped uniformly at random into bins, the number of singletons — those bins with a single ball — is important to the analysis of backoff algorithms. Existing arguments employ advanced tools to obtain concentration bounds. Here we show that standard Chernoff bounds can be used instead, and the simplicity of this approach is illustrated by re-analyzing several fundamental backoff algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/02/2020

Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations

Analyzing probabilistic programs and randomized algorithms are classical...
research
10/17/2019

Sharper bounds for uniformly stable algorithms

The generalization bounds for stable algorithms is a classical question ...
research
07/03/2018

The power of thinning in balanced allocation

Balls are sequentially allocated into n bins as follows: for each ball, ...
research
02/27/2019

Improved Concentration Bounds for Conditional Value-at-Risk and Cumulative Prospect Theory using Wasserstein distance

Known finite-sample concentration bounds for the Wasserstein distance be...
research
01/01/2014

Learning without Concentration

We obtain sharp bounds on the performance of Empirical Risk Minimization...
research
12/03/2019

Fundamental Limitations in Sequential Prediction and Recursive Algorithms: L_p Bounds via an Entropic Analysis

In this paper, we obtain fundamental L_p bounds in sequential prediction...
research
08/07/2023

Slepian concentration problem for polynomials on the unit Ball

We study the Slepian spatiospectral concentration problem for the space ...

Please sign up or login with your details

Forgot password? Click here to reset