An Efficient Algorithm for Computing Interventional Distributions in Latent Variable Causal Models

Details An Efficient Algorithm for Computing Interventional Distributions in Latent Variable Causal Models An Efficient Algorithm for Computing Interventional Distributions in Latent Variable Causal Models

2012-02-14

arxiv.org/abs/1202.3763v1

Computer Science

Learning

Scientific paper

Probabilistic inference in graphical models is the task of computing marginal and conditional densities of interest from a factorized representation of a joint probability distribution. Inference algorithms such as variable elimination and belief propagation take advantage of constraints embedded in this factorization to compute such densities efficiently. In this paper, we propose an algorithm which computes interventional distributions in latent variable causal models represented by acyclic directed mixed graphs(ADMGs). To compute these distributions efficiently, we take advantage of a recursive factorization which generalizes the usual Markov factorization for DAGs and the more recent factorization for ADMGs. Our algorithm can be viewed as a generalization of variable elimination to the mixed graph case. We show our algorithm is exponential in the mixed graph generalization of treewidth.

Affiliated with

Also associated with

No associations

Rating

An Efficient Algorithm for Computing Interventional Distributions in Latent Variable Causal Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Efficient Algorithm for Computing Interventional Distributions in Latent Variable Causal Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Algorithm for Computing Interventional Distributions in Latent Variable Causal Models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90683