Related papers: Universal concentration for sums under arbitrary d…

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

We examine the concentration of uniform generalization errors around their expectation in binary linear classification problems via an isoperimetric argument. In particular, we establish Poincar\'{e} and log-Sobolev inequalities for the…

This paper develops nonasymptotic growth and concentration bounds for a product of independent random matrices. These results sharpen and generalize recent work of Henriksen-Ward, and they are similar in spirit to the results of…

A certain spectrum, indexed by a\in[0,\infty], of upper bounds P_a(X;x) on the tail probability P(X\geq x), with P_0(X;x)=P(X\geq x) and P_\infty(X;x) being the best possible exponential upper bound on P(X\geq x), is shown to be stable and…

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…

We consider the infinite-horizon, average-reward restless bandit problem in discrete time. We propose a new class of policies that are designed to drive a progressively larger subset of arms toward the optimal distribution. We show that our…

We propose new concentration inequalities for self-normalized martingales. The main idea is to introduce a suitable weighted sum of the predictable quadratic variation and the total quadratic variation of the martingale. It offers much more…

Let $X$ be a centered random vector in a finite dimensional real inner product space $\mathcal{E}$. For a subset $C$ of the ambient vector space $V$ of $\mathcal{E}$ and $x,\,y\in V$, write $x\preceq_C y$ if $y-x\in C$. When $C$ is a closed…

Due to globalization and relaxed market regulation, we have assisted to an increasing of extremal dependence in international markets. As a consequence, several measures of tail dependence have been stated in literature in recent years,…

We establish fundamental mathematical limits on universal approximation theorem (UAT) system alignment by proving that catastrophic failures are an inescapable feature of any useful computational system. Our central thesis is that for any…

Causal inference from observational data is crucial for many disciplines such as medicine and economics. However, sharp bounds for causal effects under relaxations of the unconfoundedness assumption (causal sensitivity analysis) are subject…

This paper extends classical probabilistic results to the broader class of demimartingales and demisubmartingales. We establish variants of Doob's-type optional sampling theorem under minimal structural conditions on stopping times, relying…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

In this paper, we obtain an explicit total variation bound in the central limit theorem for the sums of non-i.i.d. random variables. Our results show that, under suitable assumptions, Lindeberg's condition is sufficient and necessary for…

We show bounds on tail probabilities for quadratic forms in sub-gaussian non-necessarily independent random variables. Our main tool will be estimates of the Luxemburg norms of such forms. This will allow us to formulate the above-mentioned…

We study randomly stopped sums via their asymptotic scales. First, finiteness of moments is considered. To generalise this study, asymptotic scales applicable to the class of all heavy-tailed random variables are used. The stopping is…

We show some preservation results of amenably extending strongly Ulam stable groups under mild decay assumptions, including quantitative preservation of asymptotic bounds under the assumption that the modulus of stability is H\"older…

Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

We introduce a novel bivariate copula model able to capture both the central and tail dependence of the joint probability distribution. Model that can capture the dependence structure within the joint tail have important implications in…