Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials

Many structured information extraction tasks employ collective graphical models that capture interinstance associativity by coupling them with various clique potentials. We propose tractable families of such potentials that are invariant under permutations of their arguments, and call them symmetric clique potentials. We present three families of symmetric potentials--MAX, SUM, and MAJORITY. We propose cluster message passing for collective inference with symmetric clique potentials, and present message computation algorithms tailored to such potentials. Our first message computation algorithm, called -pass, is sub-quadratic in the clique size, outputs exact messages for MAX, and computes 13 15 -approximate messages for Potts, a popular member of the SUM family. Empirically, it is upto two orders of magnitude faster than existing algorithms based on graph-cuts or belief propagation. Our second algorithm, based on Lagrangian relaxation, operates on MAJORITY potentials and provides clos...

• Type: Journal
• Year: 2010
• Where: JMLR
• Authors: Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan
• Keywords: Algorithm, Clique Potentials, JMLR 2010, Symmetric Clique Potentials