Step 1 – Marginal (evidence) for a candidate design
Integrate the parameter out:
p(y∣ξ)=∫p(y∣θ,ξ)p(θ)dθ
This is the predictive distribution of the not-yet-observed outcome. It’s the only place the prior enters, and it’s what makes EIG computable before running the experiment.
Step 2 – Posterior you would get, for a hypothetical y
Careful point worth having in your back pocket: the “entropy reduction” form H[p(θ)]−H[p(θ∣y,ξ)] is not equal to this KL for a single y – a surprising outcome can even increase posterior entropy. They coincide only after averaging over y (Step 4).
Step 4 – Average over outcomes you haven’t seen yet
EIG(ξ)=Ep(y∣ξ)[DKL(p(θ∣y,ξ)∥p(θ))]
Substituting Bayes’ rule and swapping the order of integration gives the three equivalent forms you can quote on the slide:
EIG(ξ)=likelihood form – the one you actually computeEp(θ)p(y∣θ,ξ)[logp(y∣ξ)p(y∣θ,ξ)]=predictive entropy−noise entropyH[p(y∣ξ)]−Ep(θ)H[p(y∣θ,ξ)]=mutual informationI(θ;y∣ξ)
So EIG is the mutual information between parameters and outcome under the design. The middle form is the useful intuition: pick the experiment whose outcome you are most uncertain about overall, minus the part of that uncertainty that is just measurement noise. Ambiguity is good; noise is not.
The design step is then ξ⋆=argmaxξEIG(ξ).
Step 5 – Actually evaluating it
p(y∣ξ) is an intractable integral, so this is a nested expectation. Standard estimator (nested Monte Carlo):
with θn∼p(θ), yn∼p(y∣θn,ξ), and inner contrastive draws θn,m∼p(θ).
Bias is O(1/M) and positive (Jensen on the inner log) – it flatters your design. Optimal budget scaling is M∝T, N∝T for total cost T.
Cheaper variants: PCE/InfoNCE-style bounds, Barber–Agakov variational lower bound, VNMC upper bound. Sandwiching with a lower + upper bound is the honest way to report it.
The formula here works like this,
For the first term, sample N of θ values and for each of the θ values, sample yn which is composed of the computed exact value from the surrogate or physics mocel and the noise (e.g., Poisson noise). For the sampled yn, calculate its probability p(yn∣θn,ξ).
For the second term, we stay with the sampled yn in the previous step and we sample M of θ values and we compute the probability to obtain yn for each of the sampled θ values, giving us p(yn∣θn,m,ξ).