Related papers: Some Hoeffding- and Bernstein-type Concentration I…
From concentration inequalities for the suprema of Gaussian or Rademacher processes an inequality is derived. It is applied to sharpen existing and to derive novel bounds on the empirical Rademacher complexities of unit balls in various…
We prove higher order concentration bounds for functions on Stiefel and Grassmann manifolds equipped with the uniform distribution. This partially extends previous work for functions on the unit sphere. Technically, our results are based on…
Certain previously known upper bounds on the moments of the norm of martingales in 2-smooth Banach spaces are improved. Some of these improvements hold even for sums of independent real-valued random variables. Applications to concentration…
We prove a multivariate version of Hoeffding's inequality about the distribution of homogeneous polynomials of Rademacher functions. The proof is based on such an estimate about the moments of homogeneous polynomials of Rademacher functions…
We derive novel concentration inequalities for the operator norm of the sum of self-adjoint operators that do not explicitly depend on the underlying dimension of the operator, but rather an intrinsic notion of it. Our analysis leads to…
We establish an Azuma type inequality under a Lipshitz condition for martingales in the framework of noncommutative probability spaces and apply it to deduce a noncommutative Heoffding inequality as well as a noncommutative McDiarmid type…
We extend the theory of concentration inequalities to simple random tensors with heavy-tailed coefficients. Specifically, we consider the class of sub-Weibull distributions $\mathcal{S}_\alpha$ for $\alpha \in [1, 2]$. We establish…
We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…
Upper bounds for the probabilities $\mathbb{P}(F\geq \mathbb{E} F + r)$ and $\mathbb{P}(F\leq \mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process…
We prove concentration inequalities and associated PAC bounds for continuous- and discrete-time additive functionals for possibly unbounded functions of multivariate, nonreversible diffusion processes. Our analysis relies on an approach via…
Initially motivated by the study of the non-asymptotic properties of non-parametric tests based on permutation methods, concentration inequalities for uniformly permuted sums have been largely studied in the literature. Recently, Delyon et…
The concentration of empirical measures is studied for dependent data, whose joint distribution satisfies Poincar\'{e}-type or logarithmic Sobolev inequalities. The general concentration results are then applied to spectral empirical…
We show sharpened forms of the concentration of measure phenomenon typically centered at stochastic expansions of order $d-1$ for any $d \in \mathbb{N}$. Here we focus on differentiable functions on the Euclidean space in presence of a…
We prove new concentration estimates for random variables that are functionals of a Poisson measure defined on a general measure space. Our results are specifically adapted to geometric applications, and are based on a pervasive use of a…
Bayesian posterior distributions are widely used for inference, but their dependence on a statistical model creates some challenges. In particular, there may be lots of nuisance parameters that require prior distributions and posterior…
Concentration inequalities for the sample mean, like those due to Bernstein, Hoeffding, and Bentkus, are valid for any sample size but overly conservative, yielding confidence intervals that are unnecessarily wide. The central limit theorem…
The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…
We present a short proof of a conjecture proposed by I. Ra\c{s}a (2017), which is an inequality involving basic Bernstein polynomials and convex functions. This proof was given in the letter to I. Ra\c{s}a (2017). The methods of our proof…
We provide a systematic approach to deal with the following problem. Let $X_1,\ldots,X_n$ be, possibly dependent, $[0,1]$-valued random variables. What is a sharp upper bound on the probability that their sum is significantly larger than…
In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in…