Complexity of exact inference on graphical models

49 Views Asked by At

I'm currently self studying these notes and in this slide it says that naively marginalizing over all unobserved variables requires an exponential number of computations. Does anyone know why it is exponential?

enter image description here

1

There are 1 best solutions below

0
On BEST ANSWER

Suppose $W=(W_1,\ldots,W_n)$, where each $W_i$ is binary. Then $W$ can take on $2^n$ different values, so the sum $\sum_w P(Y,e,w)$ is over $2^n$ terms.