1 Branch master:

2 * Added work-around for bug in Boost Graph Library

3 * Improvements of TFactor<T>:

4 - Extended functionality of TFactor<T>::operators +,-,+=,-= to handle different VarSets

5 - Added TFactor<T>::maxMarginal (similar to marginal but with max instead of sum)

6 * Added BipartiteGraph::eraseEdge

7 * Removed all the virtual default constructors *::create(), as they are not used.

8 * Fixed bug in MaxSpanningTree (it wrongly assumed that the tree was not empty).

9 * [Charlie Vaske] Added Expectation Maximization code.

10 * Added MatLab QuickStart to README.

11 * MEX file dai now also returns variable and factor beliefs.

13 * [Frederik Eaton] Added Gibbs::state() accessors/mutators

14 * [Frederik Eaton] Fixed Gibbs::getVarDist(size_t) to return uniform

15 distribution if no state is allowed

16 * [Frederik Eaton] Improved parsing code in tests/testdai to allow recursive

17 alias substitutions

18 * Interface changes:

19 TProb<T>::minVal() -> TProb<T>::min()

20 TFactor<T>::minVal() -> TFactor<T>::min()

21 TProb<T>::maxVal() -> TProb<T>::max()

22 TFactor<T>::maxVal() -> TFactor<T>::max()

23 TProb<T>::totalSum() -> TProb<T>sum()

24 TFactor<T>::totalSum() -> TFactor<T>::sum()

25 * [Frederik Eaton] Added methods setUniform (), sumAbs(), argmax() to TProb<T>

26 * [Frederik Eaton] Added TAGS, lib targets to Makefile

27 * [Frederik Eaton] Add useful aliases to aliases.conf

28 * [Frederik Eaton] Removed unnecessary copy constructors and assignment

29 operators

30 * [Frederik Eaton] Change cout to cerr in warnings and error messages

31 * [Giuseppe Passino] Optimised maximum-residual BP by using a reversed ordered

32 set instead of the linear search (which can yield enormous speedups - a

33 factor 500 has been measured on a binary Ising grid with 128x128 variables!)

34 * Added debug assertions to Var which check for inconsistent dimensions of

35 variables with the same labels

36 * [Giuseppe Passino] Added prefix ++ operator to State (State::operator++())

37 * [Giuseppe Passino] Added iterators to FactorGraph (FactorGraph::begin,

38 FactorGraph::end)

39 * [Giuseppe Passino] Added iterators to TFactor (TFactor::begin, TFactor::end)

40 * [Giuseppe Passino] Added iterators to TProb (TProb::begin, TProb::end)

41 * [Giuseppe Passino] Added BP::findMaximum(), which can be used after running

42 max-product BP to construct a global state with maximum probability

43 * Improved Makefile (libDAI now also builds out-of-the-box on MacOSX,

44 thanks to Dan Preston; merged Makefile.win and Makefile.shared into Makefile)

45 * Fixed bug in calcMarginal, calcPairBeliefs, calcPairBeliefsNew where

46 states with zero probability mass were clamped, leading to NaNs or assertion

47 errors (thanks to Dan Preston for reporting this)

48 * toc() now returns POSIX system time with maximum accuracy of microseconds

49 * Exception objects now remember their error code

50 * Added examples/example_sprinkler.cpp

53 git 065eae35cbfcc36f1a945ae3053c80c23f366306

54 --------------------------------------------

55 * [Peter Gober] Made libDAI build out-of-the-box on Cygwin.

56 * [Frederik Eaton] Added Gibbs sampler to algorithms

57 * Improved documentation of include/dai/{bipgraph.h, prob.h, smallset.h,

58 var.h, varset.h, factor.h, enum.h} and of examples/example.cpp

59 Merged TODO and FILEFORMAT into doxygen documentation

60 * examples/

61 - Moved example.cpp to examples/

62 - Added examples/example_bipgraph.cpp

63 - Added examples/example_varset.cpp

64 * Interface changes:

65 - Replaced TProb<T>::log0() by TProb<T>::log(true)

66 - Replaced TProb<T>::takeLog0() by TProb<T>::takeLog(true)

67 - Replaced TFactor<T>::log0() by TFactor<T>::log(true)

68 - Removed TProb<T>::hasNonPositives()

69 - Renamed smallSet<T> to SmallSet<T>

70 - Removed TFactor<T>::divided_by, use operator/ instead

71 - Removed TFactor<T>::divide, use operator/= instead

72 - Removed TFactor<T>::partSum(const VarSet&), use marginal(const VarSet&,true) instead

73 - Improved constructors of TProb and TFactor to use iterators instead of pointers

74 * Miscellaneous small changes and cleanups:

75 - Changed regression test so that it also works under Windows

76 - Changed output stream operator<< for Var and VarSet

77 - Added TProb::draw() function, which draws a random index

78 - Cleanup of matlab interface code

79 - Small improvement of utils/fginfo

80 - Small cleanup of BP code

81 - Switched Makefile.win to GNU Make syntax

84 libDAI-0.2.2 (2008-09-30)

85 -------------------------

87 New features:

88 * Approximate inference methods now report the number of iterations needed.

89 * Added damping to various algorithms to improve convergence properties.

90 * Added more features to utils/createfg for creating factor graphs.

91 * Added ExactInf class for brute force exact inference.

92 * [Giuseppe Pasino] Added "logdomain" property to BP, a boolean that controls

93 whether calculations are done in the log-domain or in the linear domain;

94 doing calculations in the log-domain may help if the numerical range

95 of a double is too small.

96 * [Claudio Lima] Added Max-Product functionality to BP.

97 * Improved documentation.

99 Improved architecture:

100 * Added Exceptions framework.

101 * Pervasive change of BipartiteGraph implementation (based on an idea by

102 Giuseppe Passino). BipartiteGraph no longer stores the node properties

103 (former _V1 and _V2), nor does it store a dense adjacency matrix anymore,

104 nor an edge list. Instead, it stores the graph structure as lists of

105 neighboring nodes. This yields a significant memory/speed improvement for

106 large factor graphs, and is more elegant as well. Iterating over neighbors is

107 made easy by using boost::foreach.

108 * Added conditional compilation of inference methods.

109 * VarSet is now implemented using a std::vector<Var> instead of a

110 std::set<Var>, which yields a significant speed improvement. Furthermore,

111 the implementation has been generalized, resulting in the small_set<T> class

112 which can be used to represent sets of small cardinality; VarSet is the

113 specialization with T = Var.

114 * Improved ClusterGraph implementation, yielding significant speedups

115 for the JunctionTree algorithm on large factorgraphs.

117 Code cleanup:

118 * Moved everything into namespace "dai".

119 * Renamed DEBUG to DAI_DEBUG to avoid conflicts.

120 * Replaced ENUM2,ENUM3,ENUM4,ENUM5,ENUM6 by single DAI_ENUM macro.

121 * Removed utils/remove_short_loops and matlab/remove_short_loops.

122 * Replaced sub_nb class in mr.h by boost::dynamic_bitset.

123 * Improved index.h:

124 - Renamed Index -> IndexFor

125 - Added some .reserve()'s to IndexFor methods which yields a

126 25% speedup of testregression

127 - Replaced multind by Permute

128 - Added MultiFor

129 - Added State

130 * New funcstionality of factor.h.

131 * Moved Properties and MaxDiff frameworks from InfAlg to each individual

132 inference algorithm, because the Properties framework was not as

133 convenient as I hoped, and not every inference algorithm needs a maxdiff

134 variable. Also, replaced some FactorGraph functionality in InfAlg by a

135 function that returns the FactorGraph. The result is cleaner (less

136 entangled) code.

137 * Removed x2x.

138 * Replaced Complex with real numbers (negative potentials are just too rare

139 to warrant the additional "complexity" :)).

141 Miscellaneous improvements:

142 * Now compiles also with MS Visual C++ (thanks to Jiuxiang Hu) and with

143 GCC under cygwin.

144 * Contributions by Peter Gober:

145 - Renamed variable _N in mr.* for compatibility with g++ under cygwin.

146 * Misc contributions by Giuseppe Passino:

147 - removed "using namespace std;" from header files - bad practice;

148 - moved header files in include/dai and sources in src;

149 - changed #ifndefs to GNU style;

150 - added extra warning checks (-W -Wextra) and fixed resulting warnings;

151 - dai::TProb:

152 o removed copy constructor and assignment operators (redundant);

153 o implementation of some methods via STL algorithms;

154 o added methods takeExp, takeLog, takeLog0 for transformation in-place;

155 o explicit constructor (prevents implicit conversion from size_t to TProb);

156 o added operator+,+=,-,-=, with argument T (for calculations in log-scale);

157 * Misc contributions by Christian Wojek:

158 - New FactorGraph constructor that constructs from given ranges of factors

159 and variables;

160 - Optimization of FactorGraph constructors using tr1::unordered_map.

161 * FactorGraph constructors no longer check for short loops (huge speed

162 increase for large factor graphs), nor for negative entries. Also, the

163 normtype is now Prob::NORMPROB by default.

164 * Improved MaxSpanningTreePrims algorithm (uses boost::graph).

166 Interface changes:

167 * VarSet::

168 - VarSet::stateSpace() -> nrStates(const VarSet &)

169 - VarSet( const std::set<Var> ) -> VarSet( begin, end, sizeHint=0 )

170 - VarSet( const std::vector<Var> ) -> VarSet( begin, end, sizeHint=0 )

171 - removed bool operator||

172 - operator&&(const VarSet&) -> intersects(const VarSet&)

173 - operator&&(const Var&) -> contains(const Var&)

174 * FactorGraph::

175 - delta(const Var &) -> delta(size_t)

176 - Delta(const Var &) -> Delta(size_t)

177 - makeCavity(const Var &) -> makeCavity(size_t)

178 - vars() -> vars

179 - factors() -> factors

180 - removed MakeFactorCavity(size_t)

181 - removed ExactMarginal(const VarSet &)

182 - removed ExactlogZ()

183 - removed updatedFactor(size_t)

184 - removed _normtype and NormType()

185 - removed hasShortLoops(...) and removeShortLoops(...)

186 - WriteToDotFile(const char *filename) -> printDot( std::ostream& os )

187 - undoProb(size_t) -> restoreFactor(size_t)

188 - saveProb(size_t) -> backupFactor(size_t)

189 - undoProbs(const VarSet &) -> restoreFactors(const VarSet &)

190 - saveProbs(const VarSet &) -> backupFactors(const VarSet &)

191 - ReadFromFile(const char*) returns void (throws on error)

192 - WriteToFile(const char*) returns void (throws on error)

193 - removed hasNegatives()

194 * RegionGraph::

195 - nr_ORs() -> nrORs()

196 - nr_IRs() -> nrIRs()

197 - ORs() -> ORs

198 - IRs() -> IRs

199 * *::Regenerate() -> *::construct()

200 * Renamed Index -> IndexFor

201 * Diffs:

202 - max() -> maxDiff()

203 - max_size() -> maxSize()

204 * Prob::max() -> Prob::maxVal()

205 * Factor::

206 - max() -> maxVal()

207 - part_sum() -> partSum()

208 * toc() in util.h now returns seconds as a double

209 * VarSet::operator&&

210 * Properties -> PropertySet

213 libDAI-0.2.1 (2008-05-26)

214 -------------------------

216 Bugfix release.

217 * added missing cstdio header in util.h

218 * fixed Properties in MR_CLAMPING_* and MR_EXACT_*

219 * added description of the factor graph fileformat

220 * improved Makefile

223 libDAI-0.2.0 (2006-11-30)

224 -------------------------

226 First public release.

229 0.1.5 (2006-11-30)

230 ------------------

232 Regressions

234 - tests/testlcbp and tests/testlcbp are broken.

235 - EXACT method does not work anymore.

236 - The Properties framework gives a speed penalty because of the lookup

237 costs involved; inner loops should be optimized.

239 General framework

241 - DAIAlg is now a template class; typedefs for DAIAlg<FactorGraph> and for

242 DAIAlg<RegionGraph> are provided. In this way, we do not have to write "wrapper"

243 functions to forward functionality from either FactorGraph or RegionGraph

244 to DAIAlg. Functionality like clamping can be implemented in FactorGraph

245 and in RegionGraph and no explicit interface is needed in descendants.

246 - New abstract base class InfAlg added, representing an inference algorithm,

247 from which DAIAlg<T> inherits. This solves the incompatibility problems of

248 DAIAlg<T> for different T (e.g. DAIAlg<FactorGraph> was incompatible with

249 DAIAlg<RegionGraph>). More work is required to reduce code duplication

250 (make FactorGraph part of InfAlg).

251 - Added generic interface (nrVars(), Vars(), nrFactors(), factor(size_t),

252 beliefs(), belief(VarSet &), ...) to InfAlg and descendants.

253 - Added a saveProbs/undoProbs interface to InfAlg and descendants that enables

254 one to save a few factors, modify them (e.g. clamp them), and then restore them

255 to their old values. Undo should also init the corresponding messages / beliefs.

256 This can be used if a given factor graph repeatedly needs to be clamped in

257 different ways and an approximation method is run for each clamping; using the

258 saveProbs/undoProbs can give a significant speed increase.

259 - Switched to a general Properties framework that handles the parameters of

260 all inference methods in a uniform manner. The Properties class is a map of

261 several properties in boost::any objects, indexed by their names (strings).

262 It can read from a stream and write to a stream. It is recursive, in the sense

263 that a Properties object can hold a variable of type Properties as well.

264 - Added a generic way of constructing inference algorithms from a factor graph,

265 name and properties object. Added the newInfAlg function which constructs

266 the requested object. This is used by LCBP, the Matlab interface and the

267 command line (test) interface.

268 - Added a generic enum framework for enum parameters. Although implemented as a

269 hack, it is quite useful in that it drastically simplifies and reduces the

270 amount of code for handling enum parameters.

271 - Provided generic functions for calculating marginals in different ways that

272 work for all approximate inference methods.

274 Bugfixes

276 - Fixed GBP free energy.

277 - Fixed bug in junctiontree (it didn't init the _vars variable).

278 - Corrected two bugs in operator&& and operator|| in VarSet (they returned

279 the logical NOT of what they should return).

280 - Fixed bug in RegionGraph::RecomputeOR(s).

281 - Fixed bug in utils/create_dreg_fg:

282 graph structure was not random for given parameters (forgot to call srand()).

283 - TreeEP bug workaround: use the complete junction tree instead of a subtree.

284 - Fixed bug in JTree::HUGIN() and JTree:ShaferShenoy() in case of junction tree

285 that consists of one outer region only.

286 - Fixed INIT bug in LCBP2::UpdatePancake().

287 - Fixed MaxDiffs flow (except for MR).

289 New functionality

291 - HAK supports several default cluster choices:

292 minimal (only factors)

293 delta (Markov blankets)

294 loop (all loops consisting of loops consisting of <loopdepth> or less variables)

295 Only the maximal clusters are used as outer clusters.

296 - Implemented TreeEP. It generalizes the heuristic method described in the

297 Minka & Qi paper for obtaining a tree with the most relevant interactions to

298 higher order interactions. Almost all optimizations described in the Minka & Qi

299 paper are used, except that evidence is passed over the whole tree instead of

300 relevant subsets (the latter is almost implemented but buggy). Also added

301 alternative (worst-case) algorithm that uses a maximum spanning tree on the

302 weighted graph where the weight between neighbours i and j is given by

303 N(psi,i,j), where psi is the product of all the factors involving both i and j

304 (which is an upper bound on the effective interaction between i and j).

305 - Implemented MR (MontanariRizzo) based on Bastian's code, but extended it

306 to be able to handle connectivities larger than 3 (in principle, up to 32).

307 It supports different initialization methods (the original RESPPROP,

308 the CLAMPING method and EXACT which uses JTree) and different update methods

309 (FULL and LINEAR).

310 - Implemented LCBP2, an analogon of LCBP which represents pancakes as little

311 networks and uses some approximate inference method on them for calculating

312 marginals.

313 - Now there are several LCBP variants (LCBP, LCBPI, LCBPJ, LCBPK, LCBPL);

314 LCBPJ works only for pairwise, LCBPK is LCBP improved for higher order

315 interactions and LCBPL is LCBPI improved for higher-order interactions.

316 - Wrote one single program utils/createfg for creating various types of

317 random factor graphs.

318 - Wrote utility to visualize factor graphs using graphviz.

319 (it uses the BOOST Program Options library)

320 - Added fginfo utility that displays some info about a .fg file.

321 - Implemented Factor::strength function that calculates the potential strength

322 N(psi,i,j) between variables i and j as described in cs.IT:0504030

323 - Wrote a general MatLab interface matlab/dai (similar to tests/test);

324 this unified the matlab functions dai, dai_bp, dai_mf, dai_jt, dai_tep, dai_cvm.

325 - Added MATLAB routine that returns contraction matrix A for BP convergence analysis.

326 - Implemented a MATLAB interface ai_potstrength for Factor::strength

327 - Added Martijn's x2x

329 Improvements of existing code

331 - Reimplemented RegionGraph and descendants: a RegionGraph ISA FactorGraph

332 and also a BipartiteGraph<FRegion,Region>. It now also keeps a map that

333 associates outer region indices to factor indices (no powers yet, this

334 is deemed superfluous) and provides functions to recompute (some of) the

335 outer regions from the factors.

336 - InfAlg descendants run() methods now stop immediately and return NAN in case

337 they detect NANs. Only BP does not do NAN checking for performance reasons.

338 - LCBP now works with factors containing zeroes (by defining x/0 = 0).

339 - HAK, GBP and DoubleLoop now conform to the standards for verbose reporting,

340 timing and convergence criteria.

341 - Implemented logZ() for JTree. It does the calculation during message-passing.

342 - Marginal2ndO now optionally divides by the single node beliefs (to the power n-2);

343 hopefully this will give more accurate approximations.

344 - Marginal and Marginal2ndO (optionally) use the new saveProbs/undoProbs functionality

345 for a faster way of calculating marginals, which does not require a call to init()

346 nor cloning the whole object for each clamping. This leads to a significant speedup.

347 - LCBP (and LCBP2) now have complete flexibility in the specification of the

348 inner method, i.e. the method used to generate the initial cavity approximations.

349 One can pass two strings, a name and a properties string, and LCBP simply invokes

350 newInfAlg to construct the corresponding inference algorithm and uses the generic

351 marginal functions to approximate cavity marginals.

352 - Replaced the global "method" variable by local properties and removed ai.h

353 - Added some methods to Factor (operators *, *=, /, /= with doubles as

354 second argument, operators -, +=, -= with other Factors as second

355 arguments, randomize(), RemoveFirstOrderInteractions) and similar

356 operations to Prob

357 - Moving towards boost::program_options for handling command line arguments

358 (tests/test is done).

359 - Renamed some FactorGraph methods:

360 nr_vars -> nrVars

361 nr_factors -> nrFactors

362 varind -> findVar

363 factorind -> findFactor

364 makeFacCavity -> makeFactorCavity

365 - LCBP_SEQMAXRES has been removed because it did strange things.

366 - Implemented RandomDRegularGraph

367 - Implemented JTree::calcMarginal for marginals that are not confined

368 within one cluster (using cut-set conditioning).

369 - Added isConnected() method to FactorGraph (some methods do not work with

370 disconnected factor graphs).

371 - Pair beliefs are now calculated in a symmetrical way by calcPairBeliefs

372 - Removed single node interaction "correction" code from clamping methods

373 - Removed calcCavityDist and calcCavityDist2ndO

374 - No longer depends on GSL.

375 - Increased portability by combining platform dependant utility functions

376 in util.{h,cpp}.

377 - Wrote *.m files providing help

379 Testing framework

381 - Made a new and significantly improved testing framework that provides most

382 functionality from the command line.

383 - The basis is provided by tests/test, which uses the newInfAlg functionality

384 and enables the user to easily compare from the command line different

385 inference methods on a given factorgraph. All parameters can be specified.

386 Output consists of CPU time, average and maximum single variable marginal

387 errors, relative logZ error and MaxDiff().

388 - tests/aliases.conf contains aliases for standard combinations of methods

389 and their options (which can be used in tests/test).

390 - tests/large contains several bash/python scripts that create random factor

391 graphs, compare several approximate inference algorithms (using tests/test) and

392 allow for easy visualization of the results using PyX.

393 - Added several .fg files for test purposes to /tests (e.g. two ALARM versions

394 alarm.fg and alarm_bnt.fg; testfast.fg, a 4x4 periodic Ising grid for

395 regression testing).

396 - Added a regression test to the Makefile which is included in the standard

397 target. It compares all inference methods on tests/testfast.fg with the

398 results stored in tests/testfast.out

400 Miscellaneous

402 - Expanded all tabs to spaces (":set tabstop 4\n:set expandtab\n:retab" in vim)

403 - Experimental MATLAB code added for StarEP approximation on cavity

404 - Renamed project to libDAI and changed directory name accordingly.

405 - Renamed JunctionTree to JTree.

406 - Fixed licensing (now it's officially GPL).

407 - Improved README

410 revision 252

411 ------------

413 Functionality

414 - Added RegionGraph, GBP, CVM and HAK (double-loop).

415 - Added JunctionTree (with two update algorithms, HUGIN and Shafer-Shenoy), which is a

416 RegionGraph.

417 - NormType is now chosen automatically (in case of negative factors, Prob::NORMLINF is used,

418 otherwise the default Prob::NORMPROB is used). Also, in case of negative factors, the

419 RegionGraph constructors assign each Factor to a unique outer region instead of dividing

420 it over all subsuming outer regions. See README for when negative factors are known to work

421 and when not.

422 - FactorGraph::FactorGraph(const vector<Factor>) only gives a warning in case of short loops,

423 it does not automatically merge factors anymore.

424 - Removed BP_SEQMAXRESNOCLEAR (all cavity initialization methods now are implicitly NOCLEAR)

425 - Added MATLAB interface functions ai_readfg, ai_removeshortloops and ai_bp

426 - Added LCBP-III type that should be equivalent to LCBP-II, but can handle zeroes

427 in potentials. Note that it is significantly slower than LCBP-II (and has to be reimplemented

428 such that it does not store the complete pancakes, but represents them as little factor graphs).

430 Implementation / code

431 - Made a seperate type WeightedGraph, which until now only implements Prim's

432 maximal spanning tree algorithm and is only used by the junction tree code. It might

433 be good to make it a class somewhere in the future and extend it's interface.

434 - Made a seperate class ClusterGraph, which is only used by the junction tree

435 code. It's main purpose is a graph-theoretical variable elimination algorithm.

436 - Implemented the heuristic "minimum-new-edges-in-clique-graph" for variable elimination.

437 - Massive code cleanup, moving towards "generic" programming style, using

438 multiple inheritance and polymorphism.

439 o BP, LCBP, MF, HAK and JunctionTree now inherit from a common DAIAlg class

440 o Made generic functions Marginal, Marginal2ndO, calcCavityDist, calcCavityDist2ndO, clamp

441 that can be used by FactorGraph-based DAIAlgs.

442 o Created TProb<T> class, which stores a probability vector (without the accompanying indexing

443 and VarSet) and provides functionality for it (which is used by TFactor<T>).

444 o Rewrote the VarSet class. It now caches its statespace(). It now privately inherits from set<Var>.

445 I had to overload the insert methods of set<Var> so that they calculate the new statespace.

446 o Rewrote the TFactor class. The TFactor class now HAS a TProb and HAS a VarSet.

447 - Rewrote BP to use the new TProb<T> interface. Performance of BP improved up to a factor 6 by:

448 o using Prob's instead of Factor's;

449 o splitting the multiplication of the messages into two parts (thanks to Vicenc!);

450 o optimizing the calculation of the beliefs (only the message calculations were optimized till now).

451 o replacing FactorGraph::_nb1 and _nb2 (which were set<size_t>) by vector<size_t>

452 - LCBP now seperately stores cavitydists and pancakes. Added InitPancakes() method

453 that takes the cavitydists and multiplies them with the relevant factors. This

454 resulted in an API change in AI which now accepts and returns initial cavitydists

455 instead of initial pancakes.

457 Minor changes

458 - Started writing DoxyGen documentation

459 - Renamed lcptab2fg.m matlab/ai_writefg.m

460 - Moved all matlab stuff to matlab/

461 - More detailed reporting (also reports clocks used).

462 - Marginal and Marginal2ndO now use *differences* in logZ to avoid NaNs.

463 - Improved testing suite.

464 - Removed logreal support.

465 - FactorGraph now also supports input streams and ignores comment lines in .fg files.

466 - Added tests/create_full_fg.cpp and tests/create_ising_fg.cpp which create

467 full and periodic 2D Ising networks according to some command line parameters.

468 - Now logZ really returns logZ instead of -logZ.

469 - Added FactorGraph::WriteToDotFile

472 0.1.4 (2006-04-13)

473 ------------------

474 - Added file IO routines to read and write factorgraphs.

475 - Added L-infinity normalization for use with (partially) negative factors.

476 - Renamed BetheF, MFF to logZ, which now use complex numbers to be able to

477 handle (partially) negative factors.

478 - Added test suite.

479 - All probabilities are now represented using double instead of LogReal<double>.

480 - Combined Alg and Alg3 into LCBP. Several update schemes possible.

481 - Combined several variants of BP into doBP. Several update schemes possible.

482 Now uses precalculated indices for optimization.

483 - Renamed Node -> Var and Potential -> Factor.

484 - Extensive code cleanup. More use of OO techniques. Changed API.

485 - MaxIter now means maximum number of passes (corresponding to number of

486 _parallel_ updates).

487 - MaxDiff now means the maximum L-infinity distance between the updated and

488 original single variable beliefs, for all AI methods.

489 - Implemented RBP which converges faster than BP for difficult problems.

490 - Now uses method parameter which is a bitmask combining outmethod and inmethod

491 (see ai.h).

494 0.1.3 (2006-03-22)

495 --------------------

496 - All AI methods now return maxdiff

497 - ai.cpp:

498 o Now returns maxdiffinner and maxdiffouter

499 o New BP2ndO innermethod (estimate only 2nd order cavity interactions)

500 o New InitCav outermethod (only create initial cavity distributions)

501 - bp.cpp:

502 o New CavityDist2ndO which estimates 2nd order cavity interactions

503 - Makefile:

504 o Bugfix: removed dependencies on algwim.*

507 0.1.2 (2006-02-28)

508 --------------------

509 - Cleaned up alg.cpp (removed Alg2 and its corresponding data structures).

510 - Added the possibility to provide initial cavity distributions as an input

511 argument to ai (not much error checking is done, so be careful).

512 - Potentials2mx now correctly sets the dimensions of the P field (i.e. for

513 the output arguments Q, Q0 of ai).

514 - Removed algwim.* since it does not work.

517 0.1.1 (2006-02-28)

518 --------------------

519 - The constructors of (Log)FactorGraph and LogFactorGraph from a

520 vector<(Log)Potential> now merge potentials to prevent short loops (of length

521 4) in the factor graph. These are used in ai to construct the factor graphs

522 from the psi argument. If compiled with DEBUG defined, the method calc_nb()

523 of BipGraph checks for the existence of short loops.

524 - Changed calling syntax of ai (now the actual syntax *does* correspond to its

525 description in the help).

526 - ai does not hook cout anymore (which caused weird segfaults).

527 - Fixed a bug in an assert statement in the matlab interface code in ai.cpp.

528 - Removed network.* since it is not useful.

531 0.1.0 (2006-02-28)

532 --------------------

533 First version worthy a version number.