748649a5eaa192ceffc9a06ad1ff0788250b9bb6
[libdai.git] / ChangeLog
1 git HEAD
2 --------
3 * Fixed bugs in unit test prob_test.cpp: replaced all occurences of
4 BOOST_CHECK_CLOSE(...,(Real)0.0,tol) with BOOST_CHECK_SMALL(...,tol)
5 * Merged Generalized Loop Correction code kindly provided by Siamak Ravanbakhsh
6
7
8 libDAI-0.3.1 (2012-09-17)
9 -------------------------
10
11 Miscellaneous improvements:
12 * Full 64-bit support on all supported platforms (Linux, OSX, Windows)
13 * Added special MatLab interface for junction tree algorithm (dai_jtree)
14 * Optimized ClusterGraph( const FactorGraph&, bool) constructor
15
16 Build system improvements:
17 * Added Makefile.WINDOWS64, kindly provided by Lin Ming
18 * [Arman Aksoy] Added Makefile.MACOSX64
19 * Added VC10 build files, kindly provided by Sameh Khamis
20
21 Bug fixes:
22 * Fixed bug (found by Sameh Khamis): define NAN (Windows)
23 * Fixed bug (found by Sameh Khamis): add some necessary casts of size_t to BigInt (Windows)
24 * Fixed bug (found by Yan): replaced GNU extension __PRETTY_FUNCTION__ by __FUNCTION__ (Visual Studio) or __func__ (other compilers)
25 * Fixed bug (found by Andy Mueller): added GMP library invocations to swig Makefile
26 * Fixed bug (found by cax): when building MatLab MEX files, GMP/MPIR libraries were not linked
27 * Fixed bug in findMaximum (it only considered a single connected component of the factor graph)
28 * [Benjamin Piwowarski] Renamed "foreach" macro into "bforeach" to avoid conflicts with newer Boost library versions
29 * Fixed "typename" bug in src/alldai.cpp which resulted in FTBFS with older g++ compilers
30 * Fixed memory leak in alldai.cpp and removed the function builtinInfAlgs()
31 * Fixed memory leak in CBP::run()
32 * Fixed typo in Priya's name
33
34
35 libDAI-0.3.0 (2011-07-12)
36 -------------------------
37
38 New license:
39 * Changed license from GPL v2+ to FreeBSD (BSD 2-clause)
40
41 Miscellaneous improvements:
42 * Improved Exception class
43 (it now stores more information and doesn't print to stderr by default)
44 * Added builtinInfAlgs() and builtinInfAlgNames()
45
46 Bug fixes:
47 * [Laurens van der Maaten] src/matlab/dai.cpp now correctly handles missing logZ()
48 and maxDiff() implementations
49 * Now uses GMP big integer type to represent linear states and the number of
50 states of VarSets (in some cases). This fixes a bug Jerome Maye and Priya
51 found in the State class. Unfortunately, the supplied Makefile.WINDOWS now
52 no longer works out-of-the-box.
53 * Fixed numerical issues in MF, FBP and TRWBP (discovered in sparse branch)
54 * Fixed bug in findMaximum(): inconsistent max-beliefs are now detected,
55 instead of returning a MAP state with zero joint probability
56 (reported by Hynek Urban)
57 * Fixed a Boost-related bug in src/util.cpp (reported by Avneesh Saluja)
58 (the random seed needs to be an unsigned int on some platforms)
59 * Fixed two bugs in examples/example_sprinkler_gibbs (reported by Priya)
60 * Fixed bug in tokenizeString() and Evidence::addEvidenceTabFile()
61 (a tab character at the end of a line was incorrectly discarded - bug reported by Priya)
62 * Replaced all Name members by name() virtual functions and removed global variable DAINames
63 (this fixes a bug in matlab/dai.cpp reported by Thomas Mensink)
64
65
66 libDAI-0.2.7 (2010-08-19)
67 -------------------------
68
69 * Removed interfaces deprecated in 0.2.6.
70 * Fixed a bug in JTree::findMaximum() (reported by zhengyun84 and Dhruv Batra):
71 if one or more variables had a MAP belief with more than one maximum, an
72 incorrect MAP state could result.
73
74
75 libDAI-0.2.6 (2010-08-05)
76 -------------------------
77
78 New features:
79 * Added decimation algorithm DecMAP for MAP inference (decmap.h/cpp).
80 * Added source code for one of the winning solvers of the
81 UAI 2010 Approximate Inference Challenge (examples/uai2010-aie-solver.cpp).
82 * Added support for reading files in the UAI Approximate Inference Challenge
83 format, supporting both the 2006/2008 evidence file format and the 2010
84 evidence file format (io.h/cpp).
85
86 Miscellaneous improvements:
87 * 'maxtime' property added to various algorithms (BP, Gibbs, HAK, TreeEP)
88 for setting an upper limit on execution time.
89 * 'maxmem' property added to JTree for setting an upper limit on memory usage.
90 * SmallSet:
91 - Added SmallSet::erase( const T& t ).
92 * VarSet:
93 - nrStates() now returns a long double instead of a size_t.
94 * Permute:
95 - Added ranges() accessor.
96 - Added inverse() method.
97 - Added optional reverse argument to Permute( const std::vector<Var>& ) constructor.
98 * Factor:
99 - Added createFactorDelta( const VarSet& vs, size_t state ).
100 * ClusterGraph:
101 - Added ClusterGraph(const FactorGraph& fg, bool onlyMaximal) constructor.
102 - Added findCluster( const VarSet& cl ).
103 - Added elimVar( size_t i ).
104 - Added 'maxStates' argument to VarElim( EliminationChoice f, size_t maxStates=0 ).
105 * FactorGraph:
106 - Added isMaximal(size_t).
107 - Added maximalFactor(size_t).
108 - Added FactorGraph::logScore( const std::vector<size_t>& statevec ).
109 * Gibbs:
110 - Added 'restart' property.
111 - Added Gibbs::findMaximum() for MAP inference.
112 * HAK:
113 - Optimized region graph construction for HAK/GBP with clusters=BETHE.
114 * examples/examples_imagesegmentation.cpp:
115 - [Peter Rockett] Improved Makefiles for image segmentation example.
116 - Added build flag to specify the CImg version.
117 * util.h/cpp:
118 - Added fromString<>( const std::string& x ).
119
120 Interface changes (the old interface is marked obsolete and will be removed in the next release):
121 * Added InfAlg::setMaxIter(size_t) for setting the maximum number of iterations.
122 * Deprecated Graph::Neighbor, BipartiteGraph::Neighbor and DAG::Neighbor
123 and replaced them by a globally defined Neighbor structure
124 * Deprecated Graph::Neighbors, BipartiteGraph::Neighbors and DAG::Neighbors
125 and replaced them by a globally defined Neighbors type
126 * Deprecated Graph::Edge, BipartiteGraph::Edge and DAG::Edge
127 and replaced them by a globally defined Edge type
128 * Renamed 'iters' property of Gibbs algorithm into 'maxiter'.
129 * ClusterGraph::findVar( const Var& n ) no longer throws an exception if the
130 variable is not found.
131 * Deprecated 'void tokenizeString( const string&, vector<string>&, const string& )'
132 and replaced it with an improved version
133 'vector<string> tokenizeString( const string&, bool, const string& )'
134 * Removed interfaces deprecated in 0.2.5.
135
136 Bug fixes:
137 * Fixed a problem with isnan() on FreeBSD; it is now in the dai namespace.
138 * Workaround for older g++ compilers (e.g. version 4.0.0 on Darwin 9.8.0)
139 which have problems when comparing const_reverse_iterator with
140 reverse_iterator.
141 * [Matt Dunham] Fixed a bug in Factors2mx in src/matlab/matlab.cpp
142 (segfault if factors depending on 0 variables were passed to MatLab)
143
144
145 libDAI-0.2.5 (2010-05-09)
146 -------------------------
147
148 New features:
149 * Added unit tests for var, smallset, varset, graph, dag, bipgraph,
150 weightedgraph, enum, util, exceptions, properties, index, prob,
151 factor, factorgraph, clustergraph, regiongraph, daialg, alldai
152 * [Ofer Meshi] Added a script for converting from FastInf to libDAI format
153 * Added utils/uai2fg, a utility to convert the UAI inference competition file
154 formats to the libDAI factor graph file format
155 * Added dag.h/cpp, an implementation of Directed Acyclic Graphs
156 * Added examples/example_imagesegmentation
157
158 Miscellaneous improvements:
159 * TRWBP:
160 - Added initialization of TRWBP weights by sampling spanning trees
161 * MF:
162 - Added an "init" option that allows to initialize randomly
163 - Added an "updates" option that allows to choose between standard
164 mean field and "hard-spin" mean field
165 * MR:
166 - rewrote response propagation implementation with help of BBP
167 - now uses GraphAL to represent the Markov graph
168 - miscellaneous smaller cleanups
169 * TreeEP:
170 - Now also supports disconnected factor graphs
171 * JTree:
172 - Now also supports disconnected factor graphs
173 * ExactInf:
174 - Added findMaximum()
175 * RegionGraph:
176 - Added error checking code
177 - Changed the way a RegionGraph is streamed to an std::ostream.
178 * ClusterGraph:
179 - Added nrVars() method
180 - Added var( size_t ) method
181 - Added cluster( size_t ) method
182 * FactorGraph:
183 - clamped() now contains a delta factor for the clamped variable
184 - Added MarkovGraph()
185 * TFactor:
186 - Added takeAbs()
187 - Added takeExp()
188 - Added takeLog( bool )
189 - Added operator-() const
190 - Added sumAbs() const
191 - Added operator==( const TFactor<T> &y )
192 - Added get(size_t), set(size_t,T)
193 * TProb:
194 - Added operator==( const TProb<T> &q )
195 - accumulate() now also applies op2 to init
196 - operator/= (T x) now yields 0 when dividing by 0
197 - Added resize(size_t)
198 - Added get(size_t) and set(size_t,T)
199 - Changed format of TProb<T> when streamed to an ostream
200 * multifor:
201 - Added reset()
202 * PropertySet:
203 - Added size()
204 - Added clear()
205 - Added erase()
206 * util.h/cpp:
207 - Added std::string toString( const T& x )
208 * weightedgraph.h/cpp:
209 - Added option to MaxSpanningTree and MinSpanningTree for
210 choosing between Prim's algorithm and Kruskal's algorithm
211 - Better error checking in RootedTree constructor
212 - Added GraphEL::GraphEL( const GraphAL& G ) constructor
213 * BipartiteGraph:
214 - Added hasEdge()
215 - Added findNb1()
216 - Added findNb2()
217 - Added nb1Set()
218 - Added nb2Set()
219 - Added operator==( const BipartiteGraph& )
220 - Added BipartiteGraph( size_t nr1, size_t nr2 ) constructor
221 - Added operator<<( std::ostream&, const BipartiteGraph& )
222 * GraphAL:
223 - Added hasEdge(size_t,size_t)
224 - Added nbSet(size_t)
225 - Added operator==( const GraphAL& )
226 - Added operator<<( std::ostream&, const GraphAL& )
227 * SmallSet:
228 - Added insert( const T& t ) method
229 * Improved regression test
230 * Made all "verbose" properties optional
231 * utils/createfg now has a new factor type ('ISINGUNIFORM') and the old
232 'ISING' factor type has been renamed to 'ISINGGAUSS'
233 * tests/testdai option "marginals" now has five possible values: NONE
234 outputs no marginals, VAR only variable marginals, FAC only factor
235 marginals, VARFAC both types of marginals, and ALL outputs all
236 marginals calculated by the algorithm.
237 * Compressed Makefile
238
239 Interface changes (the old interface is marked obsolete and will be removed in the next release):
240 * Removed RandomDRegularGraph(), please use createGraphRegular() instead
241 * TreeEP:
242 - Changed construct( const RootedTree& ) into
243 construct( const FactorGraph&, const RootedTree& )
244 * JTree:
245 - Changed construct( const std::vector<VarSet>&, bool ) into
246 construct( const FactorGraph&, const std::vector<VarSet>&, bool )
247 - Changed GenerateJT( const std::vector<VarSet> & )
248 into GenerateJT( const FactorGraph &, const std::vector<VarSet> & )
249 * RegionGraph:
250 - Made (previously public) members G, ORs, IRs and fac2OR protected and
251 added DAG() accessor which returns a reference to the region graph DAG
252 structure (currently implemented as a BipartiteGraph).
253 - Renamed calcCountingNumbers() into calcCVMCountingNumbers() and made it
254 protected, because exposing it to the world serves no purpose.
255 - Removed partial constructor RegionGraph( const FactorGraph& fg )
256 - Made RecomputeORs(), RecomputeORs( const VarSet& ) and RecomputeOR( size_t )
257 protected and renamed them by changing the "Recompute" into "recompute",
258 because exposing them to the world serves no purpose.
259 * ClusterGraph:
260 - Made (previously public) members G, vars and clusters private and added
261 bipGraph(), vars() and clusters() methods which offer read-only access
262 to these members.
263 - Deprecated toVector()
264 - Renamed size() into nrClusters()
265 * FactorGraph:
266 - Renamed Cliques() into maximalFactorDomains() and made it faster
267 - findVars( const VarSet& ) now returns a SmallSet<size_t>
268 and its argument now has a const-qualifier (which fixes a small bug).
269 - Made (previously public) member G private and added the
270 bipGraph() method, which offers read-only access to it.
271 - Deprecated the iterator interface:
272 o FactorGraph::iterator typedef
273 o FactorGraph::const_iterator typedef
274 o FactorGraph::begin() members
275 o FactorGraph::end() members
276 - Deprecated factor(size_t) which offered write access to a factor
277 because using this functionality in the descendant RegionGraph is dangerous,
278 as the outer regions are not automatically recomputed.
279 * TFactor:
280 - Renamed states() into nrStates()
281 - Added get(size_t) and set(size_t,T) operators;
282 get() is equivalent to "operator[](size_t) const" and set() should
283 be used instead of the non-const operator[], which has been deprecated
284 * TProb:
285 - Deprecated TProb( TIterator begin, TIterator end, size_t sizeHint=0 )
286 constructor: the sizeHint argument no longer defaults to 0
287 - Deprecated accumulate( T init, binOp op1, unOp op2 );
288 instead, accumulateSum( T init, unOp op ) and
289 accumulateMax( T init, unOp op, bool minimize ) should be used.
290 - Deprecated TProb::NormType and TProb::DistType;
291 ProbNormType and ProbDistType should be used instead.
292 - Fixed bug by renaming operator<=() to operator<()
293 - Added get(size_t) and set(size_t,T) operators;
294 get() is equivalent to "operator[](size_t) const" and set() should
295 be used instead of the non-const operator[], which has been deprecated
296 * PropertySet:
297 - Renamed Set() -> set()
298 - Renamed Get() -> get()
299 - Renamed GetAs<T>() -> getAs<T>()
300 - Renamed ConvertTo<T>() -> convertTo<T>()
301 * util.h/cpp:
302 - Removed max( const std::vector<Real> &v )
303 * weightedgraph.h/cpp:
304 - Renamed MaxSpanningTreePrims into MaxSpanningTree
305 - Renamed MinSpanningTreePrims into MinSpanningTree
306 - The vertices in DEdge and UEdge are now named "first" and "second"
307 for compatibility with a std::pair<size_t,size_t>
308 * BipartiteGraph:
309 - delta1() and delta2() now return a SmallSet<size_t> instead of a vector<size_t>
310 * SmallSet:
311 - The sizeHint argument of the iterator constructor
312 SmallSet::SmallSet( TIterator begin, TIterator end, size_t sizeHint=0 )
313 no longer has a default value in order to avoid confusion with the
314 SmallSet::SmallSet( const T &t1, const T &t2 )
315 constructor.
316
317 Bug fixes:
318 * [Stefano Pellegrini] Fixed bug in JTree::findMaximum()
319 * [Stefano Pellegrini] Fixed bug in BP[logdomain=1,inference=MAXPROD]
320 * Fixed some bugs in the MatLab interface build system
321 * Fixed a bug in utils/fginfo.cpp
322 * Fixed a bug in JTree::findMaximum() and simplified the code
323 * Fixed bug in BBPCostFunction::operator=() which prevented the desired
324 assignment from happening
325 * RegionGraph::WriteToFile( const char* ), RegionGraph::ReadFromFile( const char * )
326 and RegionGraph::printDot( std::ostream& ) incorrectly called their respective
327 FactorGraph ancestor methods; this has been corrected by letting them throw a
328 NOT_IMPLEMENTED exception.
329 * Fixed bug in FactorGraph::clone()
330 * Fixed bug in min( const TFactor<T> &, const TFactor<T> & )
331 * Fixed bug in max( const TFactor<T> &, const TFactor<T> & )
332 * Fixed bug by renaming TProb<T>::operator<=() to TProb<T>::operator<()
333 * Fixed bug in PropertySet::setAsString<T>()
334 * Fixed a bug in rnd_seed()
335 * BipartiteGraph:
336 - Fixed bug in eraseNode1()
337 - Fixed bug in eraseNode2()
338 - Fixed bug in isTree()
339 * GraphAL:
340 - Fixed bug in nrEdges()
341 - Fixed bug in addEdge()
342 - Fixed bug in isTree()
343 - Fixed bug in eraseNode()
344 - Fixed bug in printDot()
345 * Fixed bug in createGraphGrid3D()
346 * Fixed bug in createGraphRegular()
347
348
349 libDAI-0.2.4 (2010-02-11)
350 -------------------------
351
352 New features:
353 * Implemented Tree-Reweighted BP
354 * [Frederik Eaton] Implemented Fractional Belief Propagation
355
356 Miscellaneous improvements:
357 * Improved documentation
358 * [Frederik Eaton] Added constructors for BBPCostFunction
359 * [Frederik Eaton] Added accessor/mutator for the elements of a SmallSet<>
360 * [Frederik Eaton] Added unary minus to TProb<>
361 * [Frederik Eaton] Added Hellinger distance to TProb<>::DistType
362 * [Frederik Eaton] Two small patches for src/jtree.cpp and utils/createfg.cpp
363 * tests/testdai option "marginals" now has three possible values: NONE
364 outputs no marginals, VAR only variable marginals, and ALL outputs all
365 marginals calculated by the algorithm.
366 * Strengthened convergence criteria of various algorithms
367 * Added GraphAL, an adjacency list implementation for graphs,
368 similar to (but simpler than) BipartiteGraph
369 * Added some functionality to create various standard factors
370 (the functions whose names start with "createFactor")
371 * Added examples example_sprinkler_gibbs and example_sprinkler_em
372 * Implemented various heuristics for choosing a variable elimination sequence
373 in JTree
374 * Added BETHE method for GBP/HAK cluster choice
375 * Made alias support official part of the library
376
377 Build system:
378 * Moved platform independent build options into Makefile.ALL
379 * Windows platform now needs Boost 1.37 or higher
380
381 Code cleanup:
382 * Cleaned up utils/createfg and tests/testdai
383 * Cleanup of some duplicate code in BP, FBP, TRWBP
384
385 Interface changes (the old interface is marked obsolete and will be removed in the next release):
386 * Removed obsolete/deprecated stuff
387 * Renamed Graph into GraphEL (for Graph, implemented as Edge List)
388 * Renamed some functions of BipartiteGraph:
389 add1() -> addNode1()
390 erase1() -> eraseNode1()
391 nr1() -> nrNodes1()
392 add2() -> addNode2()
393 erase2() -> eraseNode2()
394 nr2() -> nrNodes2()
395 * Renamed some functions in ClusterGraph:
396 ClusterGraph::eliminationCost() -> ::eliminationCost_MinFill()
397 ClusterGraph::VarElim() -> ClusterGraph::VarElim( sequentialVariableElimination( ElimSeq ) )
398 ClusterGraph::VarElim_MinFill() -> ClusterGraph::VarElim( greedyVariableElimination( eliminationCost_MinFill ) )
399 * Changed interface of one RegionGraph constructor
400 * Renamed "Clamped BP" into "Conditioned BP"
401
402 Bug fixes:
403 * Fixed regression in scripts/regenerate-properties (now all errors are
404 gathered before throwing the exception, as used to be the case)
405 * Fixed FTBFS errors on MACOSX (thanks to Sebastian Riedel for reporting this bug)
406 * [Alexander Schwing] Fixed error in BP that occured with damping
407 and using log-domain updates
408 * Fixed bug in HAK for trivial region graphs (with only one outer region
409 and no inner regions), reported by Alejandro Lage.
410 * Fixed long-standing bug in TreeEP (now, within-loop propagation optimization works)
411
412
413 libDAI-0.2.3 (2009-11-16)
414 -------------------------
415
416 New features:
417 * Complete doxygen documentation (although more detailed documentation still
418 has to be written)
419 * [Charles Vaske] Added parameter learning for conditional probabilities by
420 Expectation Maximization
421 * [Patrick Pletscher] Added SWIG wrapper code for experimental python and
422 octave interfaces
423 * Added Max-Product functionality to JTree
424 * [Frederik Eaton] Added Back-Belief-Propagation
425 * [Frederik Eaton] Added approximate inference method "Clamped Belief Propagation"
426 * [Frederik Eaton] Added approximate inference method "Gibbs sampling"
427
428 Code cleanup:
429 * Updated copyright headers
430 * Cleaned up error handling by introducing the DAI_THROWE macro
431 * Introduced DAI_DEBASSERT macro to abbreviate a common pattern
432 * Replaced the standard assert() macro by DAI_ASSERT, which throws a
433 dai::Exception and is even active if NDEBUG is defined
434 * Removed all the virtual default constructors *::create(), as they are not used
435 * [Frederik Eaton] Removed unnecessary copy constructors and assignment operators
436 * [Frederik Eaton] Change cout to cerr in warnings and error messages
437
438 Miscellaneous improvements:
439 * BipartiteGraph:
440 - Added eraseEdge( size_t n1, size_t n2 )
441 - [Frederik Eaton] Improved documentation of Neighbor
442 * TProb<T>:
443 - Added divided_by(const TProb<T>&) const
444 - Added constructor TProb<T>( const std::vector<S> &v )
445 - Added size_t draw(), which draws a random index
446 - [Frederik Eaton] Added setUniform()
447 - [Frederik Eaton] Added sumAbs()
448 - [Frederik Eaton] Added argmax()
449 - [Giuseppe Passino] Added begin(), end()
450 * TFactor<T>:
451 - [Giuseppe Passino] Added begin(), end()
452 - [Charles Vaske] Added TFactor( const std::vector<Var> &vars, const std::vector<T> &p ),
453 which reorders variables to canonical ordering before storing the table
454 - Added constructor TFactor<T>( const VarSet &vars, const std::vector<S> &v )
455 - Extended functionality of TFactor<T>::operators +,-,+=,-= to handle different VarSets
456 - Added TFactor<T>::maxMarginal (similar to marginal but with max instead of sum)
457 * State:
458 - [Giuseppe Passino] Added prefix ++ operator
459 * Permute:
460 - [Charles Vaske] Added constructor in Permute for canonical variable ordering
461 * FactorGraph:
462 - [Frederik Eaton] Added clampVar()
463 - [Frederik Eaton] Added clampFactor()
464 - [Giuseppe Passino] Added begin(), end()
465 * PropertySet:
466 - Added keys(), for getting all keys
467 - [Frederik Eaton] Added default constructor
468 - [Frederik Eaton] Added constructor from string
469 * InfAlg:
470 - Added setProperties(), getProperties() and printProperties()
471 - [Frederik Eaton] Added beliefV(), beliefF()
472 * ExactInf:
473 - Added calcMarginal(const VarSet &)
474 * HAK:
475 - Added "init" parameter to allow for random initialization
476 * BP:
477 - [Giuseppe Passino] Added findMaximum(), which can be used after running
478 max-product BP to construct a global state with maximum probability
479 * JTree:
480 - Added findMaximum(), which can be used after running
481 max-product JTree to construct a global state with maximum probability
482 * MatLab interface:
483 - MEX file dai now also returns variable and factor beliefs
484 - [Sebastian Nowozin] MEX file dai now also optionally returns the MAP state
485 (only for BP and JTree)
486 * README is now created automatically from doxygen documentation
487 * [Frederik Eaton] Added script for automatically generating properties code (used by CBP and BBP)
488 * [Frederik Eaton] Added newInfAlgFromString to alldai.h/cpp
489 * [Frederik Eaton] Added some utility macros (DAI_PV, DAI_DMSG, DAI_IFVERB)
490 and functions (concat(),rnd()) to util.h
491 * Changed output stream operator<< for Var and VarSet
492 * [Frederik Eaton] Improved parsing code in tests/testdai to allow recursive
493 alias substitutions
494 * [Frederik Eaton] Added useful aliases to aliases.conf
495 * [Giuseppe Passino] Optimised maximum-residual BP by using a reversed ordered
496 set instead of the linear search (which can yield enormous speedups - a
497 factor 500 has been measured on a binary Ising grid with 128x128 variables!)
498 * Added debug assertions to Var which check for inconsistent dimensions of
499 variables with the same labels
500 * toc() now returns POSIX system time with maximum accuracy of microseconds
501 * Exception objects now remember their error code
502 * Examples:
503 - Moved example.cpp to examples/
504 - Added examples/example_bipgraph.cpp
505 - Added examples/example_varset.cpp
506 - Added examples/example_sprinkler.cpp
507 - Added examples/example_permute.cpp
508 - Added python and octave ports for examples/example_sprinkler.cpp
509
510 Build system:
511 * Improved Makefile:
512 - Merged Makefile.win and Makefile.shared into Makefile
513 - Macros DAI_VERSION and DAI_DATE have been introduced,
514 in order to store this information in a central place
515 - Introduced CCNODEBUGFLAGS in Makefile
516 - Switched Makefile.win to GNU Make syntax
517 - [Frederik Eaton] Added TAGS, lib targets to Makefile
518 * Compatibility:
519 - [Peter Gober] libDAI can now be built on Cygwin
520 - [Dan Preston] libDAI can now be built on Mac OS X
521 - Changed regression test so that it also works under Windows
522
523 Interface changes (the old interface is marked obsolete and will be removed in the next release):
524 * Var:
525 - Variable labels are now nonnegative (of type size_t)
526 * VarSet:
527 - Replaced calcState() by non-member calcLinearState()
528 - Replaced calcStates() by non-member calcState()
529 * Permute:
530 - Renamed convert_linear_index into convertLinearIndex
531 * TProb<>:
532 - Replaced log0() by log(true)
533 - Replaced takeLog0() by takeLog(true)
534 - Removed hasNonPositives()
535 - Renamed minVal() to min()
536 - Renamed maxVal() to max()
537 - Renamed totalSum() to sum()
538 * TFactor<>:
539 - Replaced log0() by TFactor<T>::log(true)
540 - Removed divided_by, use operator/ instead
541 - Removed divide, use operator/= instead
542 - Removed partSum(const VarSet&), use marginal(const VarSet&,false) instead
543 - Renamed minVal() to min()
544 - Renamed maxVal() to max()
545 - Renamed totalSum() to sum()
546 * FactorGraph:
547 - Changed clamp and clamp interfaces (the variable to be
548 clamped is now indicated by its index, not as a Var)
549 * RegionGraph:
550 - Renamed Check_Counting_Numbers into checkCountingNumbers
551 - Renamed Calc_Counting_Numbers into calcCountingNumbers
552 * Miscellaneous:
553 - Renamed Treewidth(const FactorGraph &) into boundTreewidth(const FactorGraph &)
554 - Replaced UEdgeVec by Graph
555 - Replaced DEdgeVec by new RootedTree class
556 - Moved functionality of GrowRootedTree() into constructor of RootedTree
557 - Merged calcPairBeliefsNew() into calcPairBeliefs()
558 - Removed calcMarginal2ndO()
559 - Renamed smallSet<T> to SmallSet<T>
560 - Removed class Diffs
561 - [Frederik Eaton] Added backwards compatibility layer for edge interface to
562 BipartiteGraph and FactorGraph (which will be obsoleted soon)
563
564 Bug fixes:
565 * Fixed reversal of min and max in
566 TFactor<T> min( const TFactor<T> &, const TFactor<T> & )
567 TFactor<T> max( const TFactor<T> &, const TFactor<T> & )
568 * [Sebastian Nowozin] Fixed memory leak in MEX file dai
569 * [Frederik Eaton] In PropertySet::getStringAs(), check for typeid(ValueType)
570 before typeid(std::string) (this fixes a strange bug for empty string property)
571 * Added work-around for bug in Boost Graph Library
572 * Fixed bug in MaxSpanningTree (it wrongly assumed that the tree was not empty).
573 * Fixed bug in calcMarginal and calcPairBeliefs where states with zero probability
574 mass were clamped, leading to NaNs or assertion errors (thanks to Dan Preston
575 for reporting this)
576
577
578 libDAI-0.2.2 (2008-09-30)
579 -------------------------
580
581 New features:
582 * Approximate inference methods now report the number of iterations needed.
583 * Added damping to various algorithms to improve convergence properties.
584 * Added more features to utils/createfg for creating factor graphs.
585 * Added ExactInf class for brute force exact inference.
586 * [Giuseppe Pasino] Added "logdomain" property to BP, a boolean that controls
587 whether calculations are done in the log-domain or in the linear domain;
588 doing calculations in the log-domain may help if the numerical range
589 of a double is too small.
590 * [Claudio Lima] Added Max-Product functionality to BP.
591 * Improved documentation.
592
593 Improved architecture:
594 * Added Exceptions framework.
595 * Pervasive change of BipartiteGraph implementation (based on an idea by
596 Giuseppe Passino). BipartiteGraph no longer stores the node properties
597 (former _V1 and _V2), nor does it store a dense adjacency matrix anymore,
598 nor an edge list. Instead, it stores the graph structure as lists of
599 neighboring nodes. This yields a significant memory/speed improvement for
600 large factor graphs, and is more elegant as well. Iterating over neighbors is
601 made easy by using boost::foreach.
602 * Added conditional compilation of inference methods.
603 * VarSet is now implemented using a std::vector<Var> instead of a
604 std::set<Var>, which yields a significant speed improvement. Furthermore,
605 the implementation has been generalized, resulting in the small_set<T> class
606 which can be used to represent sets of small cardinality; VarSet is the
607 specialization with T = Var.
608 * Improved ClusterGraph implementation, yielding significant speedups
609 for the JunctionTree algorithm on large factorgraphs.
610
611 Code cleanup:
612 * Moved everything into namespace "dai".
613 * Renamed DEBUG to DAI_DEBUG to avoid conflicts.
614 * Replaced ENUM2,ENUM3,ENUM4,ENUM5,ENUM6 by single DAI_ENUM macro.
615 * Removed utils/remove_short_loops and matlab/remove_short_loops.
616 * Replaced sub_nb class in mr.h by boost::dynamic_bitset.
617 * Improved index.h:
618 - Renamed Index -> IndexFor
619 - Added some .reserve()'s to IndexFor methods which yields a
620 25% speedup of testregression
621 - Replaced multind by Permute
622 - Added MultiFor
623 - Added State
624 * New funcstionality of factor.h.
625 * Moved Properties and MaxDiff frameworks from InfAlg to each individual
626 inference algorithm, because the Properties framework was not as
627 convenient as I hoped, and not every inference algorithm needs a maxdiff
628 variable. Also, replaced some FactorGraph functionality in InfAlg by a
629 function that returns the FactorGraph. The result is cleaner (less
630 entangled) code.
631 * Removed x2x.
632 * Replaced Complex with real numbers (negative potentials are just too rare
633 to warrant the additional "complexity" :)).
634
635 Miscellaneous improvements:
636 * Now compiles also with MS Visual C++ (thanks to Jiuxiang Hu) and with
637 GCC under Cygwin.
638 * Contributions by Peter Gober:
639 - Renamed variable _N in mr.* for compatibility with g++ under Cygwin.
640 * Misc contributions by Giuseppe Passino:
641 - removed "using namespace std;" from header files - bad practice;
642 - moved header files in include/dai and sources in src;
643 - changed #ifndefs to GNU style;
644 - added extra warning checks (-W -Wextra) and fixed resulting warnings;
645 - dai::TProb:
646 o removed copy constructor and assignment operators (redundant);
647 o implementation of some methods via STL algorithms;
648 o added methods takeExp, takeLog, takeLog0 for transformation in-place;
649 o explicit constructor (prevents implicit conversion from size_t to TProb);
650 o added operator+,+=,-,-=, with argument T (for calculations in log-scale);
651 * Misc contributions by Christian Wojek:
652 - New FactorGraph constructor that constructs from given ranges of factors
653 and variables;
654 - Optimization of FactorGraph constructors using tr1::unordered_map.
655 * FactorGraph constructors no longer check for short loops (huge speed
656 increase for large factor graphs), nor for negative entries. Also, the
657 normtype is now Prob::NORMPROB by default.
658 * Improved MaxSpanningTreePrims algorithm (uses boost::graph).
659
660 Interface changes:
661 * VarSet::
662 - VarSet::stateSpace() -> nrStates(const VarSet &)
663 - VarSet( const std::set<Var> ) -> VarSet( begin, end, sizeHint=0 )
664 - VarSet( const std::vector<Var> ) -> VarSet( begin, end, sizeHint=0 )
665 - removed bool operator||
666 - operator&&(const VarSet&) -> intersects(const VarSet&)
667 - operator&&(const Var&) -> contains(const Var&)
668 * FactorGraph::
669 - delta(const Var &) -> delta(size_t)
670 - Delta(const Var &) -> Delta(size_t)
671 - makeCavity(const Var &) -> makeCavity(size_t)
672 - vars() -> vars
673 - factors() -> factors
674 - removed MakeFactorCavity(size_t)
675 - removed ExactMarginal(const VarSet &)
676 - removed ExactlogZ()
677 - removed updatedFactor(size_t)
678 - removed _normtype and NormType()
679 - removed hasShortLoops(...) and removeShortLoops(...)
680 - WriteToDotFile(const char *filename) -> printDot( std::ostream& os )
681 - undoProb(size_t) -> restoreFactor(size_t)
682 - saveProb(size_t) -> backupFactor(size_t)
683 - undoProbs(const VarSet &) -> restoreFactors(const VarSet &)
684 - saveProbs(const VarSet &) -> backupFactors(const VarSet &)
685 - ReadFromFile(const char*) returns void (throws on error)
686 - WriteToFile(const char*) returns void (throws on error)
687 - removed hasNegatives()
688 * RegionGraph::
689 - nr_ORs() -> nrORs()
690 - nr_IRs() -> nrIRs()
691 - ORs() -> ORs
692 - IRs() -> IRs
693 * *::Regenerate() -> *::construct()
694 * Renamed Index -> IndexFor
695 * Diffs:
696 - max() -> maxDiff()
697 - max_size() -> maxSize()
698 * Prob::max() -> Prob::maxVal()
699 * Factor::
700 - max() -> maxVal()
701 - part_sum() -> partSum()
702 * toc() in util.h now returns seconds as a double
703 * VarSet::operator&&
704 * Properties -> PropertySet
705
706
707 libDAI-0.2.1 (2008-05-26)
708 -------------------------
709
710 Bugfix release.
711 * added missing cstdio header in util.h
712 * fixed Properties in MR_CLAMPING_* and MR_EXACT_*
713 * added description of the factor graph fileformat
714 * improved Makefile
715
716
717 libDAI-0.2.0 (2006-11-30)
718 -------------------------
719
720 First public release.
721
722
723 0.1.5 (2006-11-30)
724 ------------------
725
726 Regressions
727
728 - tests/testlcbp and tests/testlcbp are broken.
729 - EXACT method does not work anymore.
730 - The Properties framework gives a speed penalty because of the lookup
731 costs involved; inner loops should be optimized.
732
733 General framework
734
735 - DAIAlg is now a template class; typedefs for DAIAlg<FactorGraph> and for
736 DAIAlg<RegionGraph> are provided. In this way, we do not have to write "wrapper"
737 functions to forward functionality from either FactorGraph or RegionGraph
738 to DAIAlg. Functionality like clamping can be implemented in FactorGraph
739 and in RegionGraph and no explicit interface is needed in descendants.
740 - New abstract base class InfAlg added, representing an inference algorithm,
741 from which DAIAlg<T> inherits. This solves the incompatibility problems of
742 DAIAlg<T> for different T (e.g. DAIAlg<FactorGraph> was incompatible with
743 DAIAlg<RegionGraph>). More work is required to reduce code duplication
744 (make FactorGraph part of InfAlg).
745 - Added generic interface (nrVars(), Vars(), nrFactors(), factor(size_t),
746 beliefs(), belief(VarSet &), ...) to InfAlg and descendants.
747 - Added a saveProbs/undoProbs interface to InfAlg and descendants that enables
748 one to save a few factors, modify them (e.g. clamp them), and then restore them
749 to their old values. Undo should also init the corresponding messages / beliefs.
750 This can be used if a given factor graph repeatedly needs to be clamped in
751 different ways and an approximation method is run for each clamping; using the
752 saveProbs/undoProbs can give a significant speed increase.
753 - Switched to a general Properties framework that handles the parameters of
754 all inference methods in a uniform manner. The Properties class is a map of
755 several properties in boost::any objects, indexed by their names (strings).
756 It can read from a stream and write to a stream. It is recursive, in the sense
757 that a Properties object can hold a variable of type Properties as well.
758 - Added a generic way of constructing inference algorithms from a factor graph,
759 name and properties object. Added the newInfAlg function which constructs
760 the requested object. This is used by LCBP, the Matlab interface and the
761 command line (test) interface.
762 - Added a generic enum framework for enum parameters. Although implemented as a
763 hack, it is quite useful in that it drastically simplifies and reduces the
764 amount of code for handling enum parameters.
765 - Provided generic functions for calculating marginals in different ways that
766 work for all approximate inference methods.
767
768 Bugfixes
769
770 - Fixed GBP free energy.
771 - Fixed bug in junctiontree (it didn't init the _vars variable).
772 - Corrected two bugs in operator&& and operator|| in VarSet (they returned
773 the logical NOT of what they should return).
774 - Fixed bug in RegionGraph::RecomputeOR(s).
775 - Fixed bug in utils/create_dreg_fg:
776 graph structure was not random for given parameters (forgot to call srand()).
777 - TreeEP bug workaround: use the complete junction tree instead of a subtree.
778 - Fixed bug in JTree::HUGIN() and JTree:ShaferShenoy() in case of junction tree
779 that consists of one outer region only.
780 - Fixed INIT bug in LCBP2::UpdatePancake().
781 - Fixed MaxDiffs flow (except for MR).
782
783 New functionality
784
785 - HAK supports several default cluster choices:
786 minimal (only factors)
787 delta (Markov blankets)
788 loop (all loops consisting of loops consisting of <loopdepth> or less variables)
789 Only the maximal clusters are used as outer clusters.
790 - Implemented TreeEP. It generalizes the heuristic method described in the
791 Minka & Qi paper for obtaining a tree with the most relevant interactions to
792 higher order interactions. Almost all optimizations described in the Minka & Qi
793 paper are used, except that evidence is passed over the whole tree instead of
794 relevant subsets (the latter is almost implemented but buggy). Also added
795 alternative (worst-case) algorithm that uses a maximum spanning tree on the
796 weighted graph where the weight between neighbours i and j is given by
797 N(psi,i,j), where psi is the product of all the factors involving both i and j
798 (which is an upper bound on the effective interaction between i and j).
799 - Implemented MR (MontanariRizzo) based on Bastian's code, but extended it
800 to be able to handle connectivities larger than 3 (in principle, up to 32).
801 It supports different initialization methods (the original RESPPROP,
802 the CLAMPING method and EXACT which uses JTree) and different update methods
803 (FULL and LINEAR).
804 - Implemented LCBP2, an analogon of LCBP which represents pancakes as little
805 networks and uses some approximate inference method on them for calculating
806 marginals.
807 - Now there are several LCBP variants (LCBP, LCBPI, LCBPJ, LCBPK, LCBPL);
808 LCBPJ works only for pairwise, LCBPK is LCBP improved for higher order
809 interactions and LCBPL is LCBPI improved for higher-order interactions.
810 - Wrote one single program utils/createfg for creating various types of
811 random factor graphs.
812 - Wrote utility to visualize factor graphs using graphviz.
813 (it uses the BOOST Program Options library)
814 - Added fginfo utility that displays some info about a .fg file.
815 - Implemented Factor::strength function that calculates the potential strength
816 N(psi,i,j) between variables i and j as described in cs.IT:0504030
817 - Wrote a general MatLab interface matlab/dai (similar to tests/test);
818 this unified the matlab functions dai, dai_bp, dai_mf, dai_jt, dai_tep, dai_cvm.
819 - Added MATLAB routine that returns contraction matrix A for BP convergence analysis.
820 - Implemented a MATLAB interface ai_potstrength for Factor::strength
821 - Added Martijn's x2x
822
823 Improvements of existing code
824
825 - Reimplemented RegionGraph and descendants: a RegionGraph ISA FactorGraph
826 and also a BipartiteGraph<FRegion,Region>. It now also keeps a map that
827 associates outer region indices to factor indices (no powers yet, this
828 is deemed superfluous) and provides functions to recompute (some of) the
829 outer regions from the factors.
830 - InfAlg descendants run() methods now stop immediately and return NAN in case
831 they detect NANs. Only BP does not do NAN checking for performance reasons.
832 - LCBP now works with factors containing zeroes (by defining x/0 = 0).
833 - HAK, GBP and DoubleLoop now conform to the standards for verbose reporting,
834 timing and convergence criteria.
835 - Implemented logZ() for JTree. It does the calculation during message-passing.
836 - Marginal2ndO now optionally divides by the single node beliefs (to the power n-2);
837 hopefully this will give more accurate approximations.
838 - Marginal and Marginal2ndO (optionally) use the new saveProbs/undoProbs functionality
839 for a faster way of calculating marginals, which does not require a call to init()
840 nor cloning the whole object for each clamping. This leads to a significant speedup.
841 - LCBP (and LCBP2) now have complete flexibility in the specification of the
842 inner method, i.e. the method used to generate the initial cavity approximations.
843 One can pass two strings, a name and a properties string, and LCBP simply invokes
844 newInfAlg to construct the corresponding inference algorithm and uses the generic
845 marginal functions to approximate cavity marginals.
846 - Replaced the global "method" variable by local properties and removed ai.h
847 - Added some methods to Factor (operators *, *=, /, /= with doubles as
848 second argument, operators -, +=, -= with other Factors as second
849 arguments, randomize(), RemoveFirstOrderInteractions) and similar
850 operations to Prob
851 - Moving towards boost::program_options for handling command line arguments
852 (tests/test is done).
853 - Renamed some FactorGraph methods:
854 nr_vars -> nrVars
855 nr_factors -> nrFactors
856 varind -> findVar
857 factorind -> findFactor
858 makeFacCavity -> makeFactorCavity
859 - LCBP_SEQMAXRES has been removed because it did strange things.
860 - Implemented RandomDRegularGraph
861 - Implemented JTree::calcMarginal for marginals that are not confined
862 within one cluster (using cut-set conditioning).
863 - Added isConnected() method to FactorGraph (some methods do not work with
864 disconnected factor graphs).
865 - Pair beliefs are now calculated in a symmetrical way by calcPairBeliefs
866 - Removed single node interaction "correction" code from clamping methods
867 - Removed calcCavityDist and calcCavityDist2ndO
868 - No longer depends on GSL.
869 - Increased portability by combining platform dependant utility functions
870 in util.{h,cpp}.
871 - Wrote *.m files providing help
872
873 Testing framework
874
875 - Made a new and significantly improved testing framework that provides most
876 functionality from the command line.
877 - The basis is provided by tests/test, which uses the newInfAlg functionality
878 and enables the user to easily compare from the command line different
879 inference methods on a given factorgraph. All parameters can be specified.
880 Output consists of CPU time, average and maximum single variable marginal
881 errors, relative logZ error and MaxDiff().
882 - tests/aliases.conf contains aliases for standard combinations of methods
883 and their options (which can be used in tests/test).
884 - tests/large contains several bash/python scripts that create random factor
885 graphs, compare several approximate inference algorithms (using tests/test) and
886 allow for easy visualization of the results using PyX.
887 - Added several .fg files for test purposes to /tests (e.g. two ALARM versions
888 alarm.fg and alarm_bnt.fg; testfast.fg, a 4x4 periodic Ising grid for
889 regression testing).
890 - Added a regression test to the Makefile which is included in the standard
891 target. It compares all inference methods on tests/testfast.fg with the
892 results stored in tests/testfast.out
893
894 Miscellaneous
895
896 - Expanded all tabs to spaces (":set tabstop 4\n:set expandtab\n:retab" in vim)
897 - Experimental MATLAB code added for StarEP approximation on cavity
898 - Renamed project to libDAI and changed directory name accordingly.
899 - Renamed JunctionTree to JTree.
900 - Fixed licensing (now it's officially GPL).
901 - Improved README
902
903
904 revision 252
905 ------------
906
907 Functionality
908 - Added RegionGraph, GBP, CVM and HAK (double-loop).
909 - Added JunctionTree (with two update algorithms, HUGIN and Shafer-Shenoy), which is a
910 RegionGraph.
911 - NormType is now chosen automatically (in case of negative factors, Prob::NORMLINF is used,
912 otherwise the default Prob::NORMPROB is used). Also, in case of negative factors, the
913 RegionGraph constructors assign each Factor to a unique outer region instead of dividing
914 it over all subsuming outer regions. See README for when negative factors are known to work
915 and when not.
916 - FactorGraph::FactorGraph(const vector<Factor>) only gives a warning in case of short loops,
917 it does not automatically merge factors anymore.
918 - Removed BP_SEQMAXRESNOCLEAR (all cavity initialization methods now are implicitly NOCLEAR)
919 - Added MATLAB interface functions ai_readfg, ai_removeshortloops and ai_bp
920 - Added LCBP-III type that should be equivalent to LCBP-II, but can handle zeroes
921 in potentials. Note that it is significantly slower than LCBP-II (and has to be reimplemented
922 such that it does not store the complete pancakes, but represents them as little factor graphs).
923
924 Implementation / code
925 - Made a seperate type WeightedGraph, which until now only implements Prim's
926 maximal spanning tree algorithm and is only used by the junction tree code. It might
927 be good to make it a class somewhere in the future and extend it's interface.
928 - Made a seperate class ClusterGraph, which is only used by the junction tree
929 code. It's main purpose is a graph-theoretical variable elimination algorithm.
930 - Implemented the heuristic "minimum-new-edges-in-clique-graph" for variable elimination.
931 - Massive code cleanup, moving towards "generic" programming style, using
932 multiple inheritance and polymorphism.
933 o BP, LCBP, MF, HAK and JunctionTree now inherit from a common DAIAlg class
934 o Made generic functions Marginal, Marginal2ndO, calcCavityDist, calcCavityDist2ndO, clamp
935 that can be used by FactorGraph-based DAIAlgs.
936 o Created TProb<T> class, which stores a probability vector (without the accompanying indexing
937 and VarSet) and provides functionality for it (which is used by TFactor<T>).
938 o Rewrote the VarSet class. It now caches its statespace(). It now privately inherits from set<Var>.
939 I had to overload the insert methods of set<Var> so that they calculate the new statespace.
940 o Rewrote the TFactor class. The TFactor class now HAS a TProb and HAS a VarSet.
941 - Rewrote BP to use the new TProb<T> interface. Performance of BP improved up to a factor 6 by:
942 o using Prob's instead of Factor's;
943 o splitting the multiplication of the messages into two parts (thanks to Vicenc!);
944 o optimizing the calculation of the beliefs (only the message calculations were optimized till now).
945 o replacing FactorGraph::_nb1 and _nb2 (which were set<size_t>) by vector<size_t>
946 - LCBP now seperately stores cavitydists and pancakes. Added InitPancakes() method
947 that takes the cavitydists and multiplies them with the relevant factors. This
948 resulted in an API change in AI which now accepts and returns initial cavitydists
949 instead of initial pancakes.
950
951 Minor changes
952 - Started writing DoxyGen documentation
953 - Renamed lcptab2fg.m matlab/ai_writefg.m
954 - Moved all matlab stuff to matlab/
955 - More detailed reporting (also reports clocks used).
956 - Marginal and Marginal2ndO now use *differences* in logZ to avoid NaNs.
957 - Improved testing suite.
958 - Removed logreal support.
959 - FactorGraph now also supports input streams and ignores comment lines in .fg files.
960 - Added tests/create_full_fg.cpp and tests/create_ising_fg.cpp which create
961 full and periodic 2D Ising networks according to some command line parameters.
962 - Now logZ really returns logZ instead of -logZ.
963 - Added FactorGraph::WriteToDotFile
964
965
966 0.1.4 (2006-04-13)
967 ------------------
968 - Added file IO routines to read and write factorgraphs.
969 - Added L-infinity normalization for use with (partially) negative factors.
970 - Renamed BetheF, MFF to logZ, which now use complex numbers to be able to
971 handle (partially) negative factors.
972 - Added test suite.
973 - All probabilities are now represented using double instead of LogReal<double>.
974 - Combined Alg and Alg3 into LCBP. Several update schemes possible.
975 - Combined several variants of BP into doBP. Several update schemes possible.
976 Now uses precalculated indices for optimization.
977 - Renamed Node -> Var and Potential -> Factor.
978 - Extensive code cleanup. More use of OO techniques. Changed API.
979 - MaxIter now means maximum number of passes (corresponding to number of
980 _parallel_ updates).
981 - MaxDiff now means the maximum L-infinity distance between the updated and
982 original single variable beliefs, for all AI methods.
983 - Implemented RBP which converges faster than BP for difficult problems.
984 - Now uses method parameter which is a bitmask combining outmethod and inmethod
985 (see ai.h).
986
987
988 0.1.3 (2006-03-22)
989 --------------------
990 - All AI methods now return maxdiff
991 - ai.cpp:
992 o Now returns maxdiffinner and maxdiffouter
993 o New BP2ndO innermethod (estimate only 2nd order cavity interactions)
994 o New InitCav outermethod (only create initial cavity distributions)
995 - bp.cpp:
996 o New CavityDist2ndO which estimates 2nd order cavity interactions
997 - Makefile:
998 o Bugfix: removed dependencies on algwim.*
999
1000
1001 0.1.2 (2006-02-28)
1002 --------------------
1003 - Cleaned up alg.cpp (removed Alg2 and its corresponding data structures).
1004 - Added the possibility to provide initial cavity distributions as an input
1005 argument to ai (not much error checking is done, so be careful).
1006 - Potentials2mx now correctly sets the dimensions of the P field (i.e. for
1007 the output arguments Q, Q0 of ai).
1008 - Removed algwim.* since it does not work.
1009
1010
1011 0.1.1 (2006-02-28)
1012 --------------------
1013 - The constructors of (Log)FactorGraph and LogFactorGraph from a
1014 vector<(Log)Potential> now merge potentials to prevent short loops (of length
1015 4) in the factor graph. These are used in ai to construct the factor graphs
1016 from the psi argument. If compiled with DEBUG defined, the method calc_nb()
1017 of BipGraph checks for the existence of short loops.
1018 - Changed calling syntax of ai (now the actual syntax *does* correspond to its
1019 description in the help).
1020 - ai does not hook cout anymore (which caused weird segfaults).
1021 - Fixed a bug in an assert statement in the matlab interface code in ai.cpp.
1022 - Removed network.* since it is not useful.
1023
1024
1025 0.1.0 (2006-02-28)
1026 --------------------
1027 First version worthy of a version number.