Judea Pearl University of California Los Angeles CAUSAL REASONING FOR DECISION AIDING SYSTEMS.

Slides:



Advertisements
Similar presentations
Department of Computer Science
Advertisements

RELATED CLASS CS 262 Z – SEMINAR IN CAUSAL MODELING CURRENT TOPICS IN COGNITIVE SYSTEMS INSTRUCTOR: JUDEA PEARL Spring Quarter Monday and Wednesday, 2-4pm.
1 WHAT'S NEW IN CAUSAL INFERENCE: From Propensity Scores And Mediation To External Validity Judea Pearl University of California Los Angeles (
CAUSES AND COUNTERFACTUALS Judea Pearl University of California Los Angeles (
1 THE SYMBIOTIC APPROACH TO CAUSAL INFERENCE Judea Pearl University of California Los Angeles (
Structural Reliability Analysis – Basics
Copyright © 2006 Addison-Wesley. All rights reserved. 3.5 Dynamic Semantics Meanings of expressions, statements, and program units Static semantics – type.
COMMENTS ON By Judea Pearl (UCLA). notation 1990’s Artificial Intelligence Hoover.
Lecture 4 This week’s reading: Ch. 1 Today:
THEORY AND APPLICATIONS OF CAUSAL REASONING CONGNITIVE SYSTEMS LABORATORY UCLA Judea Pearl and Jin Tian Model Correctness Mark Hopkins LAYER WIDTH: A New.
1 CAUSAL INFERENCE: MATHEMATICAL FOUNDATIONS AND PRACTICAL APPLICATIONS Judea Pearl University of California Los Angeles (
7.4 Function Notation and Linear Functions
Linear Programming Models: Graphical and Computer Methods
CAUSES AND COUNTERFACTUALS OR THE SUBTLE WISDOM OF BRAINLESS ROBOTS.
1 WHAT'S NEW IN CAUSAL INFERENCE: From Propensity Scores And Mediation To External Validity Judea Pearl University of California Los Angeles (
Bayes Net Perspectives on Causation and Causal Inference
Chapter 0 – Objectives Solve for a variable in one-variable equations ex: Solve -3(x+5) = 10 Solve for a variable in two-variable equations ex: Solve.
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 (
Judea Pearl Computer Science Department UCLA DIRECT AND INDIRECT EFFECTS.
Unpacking the EOC Algebra I Release Items Eligible Texas Essential Knowledge and Skills Texas Education Agency Student Assessment Division Fall 2010.
Judea Pearl University of California Los Angeles ( THE MATHEMATICS OF CAUSE AND EFFECT.
___________________________________________________________________________ Operations Research  Jan Fábry Linear Programming.
___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry Linear Programming.
2.3 Introduction to Functions
Compound Absolute Values Equalities and Inequalities More than one absolute value in the equation.
One model for the growth of a population is based on the assumption that the population grows at a rate proportional to the size of the population. That.
REASONING WITH CAUSE AND EFFECT Judea Pearl Department of Computer Science UCLA.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
Correlation Assume you have two measurements, x and y, on a set of objects, and would like to know if x and y are related. If they are directly related,
CAUSES AND COUNTERFACTIALS IN THE EMPIRICAL SCIENCES Judea Pearl University of California Los Angeles (
REASONING WITH CAUSE AND EFFECT Judea Pearl Department of Computer Science UCLA.
Math I Cluster Quiz Data. Math I Unit 2 Represent & Solve Equations & Inequalities Graphically.
CHAPTER 5 Probability Theory (continued) Introduction to Bayesian Networks.
THE MATHEMATICS OF CAUSE AND COUNTERFACTUALS Judea Pearl University of California Los Angeles (
1 BA 555 Practical Business Analysis Linear Programming (LP) Sensitivity Analysis Simulation Agenda.
Impact Evaluation Sebastian Galiani November 2006 Causal Inference.
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.
Understanding Naturally Conveyed Explanations of Device Behavior Michael Oltmans and Randall Davis MIT Artificial Intelligence Lab.
Prepared by Amira Selim 31 st October 2009 Revised by Dahlia Biazid Requirements Analysis.
Chapter 2: Linear Equations and Functions Section 2.1: Represent Relations and Functions.
© 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
An Introduction to Linear Programming
Operations Research Chapter one.
CS 188: Artificial Intelligence Spring 2007
Linear Programming Dr. T. T. Kachwala.
College Algebra Chapter 2 Functions and Graphs
National 4 Mathematics.
Department of Computer Science
Introduction to Functions
Chen Avin Ilya Shpitser Judea Pearl Computer Science Department UCLA
Department of Computer Science
Solve Systems of Linear Inequalities
A MACHINE LEARNING EXERCISE
CS 188: Artificial Intelligence
University of California
Introduction.
CS 188: Artificial Intelligence Fall 2007
CS 188: Artificial Intelligence Fall 2008
College Algebra Chapter 2 Functions and Graphs
1.5 Linear Inequalities.
Math I Quarter I Standards
Computer Science and Statistics
CS 188: Artificial Intelligence Spring 2007
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
THE MATHEMATICS OF PROGRAM EVALUATION
Department of Computer Science
CAUSAL REASONING FOR DECISION AIDING SYSTEMS
Presentation transcript:

Judea Pearl University of California Los Angeles CAUSAL REASONING FOR DECISION AIDING SYSTEMS

PROBLEM STATEMENT Coherent fusion of information for situation assessment and COA evaluation under uncertainty. Friendly language for inputting new information and answering mission-related queries.

FLEXIBLE QUERIES AND ANSWERS Q Q What does it (new evidence) mean? A A It means that you can no longer expect to accomplish task A in two hours, unless you ensure that B does not happen. Q Q How come it took me six hours? A A It was probably due to the heavy rains. Thus, it would have been better to use unit-201, instead of unit-200.

REQUIREMENTS FOR FLEXIBLE QUERIES Understanding of causal relationships in the domain. Causal Interpretation of new evidence. Interpretation of causal queries. Automatic generation of explanations, using causal and counterfactual relationships.

COUNTERFACTUALS: STRUCTURAL SEMANTICS Notation: Y x (u) = y Abbreviation: y x Formal: Y has the value y in the solution to a mutilated system of equations, where the equation for X is replaced by a constant X=x. u Y x (u)=y Z W X=x u Y Z W X Probability of Counterfactuals: Functional Bayes Net

TYPES OF QUERIES Inference to four types of claims: 1.Effects of potential interventions, 2.Claims about attribution (responsibility) 3.Claims about direct and indirect effects 4.Claims about explanations

THE OVERRIDING THEME 1. Define Q(M) as a counterfactual expression 2. Determine conditions for the reduction 3. If reduction is feasible, Q is inferable. Demonstrated on three types of queries: Q 1 : P(y|do(x)) Causal Effect (= P(Y x =y) ) Q 2 : P(Y x = y | x, y) Probability of necessity Q 3 : Direct Effect

OUTLINE Review: Causal analysis in COA evaluation Progress report: 1.Model Correctness – J. Pearl 2.Causal Effects – J. Tian 3.Identifications in Linear Systems – C. Brito 4.Actual Causation and Explanations – M. Hopkins 5.Qualitative Planning Under Uncertainty – B. Bonet

CORRECTNESS and CORROBORATION Data D corroborates structure S if S is (i) falsifiable and (ii) compatible with D. Falsifiability: P*(S)  P* Types of constraints: 1. conditional independencies 2. inequalities (for restricted domains) 3. functional Constraints implied by S P*P* P*(S) D (Data) e.g., wxyz

FROM CORROBORATING MODELS TO CORROBORATING CLAIMS A corroborated structure can imply identifiable yet uncorroborated claims. e.g., xyxy a

FROM CORROBORATING MODELS TO CORROBORATING CLAIMS A corroborated structure can imply identifiable yet uncorroborated claims. e.g., xyxy a = 0

FROM CORROBORATING MODELS TO CORROBORATING CLAIMS A corroborated structure can imply identifiable yet uncorroborated claims. e.g., xyzxy a a xyz b Some claims can be more corroborated than others.

FROM CORROBORATING MODELS TO CORROBORATING CLAIMS A corroborated structure can imply identifiable yet uncorroborated claims. e.g., xyzxy a a xyz b Some claims can be more corroborated than others.

FROM CORROBORATING MODELS TO CORROBORATING CLAIMS A corroborated structure can imply identifiable yet uncorroborated claims. e.g., xyzxy a Definition: An identifiable claim C is corroborated by data if some minimal set of assumptions in S sufficient for identifying C is corroborated by the data. Graphical criterion: minimal substructure = maximal supergraph a xyz b Some claims can be more corroborated than others.

A corroborated structure can imply identifiable yet uncorroborated claims. e.g., a xyzxyz ab xyz FROM CORROBORATING MODELS TO CORROBORATING CLAIMS Some claims can be more corroborated than others. Definition: An identifiable claim C is corroborated by data if some minimal set of assumptions in S sufficient for identifying C is corroborated by the data. Graphical criterion: minimal substructure = maximal supergraph

OUTLINE Review: Causal analysis in COA evaluation Progress report: 1.Model Correctness – J. Pearl 2.Causal Effects – J. Tian 3.Identifications in Linear Systems – C. Brito 4.Actual Causation and Explanations – M. Hopkins 5.Qualitative Planning Under Uncertainty – B. Bonet