Convergence of Min-Sum Message Passing for Quadratic Optimization
暂无分享,去创建一个
[1] Martin J. Wainwright,et al. Tree-based reparameterization framework for analysis of sum-product and related algorithms , 2003, IEEE Trans. Inf. Theory.
[2] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[3] William T. Freeman,et al. Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology , 1999, Neural Computation.
[4] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[5] Andrea Montanari,et al. Belief Propagation Based Multi--User Detection , 2005, ArXiv.
[6] Benjamin Van Roy,et al. Consensus Propagation , 2005, IEEE Transactions on Information Theory.
[7] Benjamin Van Roy,et al. An analysis of belief propagation on the turbo decoding graph with Gaussian densities , 2001, IEEE Trans. Inf. Theory.
[8] Dmitry M. Malioutov,et al. Walk-Sums and Belief Propagation in Gaussian Graphical Models , 2006, J. Mach. Learn. Res..
[9] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[10] Dmitry M. Malioutov,et al. Walk-Sum Interpretation and Analysis of Gaussian Belief Propagation , 2005, NIPS.
[11] Martin J. Wainwright,et al. Tree consistency and bounds on the performance of the max-product algorithm and its generalizations , 2004, Stat. Comput..
[12] Benjamin Van Roy,et al. Convergence of the Min-Sum Algorithm for Convex Optimization , 2007, 0705.4253.
[13] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[14] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.