The weighted Hamming distance from $x$ to a set $A$: $d_α(x, A) = \inf_{y \in A} d_α(x, y)$.
Instances For
Talagrand's convex distance from $x$ to $A$, defined as the supremum of the weighted distances $d_α(x, A)$ over all unit-norm weight vectors: $d_T(x, A) = \sup_{\|α\|_2 = 1} d_α(x, A)$.
Instances For
The function $f$ admits weighted certificates with constant $K$: for every $x$ there exist nonnegative weights $α(x)$ with $\|α(x)\|_2 \leq K/2$ such that for all $y$, $f(y) \geq f(x) - \sum_{i : x_i \neq y_i} α_i(x)$.
Instances For
Talagrand's convex-distance inequality (Theorem 9.5.11): for any product probability measure on $\prod_i Ω_i$ and any set $A$, $\mu(A) \cdot \mu(\{x : d_T(x, A) \geq t\}) \leq e^{-t^2 / 4}$.
If $f$ has weighted certificates with constant $K$ and $f(x) \geq r$, then the convex distance from $x$ to the sublevel set $\{f \leq r - t\}$ is at least $2t/K$.
Combining the two one-sided product bounds with the median property $\mathbb{P}(f \leq m), \mathbb{P}(f \geq m) \geq 1/2$ yields the two-sided tail bound $\mathbb{P}(f \geq m+t) + \mathbb{P}(f \leq m-t) \leq 4 e^{-t^2 / K^2}$.
Theorem 9.5.14 (Talagrand's inequality with weighted certificates): if $f$ has weighted certificates with constant $K$ and $m$ is a median of $f$, then $\mu(\{x : |f(x) - m| \geq t\}) \leq 4 e^{-t^2 / K^2}$.