English
Related papers

Related papers: Variance Bounds: Some Old and Some New

200 papers

We consider the variance of a function of $n$ independent random variables and provide new inequalities which, in particular, extend previous results obtained for symmetric functions in the i.i.d.~setting. For instance, we obtain various…

Statistics Theory · Mathematics 2020-01-01 Olivier Bousquet , Christian Houdré

The Chernoff bound is a well-known tool for obtaining a high probability bound on the expectation of a Bernoulli random variable in terms of its sample average. This bound is commonly used in statistical learning theory to upper bound the…

Machine Learning · Statistics 2022-05-18 Andrew Y. K. Foong , Wessel P. Bruinsma , David R. Burt

Existing concentration bounds for bounded vector-valued random variables include extensions of the scalar Hoeffding and Bernstein inequalities. While the latter is typically tighter, it requires knowing a bound on the variance of the random…

Statistics Theory · Mathematics 2026-05-28 Diego Martinez-Taboada , Aaditya Ramdas

A general device is proposed, which provides for extension of exponential inequalities for sums of independent real-valued random variables to those for martingales in the 2-smooth Banach spaces. This is used to obtain optimum bounds of the…

Probability · Mathematics 2012-12-11 Iosif Pinelis

We develop novel empirical Bernstein inequalities for the variance of bounded random variables. Our inequalities hold under constant conditional variance and mean, without further assumptions like independence or identical distribution of…

Statistics Theory · Mathematics 2026-05-28 Diego Martinez-Taboada , Aaditya Ramdas

We explore asymptotically optimal bounds for deviations of distributions of independent Bernoulli random variables from the Poisson limit in terms of the Shannon relative entropy and R\'enyi/Tsallis relative distances (including Pearson's…

Probability · Mathematics 2019-08-15 S. G. Bobkov , G. P. Chistyakov , F. Götze

We consider the problem of bounding large deviations for non-i.i.d. random variables that are allowed to have arbitrary dependencies. Previous works typically assumed a specific dependence structure, namely the existence of independent…

Probability · Mathematics 2018-11-06 Christoph H. Lampert , Liva Ralaivola , Alexander Zimin

Using coupling techniques based on Stein's method for probability approximation, we revisit classical variance bounding inequalities of Chernoff, Cacoullos, Chen and Klaassen. Taking advantage of modern coupling techniques allows us to…

Probability · Mathematics 2019-11-11 Fraser Daly , Fatemeh Ghaderinezhad , Christophe Ley , Yvik Swan

We derive various sharp bounds on moments of the distance between two independent random vectors taking values in a Banach space.

Functional Analysis · Mathematics 2019-05-06 Assaf Naor , Krzysztof Oleszkiewicz

This paper develops sharp bounds on moments of sums of k-wise independent bounded random variables, under constrained average variance. The result closes the problem addressed in part in the previous works of Schmidt et al. and Bellare,…

Probability · Mathematics 2022-09-07 Maciej Skorski

Estimating and optimizing Mutual Information (MI) is core to many problems in machine learning; however, bounding MI in high dimensions is challenging. To establish tractable and scalable objectives, recent work has turned to variational…

Machine Learning · Computer Science 2019-05-17 Ben Poole , Sherjil Ozair , Aaron van den Oord , Alexander A. Alemi , George Tucker

Variational methods are employed in situations where exact Bayesian inference becomes intractable due to the difficulty in performing certain integrals. Typically, variational methods postulate a tractable posterior and formulate a lower…

Machine Learning · Statistics 2019-06-12 Nikolaos Gianniotis , Christoph Schnörr , Christian Molkenthin , Sanjay Singh Bora

This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the…

Artificial Intelligence · Computer Science 2015-03-19 Wolfgang Gatterbauer , Dan Suciu

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

Information Theory · Computer Science 2007-07-13 Beniamin Mounits , Tuvi Etzion , Simon Litsyn

As was noted already by A. N. Kolmogorov, any random variable has a Bernoulli component. This observation provides a tool for the extension of results which are known for Bernoulli random variables to arbitrary distributions. Two…

Probability · Mathematics 2010-10-26 Michael Aizenman , Francois Germinet , Abel Klein , Simone Warzel

Deep neural networks have achieved impressive results on a wide variety of tasks. However, quantifying uncertainty in the network's output is a challenging task. Bayesian models offer a mathematical framework to reason about model…

Machine Learning · Computer Science 2019-05-28 Manikanta Srikar Yellapragada , Chandra Prakash Konkimalla

In this paper we derive sharp lower and upper bounds for the covariance of two bounded random variables when knowledge about their expected values, variances or both is available. When only the expected values are known, our result can be…

Probability · Mathematics 2021-06-21 Ola Hössjer , Arvid Sjölander

Known Bernstein-type upper bounds on the tail probabilities for sums of independent zero-mean sub-exponential random variables are improved in several ways at once. The new upper bounds have a certain optimality property.

Probability · Mathematics 2022-08-15 Iosif Pinelis

The potential applications of boundary functionals of random processes, such as the extreme values of these processes, the moment of first reaching a fixed level, the value of the process at the moment of reaching the level, the moment of…

Statistical Mechanics · Physics 2025-01-15 V. V. Ryazanov

New lower bounds on the total variation distance between the distribution of a sum of independent Bernoulli random variables and the Poisson random variable (with the same mean) are derived via the Chen-Stein method. The new bounds rely on…

Information Theory · Computer Science 2013-07-17 Igal Sason
‹ Prev 1 2 3 10 Next ›