The paper states that the binary random-binning estimator converges exponentially in P for a fixed pair and gives a uniform convergence guarantee in Claim 2. For compact M, the probability of uniform error at most epsilon is at least 1 - 36 d P alpha diam(M) exp(-(P epsilon^2/8 + ln(epsilon/L_k))/(d+1)). · CiteArk
The paper states that the binary random-binning estimator converges exponentially in P for a fixed pair and gives a uniform convergence guarantee in Claim 2. For compact M, the probability of uniform error at most epsilon is at least 1 - 36 d P alpha diam(M) exp(-(P epsilon^2/8 + ln(epsilon/L_k))/(d+1)).
来源：paper:PDF p. 5, Section 4, Claim 2; proof on PDF p. 8, Eqs. (8) and following bound
