均匀硬币和有偏硬币之间的统计距离


9

让 U 均匀分布在 n 位,让 D 被分配 n 位是独立的,每个位是 1 很有可能 1/2−ϵ。两者之间的统计距离是否正确D 和 U 是 Ω(ϵn), 什么时候 n≤1/ϵ2?


2
是。之间的统计距离U 和 V 至少是 PrU(∑xi>n/2)−PrD(∑xi>n/2),这是 Ω(εn); 参见例如matus的答案:cstheory.stackexchange.com/questions/14471/…–
— Yury

2
谢谢。也许解释一下如何从matus在我可以接受的答案中所写的内容中得到什么?
— Manu


1
关于Matus的答案,您可以做得比Slud的不等式更好。参见arxiv.org/abs/1606.08920中的
— Aryeh,

Answers:


7

用表示随机位 x1,…,xn。根据定义,U 和 D 至少是 PrU(∑xi≥t)−PrD(∑xi≥t) 每一个 t。我们选择t=n/2+n。

注意 PrU(∑xi≥t)≥c1 for some absolute constant c1>0. If PrD(∑xi≥t)≤c1/2, then the statistical distance is at least c1/2, and we are done. So we assume below that PrD(∑xi≥t)≥c1/2.

Let f(s)=Pr(∑xi≥t) for i.i.d. Bernoulli random variables x1,…,xn with Pr(xi=1)=1/2−s. Our goal is to prove that f(0)−f(ε)=Ω(εn). By the mean value theorem,

f(0)−f(ε)=−εf′(ξ),
for some ξ∈(0,ε). Now, we will prove that −f′(ξ)≥Ω(n); that will imply that the desired statistical distance is at least Ω(nε), as required.

Write,

f(ξ)=∑k≥t(nk)(12−ξ)k(12+ξ)n−k,
and
f′(ξ)=∑k≥t(nk)(−k(12−ξ)k−1(12+ξ)n−k+(n−k)(12−ξ)k(12+ξ)n−k−1)=−∑k≥t(nk)(12−ξ)k(12+ξ)n−kk/2+kξ−(n−k)/2+(n−k)ξ(1/2−ξ)(1/2+ξ).
Note that
k/2+kξ−(n−k)/2+(n−k)ξ(1/2−ξ)(1/2+ξ)=(2k−n)/2+nξ(1/2−ξ)(1/2+ξ)≥2(2t−n)=4n.
Thus,
−f′(ξ)≥4n∑k≥t(nk)(12−ξ)k(12+ξ)n−k=4nf(ξ)≥4nf(ε)≥4n⋅(c1/2).
Here, we used the assumption that f(ε)=PrD(x1+⋯+xn≥t)≥c1/2. We showed that −f′(ξ)=Ω(n).

5

A somewhat more elementary, and slightly messier proof (or at least it feels so to me).

For convenience, write ε=γn, with γ∈[0,1) by assumption.

We explicitly lower bound the expression of dTV⁡(P,U):

2dTV⁡(P,U)=∑x∈{0,1}n|(12+γn)|x|(12−γn)n−|x|−12n|=12n∑k=0n(nk)|(1+2γn)k(1−2γn)n−k−1|≥12n∑k=n2+nn2+2n(nk)|(1+2γn)k(1−2γn)n−k−1|≥Cn∑k=n2+nn2+2n|(1+2γn)k(1−2γn)n−k−1|
where C>0 is an absolute constant. We lower bound each summand separately: fixing k, and writing ℓ=k−n2∈[n,2n],
(1+2γn)k(1−2γn)n−k=(1−4γ2n)n/2(1+2γn1−2γn)ℓ≥(1−4γ2n)n/2(1+2γn1−2γn)n→n→∞e4γ−2γ2
so that each summand is lower bounded by a quantity that converges (when n→∞) to e4γ−2γ2−1>4γ−2γ2>2γ; implying that each is Ω(γ). Summing up, this yields
2dTV⁡(P,U)≥Cn∑k=n2+nn2+2nΩ(γ)=Ω(γ)=Ω(εn)
as claimed.

(Using Hellinger as a proxy because of its nice properties wrt product distributions is tempting, and would be much faster, but there would be a loss by a quadratic factor in the end lower bound.)
— Clement C.

1
Nice! I like the elementary approach. We should be able to make it non-asymptotic in n too.... one way is to use (1+z1−z)n≥(1+2z)n, then use the nice inequality 1+w≥ew−w2/2. A bit messier.
— usul
By using our site, you acknowledge that you have read and understand our Cookie Policy and Privacy Policy.
Licensed under cc by-sa 3.0 with attribution required.