Marginals of DAG-Isomorphic Independence Models
نویسنده
چکیده
Probabilistic and graphical independence models both satisfy the semi-graphoid axioms, but their respective modelling powers are not equal. For every graphical independence model that is represented by d-separation in a directed acyclic graph, there exists an isomorphic probabilistic independence model, i.e. it has exactly the same independence statements. The reverse does not hold, as there exists probability distributions for which there is no perfect map. We investigate if a given probabilistic independence model can be augmented with latent variables to a new independence model that is isomorphic with a graphical independence model of a directed acyclic graph. The original independence model can then be viewed as the marginal of the model with latent variables. We show that for some independence models we need infinitely many latent variables to accomplish this.
منابع مشابه
Computing Marginals with Hierarchical Acyclic Hypergraphs
How to compute marginals efficiently is one of major concerned problems in probabilistic reasoning systems. Traditional graphical models do not preserve all conditional independencies while computing the marginals. That is, the Bayesian DAGs have to be transformed into a secondary computational structure, normally, acyclic hypergraphs, in order to compute marginals. It is well-known that some c...
متن کاملSparse Nested Markov models with Log-linear Parameters
Hidden variables are ubiquitous in practical data analysis, and therefore modeling marginal densities and doing inference with the resulting models is an important problem in statistics, machine learning, and causal inference. Recently, a new type of graphical model, called the nested Markov model, was developed which captures equality constraints found in marginals of directed acyclic graph (D...
متن کاملOn Parameter Priors for Discrete DAG Models
We investigate parameter priors for discrete DAG models. It was shown in previous works that a Dirichlet prior on the parameters of a discrete DAG model is inevitable assuming global and local parameter independence for all possible complete DAG structures. A similar result for Gaussian DAG models hinted that the assumption of local independence may be redundant. Herein, we prove that the local...
متن کاملEquivalence in Non-Recursive Structural Equation Models
Introduction In the last decade, there has been considerable progress in understanding a certain class of statistical models, known as directed acyclic graph (DAG) models, which encode independence, and conditional independence constraints. (See Pearl, 1988). This research has had fruitful results in many areas: there is now a relatively clear causal interpretation of these models, there are ef...
متن کاملOn the inclusion problem∗
Every directed acyclic graph (DAG) over a finite non-empty set of variables (= nodes) N induces an independence model overN , which is a list of conditional independence statements over N . The inclusion problem is how to characterize (in graphical terms) whether all independence statements in the model induced by a DAG K are in the model induced by a second DAG L. Meek [8] conjectured that thi...
متن کامل