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