English
Related papers

Related papers: On Sharpest Tail Bounds for Functions of Tail Boun…

200 papers

While numerous works have focused on devising efficient algorithms for reinforcement learning (RL) with uniformly bounded rewards, it remains an open question whether sample or time-efficient algorithms for RL with large state-action space…

Machine Learning · Computer Science 2024-03-08 Jiayi Huang , Han Zhong , Liwei Wang , Lin F. Yang

We obtain concentration and large deviation for the sums of independent and identically distributed random variables with heavy-tailed distributions. Our concentration results are concerned with random variables whose distributions satisfy…

Probability · Mathematics 2022-07-27 Milad Bakhshizadeh , Arian Maleki , Victor H. de la Pena

In this paper, I present a completely new type of upper and lower bounds on the right-tail probabilities of continuous random variables with unbounded support and with semi-bounded support from the left. The presented upper and lower…

Probability · Mathematics 2023-11-28 Nikola Zlatanov

We derive in this article the asymptotic behavior as well as non-asymptotical estimates of tail of distribution for self-normalized sums of random variables (r.v.) under natural classical norming. We investigate also the case of…

Probability · Mathematics 2017-10-10 E. Ostrovsky , L. Sirota

The paper suggests a simple method of deriving minimax lower bounds to the accuracy of statistical inference on heavy tails. A well-known result by Hall and Welsh (Ann. Statist. 12 (1984) 1079-1084) states that if $\hat{\alpha}_n$ is an…

Statistics Theory · Mathematics 2014-03-14 S. Y. Novak

We say that a random integer variable $X$ is monotone if the modulus of the characteristic function of $X$ is decreasing on $[0,\pi]$. This is the case for many commonly encountered variables, e.g., Bernoulli, Poisson and geometric random…

Probability · Mathematics 2021-04-14 Anders Aamand , Noga Alon , Jakob Bæk Tejs Knudsen , Mikkel Thorup

In our recent research endeavors, we have delved into the realm of tail bounds problems concerning bivariate random tensor means. In this context, tensors are treated as finite-dimensional operators. However, the longstanding challenge of…

Probability · Mathematics 2023-08-15 Shih-Yu Chang

We consider non-convex stochastic optimization using first-order algorithms for which the gradient estimates may have heavy tails. We show that a combination of gradient clipping, momentum, and normalized gradient descent yields convergence…

Machine Learning · Computer Science 2021-11-10 Ashok Cutkosky , Harsh Mehta

Let $X_{1},\ldots ,X_{n}$ be $n$ real-valued dependent random variables. With motivation from Mitra and Resnick (2009), we derive the tail asymptotic expansion for the weighted sum of order statistics $X_{1:n}\leq \cdots \leq X_{n:n}$ of…

Probability · Mathematics 2014-08-07 Enkelejd Hashorva , Jinzhi Li

This paper describes the construction of a lower bound for the tails of general random variables, using solely knowledge of their moment generating function. The tilting procedure used allows for the construction of lower bounds that are…

Probability · Mathematics 2007-06-13 Ted Theodosopoulos

We study the Excluded Grid Theorem, a fundamental structural result in graph theory, that was proved by Robertson and Seymour in their seminal work on graph minors. The theorem states that there is a function $f: \mathbb{Z}^+ \to…

Discrete Mathematics · Computer Science 2019-01-24 Julia Chuzhoy , Zihan Tan

We provide finite sample upper and lower bounds on the Binomial tail probability which are a direct application of Sanov's theorem. We then use these to obtain high probability upper and lower bounds on the minimum of i.i.d. Binomial random…

Probability · Mathematics 2025-02-27 Xiaohan Zhu , Mesrob I. Ohannessian , Nathan Srebro

The study of tail behaviour of SGD-induced processes has been attracting a lot of interest, due to offering strong guarantees with respect to individual runs of an algorithm. While many works provide high-probability guarantees, quantifying…

Machine Learning · Computer Science 2026-02-06 Aleksandar Armacki , Dragana Bajović , Dušan Jakovetić , Soummya Kar , Ali H. Sayed

In a number of applications, particularly in financial and actuarial mathematics, it is of interest to characterize the tail distribution of a random variable $V$ satisfying the distributional equation $V\stackrel{\mathcal{D}}{=}f(V)$,…

Probability · Mathematics 2014-07-04 Jeffrey F. Collamore , Guoqing Diao , Anand N. Vidyashankar

Consider a random sample in the max-domain of attraction of a multivariate extreme value distribution such that the dependence structure of the attractor belongs to a parametric model. A new estimator for the unknown parameter is defined as…

Statistics Theory · Mathematics 2012-10-05 John H. J. Einmahl , Andrea Krajina , Johan Segers

Models based on assumptions of multivariate regular variation and hidden regular variation provide ways to describe a broad range of extremal dependence structures when marginal distributions are heavy tailed. Multivariate regular variation…

Probability · Mathematics 2007-05-23 Janet E. Heffernan , Sidney I. Resnick

Modelling multivariate tail dependence is one of the key challenges in extreme-value theory. Multivariate extremes are usually characterized using parametric models, some of which have simpler submodels at the boundary of their parameter…

Methodology · Statistics 2018-12-17 Anna Kiriliouk

The exact expression for the probability density $p_{_N}(x)$ for sums of a finite number $N$ of random independent terms is obtained. It is shown that the very tail of $p_{_N}(x)$ has a Gaussian form if and only if all the random terms are…

Probability · Mathematics 2013-05-29 Michael I. Tribelsky

Consider a sequence of i.i.d. random Lipschitz functions $\{\Psi_n\}_{n \geq 0}$. Using this sequence we can define a Markov chain via the recursive formula $R_{n+1} = \Psi_{n+1}(R_n)$. It is a well known fact that under some mild moment…

Probability · Mathematics 2015-04-21 Piotr Dyszewski

We consider solutions to so-called stochastic fixed point equation $R \stackrel{d}{=} \Psi(R)$, where $\Psi $ is a random Lipschitz function and $R$ is a random variable independent of $\Psi$. Under the assumption that $\Psi$ can be…

Probability · Mathematics 2017-06-14 Ewa Damek , Piotr Dyszewski