We prove concentration inequalities for functions of independent random variables {under} sub-gaussian and sub-exponential conditions. The utility of the inequalities is demonstrated by an extension of the now classical method of Rademacher complexities to Lipschitz function classes and unbounded sub-exponential distribution.
We consider Markov chain with spectral gap in $L^2$ space. Assume that $f$ is a bounded function. Then the probabilities of large deviations of average along trajectory satisfy Hoeffding's-type inequalities. These bounds depend only on the stationary mean, spectral gap and the end-points of support of $f$.
Beijing National Research Center for Information Science and Technology(北京信息科学与技术国家研究中心);Tsinghua University(清华大学)
It is well known that Hoeffding's inequality has a lot of applications in the signal and information processing fields. How to improve Hoeffding's inequality and find the refinements of its applications have always attracted much attentions. An improvement of Hoeffding inequality was recently given by Hertz \cite{r1}. Eventhough such an improvement is not so big, it still can be used to update many known results with original Hoeffding's inequality, especially for Hoeffding-Azuma inequality for martingales. However, the results in original Hoeffding's inequality and its refinement one by Hertz…
We prove a new Bernstein-type inequality for the log-likelihood function of Bernoulli variables. In contrast to classical Bernstein's inequality and Hoeffding's inequality when applied to the log-likelihood, the new bound is independent of the parameters of the Bernoulli variables and therefore does not blow up as the parameters approach 0 or 1. The new inequality strengthens certain theoretical results on likelihood-based methods for community detection in networks and can be applied to other likelihood-based methods for binary data.
In a celebrated work by Hoeffding [J. Amer. Statist. Assoc. 58 (1963) 13-30], several inequalities for tail probabilities of sums M_n=X_1+... +X_n of bounded independent random variables X_j were proved. These inequalities had a considerable impact on the development of probability and statistics, and remained unimproved until 1995 when Talagrand [Inst. Hautes Etudes Sci. Publ. Math. 81 (1995a) 73-205] inserted certain missing factors in the bounds of two theorems. By similar factors, a third theorem was refined by Pinelis [Progress in Probability 43 (1998) 257-314] and refined (and extended) …
In this work, Bernstein's concentration inequalities for squared integrable matrix-valued discrete-time martingales are obtained. Based on Lieb's theory and Bernstein's condition, a suitable supermartingale can be constructed. Our proof is largely based on this new exponential supermartingale, Freedman's method, and Doob's stopping theorem. Our result can be regarded as an extension of Tropp's work (ECP, 2012).
For self-normalized martingales with conditionally symmetric differences, de la Peña [A general class of exponential inequalities for martingales and ratios. Ann. Probab. 27, No.1, 537-564] established the Gaussian type exponential inequalities. Bercu and Touati [Exponential inequalities for self-normalized martingales with applications. Ann. Appl. Probab. 18: 1848-1869] extended de la Peña's inequalities to martingales with differences heavy on left. In this paper, we establish Bernstein type exponential inequalities for self-normalized martingales with differences bounded from below. Moreove…
We consider the three dimensional array $\mathcal{A} = \{a_{i,j,k}\}_{1\le i,j,k \le n}$, with $a_{i,j,k} \in [0,1]$, and the two random statistics $T_{1}:= \sum_{i=1}^n \sum_{j=1}^n a_{i,j,σ(i)}$ and $T_{2}:= \sum_{i=1}^{n} a_{i,σ(i),π(i)}$, where $σ$ and $π$ are chosen independently from the set of permutations of $\{1,2,\ldots,n \}.$ These can be viewed as natural three dimensional generalizations of the statistic $T_{3}=\sum_{i=1}^{n} a_{i,σ(i)}$, considered by Hoeffding \cite{Hoe51}. Here we give Bernstein type concentration inequalities for $T_{1}$ and $T_{2}$ by extending the argument f…
We consider the stochastic integrals of multivariate point processes and study their concentration phenomena. In particular, we obtain a Bernstein type of concentration inequality through Doléans-Dade exponential formula and a uniform exponential inequality using a generic chaining argument. As applications, we obtain a upper bound for a sequence of discrete time martingales indexed by a class of functionals, and so derive the rate of convergence for nonparametric maximum likelihood estimators, which is an improvement of earlier work of van de Geer.
The Entropy method provides a powerful framework for proving scalar concentration inequalities by establishing functional inequalities like Poincare and log-Sobolev inequalities. These inequalities are especially useful for deriving concentration for dependent distributions coming from stationary distributions of Markov chains. In contrast to the scalar case, the study of matrix concentration inequalities is fairly recent and there does not seem to be a general framework for proving matrix concentration inequalities using the Entropy method. In this paper, we initiate the study of Matrix value…
We show sharpened forms of the concentration of measure phenomenon centered at first order stochastic expansions. The bound are based on second order difference operators and second order derivatives. Applications to functions on the discrete cube and stochastic Hoeffding type expansions in mathematical statistics are studied as well as linear eigenvalue statistics in random matrix theory.
We establish concentration inequalities for Lipschitz functions of dependent random variables, whose dependencies are specified by forests. We also give concentration results for decomposable functions, improving Janson's Hoeffding-type inequality for the summation of graph-dependent bounded variables. These results extend McDiarmid's bounded difference inequality to the dependent cases.
This note contains some estimates for tail spaces on Hamming cube. We use analytic paraproduct operator for that purpose. We also show several types of Bernstein--Markov inequalities for Banach space valued functions on Hamming cube. Here the novelty is in getting rid of some irritating logarithms and in proving Bernstein--Markov inequalities for $|\nabla f|_X$ rather than for $Δ^{1/2} f$ for $X$ valued polynomials on Hamming cube.
The Bernstein inequality is a tight upper bound on tail probabilities for independent random variables. Freedman extended the Bernstein inequality to martingales with differences bounded from above, and then Dzhaparidze and van Zanten generalized Freedman's result to non-bounded locally square integrable martingales. In this paper, we derive some Dzhaparidze-van Zanten type inequalities for self-normalized martingales with square integrable and non-square integrable differences.
We obtain a Bernstein type Gaussian concentration inequality for martingales. Our inequality improves the Azuma-Hoeffding inequality for moderate deviations $x$. Following the work of McDiarmid (1989), Talagrand (1996) and Boucheron, Lugosi and Massart (2000,2003), we show that our result can be applied to the concentration of random functions, Erdös-Rényi random graph, and maxima of empirical processes. Several interesting Gaussian concentration inequalities have been obtained.
CY University(CY大学);University Paris 1 Panthéon-Sorbonne(巴黎第一大学先贤祠-索邦大学)
Concentration inequalities are widely used for analyzing machine learning algorithms. However, current concentration inequalities cannot be applied to some of the most popular deep neural networks, notably in natural language processing. This is mostly due to the non-causal nature of such involved data, in the sense that each data point depends on other neighbor data points. In this paper, a framework for modeling non-causal random fields is provided and a Hoeffding-type concentration inequality is obtained for this framework. The proof of this result relies on a local approximation of the non…
A note on exponential inequalities for the distribution tails of canonical von Mises' statistics of dependent observations
对于满足φ-混合条件的平稳随机变量序列的样本,得到了任意阶标准von Mises统计量分布尾的Hoeffding型指数不等式.本文削弱了Borisov和Volodko(2009)的论文“Exponential inequalities for the distributions of canonical U- and V-statistics of dependent observations”中对系数φ()的限制。同时,对文中的相应证明进行了修正.
For a real-valued measurable function $f$ and a nonnegative, nondecreasing function $ϕ$, we first obtain a Chebyshev type inequality which provides an upper bound for $\displaystyle ϕ(λ_{1}) μ(\{x \in Ω: f(x) \geq λ_{1} \}) + \sum_{k=2}^{n}\left(ϕ(λ_{k})- ϕ(λ_{k-1})\right) μ(\{x \in Ω: f(x) \geq λ_{k}\}) ,$ where $0 < λ_1 < λ_2 \cdots λ_n < \infty$. Using this, generalizations of a few concentration inequalities such as Markov, reverse Markov, Bienaymé-Chebyshev, Cantelli and Hoeffding inequalities are obtained.
Using the renewal approach we prove Bernstein-like inequalities for additive functionals of geometrically ergodic Markov chains, thus obtaining counterparts of inequalities for sums of independent random variables. The coefficient in the sub-Gaussian part of our estimate is the asymptotic variance of the additive functional, i.e. the variance of the limiting Gaussian variable in the Central Limit Theorem for Markov chains. This refines earlier results by R. Adamczak and W. Bednorz, which were obtained under the additional assumption of strong aperiodicity of the chain.
In this article we present a Bernstein inequality for sums of random variables which are defined on a spatial lattice structure. The inequality can be used to derive concentration inequalities. It can be useful to obtain consistency properties for nonparametric estimators of conditional expectation functions.
We obtain the following dimension independent Bernstein-Markov inequality in Gauss space: for each $1\leq p<\infty$ there exists a constant $C_p>0$ such that for any $k\geq 1$ and all polynomials $P$ on $\mathbb{R}^{k}$ we have $$ \| \nabla P\|_{L^{p}(\mathbb{R}^{k}, \mathrm{d}γ_k)} \leq C_p (\mathrm{deg}\, P)^{\frac{1}{2}+\frac{1}π\arctan\left(\frac{|p-2|}{2\sqrt{p-1}}\right)}\|P\|_{L^{p}(\mathbb{R}^{k}, \mathrm{d}γ_k)}, $$ where $\mathrm{d}γ_k$ is the standard Gaussian measure on $\mathbb{R}^{k}$. We also show that under some mild growth assumptions on any function $B \in C^{2}((0,\infty))\c…
Since Kilmer et al. introduced the new multiplication method between two third-order tensors around 2008 and third-order tensors with such multiplication structure are also called as T-product tensors, T-product tensors have been applied to many fields in science and engineering, such as low-rank tensor approximation, signal processing, image feature extraction, machine learning, computer vision, and the multi-view clustering problem, etc. However, there are very few works dedicated to exploring the behavior of random T-product tensors. This work considers the problem about the tail behavior o…
Recent development in high-dimensional statistical inference has necessitated concentration inequalities for a broader range of random variables. We focus on sub-Weibull random variables, which extend sub-Gaussian or sub-exponential random variables to allow heavy-tailed distributions. This paper presents concentration inequalities for independent sub-Weibull random variables with finite Generalized Bernstein-Orlicz norms, providing generalized Bernstein's inequalities and Rosenthal-type moment bounds. The tightness of the proposed bounds is shown through lower bounds of the concentration ineq…
We derive concentration inequalities for empirical means $\frac{1}{t} \int_0^t f(X_s) ds$ where $X_s$ is an irreducible Markov jump process on a finite state space and $f$ some observable. Using a Feynman-Kac semigroup we first derive a general concentration inequality. Then, based on this inequality we derive further concentration inequalities. Hereby we use three different methods; perturbation theory, Poincaré inequalities and information inequalities. We also obtain a Bernstein type concentration inequality.
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 al. proved a new Bernstein-type concentration inequality based on martingale theory. This work presents a new proof of this inequality based on the fundamental inequalities for random permutations of Talagrand. The idea is to first obtain a rough inequality for the square root of the permuted sum, and then, iterate the previous analysis and plug this first i…
We obtain moderate deviations theorems and exponential (Bernstein type) concentration inequalities for "nonconventional" sums of the form $S_N=\sum_{n=1}^N (F(ξ_{q_1(n)},ξ_{q_2(n)},...,ξ_{q_\ell(n)})-\bar F)$.
In the present paper we prove that the probabilities of the Pólya urn distribution (with negative replacement) satisfy a monotonicity property similar to that of the binomial distribution (Pólya urn distribution with no replacement). As a consequence, we show that the random variables with Pólya urn distribution (with negative replacement) are stochastically ordered with respect to the parameter giving the initial distribution of the urn. An equivalent formulation of this result shows that the new Bernstein operator recently introduced in [3] is a monotone operator. The proofs are probabilisti…
We derive tight and computable bounds on the bias of statistical estimators, or more generally of quantities of interest, when evaluated on a baseline model P rather than on the typically unknown true model Q. Our proposed method combines the scalable information inequality derived by P. Dupuis, K.Chowdhary, the authors and their collaborators together with classical concentration inequalities (such as Bennett's and Hoeffding-Azuma inequalities). Our bounds are expressed in terms of the Kullback-Leibler divergence R(Q||P) of model Q with respect to P and the moment generating function for the …
We present some extensions of Bernstein's concentration inequality for random matrices. This inequality has become a useful and powerful tool for many problems in statistics, signal processing and theoretical computer science. The main feature of our bounds is that, unlike the majority of previous related results, they do not depend on the dimension $d$ of the ambient space. Instead, the dimension factor is replaced by the "effective rank" associated with the underlying distribution that is bounded from above by $d$. In particular, this makes an extension to the infinite-dimensional setting po…