Related papers: Sharp large deviation results for sums of independ…
We present a PAC-Bayes-style generalization bound which enables the replacement of the KL-divergence with a variety of Integral Probability Metrics (IPM). We provide instances of this bound with the IPM being the total variation metric and…
We study the large deviation probabilities of infinite weighted sums of independent random variables that have stretched exponential tails. This generalizes Kiesel and Stadtm\"uller (2000), who study the same objects under the assumption of…
In 1969 V.V.~Petrov found a new sufficient condition for the applicability of the strong law of large numbers to sequences of independent random variables. He proved the following theorem: let $\{X_{n}\}_{n=1}^{\infty}$ be a sequence of…
We analyse the convergence of the proximal gradient algorithm for convex composite problems in the presence of gradient and proximal computational inaccuracies. We derive new tighter deterministic and probabilistic bounds that we use to…
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual parameters that are often used as heuristic estimates of the marginal…
In this work, we improve upon the guarantees for sparse random embeddings, as they were recently provided and analyzed by Freksen at al. (NIPS'18) and Jagadeesan (NIPS'19). Specifically, we show that (a) our bounds are explicit as opposed…
The upper bound inequality for variance of weighted sum of correlated random variables is derived according to Cauchy-Schwarz's inequality, while the weights are non-negative with sum of 1. We also give a novel proof with positive…
We prove large deviation principles for the distribution of the empirical measure of the eigenvalues of Lax matrices following the Generalized Gibbs ensembles of the classical Toda chain introduced in [10]. We deduce the almost sure…
We obtain asymptotic expansions for local probabilities of partial sums for uniformly bounded independent but not necessarily identically distributed integer-valued random variables. The expansions involve products of polynomials and…
By applying results obtained from the new versions of the classical Levy, Ottaviani, and Hoffmann-Jorgensen (1974) inequalities proved by Li and Rosalsky(2013) and by using techniques developed by Hechner and Heinkel (2010), we provide a…
We prove limit relations between the sharp constants in the multivariate Bernstein-Nikolskii type inequalities for trigonometric polynomials and entire functions of exponential type with the spectrum in a centrally symmetric convex body.
The local Rademacher complexity framework is one of the most successful general-purpose toolboxes for establishing sharp excess risk bounds for statistical estimators based on the framework of empirical risk minimization. Applying this…
Let $Y=X_1+\cdots+X_N$ be a sum of a random number of exchangeable random variables, where the random variable $N$ is independent of the $X_j$, and the $X_j$ are from the generalized multinomial model introduced by Tallis (1962). This…
We establish a sharp large deviation principle for renewal-reward processes, supposing that each renewal involves a broad-sense reward taking values in a real separable Banach space. In fact, we demonstrate a weak large deviation principle…
For a polynomial $P_n$ of degree $n$, Bernstein's inequality states that $\|P_n'\| \le n \|P_n\|$ for all $L^p$ norms on the unit circle, $0<p\le\infty,$ with equality for $P_n(z)= c z^n.$ We study this inequality for random polynomials,…
We prove a large deviation principle for the sum of n independent heavy-tailed random variables, which are subject to a moving cut-off boundary at location n. Conditional on the sum being large at scale n, we show that a finite number of…
We prove an exponential probability tail inequality for positive semidefinite quadratic forms in a subgaussian random vector. The bound is analogous to one that holds when the vector has independent Gaussian entries.
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…
Almost 10 years ago, Impagliazzo and Kabanets (2010) gave a new combinatorial proof of Chernoff's bound for sums of bounded independent random variables. Unlike previous methods, their proof is constructive. This means that it provides an…
We obtain an asymptotically sharp error bound in the classical Sudakov-Fernique comparison inequality for finite collections of gaussian random variables. Our proof is short and self-contained, and gives an easy alternative argument for the…