nips nips2005 nips2005-96 nips2005-96-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: O. P. Kreidl, Alan S. Willsky
Abstract: Given a directed graphical model with binary-valued hidden nodes and real-valued noisy observations, consider deciding upon the maximum a-posteriori (MAP) or the maximum posterior-marginal (MPM) assignment under the restriction that each node broadcasts only to its children exactly one single-bit message. We present a variational formulation, viewing the processing rules local to all nodes as degrees-of-freedom, that minimizes the loss in expected (MAP or MPM) performance subject to such online communication constraints. The approach leads to a novel message-passing algorithm to be executed offline, or before observations are realized, which mitigates the performance loss by iteratively coupling all rules in a manner implicitly driven by global statistics. We also provide (i) illustrative examples, (ii) assumptions that guarantee convergence and efficiency and (iii) connections to active research areas. 1
[1] J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
[2] L. Chen, et al. Data association based on optimization in graphical models with application to sensor networks. Mathematical and Computer Modeling, 2005. To appear.
[3] A. T. Ihler, et al. Message errors in belief propagation. Advances in NIPS 17, MIT Press, 2005.
[4] M. I. Jordan, et al. An introduction to variational methods for graphical models. Learning in Graphical Models, pp. 105–161, MIT Press, 1999.
[5] J. N. Tsitsiklis. Decentralized detection. Adv. in Stat. Sig. Proc., pp. 297–344, JAI Press, 1993.
[6] P. K. Varshney. Distributed Detection and Data Fusion. Springer-Verlag, 1997.
[7] J. Marschak and R. Radner. The Economic Theory of Teams. Yale University Press, 1972.
[8] O. P. Kreidl and A. S. Willsky. Posterior assignment in directed graphical models with minimal online communication. Available: http://web.mit.edu/opk/www/res.html
[9] D. P. Bertsekas. Nonlinear Programming. Athena Scientific, 1995.
[10] S. Kakade, et al. Correlated equilibria in graphical games. ACM-CEC, pp. 42–47, 2003.
[11] J. Lafferty, et al. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. ICML, 2001.
[12] X. Nguyen, et al. Decentralized detection and classification using kernel methods. ICML,2004.