Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models

27 Jul 2017Ankit AnandRitesh NoothigattuParag SinglaMausam

Lifted inference algorithms commonly exploit symmetries in a probabilistic graphical model (PGM) for efficient inference. However, existing algorithms for Boolean-valued domains can identify only those pairs of states as symmetric, in which the number of ones and zeros match exactly (count symmetries)... (read more)

PDF Abstract

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.