QUIZ!! T/F: Probability Tables PT(X) do not always sum to one. FALSE

Slides:



Advertisements
Similar presentations
Bayesian networks Chapter 14 Section 1 – 2. Outline Syntax Semantics Exact computation.
Advertisements

Bayesian Networks CSE 473. © Daniel S. Weld 2 Last Time Basic notions Atomic events Probabilities Joint distribution Inference by enumeration Independence.
PROBABILITY. Uncertainty  Let action A t = leave for airport t minutes before flight from Logan Airport  Will A t get me there on time ? Problems :
CPSC 322, Lecture 26Slide 1 Reasoning Under Uncertainty: Belief Networks Computer Science cpsc322, Lecture 27 (Textbook Chpt 6.3) March, 16, 2009.
CS 188: Artificial Intelligence Spring 2007 Lecture 11: Probability 2/20/2007 Srini Narayanan – ICSI and UC Berkeley.
Review: Bayesian learning and inference
CPSC 422 Review Of Probability Theory.
Bayesian Networks. Motivation The conditional independence assumption made by naïve Bayes classifiers may seem to rigid, especially for classification.
CS 188: Artificial Intelligence Fall 2009 Lecture 13: Probability 10/8/2009 Dan Klein – UC Berkeley 1.
Bayesian networks Chapter 14 Section 1 – 2.
Bayesian Belief Networks
CS 188: Artificial Intelligence Fall 2009 Lecture 15: Bayes’ Nets II – Independence 10/15/2009 Dan Klein – UC Berkeley.
KI2 - 2 Kunstmatige Intelligentie / RuG Probabilities Revisited AIMA, Chapter 13.
CS 188: Artificial Intelligence Spring 2009 Lecture 15: Bayes’ Nets II -- Independence 3/10/2009 John DeNero – UC Berkeley Slides adapted from Dan Klein.
Ai in game programming it university of copenhagen Welcome to... the Crash Course Probability Theory Marco Loog.
CS 188: Artificial Intelligence Fall 2009 Lecture 14: Bayes’ Nets 10/13/2009 Dan Klein – UC Berkeley.
Bayesian networks More commonly called graphical models A way to depict conditional independence relationships between random variables A compact specification.
Uncertainty Chapter 13.
Uncertainty Chapter 13.
Bayes’ Nets [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at
Advanced Artificial Intelligence
Announcements  Midterm 1  Graded midterms available on pandagrader  See Piazza for post on how fire alarm is handled  Project 4: Ghostbusters  Due.
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.
Bayesian Networks Tamara Berg CS Artificial Intelligence Many slides throughout the course adapted from Svetlana Lazebnik, Dan Klein, Stuart Russell,
An Introduction to Artificial Intelligence Chapter 13 & : Uncertainty & Bayesian Networks Ramin Halavati
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes March 13, 2012.
CSE 473: Artificial Intelligence Spring 2012 Bayesian Networks Dan Weld Many slides adapted from Dan Klein, Stuart Russell, Andrew Moore & Luke Zettlemoyer.
Bayesian networks. Motivation We saw that the full joint probability can be used to answer any question about the domain, but can become intractable as.
Probabilistic Models  Models describe how (a portion of) the world works  Models are always simplifications  May not account for every variable  May.
1 Monte Carlo Artificial Intelligence: Bayesian Networks.
An Introduction to Artificial Intelligence Chapter 13 & : Uncertainty & Bayesian Networks Ramin Halavati
QUIZ!!  T/F: Traffic, Umbrella are cond. independent given raining. TRUE  T/F: Fire, Smoke are cond. Independent given alarm. FALSE  T/F: BNs encode.
Announcements Project 4: Ghostbusters Homework 7
Probabilistic Reasoning [Ch. 14] Bayes Networks – Part 1 ◦Syntax ◦Semantics ◦Parameterized distributions Inference – Part2 ◦Exact inference by enumeration.
Marginalization & Conditioning Marginalization (summing out): for any sets of variables Y and Z: Conditioning(variant of marginalization):
Uncertainty Chapter 13. Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule.
CHAPTER 5 Probability Theory (continued) Introduction to Bayesian Networks.
Review: Bayesian inference  A general scenario:  Query variables: X  Evidence (observed) variables and their values: E = e  Unobserved variables: Y.
Uncertainty Let action A t = leave for airport t minutes before flight Will A t get me there on time? Problems: 1.partial observability (road state, other.
CSE 473 Uncertainty. © UW CSE AI Faculty 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one has stood.
CS 511a: Artificial Intelligence Spring 2013 Lecture 13: Probability/ State Space Uncertainty 03/18/2013 Robert Pless Class directly adapted from Kilian.
PROBABILISTIC REASONING Heng Ji 04/05, 04/08, 2016.
Chapter 12. Probability Reasoning Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Artificial Intelligence Bayes’ Nets: Independence Instructors: David Suter and Qince Li Course Harbin Institute of Technology [Many slides.
CS 188: Artificial Intelligence Spring 2007
Bayesian networks Chapter 14 Section 1 – 2.
Presented By S.Yamuna AP/CSE
Bayesian networks (1) Lirong Xia Spring Bayesian networks (1) Lirong Xia Spring 2017.
Probabilistic Models Models describe how (a portion of) the world works Models are always simplifications May not account for every variable May not account.
CS 4/527: Artificial Intelligence
Quizzz Rihanna’s car engine does not start (E).
CS 4/527: Artificial Intelligence
Probability Topics Random Variables Joint and Marginal Distributions
CHAPTER 7 BAYESIAN NETWORK INDEPENDENCE BAYESIAN NETWORK INFERENCE MACHINE LEARNING ISSUES.
CS 188: Artificial Intelligence
CS 188: Artificial Intelligence Fall 2008
CAP 5636 – Advanced Artificial Intelligence
CS 188: Artificial Intelligence Fall 2007
CSE 473: Artificial Intelligence Autumn 2011
CS 188: Artificial Intelligence Fall 2007
CS 188: Artificial Intelligence Fall 2008
Probabilistic Reasoning
CAP 5636 – Advanced Artificial Intelligence
CS 188: Artificial Intelligence
CS 188: Artificial Intelligence Spring 2007
Probabilistic Reasoning
CS 188: Artificial Intelligence Spring 2006
Bayesian networks (1) Lirong Xia. Bayesian networks (1) Lirong Xia.
CS 188: Artificial Intelligence Fall 2008
Presentation transcript:

QUIZ!! T/F: Probability Tables PT(X) do not always sum to one. FALSE T/F: Conditional Probability Tables CPT(X|Y=y) always sum to one. TRUE T/F: Conditional Probability Tables CPT(X|Y) always sum to one. FALSE T/F: Marginal distr. can be computed from joint distributions. TRUE T/F: P(X|Y)P(Y)=P(X,Y)=P(Y|X)P(X). TRUE T/F: A probabilistic model is a joint distribution over a set of r.v.’s. TRUE T/F: Probabilistic inference = compute conditional probs. from joint. TRUE What is the power of Bayes Rule? Name the three steps of Inference by Enumeration. Power of Bayes Rule --- compute one condition probability from the “reverse” conditional probability + relevant priors Inference by Enumeration (on next slide!!).

Inference by Enumeration General case: Evidence variables: Query* variable: Hidden variables: We want: First, select the entries consistent with the evidence Second, sum out H to get joint of Query and evidence: Third, normalize the remaining entries to conditionalize Obvious problems: Worst-case time complexity O(dn) Space complexity O(dn) to store the joint distribution All variables d^n if you have n variables, each of which can have d different data values. Hidden variables: --- those for which you don’ * Works fine with multiple query variables, too

CSE 511a: Artificial Intelligence Spring 2012 Lecture 14: Bayes’Nets / Graphical Models 10/25/2010 Kilian Q. Weinberger Many slides adapted from Dan Klein – UC Berkeley

Last Lecture ... Probabilistic Models Inference by Enumeration Inference with Bayes Rule Works well for small problems, but what if we have many random variables?

This Lecture: Bayes Nets

Probabilistic Models Distribution over T,W A probabilistic model is a joint distribution over a set of random variables Probabilistic models: (Random) variables with domains Assignments are called outcomes Joint distributions: say whether assignments (outcomes) are likely Normalized: sum to 1.0 Ideally: only certain variables directly interact T W P hot sun 0.4 rain 0.1 cold 0.2 0.3

Probabilistic Models Models describe how (a portion of) the world works Models are always simplifications May not account for every variable May not account for all interactions between variables “All models are wrong; but some are useful.” – George E. P. Box What do we do with probabilistic models? We (or our agents) need to reason about unknown variables, given evidence Example: explanation (diagnostic reasoning) Example: prediction (causal reasoning) Example: value of information George Box: All models are wrong; some of them are useful

Probabilistic Models A probabilistic model is a joint distribution over a set of variables Given a joint distribution, we can reason about unobserved variables given observations (evidence) General form of a query: This kind of posterior distribution is also called the belief function of an agent which uses this model Stuff you care about Stuff you already know

Model for Ghostbusters Reminder: ghost is hidden, sensors are noisy T: Top sensor is red B: Bottom sensor is red G: Ghost is in the top Queries: P( +g) = ?? P( +g | +t) = ?? P( +g | +t, -b) = ?? Problem: joint distribution too large / complex Joint Distribution T B G P(T,B,G) +t +b +g 0.16 g b 0.24 0.04 t t 0.06

Independence Two variables are independent in a joint distribution if and only if: Says the joint distribution factors into a product of two simple ones Usually variables aren’t independent! Can use independence as a modeling assumption Independence can be a simplifying assumption Empirical joint distributions: at best “close” to independent What could we assume for {Weather, Traffic, Cavity}? Independence is like something from CSPs: what?

Example: Independence N fair, independent coin flips: h 0.5 t h 0.5 t h 0.5 t What about UNFAIR, independent coin flips?

Example: Independence? T P warm 0.5 cold T W P warm sun 0.4 rain 0.1 cold 0.2 0.3 T W P warm sun 0.3 rain 0.2 cold Start with the Joint Table, and here are the marginalized tables for Temperature and Weather. Is this Joint Table independent? W P sun 0.6 rain 0.4

Conditional Independence P(Toothache, Cavity, Catch) If I have a cavity, the probability that the probe catches in it doesn't depend on whether I have a toothache: P(+catch | +toothache, +cavity) = P(+catch | +cavity) The same independence holds if I don’t have a cavity: P(+catch | +toothache, cavity) = P(+catch| cavity) Catch is conditionally independent of Toothache given Cavity: P(Catch | Toothache, Cavity) = P(Catch | Cavity) Equivalent statements: P(Toothache | Catch , Cavity) = P(Toothache | Cavity) P(Toothache, Catch | Cavity) = P(Toothache | Cavity) P(Catch | Cavity) One can be derived from the other easily

Conditional Independence Unconditional (absolute) independence very rare Conditional independence is our most basic and robust form of knowledge about uncertain environments: What about this domain: Traffic Umbrella Raining Traffic Umbrella Raining. On the next slide! Fire  Smoke  Alarm

The Chain Rule Trivial decomposition: With assumption of conditional independence: Bayes’ nets / graphical models help us express conditional independence assumptions

Ghostbusters Chain Rule Each sensor depends only on where the ghost is That means, the two sensors are conditionally independent, given the ghost position T: Top square is red B: Bottom square is red G: Ghost is in the top Givens: P( +g ) = 0.5 P( +t | +g ) = 0.8 P( +t | g ) = 0.4 P( +b | +g ) = 0.4 P( +b | g ) = 0.8 P(T,B,G) = P(G) P(T|G) P(B|G) T B G P(T,B,G) +t +b +g 0.16 g b 0.24 0.04 t t 0.06

Bayes’ Nets: Big Picture Two problems with using full joint distribution tables as our probabilistic models: Unless there are only a few variables, the joint is WAY too big to represent explicitly Hard to learn (estimate) anything empirically about more than a few variables at a time Bayes’ nets: a technique for describing complex joint distributions (models) using simple, local distributions (conditional probabilities) More properly called graphical models We describe how variables locally interact Local interactions chain together to give global, indirect interactions For about 10 min, we’ll be vague about how these interactions are specified

Example Bayes’ Net: Insurance

Graphical Model Notation Nodes: variables (with domains) Can be assigned (observed) or unassigned (unobserved) Arcs: interactions Similar to CSP constraints Indicate “direct influence” between variables Formally: encode conditional independence (more later) For now: imagine that arrows mean direct causation (in general, they don’t!)

Example Bayes’ Net: Car

Example: Coin Flips N independent coin flips No interactions between variables: absolute independence X1 X2 Xn A graph can have no edges. A bayes net graph of independent random variables also has no edges.

Example: Traffic Variables: R Model 1: independence R: It rains T: There is traffic Model 1: independence Model 2: rain causes traffic Why is an agent using model 2 better? R T More accurate model of the dependence

Example: Traffic II Let’s build a causal graphical model Variables T: Traffic R: It rains L: Low pressure D: Roof drips B: Ballgame C: Cavity

Example: Alarm Network Variables B: Burglary A: Alarm goes off M: Mary calls J: John calls E: Earthquake! Story --- you live in LA, where there are both burglaries and earthquakes. You have an alarm that is sensitive to vibration of your front door. The alarm company autimatlcally notifiies you and john and mary as a precaution if the alarm goes off. John and Mary like you, but don’t know each other, so they may call to check on you.

Does smoking cause cancer? In 1950s, suspicion: Smoking Cancer Correlation discovered by Ernst Wynder, at WashU 1948.

Does smoking cause cancer? Explanation of the Tobacco Research Council: Unknown Gene Smoking Cancer P(cancer | smoking, gene)=P(cancer | gene) Correlation discovered by Ernst Wynder, at WashU 1948. Link between smoking and cancer finally established in 1998. (22 Million deaths due to tobacco in those 50 years.)

Global Warming Human Activity Green House Gases Climate Change Model: Explains data Makes verifiable predictions

Global Warming Human Activity Unknown Cause X Green House Gases Climate Change Model: Undefined (mystery) variables Does not explain data Makes no predictions

Bayes’ Net Semantics Let’s formalize the semantics of a Bayes’ net A set of nodes, one per variable (A’s and X’s) A directed, acyclic graph A conditional distribution for each node A collection of distributions over X, one for each combination of parents’ values CPT: conditional probability table Description of a noisy “causal” process A1 An X A Bayes net = Topology (graph) + Local Conditional Probabilities

Probabilities in BNs Bayes’ nets implicitly encode joint distributions As a product of local conditional distributions To see what probability a BN gives to a full assignment, multiply all the relevant conditionals together: Example: This lets us reconstruct any entry of the full joint Not every BN can represent every joint distribution The topology enforces certain conditional independencies Equation assumes that I have specific labels for *EVERY* node (I have lower case x’s), and I am just trying to compute overall probability of that assignment. What example have we already seen where a BN cannot represent a joint distribution (indendence early on of weather/temperature).

Example: Coin Flips X1 X2 Xn h 0.5 t h 0.5 t h 0.5 t Only distributions whose variables are absolutely independent can be represented by a Bayes’ net with no arcs.

Example: Traffic R T +r 1/4 r 3/4 +r +t 3/4 t 1/4 r +t 1/2 t P(+r) * P(~t | +r) = ¼ * ¼ = 1/16 r +t 1/2 t

Example: Alarm Network P(E) +e 0.002 e 0.998 B P(B) +b 0.001 b 0.999 Burglary Earthqk Alarm B E A P(A|B,E) +b +e +a 0.95 a 0.05 e 0.94 0.06 b 0.29 0.71 0.001 0.999 John calls Mary calls This let’s up compute: P(b,e,a,j,m) WITHOUT have the full joint distribution table (which would be how big?!) what is probably that you are popular, but nothing bad happened? P(j,m, and not everything else?) P(~b) * P(~e) * P(~a | ~b, ~e) * P(j | ~a) * p(m | ~a) A J P(J|A) +a +j 0.9 j 0.1 a 0.05 0.95 A M P(M|A) +a +m 0.7 m 0.3 a 0.01 0.99

Bayes’ Nets So far: how a Bayes’ net encodes a joint distribution Next: how to answer queries about that distribution Key idea: conditional independence Last class: assembled BNs using an intuitive notion of conditional independence as causality Today: formalize these ideas Main goal: answer queries about conditional independence and influence After that: how to answer numerical queries (inference)

Example: Traffic Causal direction R T r 1/4 r 3/4 r t 3/16 t 1/16 r 6/16 r t 3/4 t 1/4 T r t 1/2 t

Example: Reverse Traffic Reverse causality? T t 9/16 t 7/16 r t 3/16 t 1/16 r 6/16 t r 1/3 r 2/3 R t r 1/7 r 6/7

Causality? When Bayes’ nets reflect the true causal patterns: Often simpler (nodes have fewer parents) Often easier to think about Often easier to elicit from experts BNs need not actually be causal Sometimes no causal net exists over the domain (especially if variables are missing) E.g. consider the variables Traffic and Drips End up with arrows that reflect correlation, not causation What do the arrows really mean? Topology may happen to encode causal structure Topology really encodes conditional independence

Example: Naïve Bayes Imagine we have one cause y and several effects x: This is a naïve Bayes model We’ll use these for classification later

Example: Alarm Network

The Chain Rule Can always factor any joint distribution as an incremental product of conditional distributions Why is the chain rule true? This actually claims nothing… What are the sizes of the tables we supply?

Example: Alarm Network Burglary Earthquake Alarm John calls Mary calls