Amari S. (1998). Natural gradient works efficiently in learning Neural Comput. 10

Amari S. (2001). Information geometry on hierarchical decomposition of stochastic interactions IEEE Transaction On Information Theory. 47

Amari S, Ikeda S, Shimokawa H. (2001). Information geometry and meanfield approximation: The Œ+ projection approach Advanced mean field methods: Theory and practive.

Amari S, Nagaoka H. (2000). Methods of information geometry.

Drouffe C. (1989). Statistical field theory.

Ghahramani Z, Jordan MI, Jaakkola TS, Saul LK. (1998). Learning in graphical models.

Heskes T. (2003). Stable fixed points of loopy belief propagation are minima of the Bethe free energy Advances in neural information processing systems. 15

Kabashima Y, Saad D. (1999). Statistical mechanics of error-correcting codes Europhysics Lett. 45

Kabashima Y, Saad D. (2001). The TAP approach to intensive and extensive connectivity systems Advanced mean field methods: Theory and practice.

Lauritzen S, Spiegelhalter D. (1988). Local computations with probabilities on graphical structures and their application to expert systems J Royal Stat Soc Series B. 50

Pearl J. (1988). Probabilistic reasoning in intelligent systems.

Press WH, Teukolsky SA, Flannery BP, Vellerling WT. (1992). Numerical Recipes In C: The Art Of Scientific Computing.

Richardson T. (2000). The geometry of turbo-decoding dynamics IEEE Trans Inform Theory. 46

Tanaka T. (2000). Information geometry of mean-field approximation. Neural computation. 12 [PubMed]

Tanaka T. (2001). Information geometry of mean-field approximation Advanced mean field methods: Theory and practice.

Tanaka T, Amari S, Ikeda S. (2002). Information geometrical framework for analyzing belief propagation decoder Advances in neural information processing systems. 14

Tanaka T, Amari S, Ikeda S. (2004). Information geometry of turbo codes and low-density parity-check codes IEEE Trans Inform Theory.

Wainwright M, Jaakkola T, Willsky A. (2002). Tree-based reparameterization for approximate inference on loopy graphs Advances in neural information processing systems. 14

Wainwright M, Jaakkola T, Willsky A. (2003). Tree-reweighted belief propagation algorithms and approximate ML estimate by pseudo-moment matching Proc 9th Intl Workshop Artificial Intelligence and Statistics, Available on-line at:http:--wwwfiresearch.microsoft.com-conferences-aistats2003-.

Weiss Y. (2000). Correctness of local probability in graphical models with loops. Neural computation. 12 [PubMed]

Weiss Y, Yedidia J, Freeman W. (2000). Generalized belief propagation Advances in neural information processing systems. 13

Weiss Y, Yedidia J, Freeman W. (2001). Bethe free energy, Kikuchi approximations, and belief propagation algorithms Tech. Rep. TR2001-16.

Yuille AL. (2002). CCCP algorithms to minimize the Bethe and Kikuchi free energies: convergent alternatives to belief propagation. Neural computation. 14 [PubMed]

Yuille AL, Rangarajan A. (2003). The concave-convex procedure. Neural computation. 15 [PubMed]

Amari S. (2007). Integration of stochastic models by minimizing alpha-divergence. Neural computation. 19 [PubMed]