#graphical-models News & Analysis

4 articles tagged with #graphical-models. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

4 articles

AINeutralarXiv – CS AI · Jun 196/10

🧠

Information Lattice Learning as Probabilistic Graphical Model Structure Learning

Researchers demonstrate that Information Lattice Learning (ILL), a technique for discovering interpretable rules in signals, naturally aligns with probabilistic graphical model structure learning when applied to probability distributions. The work reveals that ILL rules correspond to marginal constraints over abstracted variables, with maximum-entropy reconstruction creating constraint-based factor graphs rather than traditional Bayesian networks.

AINeutralarXiv – CS AI · May 296/10

🧠

Composing Non-Conjugate Factor Graphs with Closed-Form Variational Inference

Researchers have developed a mathematical framework that preserves closed-form variational inference when composing multiple probabilistic models together, traditionally a challenge that breaks analytical tractability. By identifying five core factor-graph primitives and proving their composability, the work enables Bayesian mixture-of-experts models with inferred gating functions, demonstrated through improved ensemble forecasting with calibrated uncertainty.

AINeutralarXiv – CS AI · May 285/10

🧠

Domain size asymptotics for Markov logic networks

Researchers analyze how Markov logic networks (MLNs) behave as domain size increases, demonstrating that probability distributions determined by MLNs diverge significantly from uniform distributions. The work provides asymptotic characterization for single-relation languages and proves fundamental differences exist between MLNs and lifted Bayesian networks in their distributional properties.

AINeutralarXiv – CS AI · May 276/10

🧠

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions

Researchers have identified critical flaws in the state-of-the-art algorithm for detecting commutative factors in factor graphs, a foundational technique for lifted probabilistic inference. The algorithm incorrectly treats a necessary condition as sufficient, potentially producing incorrect results. The authors provide corrected algorithms that maintain efficiency while ensuring correctness.