Skip to main content Skip to main navigation


Lifting Relational MAP-LPs Using Cluster Signatures

Udi Apsel; Kristian Kersting; Martin Mladenov
In: Carla E. Brodley; Peter Stone (Hrsg.). Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence (AAAI-2014), July 27-31, Québec City, Québec, Canada, Pages 2403-2409, AAAI Press, 2014.


Inference in large scale graphical models is an important task in many domains, and in particular probabilistic relational models (eg Markov logic networks). Such models often exhibit considerable symmetry, and it is a challenge to devise algorithms that exploit this symmetry to speed up inference. Recently, the automorphism group has been proposed to formalize mathematically what" exploiting symmetry" means. However, obtaining symmetry derived from automorphism is GI-hard, and consequently only a small fraction of the symmetry is easily available for effective employment. In this paper, we improve upon efficiency in two ways. First, we introduce the Cluster Signature Graph (CSG), a platform on which greater portions of the symmetries can be revealed and exploited. CSGs classify clusters of variables by projecting relations between cluster members onto a graph, allowing for the efficient pruning of symmetrical clusters even before their generation. Second, we introduce a novel framework based on CSGs for the Sherali-Adams hierarchy of linear program (LP) relaxations, dedicated to exploiting this symmetry for the benefit of tight Maximum A Posteriori (MAP) approximations. Combined with the pruning power of CSG, the framework quickly generates compact formulations for otherwise intractable LPs, as demonstrated by several empirical results.

Weitere Links