SOURCE-LINKED INTELLIGENCE

Lifted Model Construction under Approximate Commutativity

arXiv · AI, language, vision and robotics · article · Aug 25, 2026 · UTC

Lifted inference algorithms enable scalable probabilistic inference even for large object domains by leveraging the indistinguishability of objects in a probability distribution. An essential prerequisite for constructing a lifted representation is to identify commutative factors, i.e., functions whose output values are invariant under permutations of a subset of their input values, in a potential-based factorisation. In practice, however, parameters learned from data inevitably deviate even if associated objects are indistinguishable, causing their corresponding factors to be only approximate

Read original source ↗ Open in workspace

recordType

paper

region

Global