Now compiles also with Visual Studio 2008 under Windows (still buggy!)
[libdai.git] / tests / aliases.conf
1 BP_SEQFIX: BP[updates=SEQFIX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0]
2 BP_SEQRND: BP[updates=SEQRND,tol=1e-9,maxiter=10000,verbose=0,logdomain=0]
3 BP_SEQMAX: BP[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0]
4 BP_PARALL: BP[updates=PARALL,tol=1e-9,maxiter=10000,verbose=0,logdomain=0]
5 BP_SEQFIX_LOG: BP[updates=SEQFIX,tol=1e-9,maxiter=10000,verbose=0,logdomain=1]
6 BP_SEQRND_LOG: BP[updates=SEQRND,tol=1e-9,maxiter=10000,verbose=0,logdomain=1]
7 BP_SEQMAX_LOG: BP[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=1]
8 BP_PARALL_LOG: BP[updates=PARALL,tol=1e-9,maxiter=10000,verbose=0,logdomain=1]
9
10 JTREE_HUGIN: JTREE[updates=HUGIN,verbose=0]
11 JTREE_SHSH: JTREE[updates=SHSH,verbose=0]
12
13 MF_SEQRND: MF[tol=1e-9,maxiter=10000,verbose=0]
14
15 TREEEP: TREEEP[type=ORG,tol=1e-9,maxiter=10000,verbose=0]
16 TREEEPWC: TREEEP[type=ALT,tol=1e-9,maxiter=10000,verbose=0]
17
18 MR: MR[updates=FULL,inits=RESPPROP,verbose=0,tol=1e-9]
19 MR_RESPPROP_FULL: MR[updates=FULL,inits=RESPPROP,verbose=0,tol=1e-9]
20 MR_RESPPROP_LINEAR: MR[updates=LINEAR,inits=RESPPROP,verbose=0,tol=1e-9]
21 MR_CLAMPING_FULL: MR[updates=FULL,inits=CLAMPING,verbose=0,tol=1e-9]
22 MR_CLAMPING_LINEAR: MR[updates=LINEAR,inits=CLAMPING,verbose=0,tol=1e-9]
23 MR_EXACT_FULL: MR[updates=FULL,inits=EXACT,verbose=0,tol=1e-9]
24 MR_EXACT_LINEAR: MR[updates=LINEAR,inits=EXACT,verbose=0,tol=1e-9]
25
26 LCBP_FULLCAVin_SEQFIX: LC[cavity=FULL,reinit=1,updates=SEQFIX,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
27 LCBP_FULLCAVin_SEQRND: LC[cavity=FULL,reinit=1,updates=SEQRND,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
28 LCBP_FULLCAVin_NONE: LC[cavity=FULL,reinit=1,updates=SEQFIX,maxiter=0,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
29 LCBP_FULLCAV_SEQFIX: LC[cavity=FULL,reinit=0,updates=SEQFIX,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
30 LCBP_FULLCAV_SEQRND: LC[cavity=FULL,reinit=0,updates=SEQRND,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
31 LCBP_FULLCAV_NONE: LC[cavity=FULL,reinit=0,updates=SEQFIX,maxiter=0,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
32 LCBP_PAIRCAVin_SEQFIX: LC[cavity=PAIR,reinit=1,updates=SEQFIX,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
33 LCBP_PAIRCAVin_SEQRND: LC[cavity=PAIR,reinit=1,updates=SEQRND,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
34 LCBP_PAIRCAVin_NONE: LC[cavity=PAIR,reinit=1,updates=SEQFIX,maxiter=0,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
35 LCBP_PAIRCAV_SEQFIX: LC[cavity=PAIR,reinit=0,updates=SEQFIX,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
36 LCBP_PAIRCAV_SEQRND: LC[cavity=PAIR,reinit=0,updates=SEQRND,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
37 LCBP_PAIRCAV_NONE: LC[cavity=PAIR,reinit=0,updates=SEQFIX,maxiter=0,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
38 LCBP_UNICAV_SEQFIX: LC[cavity=UNIFORM,updates=SEQFIX,maxiter=10000,tol=1e-9,verbose=0,cavaiopts=[],cavainame=NONE]
39 LCBP_UNICAV_SEQRND: LC[cavity=UNIFORM,updates=SEQRND,maxiter=10000,tol=1e-9,verbose=0,cavaiopts=[],cavainame=NONE]
40 LCBP_PAIR2CAV_SEQFIX: LC[cavity=PAIR2,reinit=0,updates=SEQFIX,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
41 LCBP_PAIRINTCAV_SEQFIX: LC[cavity=PAIRINT,reinit=0,updates=SEQFIX,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
42 LCBP_PAIRCUMCAV_SEQFIX: LC[cavity=PAIRCUM,reinit=0,updates=SEQFIX,maxiter=10000,cavainame=BP,cavaiopts=[updates=SEQMAX,tol=1e-9,maxiter=10000,verbose=0,logdomain=0],tol=1e-9,verbose=0]
43 LCTREEEP: LC[cavity=FULL,reinit=1,updates=SEQFIX,maxiter=10000,cavainame=TREEEP,cavaiopts=[type=ORG,tol=1e-9,maxiter=10000,verbose=0],tol=1e-9,verbose=0]
44 LCMF: LC[cavity=FULL,reinit=1,updates=SEQFIX,maxiter=10000,cavainame=MF,cavaiopts=[tol=1e-9,maxiter=10000,verbose=0],tol=1e-9,verbose=0]
45
46 GBP_MIN: HAK[doubleloop=0,clusters=MIN,tol=1e-9,maxiter=10000,verbose=0]
47 GBP_DELTA: HAK[doubleloop=0,clusters=DELTA,tol=1e-9,maxiter=10000,verbose=0]
48 GBP_LOOP3: HAK[doubleloop=0,clusters=LOOP,loopdepth=3,tol=1e-9,maxiter=10000,verbose=0]
49 GBP_LOOP4: HAK[doubleloop=0,clusters=LOOP,loopdepth=4,tol=1e-9,maxiter=10000,verbose=0]
50 GBP_LOOP6: HAK[doubleloop=0,clusters=LOOP,loopdepth=6,tol=1e-9,maxiter=10000,verbose=0]
51 GBP_LOOP8: HAK[doubleloop=0,clusters=LOOP,loopdepth=8,tol=1e-9,maxiter=10000,verbose=0]
52
53 HAK_MIN: HAK[doubleloop=1,clusters=MIN,tol=1e-9,maxiter=10000,verbose=0]
54 HAK_DELTA: HAK[doubleloop=1,clusters=DELTA,tol=1e-9,maxiter=10000,verbose=0]
55 HAK_LOOP3: HAK[doubleloop=1,clusters=LOOP,loopdepth=3,tol=1e-9,maxiter=10000,verbose=0]
56 HAK_LOOP4: HAK[doubleloop=1,clusters=LOOP,loopdepth=4,tol=1e-9,maxiter=10000,verbose=0]
57 HAK_LOOP5: HAK[doubleloop=1,clusters=LOOP,loopdepth=5,tol=1e-9,maxiter=10000,verbose=0]
58 HAK_LOOP6: HAK[doubleloop=1,clusters=LOOP,loopdepth=6,tol=1e-9,maxiter=10000,verbose=0]
59 HAK_LOOP8: HAK[doubleloop=1,clusters=LOOP,loopdepth=8,tol=1e-9,maxiter=10000,verbose=0]
60
61 #---------------------------------------------------------------
62 #EXACT
63 #
64 #
65 #} else if( method.substr(0,5) == "EXACT" ) { // EXACT
66 # // Look if the network is small enough to do brute-force exact method
67 # bool toolarge = false;
68 # size_t total_statespace = 1;
69 # for( size_t i = 0; i < fg.nrVars(); i++ ) {
70 # total_statespace *= fg.var(i).states();
71 # if( total_statespace > (1UL << 16) )
72 # toolarge = true;
73 # }
74 #
75 # if( !toolarge ) {
76 # Factor piet;
77 # for( size_t I = 0; I < fg.nrFactors(); I++ )
78 # piet *= fg.factor( I );
79 # for( size_t i = 0; i < fg.nrVars(); i++ )
80 # q.push_back(piet.marginal(fg.var(i)));
81 # time += toc() - tic;
82 # logZ = fg.ExactlogZ();
83 # } else
84 # throw "Network too large for EXACT method";