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