Related papers: Classifying the Concentration of the Boolean Cube …

Let $Y$ be a nonnegative random variable with mean $\mu$ and finite positive variance $\sigma^2$, and let $Y^s$, defined on the same space as $Y$, have the $Y$ size biased distribution, that is, the distribution characterized by…

Product measures of dimension $n$ are known to be concentrated in Hamming distance: for any set $S$ in the product space of probability $\epsilon$, a random point in the space, with probability $1-\delta$, has a neighbor in $S$ that is…

We study sharpened forms of the concentration of measure phenomenon typically centered at stochastic expansions of order $d-1$ for any $d \in \mathbb{N}$. The bounds are based on $d$-th order derivatives or difference operators. In…

Exhibiting a new type of measure concentration, we prove uniform concentration bounds for measurable Lipschitz functions on product spaces, where Lipschitz is taken with respect to the metric induced by a weighted covering of the index set…

It is well-known that measures whose density is the form $e^{-V}$ where $V$ is a uniformly convex potential on $\RR^n$ attain strong concentration properties. In search of a notion of log-concavity on the discrete hypercube, we consider…

A probability distribution over the Boolean cube is monotone if flipping the value of a coordinate from zero to one can only increase the probability of an element. Given samples of an unknown monotone distribution over the Boolean cube, we…

Concentration of measure is a phenomenon in which a random variable that depends in a smooth way on a large number of independent random variables is essentially constant. The random variable will "concentrate" around its median or…

The concentration of measure prenomenon roughly states that, if a set $A$ in a product $\Omega^N$ of probability spaces has measure at least one half, ``most'' of the points of $\Omega^N$ are ``close'' to $A$. We proceed to a systematic…

We show that for any metric probability space $(M,d,\mu)$ with a subgaussian constant $\sigma^2(\mu)$ and any set $A \subset M$ we have $\sigma^2(\mu_A) \leq c \log\left(e/\mu(A)\right)\,\sigma^2(\mu)$, where $\mu_A$ is a restriction of…

We consider a Boolean model $Z$ driven by a Poisson particle process $\eta$ on a metric space $\mathbb{Y}$. We study the random variable $\rho(Z)$, where $\rho$ is a (deterministic) measure on $\mathbb{Y}$. Due to the interaction of…

We extend recent higher order concentration results in the discrete setting to include functions of possibly dependent variables whose distribution (on the product space) satisfies a logarithmic Sobolev inequality with respect to a…

Let $\mu$ be a Borel probability measure on a compact path-connected metric space $(X, \rho)$ for which there exist constants $c,\beta>1$ such that $\mu(B) \geq c r^{\beta}$ for every open ball $B\subset X$ of radius $r>0$. For a class of…

The concentration of measure phenomenon may be summarized as follows: a function of many weakly dependent random variables that is not too sensitive to any of its individual arguments will tend to take values very close to its expectation.…

Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a…

Verifying uniform conditions over continuous spaces through random sampling is fundamental in machine learning and control theory, yet classical coverage analyses often yield conservative bounds, particularly at small failure probabilities.…

Obtaining guarantees on the convergence of the minimizers of empirical risks to the ones of the true risk is a fundamental matter in statistical learning. Instead of deriving guarantees on the usual estimation error, the goal of this paper…

This paper studies concentration inequalities for functions of locally dependent random variables. We show that the usual definition of local dependence does not imply concentration for general Hamming Lipschitz functions. We define…

A strong law of large numbers for $d$-dimensional random projections of the $n$-dimensional cube is derived. It shows that with respect to the Hausdorff distance a properly normalized random projection of $[-1,1]^n$ onto $\mathbb{R}^d$…

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…

Many recent works have shown that adversarial examples that fool classifiers can be found by minimally perturbing a normal input. Recent theoretical results, starting with Gilmer et al. (2018b), show that if the inputs are drawn from a…