Judea Pearl Computer Science Department UCLA www.cs.ucla.edu/~judea ROBUSTNESS OF CAUSAL CLAIMS.

Slides:



Advertisements
Similar presentations
Department of Computer Science
Advertisements

Linear Programming Problem
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
QUADRATIC EQUATIONS.
1 WHAT'S NEW IN CAUSAL INFERENCE: From Propensity Scores And Mediation To External Validity Judea Pearl University of California Los Angeles (
Inequalities in One Triangle
1 THE SYMBIOTIC APPROACH TO CAUSAL INFERENCE Judea Pearl University of California Los Angeles (
Inexact SQP Methods for Equality Constrained Optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
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.
COMMENTS ON By Judea Pearl (UCLA). notation 1990’s Artificial Intelligence Hoover.
THEORY AND APPLICATIONS OF CAUSAL REASONING CONGNITIVE SYSTEMS LABORATORY UCLA Judea Pearl and Jin Tian Model Correctness Mark Hopkins LAYER WIDTH: A New.
1 MF-852 Financial Econometrics Lecture 2 Matrix Operations in Econometrics, Optimization with Excel Roy J. Epstein Fall 2003.
Judea Pearl University of California Los Angeles CAUSAL REASONING FOR DECISION AIDING SYSTEMS.
Computability and Complexity 24-1 Computability and Complexity Andrei Bulatov Approximation.
1 gR2002 Peter Spirtes Carnegie Mellon University.
Linear Programming – Max Flow – Min Cut Orgad Keller.
Causal Models, Learning Algorithms and their Application to Performance Modeling Jan Lemeire Parallel Systems lab November 15 th 2006.
1 CAUSAL INFERENCE: MATHEMATICAL FOUNDATIONS AND PRACTICAL APPLICATIONS Judea Pearl University of California Los Angeles (
SIMPSON’S PARADOX, ACTIONS, DECISIONS, AND FREE WILL Judea Pearl UCLA
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
1 WHAT'S NEW IN CAUSAL INFERENCE: From Propensity Scores And Mediation To External Validity Judea Pearl University of California Los Angeles (
Bayes’ Nets  A Bayes’ net is an efficient encoding of a probabilistic model of a domain  Questions we can ask:  Inference: given a fixed BN, what is.
CAUSAL INFERENCE IN THE EMPIRICAL SCIENCES Judea Pearl University of California Los Angeles (
1 REASONING WITH CAUSES AND COUNTERFACTUALS Judea Pearl UCLA (
Linking graphs and systems of equations Graph of a linear equation Graphical solutions to systems.
Primal-Dual Meets Local Search: Approximating MST’s with Non-uniform Degree Bounds Author: Jochen Könemann R. Ravi From CMU CS 3150 Presentation by Dan.
Judea Pearl Computer Science Department UCLA DIRECT AND INDIRECT EFFECTS.
Simple Linear Regression Models
Applied Discrete Mathematics Week 13: Boolean Algebra
Nov. 20, 2010 A pessimistic one-step diagnosis algorithms for cube-like networks under the PMC model Dr. C. H. Tsai Department of C.S.I.E, National Dong.
Judea Pearl University of California Los Angeles ( THE MATHEMATICS OF CAUSE AND EFFECT.
Feature Selection and Causal discovery Isabelle Guyon, Clopinet André Elisseeff, IBM Zürich Constantin Aliferis, Vanderbilt University.
Chapter 6 Supplement Linear Programming.
Course files
Normal distributions Theorem: Let X,Y normally distributed independent stochastic variables with mean and variance respectively. Then Y-X is normally distributed.
INTERVENTIONS AND INFERENCE / REASONING. Causal models  Recall from yesterday:  Represent relevance using graphs  Causal relevance ⇒ DAGs  Quantitative.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Conditional Probability Distributions Eran Segal Weizmann Institute.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
THE MATHEMATICS OF CAUSE AND COUNTERFACTUALS Judea Pearl University of California Los Angeles (
Chapter 6 Questions Quick Quiz
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Causal Model Ying Nian Wu UCLA Department of Statistics July 13, 2007 IPAM Summer School.
Managerial Economics Linear Programming Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr.
CAUSAL REASONING FOR DECISION AIDING SYSTEMS COGNITIVE SYSTEMS LABORATORY UCLA Judea Pearl, Mark Hopkins, Blai Bonet, Chen Avin, Ilya Shpitser.
LIMITS OF FUNCTIONS. CONTINUITY Definition (p. 110) If one or more of the above conditions fails to hold at C the function is said to be discontinuous.
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.
1 Comments Yutaka Kano Osaka University
1 BN Semantics 1 Graphical Models – Carlos Guestrin Carnegie Mellon University September 15 th, 2006 Readings: K&F: 3.1, 3.2, 3.3.
Summary: connecting the question to the analysis(es) Jay S. Kaufman, PhD McGill University, Montreal QC 26 February :40 PM – 4:20 PM National Academy.
1 Day 2: Search June 9, 2015 Carnegie Mellon University Center for Causal Discovery.
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Basic Definitions and Terminology
Managerial Economics Linear Programming
Excel Solver.
Copyright © Cengage Learning. All rights reserved.
University of California
A Bayesian Approach to Learning Causal networks
Chen Avin Ilya Shpitser Judea Pearl Computer Science Department UCLA
Department of Computer Science
Linear Programming Duality, Reductions, and Bipartite Matching
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Linear Programming Problem
From Propensity Scores And Mediation To External Validity
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Department of Computer Science
CAUSAL REASONING FOR DECISION AIDING SYSTEMS
Presentation transcript:

Judea Pearl Computer Science Department UCLA ROBUSTNESS OF CAUSAL CLAIMS

ROBUSTNESS: MOTIVATION The effect of smoking on cancer is, in general, non-identifiable (from observational studies). Smoking x y Genetic Factors (unobserved) Cancer u In linear systems: y =  x +   is non-identifiable. 

ROBUSTNESS: MOTIVATION Z – Instrumental variable; cov( z,u ) = 0 Smoking y Genetic Factors (unobserved) Cancer  u x Z Price of Cigarettes   is identifiable

ROBUSTNESS: MOTIVATION Problem with Instrumental Variables: The model may be wrong! Smoking Z Price of Cigarettes  x y Genetic Factors (unobserved) Cancer  u

Smoking ROBUSTNESS: MOTIVATION Z1Z1 Price of Cigarettes  Solution: Invoke several instruments Surprise:  1 =  2 model is likely correct x y Genetic Factors (unobserved) Cancer  u Peer Pressure Z2Z2 

ROBUSTNESS: MOTIVATION Z1Z1 Price of Cigarettes  x y Genetic Factors (unobserved) Cancer  u Peer Pressure Z2Z2  Smoking Greater surprise:  1 =  2 =  3 ….=  n = q Claim  = q is highly likely to be correct Z3Z3 ZnZn Anti-smoking Legislation

ROBUSTNESS: MOTIVATION xy Genetic Factors (unobserved) Cancer  u Smoking Symptoms do not act as instruments  remains non-identifiable s Symptom Why? Taking a noisy measurement ( s ) of an observed variable ( y ) cannot add new information

ROBUSTNESS: MOTIVATION x Genetic Factors (unobserved) Cancer  u Smoking Adding many symptoms does not help.  remains non-identifiable y Symptom S1S1 S2S2 SnSn

ROBUSTNESS: MOTIVATION Find if  can evoke an equality surprise  1 =  2 = …  n associated with several independent estimands of  x y  Given a parameter  in a general graph Formulate: Surprise, over-identification, independence Robustness: The degree to which  is robust to violations of model assumptions

ROBUSTNESS: FORMULATION Bad attempt: Parameter  is robust (over identifies) f 1, f 2 : Two distinct functions if:

ROBUSTNESS: FORMULATION exex eyey ezez xyz bc x = e x y = bx + e y z = cy + e z R yx = b R zx = bc R zy = c constraint: (b) (c) y → z irrelvant to derivation of b

RELEVANCE: FORMULATION Definition 8 Let A be an assumption embodied in model M, and p a parameter in M. A is said to be relevant to p if and only if there exists a set of assumptions S in M such that S and A sustain the identification of p but S alone does not sustain such identification. Theorem 2 An assumption A is relevant to p if and only if A is a member of a minimal set of assumptions sufficient for identifying p.

ROBUSTNESS: FORMULATION Definition 5 (Degree of over-identification) A parameter p (of model M ) is identified to degree k (read: k -identified) if there are k minimal sets of assumptions each yielding a distinct estimand of p.

ROBUSTNESS: FORMULATION xy b z c Minimal assumption sets for c. x y z c x y z c G3G3 G2G2 x y z c G1G1 Minimal assumption sets for b. x y b z

FROM MINIMAL ASSUMPTION SETS TO MAXIMAL EDGE SUPERGRAPHS FROM PARAMETERS TO CLAIMS Definition A claim C is identified to degree k in model M (graph G ), if there are k edge supergraphs of G that permit the identification of C, each yielding a distinct estimand. TE ( x,z ) = R zx TE ( x,z ) = R zx Rzy ·x x y z x y z e.g., Claim: (Total effect) TE (x,z) = q x y z

CONCLUSIONS 1.Formal definition to ROBUSTNESS of causal claims: “A claim is robust when it is insensitive to violations of some of the model assumptions” 2.Graphical criteria and algorithms for computing the degree of robustness of a given causal claim.