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