THEORY AND APPLICATIONS OF CAUSAL REASONING CONGNITIVE SYSTEMS LABORATORY UCLA Judea Pearl and Jin Tian Model Correctness Mark Hopkins LAYER WIDTH: A New.

Slides:



Advertisements
Similar presentations
Explanation-Based Learning (borrowed from mooney et al)
Advertisements

Dr. Alexandra I. Cristea CS 319: Theory of Databases: C3.
Discovering Cyclic Causal Models by Independent Components Analysis Gustavo Lacerda Peter Spirtes Joseph Ramsey Patrik O. Hoyer.
1. Person 1 1.Stress 2.Depression 3. Religious Coping Task: learn causal model 2 Data from Bongjae Lee, described in Silva et al
Weakening the Causal Faithfulness Assumption
Bayesian Networks, Winter Yoav Haimovitch & Ariel Raviv 1.
Outline 1)Motivation 2)Representing/Modeling Causal Systems 3)Estimation and Updating 4)Model Search 5)Linear Latent Variable Models 6)Case Study: fMRI.
1 THE SYMBIOTIC APPROACH TO CAUSAL INFERENCE Judea Pearl University of California Los Angeles (
Convexity of Point Set Sandip Das Indian Statistical Institute.
THE MATHEMATICS OF CAUSAL MODELING Judea Pearl Department of Computer Science UCLA.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering An Introduction to Pearl’s Do-Calculus of Intervention Marco Valtorta Department.
Learning Causality Some slides are from Judea Pearl’s class lecture
COMMENTS ON By Judea Pearl (UCLA). notation 1990’s Artificial Intelligence Hoover.
Causal Networks Denny Borsboom. Overview The causal relation Causality and conditional independence Causal networks Blocking and d-separation Excercise.
Discovery of Conservation Laws via Matrix Search Oliver Schulte and Mark S. Drew School of Computing Science Simon Fraser University Vancouver, Canada.
ECE 331 – Digital System Design
Linear Functions and Modeling
FDImplication: 1 Functional Dependencies (FDs) Let r(R) be a relation and let t  r, then the restriction of t to X  R, written t[X], is the projection.
Bayesian Network Representation Continued
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Causal Diagrams and the Identification of Causal Effects A presentation of.
Judea Pearl University of California Los Angeles CAUSAL REASONING FOR DECISION AIDING SYSTEMS.
Identifying Conflicts in Overconstrained Temporal Problems Mark H. Liffiton, Michael D. Moffitt, Martha E. Pollack, and Karem A. Sakallah University of.
Proving Incompleteness {NAND} is a complete system Is {XOR,0} a complete system?
Dr. Alexandra I. Cristea CS 319: Theory of Databases: C3.
Causal Modeling for Anomaly Detection Andrew Arnold Machine Learning Department, Carnegie Mellon University Summer Project with Naoki Abe Predictive Modeling.
Simplifying Boolean Expressions Using K-Map Method
SIMPSON’S PARADOX, ACTIONS, DECISIONS, AND FREE WILL Judea Pearl UCLA
constructions The Perpendicular bisector of a Line.
Consumption, Production, Welfare B: Consumer Behaviour Univ. Prof. dr. Maarten Janssen University of Vienna Winter semester 2013.
Judea Pearl University of California Los Angeles ( THE MATHEMATICS OF CAUSE AND EFFECT.
Combinatorial Algorithms Unate Covering Binate Covering Graph Coloring Maximum Clique.
1 Structured Region Graphs: Morphing EP into GBP Max Welling Tom Minka Yee Whye Teh.
SIMPSON’S PARADOX, ACTIONS, DECISIONS, AND FREE WILL Judea Pearl UCLA
THE MATHEMATICS OF CAUSE AND EFFECT: With Reflections on Machine Learning Judea Pearl Departments of Computer Science and Statistics UCLA.
Steering witnesses and criteria for the (non-)existence of local hidden state (LHS) models Eric Cavalcanti, Steve Jones, Howard Wiseman Centre for Quantum.
The Nature of Modeling and Modeling Nature. “The sciences do not try to explain, they hardly even try to interpret, they mainly make models… The justification.
On Reducing the Global State Graph for Verification of Distributed Computations Vijay K. Garg, Arindam Chakraborty Parallel and Distributed Systems Laboratory.
5x 4 – 405 = 5(x 4 – 81) = 5(x 2 + 9)(x 2 – 9) = 5(x 2 + 9)(x + 3)(x – 3) by D. Fisher.
REASONING WITH CAUSE AND EFFECT Judea Pearl Department of Computer Science UCLA.
COE 202: Digital Logic Design Combinational Logic Part 4
Bellwork Name all the angles that have the vertex B. 1) 2) 3) 4) a. Translate
Notes on local determinism Days 12, 13 and 14 of Comp Sci 480.
REASONING WITH CAUSE AND EFFECT Judea Pearl Department of Computer Science UCLA.
1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.
1 Bayesian Networks (Directed Acyclic Graphical Models) The situation of a bell that rings whenever the outcome of two coins are equal can not be well.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Judea Pearl Computer Science Department UCLA ROBUSTNESS OF CAUSAL CLAIMS.
CAUSAL REASONING FOR DECISION AIDING SYSTEMS COGNITIVE SYSTEMS LABORATORY UCLA Judea Pearl, Mark Hopkins, Blai Bonet, Chen Avin, Ilya Shpitser.
Mediation: The Causal Inference Approach David A. Kenny.
1 CONFOUNDING EQUIVALENCE Judea Pearl – UCLA, USA Azaria Paz – Technion, Israel (
1 Objectives State the inequalities that relate angles and lengths of sides in a triangle State the possible lengths of three sides of a triangle.
1 BN Semantics 2 – Representation Theorem The revenge of d-separation Graphical Models – Carlos Guestrin Carnegie Mellon University September 17.
Characteristics of Science A limited discipline that studies only naturally occurring events, while offering natural explanations for the phenomenon under.
4. Find & copy the definition of a parallelogram and label the quadrilateral so it satisfies the definition. _________________________________________________.
On Abductive Equivalence Katsumi Inoue National Institute of Informatics Chiaki Sakama Wakayama University MBR
Computer Systems Laboratory Stanford University Clark W. Barrett David L. Dill Aaron Stump A Framework for Cooperating Decision Procedures.
1 Day 2: Search June 9, 2015 Carnegie Mellon University Center for Causal Discovery.
1 Day 2: Search June 14, 2016 Carnegie Mellon University Center for Causal Discovery.
Using Directed Acyclic Graphs (DAGs) to assess confounding Glenys Webster & Anne Harris May 14, 2007 St Paul’s Hospital Statistical “Rounds”
CHAPTER 6 Quine-McCluskey Method
5-5 Inequalities in Triangles
CS 352 Introduction to Logic Design
Department of Computer Science
Boolean Algebra.
Clique Tree & Independence
Computer Science and Statistics
Space groups Start w/ 2s and 21s 222.
Describe the series of translations it would take to map ∆LJK to ∆PMN
Task-Dependent Qualitative Model Abstraction
CAUSAL REASONING FOR DECISION AIDING SYSTEMS
Presentation transcript:

THEORY AND APPLICATIONS OF CAUSAL REASONING CONGNITIVE SYSTEMS LABORATORY UCLA Judea Pearl and Jin Tian Model Correctness Mark Hopkins LAYER WIDTH: A New Measure of DAG’s Size Blai Bonet Labeled RTDP: A Fast Dynamic Programming Algorithm Carlos Brito Graphical Methods for Identifying SEM

STRUCTURES, DATA, AND CORRECTNESS OBSERVATIONAL DATA ( P(A,B,C,D)) ABCD YESNOHIGHYES NOYESHIGHYES NO LOWNO … EXPERIMENTAL DATA ( P B=yes (A,B,C,D)) ABCD YES LOWYES NOYESHIGHNO YESLOWYES … ABC U D Genetic factor Cancer Tar in LungsSmoking Stress U is unobservable (unobserved)

MODEL CORRECTNESS Correctness: 1. 1.The structure has empirical implications 2. 2.Empirical data complies with those implications 3. 3.The structure given is the only one to satisfy 1-2. If 1 and 2 are satisfied, we say that the data “corroborates” the structure. Empirical implications may be observational or experimental. Given a structure of a model, in what sense can we assert that the structure is “correct”?

STRUCTURES AND IMPLICATIONS CONSIDERED ObservationalExperimental Specific Markovian Specific Semi Markovian Generic Markovian Generic Semi Markovian CI d -separation, complete Pearl, 2000 (Complete) Tian & Pearl (Complete) Algorithmic IC, Sprites et al. (Complete) Tian & Pearl Incomplete? Algorithmic IC*, Sprites et al. (Incomplete?) CI + functional (Tian & Pearl) Q -decomposition (Tian & Pearl)

MODEL CORRECTNESS Given a structure of a model, in what sense can we assert that the structure is “correct”? Correctness: 1. 1.The structure has empirical implications Empiricial data complies with those implications The structure given is the only one to satisfy 1-2. If 1 and 2 are satisfied, we say that the data “corroborates” the structure. Empiricial implications may be observational or experimental. CLAIM a claim implied by Need to define: 1.Substructure essential for claim 2.Data corroborates claim

a = r YX xyxy a StructureClaim e.g., FROM CORROBORATING MODELS TO CORROBORATING CLAIMS Is the claim a = r YX corroborated? No! Because the assumption r s = 0 is essential for the claim and no data can corroborate this assumption. xyxy a rsrs a = r YX - r s

FROM CORROBORATING MODELS TO CORROBORATING CLAIMS e.g., StructureClaim b = r ZY Is the claim b = r ZY corroborated? YES! Because the assumption needed for entailing this claim, r b = 0, can be tested: b xyzxy a b xy z xy a r ZX = r YX r ZY rbrb Note: Assumption r a = 0 cannot be tested. rara

WHEN IS AN ASSUMPTION NEEDED? Definition (Relevance): Assumption A is relevant to claim C iff there exists a set S of assumptions in the model such that Definition: A claim C is corroborated by data iff the sum total of all assumptions relevant to C is corroborated by data.

a GRAPHICAL CRITERION FOR CORROBORATED CLAIMS Theorem: An identifiable claim C is corroborated by data if The intersection of all maximal supergraphs sufficient for identifying C is corroborated by the data. b a xyz b e.g., xyx a xyz Maximal supergraph for claim a = a 0

GRAPHICAL CRITERION FOR CORROBORATED CLAIMS Theorem: An identifiable claim C is corroborated by data if The intersection of all maximal supergraphs sufficient for identifying C is corroborated by the data. e.g., b a xyzxyx b a xyz ab a xyzxyx b a xyzxyx b a xyz Intersection: xyx Maximal supergraphs:

SOME CLAIMS ARE MORE CORROBORATED THAN OTHERS G ( C ) = Intersection of all maximal supergraphs sufficient for identifying C. Definition: Claim C 1 is more corroborated than claim C 2 if the constraints induced by G ( C 1 ) entail those induced by G ( C 2 ).

The strongest sense in which one can proclaim a model "correct" is that the data comply with the observational or experimental implication of the model. Jin has explicated those implications for both Markovian and Semi-Markovian structures. I have extended these considerations from models to claims, and obtained graphical criteria for determining in what sense a specific claim C can be proclaimed "correct". CONCLUSIONS