Logical Inference Algorithms and Matrix Representations for Probabilistic Conditional Independence

05/09/2012
by   Mathias Niepert, et al.
0

Logical inference algorithms for conditional independence (CI) statements have important applications from testing consistency during knowledge elicitation to constraintbased structure learning of graphical models. We prove that the implication problem for CI statements is decidable, given that the size of the domains of the random variables is known and fixed. We will present an approximate logical inference algorithm which combines a falsification and a novel validation algorithm. The validation algorithm represents each set of CI statements as a sparse 0-1 matrix A and validates instances of the implication problem by solving specific linear programs with constraint matrix A. We will show experimentally that the algorithm is both effective and efficient in validating and falsifying instances of the probabilistic CI implication problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2013

A Graph-Based Inference Method for Conditional Independence

The graphoid axioms for conditional independence, originally described b...
research
08/16/2021

First-Order Theory of Probabilistic Independence and Single-Letter Characterizations of Capacity Regions

We consider the first-order theory of random variables with the probabil...
research
08/09/2014

On the Conditional Independence Implication Problem: A Lattice-Theoretic Approach

A lattice-theoretic framework is introduced that permits the study of th...
research
01/10/2019

Conditional independence ideals with hidden variables

We study a class of determinantal ideals that are related to conditional...
research
02/27/2013

Semigraphoids Are Two-Antecedental Approximations of Stochastic Conditional Independence Models

The semigraphoid closure of every couple of CI-statements (GI=conditiona...
research
01/07/2021

An Algorithm for the Discovery of Independence from Data

For years, independence has been considered as an important concept in m...
research
01/10/2013

On characterizing Inclusion of Bayesian Networks

Every directed acyclic graph (DAG) over a finite non-empty set of variab...

Please sign up or login with your details

Forgot password? Click here to reset