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
);
60 string
MF::printProperties() const {
61 stringstream
s( stringstream::out
);
63 s
<< "tol=" << props
.tol
<< ",";
64 s
<< "maxiter=" << props
.maxiter
<< ",";
65 s
<< "verbose=" << props
.verbose
<< "]";
73 _beliefs
.reserve( nrVars() );
76 for( size_t i
= 0; i
< nrVars(); ++i
)
77 _beliefs
.push_back(Factor(var(i
)));
81 string
MF::identify() const {
82 return string(Name
) + printProperties();
87 for( vector
<Factor
>::iterator qi
= _beliefs
.begin(); qi
!= _beliefs
.end(); qi
++ )
95 if( props
.verbose
>= 1 )
96 cout
<< "Starting " << identify() << "...";
98 size_t pass_size
= _beliefs
.size();
99 Diffs
diffs(pass_size
* 3, 1.0);
102 for( t
=0; t
< (props
.maxiter
*pass_size
) && diffs
.maxDiff() > props
.tol
; t
++ ) {
103 // choose random Var i
104 size_t i
= (size_t) (nrVars() * rnd_uniform());
108 foreach( const Neighbor
&I
, nbV(i
) ) {
110 foreach( const Neighbor
&j
, nbF(I
) ) // for all j in I \ i
113 piet
= factor(I
).log0();
115 piet
= piet
.part_sum(var(i
));
120 jan
.normalize( Prob::NORMPROB
);
122 if( jan
.hasNaNs() ) {
123 cout
<< "MF::run(): ERROR: jan has NaNs!" << endl
;
127 diffs
.push( dist( jan
, _beliefs
[i
], Prob::DISTLINF
) );
132 if( diffs
.maxDiff() > maxdiff
)
133 maxdiff
= diffs
.maxDiff();
135 if( props
.verbose
>= 1 ) {
136 if( diffs
.maxDiff() > props
.tol
) {
137 if( props
.verbose
== 1 )
139 cout
<< "MF::run: WARNING: not converged within " << props
.maxiter
<< " passes (" << toc() - tic
<< " clocks)...final maxdiff:" << diffs
.maxDiff() << endl
;
141 if( props
.verbose
>= 2 )
143 cout
<< "converged in " << t
/ pass_size
<< " passes (" << toc() - tic
<< " clocks)." << endl
;
147 return diffs
.maxDiff();
151 Factor
MF::beliefV (size_t i
) const {
154 piet
.normalize( Prob::NORMPROB
);
159 Factor
MF::belief (const VarSet
&ns
) const {
161 return belief( *(ns
.begin()) );
163 assert( ns
.size() == 1 );
169 Factor
MF::belief (const Var
&n
) const {
170 return( beliefV( findVar( n
) ) );
174 vector
<Factor
> MF::beliefs() const {
175 vector
<Factor
> result
;
176 for( size_t i
= 0; i
< nrVars(); i
++ )
177 result
.push_back( beliefV(i
) );
182 Real
MF::logZ() const {
185 for(size_t i
=0; i
< nrVars(); i
++ )
186 sum
-= beliefV(i
).entropy();
187 for(size_t I
=0; I
< nrFactors(); I
++ ) {
189 foreach( const Neighbor
&j
, nbF(I
) ) // for all j in I
191 henk
.normalize( Prob::NORMPROB
);
193 piet
= factor(I
).log0();
195 sum
-= piet
.totalSum();
202 void MF::init( const VarSet
&ns
) {
203 for( size_t i
= 0; i
< nrVars(); i
++ ) {
204 if( ns
.contains(var(i
) ) )
205 _beliefs
[i
].fill( 1.0 );
210 } // end of namespace dai