Lifted Model Construction under Approximate Commutativity

• URL: http://arxiv.org/abs/2608.24713v1
• Date: Tue, 25 Aug 2026 15:32:47 GMT
• Title: Lifted Model Construction under Approximate Commutativity
• Abstract summary: We show how -commutativity can be exploited for lifted model construction, downstream probabilistic inference, and prove strict bounds on the induced approximation error.<n>These theoretical guarantees are confirmed empirically, demonstrating comparable query accuracy at lower runtime.
• Score: 5.629677133940586
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: 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 approximately commutative instead of being exactly commutative. We address this problem by introducing the concept of ε-commutativity, a relaxation of commutativity where output values are only approximately invariant under permutations of input values. Specifically, we show how ε-commutativity can be exploited for lifted model construction, downstream probabilistic inference, and prove strict bounds on the induced approximation error, thereby ensuring the practical applicability of lifted model construction while maintaining highly accurate query results. These theoretical guarantees are confirmed empirically, demonstrating comparable query accuracy at lower runtime.

Related papers

• Propagation of~Interval Belief Structures and~Imprecise Copulas for~Neural Network Verification [1.5905165019585945]
  We propose a framework for quantitative verification under imprecise probabilistic information.<n>We combine interval belief structures to represent marginal uncertainty with imprecise copulas to model uncertain dependence.
  arXiv  Detail & Related papers  (2026-06-29T10:40:26Z)
• A Fiber Criterion for Representation Identifiability in Supervised Learning [0.0]
  Supervised learning evaluates predictors through their input-output behavior.<n>This paper formalizes the resulting representation-level identifiability problem.<n>The results clarify that representation-level claims require assumptions, objectives, measurements, or inductive biases beyond supervised predictive behavior alone.
  arXiv  Detail & Related papers  (2026-05-31T08:25:07Z)
• On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions [4.503368323711748]
  We revisit the theoretical foundations underlying the state-of-the-art algorithm to detect commutative factors.<n>We prove a slightly modified version of the aforementioned theorem, which serves as a necessary condition to identify commutative factors.<n>We present a corrected version of the state-of-the-art algorithm, which keeps its efficiency while ensuring correctness and introduce a complementary algorithm with tighter worst-case bounds.
  arXiv  Detail & Related papers  (2026-05-26T12:05:53Z)
• On the Sample Complexity of Learning for Blind Inverse Problems [8.091533689145908]
  Blind inverse problems arise in many experimental settings where the forward operator is partially or entirely unknown.<n>Data-driven approaches have been proposed to address blind inverse problems, demonstrating strong empirical performance and adaptability.<n>We shed light on learning in blind inverse problems within the simplified yet insightful framework of Linear Minimum Mean Square Estimators.
  arXiv  Detail & Related papers  (2025-12-29T11:53:37Z)
• Partial Transportability for Domain Generalization [56.37032680901525]
  Building on the theory of partial identification and transportability, this paper introduces new results for bounding the value of a functional of the target distribution.<n>Our contribution is to provide the first general estimation technique for transportability problems.<n>We propose a gradient-based optimization scheme for making scalable inferences in practice.
  arXiv  Detail & Related papers  (2025-03-30T22:06:37Z)
• Probabilistic Lexical Manifold Construction in Large Language Models via Hierarchical Vector Field Interpolation [0.0]
  The proposed methodology constructs a probabilistic function space where word representations adhere to topological consistency.<n>Probability constraints enhance lexical coherence by refining contextual relationships, leading to improvements in semantic stability across multiple linguistic distributions.<n>An assessment of computational efficiency reveals that while representations introduces minor processing overhead, the structured representation learning approach remains scalable for practical deployment.
  arXiv  Detail & Related papers  (2025-02-14T08:47:10Z)
• Identifying Weight-Variant Latent Causal Models [82.14087963690561]
  We find that transitivity acts as a key role in impeding the identifiability of latent causal representations. Under some mild assumptions, we can show that the latent causal representations can be identified up to trivial permutation and scaling. We propose a novel method, termed Structural caUsAl Variational autoEncoder, which directly learns latent causal representations and causal relationships among them.
  arXiv  Detail & Related papers  (2022-08-30T11:12:59Z)
• Data-Driven Influence Functions for Optimization-Based Causal Inference [105.5385525290466]
  We study a constructive algorithm that approximates Gateaux derivatives for statistical functionals by finite differencing. We study the case where probability distributions are not known a priori but need to be estimated from data.
  arXiv  Detail & Related papers  (2022-08-29T16:16:22Z)
• Equivariant Disentangled Transformation for Domain Generalization under Combination Shift [91.38796390449504]
  Combinations of domains and labels are not observed during training but appear in the test environment. We provide a unique formulation of the combination shift problem based on the concepts of homomorphism, equivariance, and a refined definition of disentanglement.
  arXiv  Detail & Related papers  (2022-08-03T12:31:31Z)
• Predicting Out-of-Domain Generalization with Neighborhood Invariance [59.05399533508682]
  We propose a measure of a classifier's output invariance in a local transformation neighborhood. Our measure is simple to calculate, does not depend on the test point's true label, and can be applied even in out-of-domain (OOD) settings. In experiments on benchmarks in image classification, sentiment analysis, and natural language inference, we demonstrate a strong and robust correlation between our measure and actual OOD generalization.
  arXiv  Detail & Related papers  (2022-07-05T14:55:16Z)
• Learning Disentangled Representations with Latent Variation Predictability [102.4163768995288]
  This paper defines the variation predictability of latent disentangled representations. Within an adversarial generation process, we encourage variation predictability by maximizing the mutual information between latent variations and corresponding image pairs. We develop an evaluation metric that does not rely on the ground-truth generative factors to measure the disentanglement of latent representations.
  arXiv  Detail & Related papers  (2020-07-25T08:54:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.