diff options
| author | Thibaut Horel <thibaut.horel@gmail.com> | 2015-02-06 15:48:24 -0500 |
|---|---|---|
| committer | Thibaut Horel <thibaut.horel@gmail.com> | 2015-02-06 15:48:24 -0500 |
| commit | 0ff14f56819acfc7be77f9237e18417d465b2266 (patch) | |
| tree | 32576d399ce36de031188e1ffff5b8e3f56b4336 /paper/sections/results.tex | |
| parent | 724dae4487559d7e52c5ac56b9059d124b664a13 (diff) | |
| download | cascades-0ff14f56819acfc7be77f9237e18417d465b2266.tar.gz | |
Compression
Diffstat (limited to 'paper/sections/results.tex')
| -rw-r--r-- | paper/sections/results.tex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/paper/sections/results.tex b/paper/sections/results.tex index 8a7b4f9..25f540a 100644 --- a/paper/sections/results.tex +++ b/paper/sections/results.tex @@ -203,7 +203,7 @@ with probability $1-\frac{1}{m}$. If $\theta_i = 0$ and $\hat \theta > \eta$, then $\|\hat \theta - \theta\|_2 \geq |\hat \theta_i-\theta_j| > \eta$, which is a contradiction. Therefore we get no false positives. If $\theta_i \leq \eta + \epsilon$, then $|\hat{\theta}_i- \theta_i| < \epsilon \implies \theta_j -> \eta$. Therefore, we get all strong parents. +> \eta$ and we get all strong parents. \end{proof} Assuming we know a lower bound $\alpha$ on $\Theta_{i,j}$, |
