Manuscript En03-A@1 · En03-A.tex · section · 5398614e

Independent-run sampling

Conditional approximation and verification interfaces › Independent-run sampling · lines 3029–3044

En03-A@1#ip:scalar-sampling, En03-A@1#eq:scalar-radius

Let $H_{1}, \dots, H_{N}$ be independent, identically distributed complete attempted-run histories from one fixed protocol. For a prespecified score $f (H) \in [0, 1]$ , write $μ = N^{- 1} \sum_{i} f (H_{i})$ . For $0 < α < 1$ , with probability at least $1 - α$ ,

∣ μ - E f ∣ \leq \frac{lo g ( 2/ α )}{2 N} .

Displayed formulas in this passage

En03-A@1#eq:scalar-radius · line 3038
$∣ μ - E f ∣ \leq \frac{lo g ( 2/ α )}{2 N} .$

Nearby in this section

proof: Proof
section: Independent-run sampling
proof: Proof
section: Independent-run sampling