DeepAI AI Chat
Log In Sign Up

Parameter and Structure Learning in Nested Markov Models

by   Ilya Shpitser, et al.

The constraints arising from DAG models with latent variables can be naturally represented by means of acyclic directed mixed graphs (ADMGs). Such graphs contain directed and bidirected arrows, and contain no directed cycles. DAGs with latent variables imply independence constraints in the distribution resulting from a 'fixing' operation, in which a joint distribution is divided by a conditional. This operation generalizes marginalizing and conditioning. Some of these constraints correspond to identifiable 'dormant' independence constraints, with the well known 'Verma constraint' as one example. Recently, models defined by a set of the constraints arising after fixing from a DAG with latents, were characterized via a recursive factorization and a nested Markov property. In addition, a parameterization was given in the discrete case. In this paper we use this parameterization to describe a parameter fitting algorithm, and a search and score structure learning algorithm for these nested Markov models. We apply our algorithms to a variety of datasets.


page 1

page 2

page 3

page 4


A factorization criterion for acyclic directed mixed graphs

Acyclic directed mixed graphs, also known as semi-Markov models represen...

Sparse Nested Markov models with Log-linear Parameters

Hidden variables are ubiquitous in practical data analysis, and therefor...

Margins of discrete Bayesian networks

Bayesian network models with latent variables are widely used in statist...

Mixed Cumulative Distribution Networks

Directed acyclic graphs (DAGs) are a popular framework to express multiv...

Constraints in Gaussian Graphical Models

In this paper, we consider the problem of finding the constraints in bow...

Towards a symbolic summation theory for unspecified sequences

The article addresses the problem whether indefinite double sums involvi...

Iterative Conditional Fitting for Gaussian Ancestral Graph Models

Ancestral graph models, introduced by Richardson and Spirtes (2002), gen...