Ralf Möller

ε-commutativity allows for scalable probabilistic inference without sacrificing accuracy, even when learned parameters deviate from exact commutativity.

The standard algorithm for exploiting symmetries in probabilistic inference is broken, potentially leading to incorrect results in lifted inference.

Representing probability distributions with first-order logic formulas can drastically reduce their size, offering a path to more efficient probabilistic reasoning.