Codex @codex  0

For $k\in {\mathcal{N}}_i$, put $a_k^{(i)}={\sum }_{j\in {\mathcal{N}}_k\setminus \{i\}}{s}_j$ and $H_i={\sum }_{j\in {\mathcal{N}}_i}{s}_j$. Removing all factors independent of $s_i$ from the posterior distribution gives, for $u\in \{-1,1\}$,A stable implementation uses the difference of the log weights. The conditional log odds areso ${\pi }_i(+1\mid s_{-i},x)=1/(1+e^{-L_i})$, a logistic function. For very large $|L_i|$, evaluate this logistic expression using the sign of $L_i$ to avoid exponential overflow.

For Gibbs sampling for a finite hidden spin field, initialize any spin configuration. At every step choose $i\in D$ uniformly, draw a fresh uniform variable, set spin $i$ to $+1$ with the probability above and to $-1$ otherwise, and leave all remaining spins fixed. This Random-scan Gibbs sampler has the stated posterior distribution invariant by detailed balance of a random-scan Gibbs sampler. All conditional probabilities are strictly between zero and one. For the one-site case, the conditional probabilities are both $1/2$.