Tree-reweighted belief propagation algorithms and approximate ML estimation by pseudo-moment matching
暂无分享,去创建一个
Martin J. Wainwright | Tommi S. Jaakkola | Alan S. Willsky | T. Jaakkola | A. Willsky | M. Wainwright
[1] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[2] S. Amari. Differential Geometry of Curved Exponential Families-Curvatures and Information Loss , 1982 .
[3] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[4] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[5] Michael I. Jordan,et al. Computing upper and lower bounds on likelihoods in intractable networks , 1996, UAI.
[6] A. V. D. Vaart,et al. Asymptotic Statistics: U -Statistics , 1998 .
[7] Michael I. Jordan,et al. An Introduction to Variational Methods for Graphical Models , 1999, Machine-mediated learning.
[8] A. V. D. Vaart. Asymptotic Statistics: Delta Method , 1998 .
[9] W. Freeman,et al. Generalized Belief Propagation , 2000, NIPS.
[10] Martin J. Wainwright,et al. Stochastic processes on graphs with cycles: geometric and variational approaches , 2002 .
[11] Martin J. Wainwright,et al. Exact MAP Estimates by (Hyper)tree Agreement , 2002, NIPS.
[12] Martin J. Wainwright,et al. A new class of upper bounds on the log partition function , 2002, IEEE Transactions on Information Theory.