1 /* Copyright (C) 2006-2008 Joris Mooij [j dot mooij at science dot ru dot nl]
2 Radboud University Nijmegen, The Netherlands
4 This file is part of libDAI.
6 libDAI is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 libDAI is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with libDAI; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
27 #include <dai/diffs.h>
37 const char *MF::Name
= "MF";
40 void MF::setProperties( const PropertySet
&opts
) {
41 assert( opts
.hasKey("tol") );
42 assert( opts
.hasKey("maxiter") );
43 assert( opts
.hasKey("verbose") );
45 props
.tol
= opts
.getStringAs
<double>("tol");
46 props
.maxiter
= opts
.getStringAs
<size_t>("maxiter");
47 props
.verbose
= opts
.getStringAs
<size_t>("verbose");
51 PropertySet
MF::getProperties() const {
53 opts
.Set( "tol", props
.tol
);
54 opts
.Set( "maxiter", props
.maxiter
);
55 opts
.Set( "verbose", props
.verbose
);
63 _beliefs
.reserve( nrVars() );
66 for( size_t i
= 0; i
< nrVars(); ++i
)
67 _beliefs
.push_back(Factor(var(i
)));
71 string
MF::identify() const {
72 stringstream
result (stringstream::out
);
73 result
<< Name
<< getProperties();
79 for( vector
<Factor
>::iterator qi
= _beliefs
.begin(); qi
!= _beliefs
.end(); qi
++ )
87 if( props
.verbose
>= 1 )
88 cout
<< "Starting " << identify() << "...";
90 size_t pass_size
= _beliefs
.size();
91 Diffs
diffs(pass_size
* 3, 1.0);
94 for( t
=0; t
< (props
.maxiter
*pass_size
) && diffs
.maxDiff() > props
.tol
; t
++ ) {
95 // choose random Var i
96 size_t i
= (size_t) (nrVars() * rnd_uniform());
100 foreach( const Neighbor
&I
, nbV(i
) ) {
102 foreach( const Neighbor
&j
, nbF(I
) ) // for all j in I \ i
105 piet
= factor(I
).log0();
107 piet
= piet
.part_sum(var(i
));
112 jan
.normalize( _normtype
);
114 if( jan
.hasNaNs() ) {
115 cout
<< "MF::run(): ERROR: jan has NaNs!" << endl
;
119 diffs
.push( dist( jan
, _beliefs
[i
], Prob::DISTLINF
) );
124 if( diffs
.maxDiff() > maxdiff
)
125 maxdiff
= diffs
.maxDiff();
127 if( props
.verbose
>= 1 ) {
128 if( diffs
.maxDiff() > props
.tol
) {
129 if( props
.verbose
== 1 )
131 cout
<< "MF::run: WARNING: not converged within " << props
.maxiter
<< " passes (" << toc() - tic
<< " clocks)...final maxdiff:" << diffs
.maxDiff() << endl
;
133 if( props
.verbose
>= 2 )
135 cout
<< "converged in " << t
/ pass_size
<< " passes (" << toc() - tic
<< " clocks)." << endl
;
139 return diffs
.maxDiff();
143 Factor
MF::beliefV (size_t i
) const {
146 piet
.normalize( Prob::NORMPROB
);
151 Factor
MF::belief (const VarSet
&ns
) const {
153 return belief( *(ns
.begin()) );
155 assert( ns
.size() == 1 );
161 Factor
MF::belief (const Var
&n
) const {
162 return( beliefV( findVar( n
) ) );
166 vector
<Factor
> MF::beliefs() const {
167 vector
<Factor
> result
;
168 for( size_t i
= 0; i
< nrVars(); i
++ )
169 result
.push_back( beliefV(i
) );
174 Complex
MF::logZ() const {
177 for(size_t i
=0; i
< nrVars(); i
++ )
178 sum
-= beliefV(i
).entropy();
179 for(size_t I
=0; I
< nrFactors(); I
++ ) {
181 foreach( const Neighbor
&j
, nbF(I
) ) // for all j in I
183 henk
.normalize( Prob::NORMPROB
);
185 piet
= factor(I
).log0();
187 sum
-= Complex( piet
.totalSum() );
194 void MF::init( const VarSet
&ns
) {
195 for( size_t i
= 0; i
< nrVars(); i
++ ) {
196 if( ns
.contains(var(i
) ) )
197 _beliefs
[i
].fill( 1.0 );
202 } // end of namespace dai