Related papers: A Method For Bounding Tail Probabilities
In this paper the following result, which allows one to decouple U-Statistics in tail probability, is proved in full generality. Theorem 1. Let $X_i$ be a sequence of independent random variables taking values in a measure space $S$, and…
Often, it is required to estimate the probability that a quantity such as toxicity level, plutonium, temperature, rainfall, damage, wind speed, wave size, earthquake magnitude, risk, etc., exceeds an unsafe high threshold. The probability…
A random variable $\xi$ has a {\it light-tailed} distribution (for short: is light-tailed) if it possesses a finite exponential moment, $\E \exp (\lambda \xi) <\infty$ for some $\lambda >0$, and has a {\it heavy-tailed} distribution (is…
We study the generalization properties of unregularized gradient methods applied to separable linear classification -- a setting that has received considerable attention since the pioneering work of Soudry et al. (2018). We establish tight…
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any available scheme that bounds the probability of evidence or…
Effective bounds on the union probability are well known to be beneficial in the analysis of stochastic problems in many areas, including probability theory, information theory, statistical communications, computing and operations research.…
Many management decisions involve accumulated random realizations for which only the first and second moments of their distribution are available. The sharp Chebyshev-type bound for the tail probability and Scarf bound for the expected loss…
Bayesian composite likelihood estimation of the tail index of a heavy-tailed distribution is addressed when data are randomly right-censored. Maximum a posteriori and mean posterior estimators are constructed under Jeffrey's prior…
Multivariate regular variation plays a role assessing tail risk in diverse applications such as finance, telecommunications, insurance and environmental science. The classical theory, being based on an asymptotic model, sometimes leads to…
In this paper, we will give a sufficient condition for a non-negative random variable $X$ to be heavy tailed by investigating the Laplace-Stieltjes transform of the probability distribution function. We focus on the relation between the…
In this work, we consider systems that are subjected to intermittent instabilities due to external stochastic excitation. These intermittent instabilities, though rare, have a large impact on the probabilistic response of the system and…
In recent years, tensors have been applied to different applications in science and engineering fields. In order to establish theory about tail bounds of the tensors summation behavior, this work extends previous work by considering the…
Under K.-T. Sturm's formulation, we obtain a Gaussian upper bound for tail probability of mean value of independent, identically distributed random variables with values in $\mathbb{R}$-trees and Hadamard manifolds.
This paper proposes a probabilistic approach to investigate the shape of landscapes of multi-dimensional potential functions. Under a suitable coupling scheme, two copies of the overdamped Langevin dynamics associated with the potential…
The upper tail problem for the largest eigenvalue of the Erd\H{o}s--R\'enyi random graph $\mathcal{G}_{n,p}$ is to estimate the probability that the largest eigenvalue of the adjacency matrix of $\mathcal{G}_{n,p}$ exceeds its typical value…
We obtain an uniform tail estimates for natural normed sums of independent random variables (r.v.) with regular varying tails of distributions. We give also many examples on order to show the exactness of offered estimates and discuss some…
When an explicit expression for a probability distribution function $F(x)$ can not be found, asymptotic properties of the tail probability function $\bar{F}(x)=1-F(x)$ are very valuable, since they provide approximations or bounds for…
Stochastic gradient descent is one of the most common iterative algorithms used in machine learning and its convergence analysis is a rich area of research. Understanding its convergence properties can help inform what modifications of it…
We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.