Daniel@0: % Compare different loopy belief propagation algorithms on a graph with a single loop.
Daniel@0: % LBP should give exact results if it converges.
Daniel@0: 
Daniel@0: seed = 0;
Daniel@0: rand('state', seed);
Daniel@0: randn('state', seed);
Daniel@0: 
Daniel@0: N = 2;
Daniel@0: dag = zeros(N,N);
Daniel@0: dag(1,2)=1;
Daniel@0: ns = ones(1,N); 
Daniel@0: bnet = mk_bnet(dag, ns, 'discrete', []);
Daniel@0: for i=1:N
Daniel@0:   %bnet.CPD{i} = gaussian_CPD(bnet, i, 'mean', 0);
Daniel@0:   bnet.CPD{i} = gaussian_CPD(bnet, i);
Daniel@0: end
Daniel@0: 
Daniel@0: engines = {};
Daniel@0: engines{end+1} = jtree_inf_engine(bnet);
Daniel@0: engines{end+1} = pearl_inf_engine(bnet, 'protocol', 'tree');
Daniel@0: 
Daniel@0: [time, engines] = cmp_inference_static(bnet, engines, 'maximize', 0, 'exact', 1:2, 'observed', [2], ...
Daniel@0: 				   'check_ll', 0, 'singletons_only', 1, 'check_converged', []);
Daniel@0: