Question 71
Likelihood Weighting avoids rejecting samples by:
Likelihood weighting forces evidence variables to match e and accumulates weight w.
Likelihood Weighting avoids rejecting samples by:
Likelihood weighting forces evidence variables to match e and accumulates weight w.
The Markov Blanket of a node X in a Bayesian Network consists of:
Conditioning on X's parents, children, and spouses makes X independent of all other nodes in the network.
For a Bayesian Network with n binary variables where each node has at most k parents, the total number of CPT parameters required is bounded by:
Each node has $2^k$ parent configurations, so total parameters = n * $2^k$, compared to $2^n - 1$ for full joint.
Gibbs Sampling belongs to which category of approximate inference algorithms?
Gibbs Sampling is an MCMC algorithm that generates a sequence of samples by updating one variable at a time.
In a V-STRUCTURE (Collider) X -> Y <- Z, the path between X and Z is:
A collider blocks flow when Y is unobserved, but observing Y (or descendant) opens the path ('explaining away').