When are Graphical Causal Models not Good Models? CAPITS 2008 Jan Lemeire September 12 th 2008.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

LEUCEMIA MIELOIDE AGUDA TIPO 0
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Bellwork If you roll a die, what is the probability that you roll a 2 or an odd number? P(2 or odd) 2. Is this an example of mutually exclusive, overlapping,
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 5 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING Think Distributive property backwards Work down, Show all steps ax + ay = a(x + y)
Addition Facts
1 Learning Touchmath *Graphics taken from
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions Numbers and number system Numbers and the number system, fractions, decimals, proportion & probability.
ZMQS ZMQS
Correctness of Gossip-Based Membership under Message Loss Maxim GurevichIdit Keidar Technion.
Solve Multi-step Equations
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
ABC Technology Project
Cache and Virtual Memory Replacement Algorithms
© S Haughton more than 3?
Learning Causal Models of Multivariate Systems and the Value of it for the Performance Modeling of Computer Programs Jan Lemeire December 19 th 2007 Supervisor:
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
VOORBLAD.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Squares and Square Root WALK. Solve each problem REVIEW:
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
CS1022 Computer Programming & Principles
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
1 Using Bayesian Network for combining classifiers Leonardo Nogueira Matos Departamento de Computação Universidade Federal de Sergipe.
Addition 1’s to 20.
25 seconds left…...
Slippery Slope
Test B, 100 Subtraction Facts
Finite-state Recognizers
Week 1.
Datorteknik IntegerAddSub bild 1 Integer arithmetic Depends what you mean by "integer" Assume at 3-bit string. –Then we define zero = 000 one = 001 Use.
We will resume in: 25 Minutes.
CSE 473/573 Computer Vision and Image Processing (CVIP) Ifeoma Nwogu Lecture 27 – Overview of probability concepts 1.
Dantzig-Wolfe Decomposition
A SMALL TRUTH TO MAKE LIFE 100%
1 Unit 1 Kinematics Chapter 1 Day
IP, IST, José Bioucas, Probability The mathematical language to quantify uncertainty  Observation mechanism:  Priors:  Parameters Role in inverse.
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
Simple Linear Regression Analysis
How Cells Obtain Energy from Food
What is the experimental unit in premix bioequivalence ? June 2010 Didier Concordet
1 Undirected Graphical Models Graphical Models – Carlos Guestrin Carnegie Mellon University October 29 th, 2008 Readings: K&F: 4.1, 4.2, 4.3, 4.4,
On the random structure of behavioural transition systems. Jan Friso Groote, Remco van der Hofstad, Matthias Raffelsieper.
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
1Causality & MDL Causal Models as Minimal Descriptions of Multivariate Systems Jan Lemeire June 15 th 2006.
Causal Models, Learning Algorithms and their Application to Performance Modeling Jan Lemeire Parallel Systems lab November 15 th 2006.
1Causal Performance Models Causal Models for Performance Analysis of Computer Systems Jan Lemeire TELE lab May 24 th 2006.
Presentation transcript:

When are Graphical Causal Models not Good Models? CAPITS 2008 Jan Lemeire September 12 th 2008

Pag. Jan Lemeire / 22 2 When are Causal Models not Good Models? The Kolmogorov Minimal Sufficient Statistic (KMSS). Bayesian Networks as Minimal Descriptions of Probability Distributions. When the minimal Bayesian network is the KMSS. When the minimal Bayesian network is NOT the KMSS.

Pag. Jan Lemeire / 22 3 When are Causal Models not Good Models? The Kolmogorov Minimal Sufficient Statistic (KMSS). Bayesian Networks as Minimal Descriptions of Probability Distributions. When the minimal Bayesian network is the KMSS. When the minimal Bayesian network is NOT the KMSS.

Pag. Jan Lemeire / 22 4 When are Causal Models not Good Models? Randomness versus Regularity Random string: incompressible, maximal complexity But: it is no meaningful information, only accidental information Regular string: compressible, low complexity repetition 12 times, 001 regularities randomness Model that minimally describes regularities (qualitative props) = Kolmogorov Minimal Sufficient Statistic (KMSS)

Pag. Jan Lemeire / 22 5 When are Causal Models not Good Models? The Kolmogorov Minimal Sufficient Statistic (KMSS). Bayesian Networks as Minimal Descriptions of Probability Distributions. When the minimal Bayesian network is the KMSS. When the minimal Bayesian network is NOT the KMSS.

Pag. Jan Lemeire / 22 6 When are Causal Models not Good Models? Description of Probability Distributions with Bayesian networks Multiple Bayesian networks select minimal one

Pag. Jan Lemeire / 22 7 When are Causal Models not Good Models? Meaningful Information of Probability Distributions meaningful information Regularities: Conditional Independencies Kolmogorov Minimal Sufficient Statistic if graph and CPDs are incompressible

Pag. Jan Lemeire / 22 8 When are Causal Models not Good Models? Representation of Independencies Graph (DAG) of a Bayesian network is a description of conditional independencies Faithfulness: All conditional independencies of the distribution are described by the graph. Theorem: If a faithful Bayesian network exists for a distribution, it is the minimal Bayesian network.

Pag. Jan Lemeire / 22 9 When are Causal Models not Good Models? Regularities cause unfaithfulness Theorem: A Bayesian network for which the concatenation of the CPDs is incompressible, is faithful.

Pag. Jan Lemeire / When are Causal Models not Good Models? The Kolmogorov Minimal Sufficient Statistic (KMSS). Bayesian Networks as Minimal Descriptions of Probability Distributions. When the minimal Bayesian network is the KMSS. When the minimal Bayesian network is NOT the KMSS.

Pag. Jan Lemeire / When are Causal Models not Good Models? When the minimal Bayesian network is the KMSS. No other regularities than the independencies present in graph Model is faithful KMSS = DAG quasi-unique and minimal decomposition of the system CPDs are independent

Pag. Jan Lemeire / When are Causal Models not Good Models? The Top-Ranked Hypothesis Each CPD corresponds to an independent part of reality, a mechanism = Modularity and autonomy possibility to predict the effect of changes to the system (interventions) Causal component = Reductionism

Pag. Jan Lemeire / When are Causal Models not Good Models? Except… World can be More Complex True Model Minimal Model There is no absolute guarantee, the KMSS might be a bit too simplistic

Pag. Jan Lemeire / When are Causal Models not Good Models? Great job, Jan!

Pag. Jan Lemeire / When are Causal Models not Good Models? The Kolmogorov Minimal Sufficient Statistic (KMSS). Bayesian Networks as Minimal Descriptions of Probability Distributions. When the minimal Bayesian network is the KMSS. When the minimal Bayesian network is NOT the KMSS.

Pag. Jan Lemeire / When are Causal Models not Good Models? When the minimal Bayesian network is NOT the KMSS… There are non-modeled regularities, DAG+CPDs is compressible A.Compressibility of an individual CPD B.Compressibility of a set of CPDs Case studies: –True Causal Model in set of minimal Bayesian networks? –Faithfulness? –Modularity?

Pag. Jan Lemeire / When are Causal Models not Good Models? (A1) Local Structure A single CPD can be described shorter, without affecting the rest of the model –Local structure [Friedman and Goldszmidt, 1996] –Context-specific independencies [Boutilier, 1996] Everything OK. ABCP(D|A, B, C)

Pag. Jan Lemeire / When are Causal Models not Good Models? (A2) Deterministic Relations Two minimal Bayesian networks. Both unfaithful Violation of the intersection condition

Pag. Jan Lemeire / When are Causal Models not Good Models? Conclusions for Compressibility of an individual CPD CPDs are independent modularity is still plausible True Causal Model in set of minimal Bayesian networks! But faithfulness may become invalid –Constraint-based algorithms may fail

Pag. Jan Lemeire / When are Causal Models not Good Models? (B1) Meta-mechanism Influence A->B->D and A->C->D exactly balance Unfaithfulness Learned correctly We may assume a global mechanism that controls mechanisms such that they neutralize –E.g. evolution

Pag. Jan Lemeire / When are Causal Models not Good Models? (B2) Markov Networks Different model class!! One of the minimal Bayesian Networks. Unfaithful & non-modular

Pag. Jan Lemeire / When are Causal Models not Good Models? Conclusions Faithfulness cannot be guaranteed Modularity cannot be guaranteed when dependent CPDs Regularities/Model class under consideration must be properly chosen Augmentation of Bayesian networks with other qualitative properties Faithfulness = ability of a model to explicitly explain all regularities of the data