Approximate inference using conditional entropy decompositions

Journal of Machine Learning Research

Volumn 2, Issue , 2007, Pages 130-138

  Globerson, Amir ^a   Jaakkola, Tommi ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

2D ISING MODEL; APPROXIMATE INFERENCE; CHAIN RULES; CONDITIONAL ENTROPY; GEOMETRIC PROGRAM; GRAPHICAL MODEL; LOG PARTITION FUNCTION; MARGINAL DISTRIBUTION; MARGINALS; MODEL VARIABLES; OPTIMIZATION PROBLEMS; PARTITION FUNCTIONS; UPPER BOUND;

ARTIFICIAL INTELLIGENCE; CONVEX PROGRAMMING; ISING MODEL; OPTIMIZATION;

ENTROPY;

EID: 84862295756     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (9)

1. Bertsekas, D. P. (1995). Nonlinear programming. Belmont, MA: Athena Scientific.
2. Chiang, M. (2005). Geometric programming for communication systems. Foundations and Trends in Communi-cations and Information Theory, 2, 1-154.
3. Cover, T., & Thomas, J. (1991). Elements of information theory. Wiley.
4. Deza, M., & Laurent, M. (1997). Geometry of cuts and metrics. Springe-Verlag.
5. Grotschel, M., Junger, M., & Reinelt, G. (1985). On the acyclic subgraph polytope. Math. Prog., 33, 28-42.
6. Heskes, T., Albers, K., & Kappen, B. (2003). Approximate inference and constrained optimization. UAI.
7. Wainwright, M., & Jordan, M. (2003). Graphical models, exponential families, and variational inference (Technical Report). UC Berkeley Dept. of Statistics.
8. Wainwright, M. J., Jaakkola, T., & Willsky, A. S. (2005). A new class of upper bounds on the log partition function. IEEE Trans. on Information Theory, 51, 2313-2335.
9. Yedidia, J., W.T. Freeman, W., & Weiss, Y. (2005). Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Trans. on Information Theory, 51, 2282-2312.