= Talagrand convex distance
{c}
{title2=$d_T(x,A)$}
= Talagrand distance
{c}
{synonym}
For an event $A$ in a product of finitely many <probability spaces> with its <product measure>, take the closed <convex hull> of the mismatch vectors $(\mathbf1_{x_i\ne y_i})_i$, $y\in A$. The distance of this hull from zero is $d_T(x,A)$. Equivalently it is the supremum, over nonnegative <coordinate> weights of squared sum at most one, of their minimum mismatch sum. Averaging mismatch patterns is the feature that distinguishes this quantity from ordinary <Hamming distance>.
Back to article page