Compression versus Accuracy: A Hierarchy of Lifted Models
Jan Speller, Malte Luttermann, Marcel Gehrke, Tanya Braun

TL;DR
This paper introduces a hyperparameter-free hierarchical method for constructing lifted probabilistic models, enabling efficient exploration of the trade-off between model compression and accuracy with interpretable error bounds.
Contribution
A hierarchical approach to lifted model construction that avoids hyperparameter tuning and guarantees consistent factor grouping across different levels of approximation.
Findings
Hierarchical models provide a structured way to balance compression and accuracy.
The method ensures consistent factor grouping across different ε values.
Explicit error bounds facilitate interpretability and model selection.
Abstract
Probabilistic graphical models that encode indistinguishable objects and relations among them use first-order logic constructs to compress a propositional factorised model for more efficient (lifted) inference. To obtain a lifted representation, the state-of-the-art algorithm Advanced Colour Passing (ACP) groups factors that represent matching distributions. In an approximate version using as a hyperparameter, factors are grouped that differ by a factor of at most . However, finding a suitable is not obvious and may need a lot of exploration, possibly requiring many ACP runs with different values. Additionally, varying can yield wildly different models, leading to decreased interpretability. Therefore, this paper presents a hierarchical approach to lifted model construction that is hyperparameter-free. It…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Machine Learning and Algorithms · Explainable Artificial Intelligence (XAI)
