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

Let $X$ be the number of $k$-term arithmetic progressions contained in the $p$-biased random subset of the first $N$ positive integers. We give asymptotically sharp estimates on the logarithmic upper-tail probability $\log \Pr(X \ge E[X] +…

We study the problem of learning nonparametric distributions in a finite mixture, and establish tight bounds on the sample complexity for learning the component distributions in such models. Namely, we are given i.i.d. samples from a pdf…

We propose robust sparse reduced rank regression for analyzing large and complex high-dimensional data with heavy-tailed random noise. The proposed method is based on a convex relaxation of a rank- and sparsity-constrained non-convex…

Probabilistic recurrence relations (PRRs) are a standard formalism for describing the runtime of a randomized algorithm. Given a PRR and a time limit $\kappa$, we consider the classical concept of tail probability $\Pr[T \ge \kappa]$, i.e.,…

Let $X_1,X_2,...,X_n$ be a sequence of independent or locally dependent random variables taking values in $\mathbb{Z}_+$. In this paper, we derive sharp bounds, via a new probabilistic method, for the total variation distance between the…

We show tight upper and lower bounds for switching lemmas obtained by the action of random $p$-restrictions on boolean functions that can be expressed as decision trees in which every vertex is at a distance of at most $t$ from some leaf,…

We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…

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…

Suppose that $X$ is a bounded-degree polynomial with nonnegative coefficients on the $p$-biased discrete hypercube. Our main result gives sharp estimates on the logarithmic upper tail probability of $X$ whenever an associated extremal…

Stochastic approximation (SA) is a fundamental iterative framework with broad applications in reinforcement learning and optimization. Classical analyses typically rely on martingale difference or Markov noise with bounded second moments,…

The study of loss function distributions is critical to characterize a model's behaviour on a given machine learning problem. For example, while the quality of a model is commonly determined by the average loss assessed on a testing set,…

We study generalized branching random walks, which allow time dependence and local dependence between siblings. Under appropriate tail assumptions, we prove the tightness of $F_n(\cdot-Med(F_n))$, where $F_n(\cdot)$ is the maxima…

In this paper, we present a new framework to obtain tail inequalities for sums of random matrices. Compared with existing works, our tail inequalities have the following characteristics: 1) high feasibility--they can be used to study the…

Suppose that $(Z_n)_{n\geq0}$ is a supercritical branching process in independent and identically distributed random environment. The right tail function of the scaled growth rate for $(Z_n)_{n\geq0}$ is studied. The upper bounds for…

Let X_1,..., X_n be independent Bernoulli random variables and $f$ a function on {0,1}^n. In the well-known paper (Talagrand1994) Talagrand gave an upper bound for the variance of f in terms of the individual influences of the X_i's. This…

Let $X$ be an $n\times n$ symmetric random matrix with independent but non-identically distributed entries. The deviation inequalities of the spectral norm of $X$ with Gaussian entries have been obtained by using the standard concentration…

Consider a random sample from a bivariate distribution function $F$ in the max-domain of attraction of an extreme-value distribution function $G$. This $G$ is characterized by two extreme-value indices and a spectral measure, the latter…

We derive functional convergence of the partial maxima stochastic processes of multivariate linear processes with weakly dependent heavy-tailed innovations and random coefficients. The convergence takes place in the space of…

We study in this report the so-called Strictly Subgaussian (SSub) random variables (r.v.), which form a very interest subclass of Subgaussian (Sub) r.v., and obtain the exact exponential bounds for tail of distribution for sums of…

Our work aims to study the tail behaviour of weighted sums of the form $\sum_{i=1}^{\infty} X_{i} \prod_{j=1}^{i}Y_{j}$, where $(X_{i}, Y_{i})$ are independent and identically distributed, with common joint distribution bivariate Sarmanov.…