Causal Inference from Graphical Models  I


 Nathan Lindsey
 1 years ago
 Views:
Transcription
1 Graduate Lectures Oxford, October 2013
2 Graph terminology A graphical model is a set of distributions, satisfying a set of conditional independence relations encoded by a graph. This encoding is known as a Markov property. In many graphical models, the Markov property is matched by a corresponding factorization property of the associated densities or probability mass functions. This lecture is mostly concerned with graphical models based on directed acyclic graphs as these allow particularly simple causal interpretations. Such models are also known as Bayesian networks, a term coined by Pearl (1986). There is nothing Bayesian about them.
3 Definition and example Local directed Markov property Factorization The global Markov property A directed acyclic graph D over a finite set V is a simple graph with all edges directed and no directed cycles. We use DAG for brevity. Absence of directed cycles means that, following arrows in the graph, it is impossible to return to any point. Bayesian networks have proved fundamental and useful in a wealth of interesting applications, including expert systems, genetics, complex biomedical statistics, causal analysis, and machine learning.
4 Definition and example Local directed Markov property Factorization The global Markov property Example of a directed graphical model
5 Definition and example Local directed Markov property Factorization The global Markov property An probability distribution P of random variables X v, v V satisfies the local Markov property (L) w.r.t. a directed acyclic graph D if α V : α {nd(α) \ pa(α)} pa(α). Here nd(α) are the nondescendants of α. A wellknown example is a Markov chain: X 1 X 2 X 3 X 4 X 5 with X i+1 (X 1,..., X i 1 ) X i for i = 3,..., n. X n
6 Definition and example Local directed Markov property Factorization The global Markov property For example, the local Markov property says 4 {1, 3, 5, 6} 2, 5 {1, 4} {2, 3} 3 {2, 4} 1.
7 Definition and example Local directed Markov property Factorization The global Markov property A probability distribution P over X = X V factorizes over a DAG D if its density or probability mass function f has the form (F) : f (x) = v V f (x v x pa(v) ).
8 Definition and example Local directed Markov property Factorization The global Markov property Example of DAG factorization The above graph corresponds to the factorization f (x) = f (x 1 )f (x 2 x 1 )f (x 3 x 1 )f (x 4 x 2 ) f (x 5 x 2, x 3 )f (x 6 x 3, x 5 )f (x 7 x 4, x 5, x 6 ).
9 Definition and example Local directed Markov property Factorization The global Markov property Separation in DAGs A node γ in a trail τ is a collider if edges meet headto head at γ: A trail τ from α to β in D is active relative to S if both conditions below are satisfied: all its colliders are in S an(s) all its noncolliders are outside S A trail that is not active is blocked. Two subsets A and B of vertices are dseparated by S if all trails from A to B are blocked by S. We write A d B S.
10 Definition and example Local directed Markov property Factorization The global Markov property Separation by example For S = {5}, the trail (4, 2, 5, 3, 6) is active, whereas the trails (4, 2, 5, 6) and (4, 7, 6) are blocked. For S = {3, 5}, they are all blocked.
11 Definition and example Local directed Markov property Factorization The global Markov property Returning to example Hence 4 d 6 3, 5, but it is not true that 4 d 6 5 nor that 4 d 6.
12 Definition and example Local directed Markov property Factorization The global Markov property Equivalence of Markov properties A probability distribution P satisfies the global Markov property (G) w.r.t. D if A d B S A B S. It holds for any DAG D and any distribution P that these three directed Markov properties are equivalent: (G) (L) (F).
13 Motivation Intervention vs. observation Causal interpretation Example is compelling for causal reasons
14 Motivation Intervention vs. observation Causal interpretation The now rather standard causal interpretation of a DAG (Spirtes et al., 1993; Pearl, 2000) emphasizes the distinction between conditioning by observation and conditioning by intervention. We use special notations for this P(X = x Y y) = P{X = x do(y = y)} = p(x y), (1) whereas p(y x) = p(y = y X = x) = P{Y = y is(x = x)}. [Also distinguish p(x y) from P{X = x see(y = y)}. Observation/sampling bias.] A causal interpretation of a Bayesian network involves giving (1) a simple form.
15 Motivation Intervention vs. observation Causal interpretation We say that a BN is causal w.r.t. atomic interventions at B V if it holds for any A B that p(x xa ) = p(x v x pa(v) ) v V \A For A = we obtain standard factorisation. xa =x A Note that conditional distributions p(x v x pa(v) ) are stable under interventions which do not involve x v. Such assumption must be justified in any given context.
16 Motivation Intervention vs. observation Causal interpretation Contrast the formula for intervention conditioning with that for observation conditioning: p(x xa ) = p(x v x pa(v) ) = v V \A v V p(x v x pa(v) ) v A p(x v x pa(v) ) xa =x A x A =x A. whereas p(x xa ) = v V p(x v x pa(v) ) p(x A ) xa =x A.
17 Motivation Intervention vs. observation Causal interpretation An example p(x x5 ) = p(x 1 )p(x 2 x 1 )p(x 3 x 1 )p(x 4 x 2 ) p(x 6 x 3, x5 )p(x 7 x 4, x5, x 6 ) whereas p(x x5 ) p(x 1 )p(x 2 x 1 )p(x 3 x 1 )p(x 4 x 2 ) p(x5 x 2, x 3 )p(x 6 x 3, x5 )p(x 7 x 4, x5, x 6 )
18 General equation systems Intervention by replacement DAG D can also represent structural equation system: X v g v (x pa(v), U v ), v V, (2) where g v are fixed functions and U v are independent random disturbances. Intervention in structural equation system can be made by replacement, i.e. so that X v x v is replacing the corresponding line in program (2). Corresponds to g v and U v being unaffected by the intervention if intervention is not made on node v. Hence the equation is structural.
19 General equation systems Intervention by replacement A linear structural equation system for this network is X 1 α 1 + U 1 X 2 α 2 + β 21 x 1 + U 2 X 3 α 3 + β 31 x 1 + U 3 X 4 α 4 + β 42 x 2 + U 4 X 5 α 5 + β 52 x 2 + β 53 x 3 + U 5 X 6 α 6 + β 63 x 3 + β 65 x 5 + U 6 X 7 α 7 + β 74 x 4 + β 75 x 5 + β 76 x 6 + U 7.
20 General equation systems Intervention by replacement After intervention by replacement, the system changes to X 1 α 1 + U 1 X 2 α 2 + β 21 x 1 + U 2 X 3 α 3 + β 31 x 1 + U 3 X 4 x 4 X 5 α 5 + β 52 x 2 + β 53 x 3 + U 5 X 6 α 6 + β 63 x 3 + β 65 x 5 + U 6 X 7 α 7 + β 74 x4 + β 75 x 5 + β 76 x 6 + U 7.
21 General equation systems Intervention by replacement Justification of causal models by structural equations Intervention by replacement in structural equation system implies D causal for distribution of X v, v V. Occasionally used for justification of CBN. Ambiguity in choice of g v and U v makes this problematic. May take stability of conditional distributions as a primitive rather than structural equations. Structural equations more expressive when choice of g v and U v can be externally justified.
22 Assessment of effects of actions Intervention diagrams LIMIDs r a l b a  treatment with AZT; l  intermediate response (possible lung disease); b  treatment with antibiotics; r  survival after a fixed period. Predict survival if X a 1 and X b 1, assuming stable conditional distributions.
23 Assessment of effects of actions Intervention diagrams LIMIDs Gcomputation r a l b p(1 r 1 a, 1 b ) = x l p(1 r, x l 1 a, 1 b ) = x l p(1 r x l, 1 a, 1 b )p(x l 1 a ).
24 Assessment of effects of actions Intervention diagrams LIMIDs Augment each node v A where intervention is contemplated with additional parent variable F v. F v has state space X v {φ} and conditional distributions in the intervention diagram are { p p(xv x (x v x pa(v), f v ) = pa(v) ) if f v = φ δ xv,xv if f v = xv, where δ xy is Kronecker s symbol δ xy = { 1 if x = y 0 otherwise. F v is forcing the value of X v when F v φ.
25 Assessment of effects of actions Intervention diagrams LIMIDs It now holds in the extended intervention diagram that p(x) = p (x F v = φ, v A), but also p(x xb ) = P(X = x X B xb ) = P (x F v = xv, v B, F v = φ, v B \ A), In particular it holds that if pa(v) =, then p(x xv ) = p(x v xv ).
26 Assessment of effects of actions Intervention diagrams LIMIDs More generally we can explicitly join decision nodes δ to the DAG as parents of nodes which they affect. Further, each of these can have parents in D or in to indicate that intervention at δ may depend on states of pa(δ). A strategy σ yields a conditional distribution of decisions, given their parents to yield f (x σ) = v V f (x v x pa(v) ) δ σ(x δ x pa(δ) ) where now pa(v) refer to parents in the extended diagram, which must be a DAG to make sense. This formally corresponds to the notion of LIMIDs (Lauritzen and Nilsson, 2001).
27 Assessment of effects of actions Intervention diagrams LIMIDs F C F A A C E F B B D F D LIMID for a causal interpretation of a DAG. Red nodes represent (external) forces or interventions that affect the conditional distributions of their children. Note that interventions can be allowed to depend on other variables (treatment strategies).
28 Lauritzen, S. L. (2001). Causal inference from graphical models. In BarndorffNielsen, O. E., Cox, D. R., and Klüppelberg, C., editors, Complex Stochastic Systems, pages Chapman and Hall/CRC Press, London/Boca Raton. Lauritzen, S. L. and Nilsson, D. (2001). Representing and solving decision problems with limited information. Management Science, 47: Pearl, J. (1986). Fusion, propagation and structuring in belief networks. Artificial Intelligence, 29: Pearl, J. (2000). Causality. Cambridge University Press, Cambridge. Spirtes, P., Glymour, C., and Scheines, R. (1993). Causation, Prediction and Search. SpringerVerlag, New York. Reprinted by MIT Press.
Markov Properties for Graphical Models
Wald Lecture, World Meeting on Probability and Statistics Istanbul 2012 Undirected graphs Directed acyclic graphs Chain graphs Recall that a sequence of random variables X 1,..., X n,... is a Markov chain
More informationAn Introduction to Graphical Models
An Introduction to Graphical Models Loïc Schwaller Octobre, 0 Abstract Graphical models are both a natural and powerful way to depict intricate dependency structures in multivariate random variables. They
More informationOutline. An Introduction to Causal Inference. Motivation. DSeparation. Formal Definition. Examples. Dseparation (Pearl, 1988; Spirtes, 1994)
Outline An Introduction to Causal Inference UW Markovia Reading Group presented by Michele anko & Kevin Duh Nov. 9, 2004 1. Dseparation 2. Causal Graphs 3. Causal Markov Condition 4. Inference 5. Conclusion
More informationGraphical chain models
Graphical chain models Graphical Markov models represent relations, most frequently among random variables, by combining simple yet powerful concepts: data generating processes, graphs and conditional
More informationGraphs and Conditional Independence
CIMPA Summerschool, Hammamet 2011, Tunisia September 5, 2011 A directed graphical model Directed graphical model (Bayesian network) showing relations between risk factors, diseases, and symptoms. A pedigree
More informationN 1 Experiments Suffice to Determine the Causal Relations Among N Variables
N 1 Experiments Suffice to Determine the Causal Relations Among N Variables Frederick Eberhardt Clark Glymour Richard Scheines Carnegie Mellon University December 7, 2004 Abstract By combining experimental
More informationIntroduction to NeuraBASE: Forming Join Trees in Bayesian Networks. Robert Hercus ChoongMing Chin KimFong Ho
Introduction to NeuraBASE: Forming Join Trees in Bayesian Networks Robert Hercus ChoongMing Chin KimFong Ho Introduction A Bayesian network or a belief network is a condensed graphical model of probabilistic
More information5 Directed acyclic graphs
5 Directed acyclic graphs (5.1) Introduction In many statistical studies we have prior knowledge about a temporal or causal ordering of the variables. In this chapter we will use directed graphs to incorporate
More informationGraphical Causal Models for Time Series Econometrics: Some Recent Developments and Applications
Introduction SVAR GMs Application to SVAR Recent Developments Graphical Causal Models for Time Series Econometrics: Some Recent Developments and Applications Alessio Max Planck Institute of Economics,
More informationDetecting Causal Relations in the Presence of Unmeasured Variables
392 Detecting Causal Relations in the Presence of Unmeasured Variables Peter Spirtes Deparunent of Philosophy Carnegie Mellon University Abstract The presence of latent variables can greatly complicate
More informationAn Introduction to Probabilistic Graphical Models
An Introduction to Probabilistic Graphical Models Reading: Chapters 17 and 18 in Wasserman. EE 527, Detection and Estimation Theory, An Introduction to Probabilistic Graphical Models 1 Directed Graphs
More informationThe Basics of Graphical Models
The Basics of Graphical Models David M. Blei Columbia University October 3, 2015 Introduction These notes follow Chapter 2 of An Introduction to Probabilistic Graphical Models by Michael Jordan. Many figures
More informationCausal discovery in multiple models from different experiments
Causal discovery in multiple models from different experiments Tom Claassen Radboud University Nijmegen The Netherlands tomc@cs.ru.nl Tom Heskes Radboud University Nijmegen The Netherlands tomh@cs.ru.nl
More informationAcyclic directed graphs to represent conditional independence models
Acyclic directed graphs to represent conditional independence models Marco Baioletti 1 Giuseppe Busanello 2 Barbara Vantaggi 2 1 Dip. Matematica e Informatica, Università di Perugia, Italy, email: baioletti@dipmat.unipg.it
More information7 The Elimination Algorithm
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms for Inference Fall 2014 7 The Elimination Algorithm Thus far, we have introduced directed,
More informationSegregated Graphs and Marginals of Chain Graph Models
Segregated Graphs and Marginals of Chain Graph Models Ilya Shpitser Department of Computer Science Johns Hopkins University ilyas@cs.jhu.edu Abstract Bayesian networks are a popular representation of asymmetric
More informationCausal Discovery. Richard Scheines. Peter Spirtes, Clark Glymour, and many others. Dept. of Philosophy & Machine Learning Carnegie Mellon.
Causal Discovery Richard Scheines Peter Spirtes, Clark Glymour, and many others Dept. of Philosophy & Machine Learning Carnegie Mellon Graphical Models 11/29/06 1 Outline 1. Motivation 2. Representation
More informationIterative Conditional Fitting for Discrete Chain Graph Models
Iterative Conditional Fitting for Discrete Chain Graph Models Mathias Drton 1 Department of Statistics, University of Chicago 5734 S. University Ave, Chicago, IL 60637, U.S.A. drton@uchicago.edu Abstract.
More informationGraphical Models and Message passing
Graphical Models and Message passing Yunshu Liu ASPITRG Research Group 20130716 References: [1]. Steffen Lauritzen, Graphical Models, Oxford University Press, 1996 [2]. Michael I. Jordan, Graphical models,
More informationCOS513 LECTURE 2 CONDITIONAL INDEPENDENCE AND FACTORIZATION
COS513 LECTURE 2 CONDITIONAL INDEPENDENCE AND FACTORIATION HAIPENG HENG, JIEQI U Let { 1, 2,, n } be a set of random variables. Now we have a series of questions about them: What are the conditional probabilities
More informationInference and Representation
Inference and Representation David Sontag New York University Lecture 3, Sept. 22, 2015 David Sontag (NYU) Inference and Representation Lecture 3, Sept. 22, 2015 1 / 14 Bayesian networks Reminder of first
More informationarxiv:math/ v1 [math.pr] 18 Feb 2004
A NOTE ON COMPACT MARKOV OPERATORS arxiv:math/0402302v1 [math.pr] 18 Feb 2004 FABIO ZUCCA DIPARTIMENTO DI MATEMATICA POLITECNICO DI MILANO PIAZZA LEONARDO DA VINCI 32, 20133 MILANO, ITALY. ZUCCA@MATE.POLIMI.IT
More informationPearl Causality and the Value of Control
23 Pearl Causality and the alue of Control Ross Shachter and David Heckerman 1 Introduction We welcome this opportunity to acknowledge the significance of Judea Pearl s contributions to uncertain reasoning
More informationDiscovering Structure in Continuous Variables Using Bayesian Networks
In: "Advances in Neural Information Processing Systems 8," MIT Press, Cambridge MA, 1996. Discovering Structure in Continuous Variables Using Bayesian Networks Reimar Hofmann and Volker Tresp Siemens AG,
More informationDirect and indirect effects
FACULTY OF SCIENCES Direct and indirect effects Stijn Vansteelandt Ghent University, Belgium London School of Hygiene and Tropical Medicine, U.K. Introduction Mediation analysis Mediation analysis is one
More informationCOS 424: Interacting with Data. Lecturer: Dave Blei Lecture #10 Scribe: Sunghwan Ihm March 8, 2007
COS 424: Interacting with Data Lecturer: Dave Blei Lecture #10 Scribe: Sunghwan Ihm March 8, 2007 Homework #3 will be released soon. Some questions and answers given by comments: Computational efficiency
More informationDAGs, IMaps, Factorization, dseparation, Minimal IMaps, Bayesian Networks. Slides by Nir Friedman
DAGs, IMaps, Factorization, dseparation, Minimal IMaps, Bayesian Networks Slides by Nir Friedman. Probability Distributions Let X 1,,X n be random variables Let P be a joint distribution over X 1,,X
More informationCS 188: Artificial Intelligence. Probability recap
CS 188: Artificial Intelligence Bayes Nets Representation and Independence Pieter Abbeel UC Berkeley Many slides over this course adapted from Dan Klein, Stuart Russell, Andrew Moore Conditional probability
More informationUsing Graphical Models in Microsimulation
Using Graphical Models in Microsimulation Marcus Wurzer 1 WU Vienna University of Economics and Business Reinhold Hatzinger WU Vienna University of Economics and Business Abstract: Typically, statistical
More informationCognitive Modeling. Motivation. Graphical Models. Motivation Graphical Models Bayes Nets and Bayesian Statistics. Lecture 15: Bayes Nets
Cognitive Modeling Lecture 15: Sharon Goldwater School of Informatics University of Edinburgh sgwater@inf.ed.ac.uk March 5, 2010 Sharon Goldwater Cognitive Modeling 1 1 and Bayesian Statistics 2 3 Reading:
More informationProbabilistic Networks An Introduction to Bayesian Networks and Influence Diagrams
Probabilistic Networks An Introduction to Bayesian Networks and Influence Diagrams Uffe B. Kjærulff Department of Computer Science Aalborg University Anders L. Madsen HUGIN Expert A/S 10 May 2005 2 Contents
More information1 Elements of Graphical Models
1 Elements of Graphical Models 1.1 An Example The AR(1) SV HMM provides a nice set of examples. Recall the model in centered form, defined by a set of conditional distributions that imply the full joint
More informationCommunication Theory II (E6713) September 14, 2005 Columbia University, Fall 2005 Handout #2. Lecture 1, E6713
Communication Theory II (E6713) September 14, 2005 Columbia University, Fall 2005 Handout #2 Lecture 1, E6713 COMMUNICATION NETWORK A Mathematical Model A network is represented as a directed, acyclic
More informationIntroduction to Causal Inference
Journal of Machine Learning Research 11 (2010) 16431662 Submitted 2/10; Published 5/10 Introduction to Causal Inference Peter Spirtes Department of Philosophy Carnegie Mellon University Pittsburgh, PA
More informationLocal Characterizations of Causal Bayesian Networks
Local Characterizations of Causal Bayesian Networks Elias Bareinboim 1, Carlos Brito 2, and Judea Pearl 1 1 Cognitive Systems Laboratory Computer Science Department University of California Los Angeles
More informationA Distinction between Causal Effects in Structural and Rubin Causal Models
A istinction between Causal Effects in Structural and Rubin Causal Models ionissi Aliprantis Federal Reserve Bank of Cleveland March 17, 2015 Abstract: Structural Causal Models define causal effects in
More informationLecture 4 October 23rd. 4.1 Notation and probability review
Directed and Undirected Graphical Models 2013/2014 Lecture 4 October 23rd Lecturer: Francis Bach Scribe: Vincent Bodin, Thomas Moreau 4.1 Notation and probability review Let us recall a few notations before
More informationCriteria for the characterization of token causation
L&PS Logic & Philosophy of Science Vol. VII, No. 1, 2009, pp. 115127 Criteria for the characterization of token causation Tyler J. VanderWeele Departments of Epidemiology and Biostatistics, Harvard University
More information6.975 Week 11 Summary: Expectation Propagation
6.975 Week 11 Summary: Expectation Propagation Erik Sudderth November 20, 2002 1 Introduction Expectation Propagation (EP) [2, 3] addresses the problem of constructing tractable approximations to complex
More informationGraphical Gaussian Modelling of Multivariate Time Series with Latent Variables
Graphical Gaussian Modelling of Multivariate Time Series with Latent Variables Michael Eichler Department of Quantitative Economics Maastricht University, NL m.eichler@maastrichtuniversity.nl Abstract
More informationCausal inference with graphical models in small and big data
Causal inference with graphical models in small and big data Outline Association is not causation How adjustment can help or harm Counterfactuals  individuallevel causal effect  average causal effect
More informationtseparation and dseparation for Directed Acyclic Graphs
tseparation and dseparation for Directed Acyclic Graphs Yanming Di Technical Report No. 552 Department of Statistics, University of Washington, Seattle, WA 98195 diy@stat.washington.edu February 10,
More informationOn learning of structures for Bayesian networks Timo Koski Mathematical statistics, KTH
On learning of structures for Bayesian networks Timo Koski Mathematical statistics, KTH Sigtuna 02.10.2008 Introduction Bayesian networks are a special case are multivariate (discrete) statistical distributions
More informationCAUSALITY: MODELS, REASONING, AND INFERENCE by Judea Pearl Cambridge University Press, 2000
Econometric Theory, 19, 2003, 675 685+ Printed in the United States of America+ DOI: 10+10170S0266466603004109 CAUSALITY: MODELS, REASONING, AND INFERENCE by Judea Pearl Cambridge University Press, 2000
More informationAn Introduction to Factor Graphs
An Introduction to Factor Graphs HansAndrea Loeliger MLSB 2008, Copenhagen 1 Definition A factor graph represents the factorization of a function of several variables. We use Forneystyle factor graphs
More informationBayesian networks and food security an introduction
9 Bayesian networks and food security an introduction Alfred Stein # Abstract This paper gives an introduction to Bayesian networks. Networks are defined and put into a Bayesian context. Directed acyclical
More informationMachine Learning
Machine Learning 10701 Tom M. Mitchell Machine Learning Department Carnegie Mellon University February 8, 2011 Today: Graphical models Bayes Nets: Representing distributions Conditional independencies
More informationOn Causal Discovery from Time Series Data using FCI
On Causal Discovery from Time Series Data using Doris Entner 1 and Patrik O. Hoyer 1,2 1 HIIT & Dept. of Computer Science, University of Helsinki, Finland 2 CSAIL, Massachusetts Institute of Technology,
More informationLecture 3: Bayesian Optimal Filtering Equations and Kalman Filter
Equations and Kalman Filter Department of Biomedical Engineering and Computational Science Aalto University February 10, 2011 Contents 1 Probabilistics State Space Models 2 Bayesian Optimal Filter 3 Kalman
More informationProbabilistic Graphical Models Homework 1: Due January 29, 2014 at 4 pm
Probabilistic Graphical Models 10708 Homework 1: Due January 29, 2014 at 4 pm Directions. This homework assignment covers the material presented in Lectures 13. You must complete all four problems to
More information15.1 The Regression Model: Analysis of Residuals
15.1 The Regression Model: Analysis of Residuals Tom Lewis Fall Term 2009 Tom Lewis () 15.1 The Regression Model: Analysis of Residuals Fall Term 2009 1 / 12 Outline 1 The regression model 2 Estimating
More informationCumulative distribution networks and the derivativesumproduct algorithm: Models and inference for cumulative distribution functions on graphs
Journal of Machine Learning Research 11 (2010) 148 Submitted 10/09; Published??/?? Cumulative distribution networks and the derivativesumproduct algorithm: Models and inference for cumulative distribution
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science ALGORITHMS FOR INFERENCE Fall 2014
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.438 ALGORITHMS FOR INFERENCE Fall 2014 Quiz 1 Thursday, October 16, 2014 7:00pm 10:00pm This is a closed
More informationBayesian Networks Representation. Machine Learning CSE446 Carlos Guestrin University of Washington. May 29, Carlos Guestrin
Bayesian Networks Representation Machine Learning CSE446 Carlos Guestrin University of Washington May 29, 2013 1 Causal structure n Suppose we know the following: The flu causes sinus inflammation Allergies
More informationMachine Learning
Machine Learning 10601 Tom M. Mitchell Machine Learning Department Carnegie Mellon University February 23, 2015 Today: Graphical models Bayes Nets: Representing distributions Conditional independencies
More informationIntroduction to Graphical Models
obert Collins CSE586 Credits: Several slides are from: Introduction to Graphical odels eadings in Prince textbook: Chapters 0 and but mainly only on directed graphs at this time eview: Probability Theory
More informationJournal of Statistical Software
JSS Journal of Statistical Software February 2006, Volume 15, Issue 6. http://www.jstatsoft.org/ Independencies Induced from a Graphical Markov Model After Marginalization and Conditioning: The R Package
More informationDeutsches Institut für Ernährungsforschung PotsdamRehbrücke. DAG program (v0.21)
Deutsches Institut für Ernährungsforschung PotsdamRehbrücke DAG program (v0.21) Causal diagrams: A computer program to identify minimally sufficient adjustment sets SHORT TUTORIAL Sven Knüppel http://epi.dife.de/dag
More information1 Why demand analysis/estimation?
Lecture notes: Demand estimation introduction 1 1 Why demand analysis/estimation? Estimation of demand functions is an important empirical endeavor. Why? Fundamental empircial question: how much market
More informationFinding zero of polynomials of bounded treewidth over finite field
Finding zero of polynomials of bounded treewidth over finite field Alexander Glikson ID:307167916 aglik@cs.technion.ac.il August 14, 2002 Abstract This paper is submitted as part of a project report for
More informationCausal Discovery with Continuous Additive Noise Models
Journal of Machine Learning Research 15 (2014) 20092053 Submitted 7/13; Revised 4/14; Published 6/14 Causal Discovery with Continuous Additive Noise Models Jonas Peters Seminar for Statistics, ETH Zürich
More informationBayesian Networks in Forensic DNA Analysis
Bayesian Networks in Forensic DNA Analysis Master s Thesis  J. J. van Wamelen Supervisor  prof. dr. R. D. Gill Universiteit Leiden 2 Preface When you have eliminated the impossible, whatever remains,
More informationGraphoids Over Counterfactuals
To appear in Journal of Causal Inference. TECHNICAL REPORT R396 August 2014 Graphoids Over Counterfactuals Judea Pearl University of California, Los Angeles Computer Science Department Los Angeles, CA,
More informationLecture 13: Knowledge Representation and Reasoning Part 2 Sanjeev Arora Elad Hazan
COS 402 Machine Learning and Artificial Intelligence Fall 2016 Lecture 13: Knowledge Representation and Reasoning Part 2 Sanjeev Arora Elad Hazan (Borrows from slides of Percy Liang, Stanford U.) Midterm
More informationCausal Inference on Total, Direct, and Indirect Effects
Causal Inference on Total, Direct, and Indirect Effects Rolf Steyer, Axel Mayer and Christiane Fiege In: A. Michalos (ed.), Encyclopedia of Quality of Life Research Version: May 27, 2013 1 1 RESEARCH TRADITIONS
More informationA New Look at Causal Independence
A New Look at Causal Independence David Heckerman John S. Breese Microsoft Research One Microsoft Way Redmond, WA 980526399 Abstract Heckerman (1993) defined causal independence
More informationLearning Causal Relations in Multivariate Time Series Data
No. 200711 August 27, 2007 Learning Causal Relations in Multivariate Time Series Data Pu Chen and Hsiao Chihying Bielefeld University, Germany Abstract: Applying a probabilistic causal approach, we define
More informationAn introduction to diffusion processes and Ito s stochastic calculus Cédric Archambeau
An introduction to diffusion processes and Ito s stochastic calculus Cédric Archambeau University College, London Centre for Computational Statistics and Machine Learning c.archambeau@cs.ucl.ac.uk Motivation
More informationMarkov Chains, part I
Markov Chains, part I December 8, 2010 1 Introduction A Markov Chain is a sequence of random variables X 0, X 1,, where each X i S, such that P(X i+1 = s i+1 X i = s i, X i 1 = s i 1,, X 0 = s 0 ) = P(X
More informationOrderIndependent ConstraintBased Causal Structure Learning
Journal of Machine Learning Research 15 (2014) 39213962 Submitted 9/13; Revised 7/14; Published 11/14 OrderIndependent ConstraintBased Causal Structure Learning Diego Colombo Marloes H. Maathuis Seminar
More informationGraphical Models. CS 343: Artificial Intelligence Bayesian Networks. Raymond J. Mooney. Conditional Probability Tables.
Graphical Models CS 343: Artificial Intelligence Bayesian Networks Raymond J. Mooney University of Texas at Austin 1 If no assumption of independence is made, then an exponential number of parameters must
More informationThe Query Complexity of Scoring Rules
The Query Complexity of Scoring Rules Pablo Daniel Azar MIT, CSAIL Cambridge, MA 02139, USA azar@csail.mit.edu Silvio Micali MIT, CSAIL Cambridge, MA 02139, USA silvio@csail.mit.edu June 12, 2013 Abstract
More informationThe interpretation of \direct dependence" was kept rather informal and usually conveyed by causal intuition, for example, that the entire inuence of A
CAUSAL DIAGRAMS Sander Greenland Epidemiology Department Cognitive Systems Laboratory Computer Science Department University of California, Los Angeles, CA 90024 lesdomes@ucla.edu Judea Pearl Cognitive
More informationExchangeability and de Finetti s Theorem
Steffen Lauritzen University of Oxford April 26, 2007 Overview of Lectures 1. 2. Sufficiency, Partial Exchangeability, and Exponential Families 3. Exchangeable Arrays and Random Networks Basic references
More informationUniversität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen. Graphical Models. Niels Landwehr
Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen Graphical Models iels Landwehr Overview: Graphical Models Graphical models: tool for modelling domain with several random variables.
More informationAnalysing social science data with graphical Markov models
Analysing social science data with graphical Markov models 1 Introduction Nanny Wermuth University of Mainz The term graphical Markov models has been suggested by Michael Perlman, University of Washington,
More informationDifferential Equations
Differential Equations A differential equation is an equation that contains an unknown function and one or more of its derivatives. Here are some examples: y = 1, y = x, y = xy y + 2y + y = 0 d 3 y dx
More informationd SEPARATION: FROM THEOREMS TO ALGORITHMS
d SEPARATION: FROM THEOREMS TO ALGORITHMS Dan Geiger, Thomas Venna & Judea Pearl Cognitive Systems Laboratory, Computer Science Department University of California Los Angeles, CA 90024 geiger@cs.ucla.edu
More informationBayesian Networks for Variable Groups
JMLR: Workshop and Conference Proceedings vol 52, 380391, 2016 PGM 2016 Bayesian Networks for Variable Groups Pekka Parviainen Samuel Kaski Helsinki Institute for Information Technology HIIT Department
More informationCharacterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
Journal of Machine Learning Research 13 (2012) 24092464 Submitted 4/11; Revised 2/12; Published 8/12 Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic
More informationLecture 2: Introduction to belief (Bayesian) networks
Lecture 2: Introduction to belief (Bayesian) networks Conditional independence What is a belief network? Independence maps (Imaps) January 7, 2008 1 COMP526 Lecture 2 Recall from last time: Conditional
More informationCausal Modeling, Especially Graphical Causal Models
Causal Modeling, Especially Graphical Causal Models 36402, Advanced Data Analysis 12 April 2011 Contents 1 Causation and Counterfactuals 1 2 Causal Graphical Models 3 2.1 Calculating the effects of causes.................
More informationTheory of Computation (CS 46)
Theory of Computation (CS 46) Sets and Functions We write 2 A for the set of subsets of A. Definition. A set, A, is countably infinite if there exists a bijection from A to the natural numbers. Note. This
More informationFundamentals of probability /15.085
Fundamentals of probability. 6.436/15.085 LECTURE 23 Markov chains 23.1. Introduction Recall a model we considered earlier: random walk. We have X n = Be(p), i.i.d. Then S n = 1 j n X j was defined to
More informationBeware of the DAG! Abstract. 1. Introduction
JMLR: Workshop and Conference Proceedings 6: 59 86 NIPS 2008 Workshop on Causality Beware of the DAG! A. Philip Dawid APD@STATSLAB.CAM.AC.UK Statistical Laboratory University of Cambridge Wilberforce Road
More informationExamples. For φ > 1, we have: 4 E(X t E(X t X t 1, X t 2,...)) 2 = E(X t E(X t X t 1 )) 2 = σ 2 ε. 1 X t = ε t+1
Examples For an independent white noise (ε t ) t Z, we consider a stochastic process X satisfying for all t Z the recursion X t = φx t 1 + ε t for some φ R. Then we have in case of φ < 1: 1 X t = ε t +
More informationDiscrete chain graph models
Discrete chain graph models Mathias Drton Department of Statistics, University of Chicago, Chicago, IL 60637 email: drton@galton.uchicago.edu Abstract: The statistical literature discusses different types
More informationNew Complexity Results for MAP in Bayesian Networks
New Complexity Results for MAP in Bayesian Networks Dalle Molle Institute for Artificial Intelligence Switzerland IJCAI, 2011 Bayesian nets Directed acyclic graph (DAG) with nodes associated to (categorical)
More informationAn algorithm to find a perfect map for graphoid structures
An algorithm to find a perfect map for graphoid structures Marco Baioletti 1 Giuseppe Busanello 2 Barbara Vantaggi 2 1 Dip. Matematica e Informatica, Università di Perugia, Italy, email: baioletti@dipmat.unipg.it
More informationExamples and Proofs of Inference in Junction Trees
Examples and Proofs of Inference in Junction Trees Peter Lucas LIAC, Leiden University February 4, 2016 1 Representation and notation Let P(V) be a joint probability distribution, where V stands for a
More informationBayesian networks. Bayesian Networks. Example. Example. Chapter 14 Section 1, 2, 4
Bayesian networks Bayesian Networks Chapter 14 Section 1, 2, 4 A simple, graphical notation for conditional independence assertions and hence for compact specification of full joint distributions Syntax:
More informationBayesian networks. 1 Random variables and graphical models. Charles Elkan. October 23, 2012
Bayesian networks Charles Elkan October 23, 2012 Important: These lecture notes are based closely on notes written by Lawrence Saul. Text may be copied directly from his notes, or paraphrased. Also, these
More informationCHAPTER 2 Estimating Probabilities
CHAPTER 2 Estimating Probabilities Machine Learning Copyright c 2016. Tom M. Mitchell. All rights reserved. *DRAFT OF January 24, 2016* *PLEASE DO NOT DISTRIBUTE WITHOUT AUTHOR S PERMISSION* This is a
More information15: Mean Field Approximation and Topic Models
10708: Probabilistic Graphical Models 10708, Spring 2014 15: Mean Field Approximation and Topic Models Lecturer: Eric P. Xing Scribes: Jingwei Shen (Mean Field Approximation), Jiwei Li (Topic Models)
More informationProbabilistic Graphical Models Final Exam
Introduction to Probabilistic Graphical Models Final Exam, March 2007 1 Probabilistic Graphical Models Final Exam Please fill your name and I.D.: Name:... I.D.:... Duration: 3 hours. Guidelines: 1. The
More information3. Markov property. Markov property for MRFs. HammersleyClifford theorem. Markov property for Bayesian networks. Imap, Pmap, and chordal graphs
Markov property 33. Markov property Markov property for MRFs HammersleyClifford theorem Markov property for ayesian networks Imap, Pmap, and chordal graphs Markov Chain X Y Z X = Z Y µ(x, Y, Z) = f(x,
More informationConstructing Bayesian Network Models of Gene Expression Networks from Microarray Data
Constructing Bayesian Network Models of Gene Expression Networks from Microarray Data Peter Spirtes a, Clark Glymour b, Richard Scheines a, Stuart Kauffman c, Valerio Aimale c, Frank Wimberly c a Department
More informationBayesian Networks Tutorial I Basics of Probability Theory and Bayesian Networks
Bayesian Networks 2015 2016 Tutorial I Basics of Probability Theory and Bayesian Networks Peter Lucas LIACS, Leiden University Elementary probability theory We adopt the following notations with respect
More informationProbabilistic EntityRelationship Models, PRMs, and Plate Models
Probabilistic EntityRelationship Models, PRMs, and Plate Models David Heckerman Christopher Meek One Microsoft Way, Redmond, WA 98052 Daphne Koller Computer Science Department, Stanford, CA 94305 heckerma@microsoft.com
More informationEconomic Growth and Development: Problem set for class 1
Economic Growth and Development: Problem set for class 1 1. Dynamic optimization. Using the mathematical appendix in Barro and SalaiMartin examine how we obtain the firstorder conditions for a dynamic
More information