ad1152b3294087c674753f050a60d4758c7cc940
[libdai.git] / ChangeLog
1 * [Giuseppe Passino] Optimised maximum-residual BP by using a reversed ordered
2 set instead of the linear search (which can yield enormous speedups - a factor
3 500 has been measured on a binary Ising grid with 128x128 variables!)
4 * Added debug assertions to Var which check for inconsistent dimensions of
5 variables with the same labels
6 * [Giuseppe Passino] Added prefix ++ operator to State (State::operator++())
7 * [Giuseppe Passino] Added iterators to FactorGraph (FactorGraph::begin, FactorGraph::end)
8 * [Giuseppe Passino] Added iterators to TFactor (TFactor::begin, TFactor::end)
9 * [Giuseppe Passino] Added iterators to TProb (TProb::begin, TProb::end)
10 * [Giuseppe Passino] Added BP::findMaximum(), which can be used after running
11 max-product BP to construct a global state with maximum probability
12 * Improved Makefile (libDAI now also builds out-of-the-box on MacOSX,
13 thanks to Dan Preston; merged Makefile.win and Makefile.shared into Makefile)
14 * Fixed bug in calcMarginal, calcPairBeliefs, calcPairBeliefsNew where
15 states with zero probability mass were clamped, leading to NaNs or assertion
16 errors (thanks to Dan Preston for reporting this)
17 * toc() now returns POSIX system time with maximum accuracy of microseconds
18 * Exception objects now remember their error code
19 * Added examples/example_springler.cpp
20
21
22 git 065eae35cbfcc36f1a945ae3053c80c23f366306
23 --------------------------------------------
24 * [Peter Gober] Made libDAI build out-of-the-box on Cygwin.
25 * [Frederik Eaton] Added Gibbs sampler to algorithms
26 * Improved documentation of include/dai/{bipgraph.h, prob.h, smallset.h,
27 var.h, varset.h, factor.h, enum.h} and of examples/example.cpp
28 Merged TODO and FILEFORMAT into doxygen documentation
29 * examples/
30 - Moved example.cpp to examples/
31 - Added examples/example_bipgraph.cpp
32 - Added examples/example_varset.cpp
33 * Interface changes:
34 - Replaced TProb<T>::log0() by TProb<T>::log(true)
35 - Replaced TProb<T>::takeLog0() by TProb<T>::takeLog(true)
36 - Replaced TFactor<T>::log0() by TFactor<T>::log(true)
37 - Removed TProb<T>::hasNonPositives()
38 - Renamed smallSet<T> to SmallSet<T>
39 - Removed TFactor<T>::divided_by, use operator/ instead
40 - Removed TFactor<T>::divide, use operator/= instead
41 - Removed TFactor<T>::partSum(const VarSet&), use marginal(const VarSet&,true) instead
42 - Improved constructors of TProb and TFactor to use iterators instead of pointers
43 * Miscellaneous small changes and cleanups:
44 - Changed regression test so that it also works under Windows
45 - Changed output stream operator<< for Var and VarSet
46 - Added TProb::draw() function, which draws a random index
47 - Cleanup of matlab interface code
48 - Small improvement of utils/fginfo
49 - Small cleanup of BP code
50 - Switched Makefile.win to GNU Make syntax
51
52
53 libDAI-0.2.2 (2008-09-30)
54 -------------------------
55
56 New features:
57 * Approximate inference methods now report the number of iterations needed.
58 * Added damping to various algorithms to improve convergence properties.
59 * Added more features to utils/createfg for creating factor graphs.
60 * Added ExactInf class for brute force exact inference.
61 * [Giuseppe Pasino] Added "logdomain" property to BP, a boolean that controls
62 whether calculations are done in the log-domain or in the linear domain;
63 doing calculations in the log-domain may help if the numerical range
64 of a double is too small.
65 * [Claudio Lima] Added Max-Product functionality to BP.
66 * Improved documentation.
67
68 Improved architecture:
69 * Added Exceptions framework.
70 * Pervasive change of BipartiteGraph implementation (based on an idea by
71 Giuseppe Passino). BipartiteGraph no longer stores the node properties
72 (former _V1 and _V2), nor does it store a dense adjacency matrix anymore,
73 nor an edge list. Instead, it stores the graph structure as lists of
74 neighboring nodes. This yields a significant memory/speed improvement for
75 large factor graphs, and is more elegant as well. Iterating over neighbors is
76 made easy by using boost::foreach.
77 * Added conditional compilation of inference methods.
78 * VarSet is now implemented using a std::vector<Var> instead of a
79 std::set<Var>, which yields a significant speed improvement. Furthermore,
80 the implementation has been generalized, resulting in the small_set<T> class
81 which can be used to represent sets of small cardinality; VarSet is the
82 specialization with T = Var.
83 * Improved ClusterGraph implementation, yielding significant speedups
84 for the JunctionTree algorithm on large factorgraphs.
85
86 Code cleanup:
87 * Moved everything into namespace "dai".
88 * Renamed DEBUG to DAI_DEBUG to avoid conflicts.
89 * Replaced ENUM2,ENUM3,ENUM4,ENUM5,ENUM6 by single DAI_ENUM macro.
90 * Removed utils/remove_short_loops and matlab/remove_short_loops.
91 * Replaced sub_nb class in mr.h by boost::dynamic_bitset.
92 * Improved index.h:
93 - Renamed Index -> IndexFor
94 - Added some .reserve()'s to IndexFor methods which yields a
95 25% speedup of testregression
96 - Replaced multind by Permute
97 - Added MultiFor
98 - Added State
99 * New funcstionality of factor.h.
100 * Moved Properties and MaxDiff frameworks from InfAlg to each individual
101 inference algorithm, because the Properties framework was not as
102 convenient as I hoped, and not every inference algorithm needs a maxdiff
103 variable. Also, replaced some FactorGraph functionality in InfAlg by a
104 function that returns the FactorGraph. The result is cleaner (less
105 entangled) code.
106 * Removed x2x.
107 * Replaced Complex with real numbers (negative potentials are just too rare
108 to warrant the additional "complexity" :)).
109
110 Miscellaneous improvements:
111 * Now compiles also with MS Visual C++ (thanks to Jiuxiang Hu) and with
112 GCC under cygwin.
113 * Contributions by Peter Gober:
114 - Renamed variable _N in mr.* for compatibility with g++ under cygwin.
115 * Misc contributions by Giuseppe Passino:
116 - removed "using namespace std;" from header files - bad practice;
117 - moved header files in include/dai and sources in src;
118 - changed #ifndefs to GNU style;
119 - added extra warning checks (-W -Wextra) and fixed resulting warnings;
120 - dai::TProb:
121 o removed copy constructor and assignment operators (redundant);
122 o implementation of some methods via STL algorithms;
123 o added methods takeExp, takeLog, takeLog0 for transformation in-place;
124 o explicit constructor (prevents implicit conversion from size_t to TProb);
125 o added operator+,+=,-,-=, with argument T (for calculations in log-scale);
126 * Misc contributions by Christian Wojek:
127 - New FactorGraph constructor that constructs from given ranges of factors
128 and variables;
129 - Optimization of FactorGraph constructors using tr1::unordered_map.
130 * FactorGraph constructors no longer check for short loops (huge speed
131 increase for large factor graphs), nor for negative entries. Also, the
132 normtype is now Prob::NORMPROB by default.
133 * Improved MaxSpanningTreePrims algorithm (uses boost::graph).
134
135 Interface changes:
136 * VarSet::
137 - VarSet::stateSpace() -> nrStates(const VarSet &)
138 - VarSet( const std::set<Var> ) -> VarSet( begin, end, sizeHint=0 )
139 - VarSet( const std::vector<Var> ) -> VarSet( begin, end, sizeHint=0 )
140 - removed bool operator||
141 - operator&&(const VarSet&) -> intersects(const VarSet&)
142 - operator&&(const Var&) -> contains(const Var&)
143 * FactorGraph::
144 - delta(const Var &) -> delta(size_t)
145 - Delta(const Var &) -> Delta(size_t)
146 - makeCavity(const Var &) -> makeCavity(size_t)
147 - vars() -> vars
148 - factors() -> factors
149 - removed MakeFactorCavity(size_t)
150 - removed ExactMarginal(const VarSet &)
151 - removed ExactlogZ()
152 - removed updatedFactor(size_t)
153 - removed _normtype and NormType()
154 - removed hasShortLoops(...) and removeShortLoops(...)
155 - WriteToDotFile(const char *filename) -> printDot( std::ostream& os )
156 - undoProb(size_t) -> restoreFactor(size_t)
157 - saveProb(size_t) -> backupFactor(size_t)
158 - undoProbs(const VarSet &) -> restoreFactors(const VarSet &)
159 - saveProbs(const VarSet &) -> backupFactors(const VarSet &)
160 - ReadFromFile(const char*) returns void (throws on error)
161 - WriteToFile(const char*) returns void (throws on error)
162 - removed hasNegatives()
163 * RegionGraph::
164 - nr_ORs() -> nrORs()
165 - nr_IRs() -> nrIRs()
166 - ORs() -> ORs
167 - IRs() -> IRs
168 * *::Regenerate() -> *::construct()
169 * Renamed Index -> IndexFor
170 * Diffs:
171 - max() -> maxDiff()
172 - max_size() -> maxSize()
173 * Prob::max() -> Prob::maxVal()
174 * Factor::
175 - max() -> maxVal()
176 - part_sum() -> partSum()
177 * toc() in util.h now returns seconds as a double
178 * VarSet::operator&&
179 * Properties -> PropertySet
180
181
182 libDAI-0.2.1 (2008-05-26)
183 -------------------------
184
185 Bugfix release.
186 * added missing cstdio header in util.h
187 * fixed Properties in MR_CLAMPING_* and MR_EXACT_*
188 * added description of the factor graph fileformat
189 * improved Makefile
190
191
192 libDAI-0.2.0 (2006-11-30)
193 -------------------------
194
195 First public release.
196
197
198 0.1.5 (2006-11-30)
199 ------------------
200
201 Regressions
202
203 - tests/testlcbp and tests/testlcbp are broken.
204 - EXACT method does not work anymore.
205 - The Properties framework gives a speed penalty because of the lookup
206 costs involved; inner loops should be optimized.
207
208 General framework
209
210 - DAIAlg is now a template class; typedefs for DAIAlg<FactorGraph> and for
211 DAIAlg<RegionGraph> are provided. In this way, we do not have to write "wrapper"
212 functions to forward functionality from either FactorGraph or RegionGraph
213 to DAIAlg. Functionality like clamping can be implemented in FactorGraph
214 and in RegionGraph and no explicit interface is needed in descendants.
215 - New abstract base class InfAlg added, representing an inference algorithm,
216 from which DAIAlg<T> inherits. This solves the incompatibility problems of
217 DAIAlg<T> for different T (e.g. DAIAlg<FactorGraph> was incompatible with
218 DAIAlg<RegionGraph>). More work is required to reduce code duplication
219 (make FactorGraph part of InfAlg).
220 - Added generic interface (nrVars(), Vars(), nrFactors(), factor(size_t),
221 beliefs(), belief(VarSet &), ...) to InfAlg and descendants.
222 - Added a saveProbs/undoProbs interface to InfAlg and descendants that enables
223 one to save a few factors, modify them (e.g. clamp them), and then restore them
224 to their old values. Undo should also init the corresponding messages / beliefs.
225 This can be used if a given factor graph repeatedly needs to be clamped in
226 different ways and an approximation method is run for each clamping; using the
227 saveProbs/undoProbs can give a significant speed increase.
228 - Switched to a general Properties framework that handles the parameters of
229 all inference methods in a uniform manner. The Properties class is a map of
230 several properties in boost::any objects, indexed by their names (strings).
231 It can read from a stream and write to a stream. It is recursive, in the sense
232 that a Properties object can hold a variable of type Properties as well.
233 - Added a generic way of constructing inference algorithms from a factor graph,
234 name and properties object. Added the newInfAlg function which constructs
235 the requested object. This is used by LCBP, the Matlab interface and the
236 command line (test) interface.
237 - Added a generic enum framework for enum parameters. Although implemented as a
238 hack, it is quite useful in that it drastically simplifies and reduces the
239 amount of code for handling enum parameters.
240 - Provided generic functions for calculating marginals in different ways that
241 work for all approximate inference methods.
242
243 Bugfixes
244
245 - Fixed GBP free energy.
246 - Fixed bug in junctiontree (it didn't init the _vars variable).
247 - Corrected two bugs in operator&& and operator|| in VarSet (they returned
248 the logical NOT of what they should return).
249 - Fixed bug in RegionGraph::RecomputeOR(s).
250 - Fixed bug in utils/create_dreg_fg:
251 graph structure was not random for given parameters (forgot to call srand()).
252 - TreeEP bug workaround: use the complete junction tree instead of a subtree.
253 - Fixed bug in JTree::HUGIN() and JTree:ShaferShenoy() in case of junction tree
254 that consists of one outer region only.
255 - Fixed INIT bug in LCBP2::UpdatePancake().
256 - Fixed MaxDiffs flow (except for MR).
257
258 New functionality
259
260 - HAK supports several default cluster choices:
261 minimal (only factors)
262 delta (Markov blankets)
263 loop (all loops consisting of loops consisting of <loopdepth> or less variables)
264 Only the maximal clusters are used as outer clusters.
265 - Implemented TreeEP. It generalizes the heuristic method described in the
266 Minka & Qi paper for obtaining a tree with the most relevant interactions to
267 higher order interactions. Almost all optimizations described in the Minka & Qi
268 paper are used, except that evidence is passed over the whole tree instead of
269 relevant subsets (the latter is almost implemented but buggy). Also added
270 alternative (worst-case) algorithm that uses a maximum spanning tree on the
271 weighted graph where the weight between neighbours i and j is given by
272 N(psi,i,j), where psi is the product of all the factors involving both i and j
273 (which is an upper bound on the effective interaction between i and j).
274 - Implemented MR (MontanariRizzo) based on Bastian's code, but extended it
275 to be able to handle connectivities larger than 3 (in principle, up to 32).
276 It supports different initialization methods (the original RESPPROP,
277 the CLAMPING method and EXACT which uses JTree) and different update methods
278 (FULL and LINEAR).
279 - Implemented LCBP2, an analogon of LCBP which represents pancakes as little
280 networks and uses some approximate inference method on them for calculating
281 marginals.
282 - Now there are several LCBP variants (LCBP, LCBPI, LCBPJ, LCBPK, LCBPL);
283 LCBPJ works only for pairwise, LCBPK is LCBP improved for higher order
284 interactions and LCBPL is LCBPI improved for higher-order interactions.
285 - Wrote one single program utils/createfg for creating various types of
286 random factor graphs.
287 - Wrote utility to visualize factor graphs using graphviz.
288 (it uses the BOOST Program Options library)
289 - Added fginfo utility that displays some info about a .fg file.
290 - Implemented Factor::strength function that calculates the potential strength
291 N(psi,i,j) between variables i and j as described in cs.IT:0504030
292 - Wrote a general MatLab interface matlab/dai (similar to tests/test);
293 this unified the matlab functions dai, dai_bp, dai_mf, dai_jt, dai_tep, dai_cvm.
294 - Added MATLAB routine that returns contraction matrix A for BP convergence analysis.
295 - Implemented a MATLAB interface ai_potstrength for Factor::strength
296 - Added Martijn's x2x
297
298 Improvements of existing code
299
300 - Reimplemented RegionGraph and descendants: a RegionGraph ISA FactorGraph
301 and also a BipartiteGraph<FRegion,Region>. It now also keeps a map that
302 associates outer region indices to factor indices (no powers yet, this
303 is deemed superfluous) and provides functions to recompute (some of) the
304 outer regions from the factors.
305 - InfAlg descendants run() methods now stop immediately and return NAN in case
306 they detect NANs. Only BP does not do NAN checking for performance reasons.
307 - LCBP now works with factors containing zeroes (by defining x/0 = 0).
308 - HAK, GBP and DoubleLoop now conform to the standards for verbose reporting,
309 timing and convergence criteria.
310 - Implemented logZ() for JTree. It does the calculation during message-passing.
311 - Marginal2ndO now optionally divides by the single node beliefs (to the power n-2);
312 hopefully this will give more accurate approximations.
313 - Marginal and Marginal2ndO (optionally) use the new saveProbs/undoProbs functionality
314 for a faster way of calculating marginals, which does not require a call to init()
315 nor cloning the whole object for each clamping. This leads to a significant speedup.
316 - LCBP (and LCBP2) now have complete flexibility in the specification of the
317 inner method, i.e. the method used to generate the initial cavity approximations.
318 One can pass two strings, a name and a properties string, and LCBP simply invokes
319 newInfAlg to construct the corresponding inference algorithm and uses the generic
320 marginal functions to approximate cavity marginals.
321 - Replaced the global "method" variable by local properties and removed ai.h
322 - Added some methods to Factor (operators *, *=, /, /= with doubles as
323 second argument, operators -, +=, -= with other Factors as second
324 arguments, randomize(), RemoveFirstOrderInteractions) and similar
325 operations to Prob
326 - Moving towards boost::program_options for handling command line arguments
327 (tests/test is done).
328 - Renamed some FactorGraph methods:
329 nr_vars -> nrVars
330 nr_factors -> nrFactors
331 varind -> findVar
332 factorind -> findFactor
333 makeFacCavity -> makeFactorCavity
334 - LCBP_SEQMAXRES has been removed because it did strange things.
335 - Implemented RandomDRegularGraph
336 - Implemented JTree::calcMarginal for marginals that are not confined
337 within one cluster (using cut-set conditioning).
338 - Added isConnected() method to FactorGraph (some methods do not work with
339 disconnected factor graphs).
340 - Pair beliefs are now calculated in a symmetrical way by calcPairBeliefs
341 - Removed single node interaction "correction" code from clamping methods
342 - Removed calcCavityDist and calcCavityDist2ndO
343 - No longer depends on GSL.
344 - Increased portability by combining platform dependant utility functions
345 in util.{h,cpp}.
346 - Wrote *.m files providing help
347
348 Testing framework
349
350 - Made a new and significantly improved testing framework that provides most
351 functionality from the command line.
352 - The basis is provided by tests/test, which uses the newInfAlg functionality
353 and enables the user to easily compare from the command line different
354 inference methods on a given factorgraph. All parameters can be specified.
355 Output consists of CPU time, average and maximum single variable marginal
356 errors, relative logZ error and MaxDiff().
357 - tests/aliases.conf contains aliases for standard combinations of methods
358 and their options (which can be used in tests/test).
359 - tests/large contains several bash/python scripts that create random factor
360 graphs, compare several approximate inference algorithms (using tests/test) and
361 allow for easy visualization of the results using PyX.
362 - Added several .fg files for test purposes to /tests (e.g. two ALARM versions
363 alarm.fg and alarm_bnt.fg; testfast.fg, a 4x4 periodic Ising grid for
364 regression testing).
365 - Added a regression test to the Makefile which is included in the standard
366 target. It compares all inference methods on tests/testfast.fg with the
367 results stored in tests/testfast.out
368
369 Miscellaneous
370
371 - Expanded all tabs to spaces (":set tabstop 4\n:set expandtab\n:retab" in vim)
372 - Experimental MATLAB code added for StarEP approximation on cavity
373 - Renamed project to libDAI and changed directory name accordingly.
374 - Renamed JunctionTree to JTree.
375 - Fixed licensing (now it's officially GPL).
376 - Improved README
377
378
379 revision 252
380 ------------
381
382 Functionality
383 - Added RegionGraph, GBP, CVM and HAK (double-loop).
384 - Added JunctionTree (with two update algorithms, HUGIN and Shafer-Shenoy), which is a
385 RegionGraph.
386 - NormType is now chosen automatically (in case of negative factors, Prob::NORMLINF is used,
387 otherwise the default Prob::NORMPROB is used). Also, in case of negative factors, the
388 RegionGraph constructors assign each Factor to a unique outer region instead of dividing
389 it over all subsuming outer regions. See README for when negative factors are known to work
390 and when not.
391 - FactorGraph::FactorGraph(const vector<Factor>) only gives a warning in case of short loops,
392 it does not automatically merge factors anymore.
393 - Removed BP_SEQMAXRESNOCLEAR (all cavity initialization methods now are implicitly NOCLEAR)
394 - Added MATLAB interface functions ai_readfg, ai_removeshortloops and ai_bp
395 - Added LCBP-III type that should be equivalent to LCBP-II, but can handle zeroes
396 in potentials. Note that it is significantly slower than LCBP-II (and has to be reimplemented
397 such that it does not store the complete pancakes, but represents them as little factor graphs).
398
399 Implementation / code
400 - Made a seperate type WeightedGraph, which until now only implements Prim's
401 maximal spanning tree algorithm and is only used by the junction tree code. It might
402 be good to make it a class somewhere in the future and extend it's interface.
403 - Made a seperate class ClusterGraph, which is only used by the junction tree
404 code. It's main purpose is a graph-theoretical variable elimination algorithm.
405 - Implemented the heuristic "minimum-new-edges-in-clique-graph" for variable elimination.
406 - Massive code cleanup, moving towards "generic" programming style, using
407 multiple inheritance and polymorphism.
408 o BP, LCBP, MF, HAK and JunctionTree now inherit from a common DAIAlg class
409 o Made generic functions Marginal, Marginal2ndO, calcCavityDist, calcCavityDist2ndO, clamp
410 that can be used by FactorGraph-based DAIAlgs.
411 o Created TProb<T> class, which stores a probability vector (without the accompanying indexing
412 and VarSet) and provides functionality for it (which is used by TFactor<T>).
413 o Rewrote the VarSet class. It now caches its statespace(). It now privately inherits from set<Var>.
414 I had to overload the insert methods of set<Var> so that they calculate the new statespace.
415 o Rewrote the TFactor class. The TFactor class now HAS a TProb and HAS a VarSet.
416 - Rewrote BP to use the new TProb<T> interface. Performance of BP improved up to a factor 6 by:
417 o using Prob's instead of Factor's;
418 o splitting the multiplication of the messages into two parts (thanks to Vicenc!);
419 o optimizing the calculation of the beliefs (only the message calculations were optimized till now).
420 o replacing FactorGraph::_nb1 and _nb2 (which were set<size_t>) by vector<size_t>
421 - LCBP now seperately stores cavitydists and pancakes. Added InitPancakes() method
422 that takes the cavitydists and multiplies them with the relevant factors. This
423 resulted in an API change in AI which now accepts and returns initial cavitydists
424 instead of initial pancakes.
425
426 Minor changes
427 - Started writing DoxyGen documentation
428 - Renamed lcptab2fg.m matlab/ai_writefg.m
429 - Moved all matlab stuff to matlab/
430 - More detailed reporting (also reports clocks used).
431 - Marginal and Marginal2ndO now use *differences* in logZ to avoid NaNs.
432 - Improved testing suite.
433 - Removed logreal support.
434 - FactorGraph now also supports input streams and ignores comment lines in .fg files.
435 - Added tests/create_full_fg.cpp and tests/create_ising_fg.cpp which create
436 full and periodic 2D Ising networks according to some command line parameters.
437 - Now logZ really returns logZ instead of -logZ.
438 - Added FactorGraph::WriteToDotFile
439
440
441 0.1.4 (2006-04-13)
442 ------------------
443 - Added file IO routines to read and write factorgraphs.
444 - Added L-infinity normalization for use with (partially) negative factors.
445 - Renamed BetheF, MFF to logZ, which now use complex numbers to be able to
446 handle (partially) negative factors.
447 - Added test suite.
448 - All probabilities are now represented using double instead of LogReal<double>.
449 - Combined Alg and Alg3 into LCBP. Several update schemes possible.
450 - Combined several variants of BP into doBP. Several update schemes possible.
451 Now uses precalculated indices for optimization.
452 - Renamed Node -> Var and Potential -> Factor.
453 - Extensive code cleanup. More use of OO techniques. Changed API.
454 - MaxIter now means maximum number of passes (corresponding to number of
455 _parallel_ updates).
456 - MaxDiff now means the maximum L-infinity distance between the updated and
457 original single variable beliefs, for all AI methods.
458 - Implemented RBP which converges faster than BP for difficult problems.
459 - Now uses method parameter which is a bitmask combining outmethod and inmethod
460 (see ai.h).
461
462
463 0.1.3 (2006-03-22)
464 --------------------
465 - All AI methods now return maxdiff
466 - ai.cpp:
467 o Now returns maxdiffinner and maxdiffouter
468 o New BP2ndO innermethod (estimate only 2nd order cavity interactions)
469 o New InitCav outermethod (only create initial cavity distributions)
470 - bp.cpp:
471 o New CavityDist2ndO which estimates 2nd order cavity interactions
472 - Makefile:
473 o Bugfix: removed dependencies on algwim.*
474
475
476 0.1.2 (2006-02-28)
477 --------------------
478 - Cleaned up alg.cpp (removed Alg2 and its corresponding data structures).
479 - Added the possibility to provide initial cavity distributions as an input
480 argument to ai (not much error checking is done, so be careful).
481 - Potentials2mx now correctly sets the dimensions of the P field (i.e. for
482 the output arguments Q, Q0 of ai).
483 - Removed algwim.* since it does not work.
484
485
486 0.1.1 (2006-02-28)
487 --------------------
488 - The constructors of (Log)FactorGraph and LogFactorGraph from a
489 vector<(Log)Potential> now merge potentials to prevent short loops (of length
490 4) in the factor graph. These are used in ai to construct the factor graphs
491 from the psi argument. If compiled with DEBUG defined, the method calc_nb()
492 of BipGraph checks for the existence of short loops.
493 - Changed calling syntax of ai (now the actual syntax *does* correspond to its
494 description in the help).
495 - ai does not hook cout anymore (which caused weird segfaults).
496 - Fixed a bug in an assert statement in the matlab interface code in ai.cpp.
497 - Removed network.* since it is not useful.
498
499
500 0.1.0 (2006-02-28)
501 --------------------
502 First version worthy a version number.