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: N = 4;
Daniel@0: dag = zeros(N,N);
Daniel@0: C = 1; S = 2; R = 3; W = 4;
Daniel@0: dag(C,[R S]) = 1;
Daniel@0: dag(R,W) = 1;
Daniel@0: dag(S,W)=1;
Daniel@0: ns = 2*ones(1,N); 
Daniel@0: bnet = mk_bnet(dag, ns);
Daniel@0: for i=1:N
Daniel@0:   bnet.CPD{i} = tabular_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', 'parallel');
Daniel@0: engines{end+1} = belprop_fg_inf_engine(bnet_to_fgraph(bnet));
Daniel@0: engines{end+1} = belprop_inf_engine(bnet, 'protocol', 'parallel');
Daniel@0: 
Daniel@0: % belprop_fg does not support marginal_family
Daniel@0: % belprop_fg and belprop do not support loglik even on discrete
Daniel@0: [time, engines] = cmp_inference_static(bnet, engines, 'maximize', 0, 'exact', 1, 'observed', 2, ...
Daniel@0: 				   'check_ll', 0, 'singletons_only', 1, 'check_converged', 2:4);
Daniel@0: