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