We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 3a3b341 commit 2e2efedCopy full SHA for 2e2efed
docs/src/latent_slice.md
@@ -18,7 +18,7 @@ Naturally, the sampler operates as a blocked-Gibbs sampler
18
l_n &\sim \operatorname{Uniform}\left(l; \; x_{n-1} - s_{n-1}/2,\, x_{n-1} + s_{n-1}/2\right) \\
19
s_n &\sim p(s \mid x_{n-1}, l_{n}) \\
20
t_n &\sim \operatorname{Uniform}\left(0, \pi\left(x_{n-1}\right)\right) \\
21
-x_n &\sim \operatorname{Uniform}\left\{x \mid \pi\left(x_n\right) > t_n\right\},
+x_n &\sim \operatorname{Uniform}\left\{x \mid \pi\left(x\right) > t_n\right\},
22
\end{aligned}
23
```
24
When $$x_n$$ is updated using the usual shrinkage procedure of Neal[^N2003], $$s_n$$ and $$l_n$$ are used to form the initial search window.
0 commit comments