Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Method For Bounding Tail Probabilities (2402.13662v2)

Published 21 Feb 2024 in math.PR, cs.IT, math.IT, math.ST, stat.ML, and stat.TH

Abstract: We present a method for upper and lower bounding the right and the left tail probabilities of continuous random variables (RVs). For the right tail probability of RV $X$ with probability density function $f_X(x)$, this method requires first setting a continuous, positive, and strictly decreasing function $g_X(x)$ such that $-f_X(x)/g'_X(x)$ is a decreasing and increasing function, $\forall x>x_0$, which results in upper and lower bounds, respectively, given in the form $-f_X(x) g_X(x)/g'_X(x)$, $\forall x>x_0$, where $x_0$ is some point. Similarly, for the upper and lower bounds on the left tail probability of $X$, this method requires first setting a continuous, positive, and strictly increasing function $g_X(x)$ such that $f_X(x)/g'_X(x)$ is an increasing and decreasing function, $\forall x<x_0$, which results in upper and lower bounds, respectively, given in the form $f_X(x) g_X(x)/g'_X(x)$, $\forall x<x_0$. We provide some examples of good candidates for the function $g_X(x)$. We also establish connections between the new bounds and Markov's inequality and Chernoff's bound. In addition, we provide an iterative method for obtaining ever tighter lower and upper bounds, under certain conditions. Finally, we provide numerical examples, where we show the tightness of these bounds, for some chosen $g_X(x)$.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (7)
  1. P. L. Chebyshev, “Des valeurs moyennes,” Liouville’s J. Math. Pures Appl., vol. 12, pp. 177–184, 1867.
  2. H. Chernoff, “A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,” The Annals of Mathematical Statistics, vol. 23, no. 4, pp. 493–507, 1952.
  3. W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American Statistical Association, vol. 58, no. 301, pp. 13–30, 1963.
  4. R. Ahlswede, P. Gács, and J. Körner, “Bounds on conditional probabilities with applications in multi-user communication,” Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 34, no. 2, pp. 157–177, 1976.
  5. M. Ledoux, “On Talagrand’s deviation inequalities for product measures,” ESAIM: Probability and Statistics, vol. 1, p. 63–87, 1997.
  6. M. Talagrand, “Concentration of measure and isoperimetric inequalities in product spaces,” Publications Mathématiques de l’Institut des Hautes Etudes Scientifiques, vol. 81, pp. 73–205, 1995.
  7. T. Erseghe, “On the evaluation of the polyanskiy-poor–verdú converse bound for finite block-length coding in awgn,” IEEE Transactions on Information Theory, vol. 61, no. 12, pp. 6578–6590, 2015.

Summary

We haven't generated a summary for this paper yet.