Why Zero-Biasing Is Useful
A centered random variable need not be close to normal. But the normal distribution is characterized by a derivative identity, and zero-biasing gives a way to express the corresponding identity for any centered variable with finite, positive variance. If a zero-biased version can be coupled near the original variable, that identity turns directly into a normal-approximation bound.
The transformation differs from size-biasing: it applies to centered real-valued variables, including variables that take both positive and negative values. Its defining identity also specifies the transformed law, so there is no need to assume that the original variable has a density.
Definition and Existence
This test-function class is chosen to avoid ambiguity about derivatives at atoms. In particular, the definition uses continuously differentiable functions, not functions whose derivative is specified only almost everywhere. Since \(f'\) is bounded, \(f\) grows at most linearly, so \(\mathbb{E}|Xf(X)|<\infty\) follows from the finite second moment.
At \(w=0\), the two expressions suggested by the positive- and negative-side formulas agree because \(X\mathbf{1}_{\{X=0\}}=0\). The particular value assigned to a density at one point does not affect its probability law. More generally, density formulas may differ at individual points without defining different distributions.
Uniqueness of the Zero-Biased Law
This argument identifies the whole law without testing a function whose derivative has an exceptional point. That distinction matters when a candidate zero-biased variable might have an atom at that point.
Worked Example: A Centered Bernoulli Variable
Worked Example: A Centered Bernoulli Variable
Let \(B\) be Bernoulli with \(\mathbb{P}(B=1)=p\), where \(0<p<1\), and put \(X=B-p\). Write \(q=1-p\). Then \(X=q\) with probability \(p\), and \(X=-p\) with probability \(q\). Its mean is \(pq-qp=0\), and its variance is \(pq^2+qp^2=pq\).
The density formula gives \(g(w)=1\) for \(-p<w<q\), and zero outside that interval, apart from possible endpoint values that do not affect the law. Indeed, when \(-p<w<0\), \(-\mathbb{E}[X\mathbf{1}_{\{X\leq w\}}]=pq\); when \(0\leq w<q\), \(\mathbb{E}[X\mathbf{1}_{\{X>w\}}]=pq\). Dividing by \(\sigma^2=pq\) gives one in either interval. At \(w=-p\), the strict event in the positive-side formula has probability \(p\), so its numerator is \(pq\) and the density value is one; this single endpoint value does not alter the uniform law.
Thus \(X^*\) is uniform on \([-p,q]\). Directly, for any continuously differentiable \(f\) with bounded derivative, $$ \mathbb{E}[Xf(X)] =pqf(q)-pqf(-p) =pq\int_{-p}^{q}f'(w)\,dw =pq\,\mathbb{E}[f'(X^*)]. $$ The interval has length \(q+p=1\), so the uniform expectation in the last equality is exactly the integral over the interval.
Worked Example: A Symmetric Two-Point Variable
Worked Example: A Symmetric Two-Point Variable
Let \(X\) take the values \(1\) and \(-1\) with probability \(1/2\) each. It is centered with variance one. For \(-1<w<0\), the negative-side numerator is \(-\mathbb{E}[X\mathbf{1}_{\{X\leq w\}}]=1/2\); for \(0\leq w<1\), the positive-side numerator is \(\mathbb{E}[X\mathbf{1}_{\{X>w\}}]=1/2\). The density is therefore \(1/2\) on \((-1,1)\), so \(X^*\) is uniform on \([-1,1]\).
To check the identity independently, the left side is $$ \mathbb{E}[Xf(X)]=\frac{f(1)-f(-1)}{2}. $$ For \(U\) uniform on \([-1,1]\), the fundamental theorem of calculus gives $$ \mathbb{E}[f'(U)] =\frac12\int_{-1}^1 f'(w)\,dw =\frac{f(1)-f(-1)}2. $$ The two sides agree for every test function in the definition.
Zero-Biasing Independent Sums
Worked Example: A Zero-Biased Version of an Independent Sum
Let \(X_1,\ldots,X_n\) be independent, centered variables with finite variances \(\sigma_i^2\), and suppose \(s^2=\sum_{i=1}^n\sigma_i^2>0\). Write \(W=\sum_iX_i\). For each \(i\) with \(\sigma_i^2>0\), let \(X_i^*\) have the zero-biased law of \(X_i\). Choose an index \(I\) independently with \(\mathbb{P}(I=i)=\sigma_i^2/s^2\). In the construction, take the selected \(X_I^*\) independent of all the original summands, and set \(W^*=\sum_{j\ne I}X_j+X_I^*\). Indices of zero variance have probability zero and need no zero-biased variable.
For a continuously differentiable \(f\) with bounded derivative, independence and \(\mathbb{E}X_i=0\) yield $$ \mathbb{E}[Wf(W)] =\sum_i\mathbb{E}[X_i f(W)] =\sum_i \sigma_i^2\mathbb{E}\!\left[f'\!\left(\sum_{j\ne i}X_j+X_i^*\right)\right]. $$ For each term, condition on the other summands and apply the zero-bias identity for \(X_i\) to the function \(x\mapsto f(\sum_{j\ne i}X_j+x)\). By the definition of \(I\), the last sum equals \(s^2\mathbb{E}[f'(W^*)]\). Thus \(W^*\) has the zero-biased law of \(W\), whose variance is \(s^2\).
A Coupling Bound for Normal Approximation
Let \(Z\) have the standard normal distribution. The standard normal Stein equation for a Lipschitz test function \(h\) is $$ f_h'(z)-zf_h(z)=h(z)-\mathbb{E}h(Z). $$ The normal Stein derivative bound gives a solution with \(\|f_h''\|_\infty\leq 2\|h'\|_\infty\). This is the derivative estimate used in the Wasserstein bounds from Stein’s method.
Worked Example: A Normal Bound for Rademacher Sums
Worked Example: A Normal Bound for Rademacher Sums
Let \(X_1,\ldots,X_n\) be independent, each taking \(1\) and \(-1\) with probability \(1/2\), and let \(W=\sum_iX_i\). Then \(\operatorname{Var}(W)=n\). Each summand has a zero-biased version \(U\) uniform on \([-1,1]\), as shown above. The sum construction selects \(I\) uniformly from \(\{1,\ldots,n\}\) and replaces \(X_I\) by an independent \(U\). Consequently \(W^*-W=U-X_I\).
Conditional on \(X_I=1\), \(|U-X_I|=1-U\) throughout \([-1,1]\), so its expectation is one. Conditional on \(X_I=-1\), \(|U-X_I|=U+1\), also with expectation one. Hence \(\mathbb{E}|W^*-W|=1\). Applying the coupling bound with \(\sigma=\sqrt n\) gives $$ d_{\mathrm W}\!\left(\frac{W}{\sqrt n},Z\right)\leq\frac{2}{\sqrt n}. $$ This is an explicit bound from a concrete coupling; it does not claim that the constant is optimal.
Interpretation and a Common Pitfall
The bound depends on the average distance in a coupling, not merely on the separate distributions of \(X\) and \(X^*\). A good construction makes the replacement \(X\mapsto X^*\) small on average. The independent-sum construction illustrates the mechanism: choose a summand with probability proportional to its variance, then replace only that summand.
A common normalization error is to compare \(X\) directly with a standard normal when \(X\) has variance \(\sigma^2\). The Stein identity first gives a comparison for \(X/\sigma\); the factor \(1/\sigma\) in the coupling bound follows from scaling the replacement distance. Also, positive variance is essential: if \(\sigma^2=0\), the defining identity cannot be normalized to specify a zero-biased probability law.
Check Your Understanding
Try to answer these questions using the definition and derivations above.
- Why does the zero-bias identity require \(\sigma^2>0\), and what property of \(X\) makes the density construction nonnegative?
- Why is a continuously differentiable test-function class useful when proving uniqueness?
- For a centered Bernoulli variable \(B-p\), what is the support and density of its zero-biased law?
- In the independent-sum construction, why is the replacement index selected in proportion to the summands’ variances?
- Where does the factor \(1/\sigma\) enter the Wasserstein coupling bound?