choose one or more answer. THE SELECTED ANSWER IS NOT THE ANSWER.

7. Convergence in Belief Propagation. Suppose we ran belief propagation on a cluster graph G and a clique tree T for the same Markov network that is a perfect map for a distribution P. Assume that both G and T are valid, i.e., they satisfy family preservation and the running intersection property. Which of the following statements regarding the algorithm are true? You may select 1 or more options. D If the algorithm converges, the nal duster beliefs in G, when renormalized to sum to 1, are true marginals of P. Assuming the algorithm converges, if a variable X appears in two cliques in T, the marginals P(X} computed from the the two clique beliefs must agree. [:I If the algorithm converges, the nal clique beliefs in T. when renormalized to sum to 1, are true marginals of P. Belief propagation always converges on T