AIJun 20, 2012

Template Based Inference in Symmetric Relational Markov Random Fields

arXiv:1206.5276v150 citations
Originality Highly original
AI Analysis

This work addresses the problem of slow inference and learning in relational models for researchers in machine learning and computational biology, offering a significant speedup for symmetric cases.

The paper tackles the computational inefficiency of inference in relational Markov Random Fields by introducing template-level belief propagation for symmetric relational MRFs, achieving a dramatic speedup where running time scales with model size rather than domain size, and applies it to learn models for large protein-protein interaction networks.

Relational Markov Random Fields are a general and flexible framework for reasoning about the joint distribution over attributes of a large number of interacting entities. The main computational difficulty in learning such models is inference. Even when dealing with complete data, where one can summarize a large domain by sufficient statistics, learning requires one to compute the expectation of the sufficient statistics given different parameter choices. The typical solution to this problem is to resort to approximate inference procedures, such as loopy belief propagation. Although these procedures are quite efficient, they still require computation that is on the order of the number of interactions (or features) in the model. When learning a large relational model over a complex domain, even such approximations require unrealistic running time. In this paper we show that for a particular class of relational MRFs, which have inherent symmetry, we can perform the inference needed for learning procedures using a template-level belief propagation. This procedure's running time is proportional to the size of the relational model rather than the size of the domain. Moreover, we show that this computational procedure is equivalent to sychronous loopy belief propagation. This enables a dramatic speedup in inference and learning time. We use this procedure to learn relational MRFs for capturing the joint distribution of large protein-protein interaction networks.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes