CS 188: Artificial Intelligence Fall 2009

Similar documents
CS 5522: Artificial Intelligence II

CS 343: Artificial Intelligence

Probabilistic Models

CS 188: Artificial Intelligence Fall 2008

CS 188: Artificial Intelligence Spring Announcements

Probabilistic Models. Models describe how (a portion of) the world works

CSE 473: Artificial Intelligence Autumn 2011

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

Announcements. CS 188: Artificial Intelligence Spring Probability recap. Outline. Bayes Nets: Big Picture. Graphical Model Notation

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

CSE 473: Ar+ficial Intelligence. Hidden Markov Models. Bayes Nets. Two random variable at each +me step Hidden state, X i Observa+on, E i

Bayesian networks. Soleymani. CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018

Bayesian networks (1) Lirong Xia

CS 188: Artificial Intelligence. Our Status in CS188

CS 188: Artificial Intelligence Fall 2009

Outline. CSE 473: Artificial Intelligence Spring Bayes Nets: Big Picture. Bayes Net Semantics. Hidden Markov Models. Example Bayes Net: Car

CS 188: Artificial Intelligence Spring Announcements

Our Status. We re done with Part I Search and Planning!

CS 5522: Artificial Intelligence II

Probability Hal Daumé III. Computer Science University of Maryland CS 421: Introduction to Artificial Intelligence 27 Mar 2012

CSE 473: Artificial Intelligence

Bayes Nets. CS 188: Artificial Intelligence Fall Example: Alarm Network. Bayes Net Semantics. Building the (Entire) Joint. Size of a Bayes Net

Announcements. CS 188: Artificial Intelligence Fall Causality? Example: Traffic. Topology Limits Distributions. Example: Reverse Traffic

Outline. CSE 573: Artificial Intelligence Autumn Bayes Nets: Big Picture. Bayes Net Semantics. Hidden Markov Models. Example Bayes Net: Car

CSE 473: Artificial Intelligence Probability Review à Markov Models. Outline

Bayes Nets: Independence

Announcements. CS 188: Artificial Intelligence Fall Example Bayes Net. Bayes Nets. Example: Traffic. Bayes Net Semantics

Announcements. CS 188: Artificial Intelligence Spring Bayes Net Semantics. Probabilities in BNs. All Conditional Independences

CS 5522: Artificial Intelligence II

Bayes Nets III: Inference

CS 188: Artificial Intelligence Fall 2011

Outline. CSE 573: Artificial Intelligence Autumn Agent. Partial Observability. Markov Decision Process (MDP) 10/31/2012

Artificial Intelligence Bayes Nets: Independence

Product rule. Chain rule

Quantifying uncertainty & Bayesian networks

CS 188: Artificial Intelligence Spring Announcements

Review: Bayesian learning and inference

Probability, Markov models and HMMs. Vibhav Gogate The University of Texas at Dallas

Objectives. Probabilistic Reasoning Systems. Outline. Independence. Conditional independence. Conditional independence II.

Probabilistic Reasoning Systems

Uncertainty. Outline

Bayesian Networks. Semantics of Bayes Nets. Example (Binary valued Variables) CSC384: Intro to Artificial Intelligence Reasoning under Uncertainty-III

Artificial Intelligence

Probabilistic Reasoning. (Mostly using Bayesian Networks)

Uncertainty. Introduction to Artificial Intelligence CS 151 Lecture 2 April 1, CS151, Spring 2004

Introduction to Artificial Intelligence. Unit # 11

Graphical Models - Part I

CS188 Outline. We re done with Part I: Search and Planning! Part II: Probabilistic Reasoning. Part III: Machine Learning

Lecture 10: Introduction to reasoning under uncertainty. Uncertainty

Probabilistic representation and reasoning

PROBABILISTIC REASONING SYSTEMS

Artificial Intelligence Uncertainty

Probabilistic Reasoning. Kee-Eung Kim KAIST Computer Science

Bayesian networks. Chapter 14, Sections 1 4

Informatics 2D Reasoning and Agents Semester 2,

Uncertainty. Chapter 13

Bayesian Networks BY: MOHAMAD ALSABBAGH

CS 343: Artificial Intelligence

Uncertainty. Chapter 13

Uncertainty. 22c:145 Artificial Intelligence. Problem of Logic Agents. Foundations of Probability. Axioms of Probability

CS 2750: Machine Learning. Bayesian Networks. Prof. Adriana Kovashka University of Pittsburgh March 14, 2016

CS 188: Artificial Intelligence Spring 2009

Directed Graphical Models

Announcements. Inference. Mid-term. Inference by Enumeration. Reminder: Alarm Network. Introduction to Artificial Intelligence. V22.

This lecture. Reading. Conditional Independence Bayesian (Belief) Networks: Syntax and semantics. Chapter CS151, Spring 2004

CMPSCI 240: Reasoning about Uncertainty

CS 484 Data Mining. Classification 7. Some slides are from Professor Padhraic Smyth at UC Irvine

Uncertainty and Belief Networks. Introduction to Artificial Intelligence CS 151 Lecture 1 continued Ok, Lecture 2!

CS188 Outline. CS 188: Artificial Intelligence. Today. Inference in Ghostbusters. Probability. We re done with Part I: Search and Planning!

CS 380: ARTIFICIAL INTELLIGENCE UNCERTAINTY. Santiago Ontañón

Bayesian networks. Chapter Chapter

Uncertainty and Bayesian Networks

Bayesian Network. Outline. Bayesian Network. Syntax Semantics Exact inference by enumeration Exact inference by variable elimination

Our Status in CSE 5522

Probabilistic Representation and Reasoning

Announcements. CS 188: Artificial Intelligence Fall Markov Models. Example: Markov Chain. Mini-Forward Algorithm. Example

CS 188: Artificial Intelligence. Bayes Nets

Recall from last time: Conditional probabilities. Lecture 2: Belief (Bayesian) networks. Bayes ball. Example (continued) Example: Inference problem

COMP9414/ 9814/ 3411: Artificial Intelligence. 14. Uncertainty. Russell & Norvig, Chapter 13. UNSW c AIMA, 2004, Alan Blair, 2012

Markov Models and Hidden Markov Models

Hidden Markov Models. Vibhav Gogate The University of Texas at Dallas

Bayesian Networks. Motivation

CS 188: Artificial Intelligence

Approximate Inference

COS402- Artificial Intelligence Fall Lecture 10: Bayesian Networks & Exact Inference

Probabilistic representation and reasoning

CS 343: Artificial Intelligence

CS 188: Artificial Intelligence Spring Announcements

last two digits of your SID

Reinforcement Learning Wrap-up

Y. Xiang, Inference with Uncertain Knowledge 1

Bayes Networks. CS540 Bryan R Gibson University of Wisconsin-Madison. Slides adapted from those used by Prof. Jerry Zhu, CS540-1

15-780: Graduate Artificial Intelligence. Bayesian networks: Construction and inference

Bayesian belief networks. Inference.

Pengju XJTU 2016

Quantifying Uncertainty & Probabilistic Reasoning. Abdulla AlKhenji Khaled AlEmadi Mohammed AlAnsari

Probability. CS 3793/5233 Artificial Intelligence Probability 1

Probabilistic Reasoning

Brief Intro. to Bayesian Networks. Extracted and modified from four lectures in Intro to AI, Spring 2008 Paul S. Rosenbloom

Axioms of Probability? Notation. Bayesian Networks. Bayesian Networks. Today we ll introduce Bayesian Networks.

Transcription:

CS 188: Artificial Intelligence Fall 2009 Lecture 14: Bayes Nets 10/13/2009 Dan Klein UC Berkeley

Announcements Assignments P3 due yesterday W2 due Thursday W1 returned in front (after lecture) Midterm 10/22, 6-9pm, 155 Dwinelle Prep page / details will be posted on web soon One sheet of notes allowed Basic calculators allowed, not required Review sessions TBA 2

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 3

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: Stuff you care about Stuff you already know This kind of posterior distribution is also called the belief function of an agent which uses this model 4

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 +t +b g 0.16 +t b +g 0.24 +t b g 0.04 t +b +g 0.04 t +b g 0.24 t b +g 0.06 t b g 0.06

Independence Two variables are independent if: This says that their joint distribution factors into a product two simpler distributions Another form: We write: Independence is a simplifying modeling assumption Empirical joint distributions: at best close to independent What could we assume for {Weather, Traffic, Cavity, Toothache}? 6

Example: Independence N fair, independent coin flips: h 0.5 t 0.5 h 0.5 t 0.5 h 0.5 t 0.5 7

Example: Independence? T P warm 0.5 cold 0.5 T W P warm sun 0.4 warm rain 0.1 cold sun 0.2 cold rain 0.3 W P sun 0.6 rain 0.4 T W P warm sun 0.3 warm rain 0.2 cold sun 0.3 cold rain 0.2 8

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 9

Conditional Independence Unconditional (absolute) independence very rare (why?) Conditional independence is our most basic and robust form of knowledge about uncertain environments: What about this domain: Traffic Umbrella Raining What about fire, smoke, alarm? 10

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

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 +t +b g 0.16 +t b +g 0.24 +t b g 0.04 t +b +g 0.04 t +b g 0.24 t b +g 0.06 t b g 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 13

Example Bayes Net: Insurance 14

Example Bayes Net: Car 15

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!) 16

Example: Coin Flips N independent coin flips X 1 X 2 X n No interactions between variables: absolute independence 17

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

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 19

Example: Alarm Network Variables B: Burglary A: Alarm goes off M: Mary calls J: John calls E: Earthquake! 20

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

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 22

Example: Coin Flips X 1 X 2 X n h 0.5 t 0.5 h 0.5 t 0.5 h 0.5 t 0.5 Only distributions whose variables are absolutely independent can be represented by a Bayes net with no arcs. 23

Example: Traffic R +r 1/4 r 3/4 T +r +t 3/4 t 1/4 r +t 1/2 t 1/2 24

Example: Alarm Network B P(B) +b 0.001 Burglary Earthqk E P(E) +e 0.002 b 0.999 e 0.998 John calls A J P(J A) +a +j 0.9 +a j 0.1 a +j 0.05 a j 0.95 Alarm Mary calls A M P(M A) +a +m 0.7 +a m 0.3 a +m 0.01 a m 0.99 B E A P(A B,E) +b +e +a 0.95 +b +e a 0.05 +b e +a 0.94 +b e a 0.06 b +e +a 0.29 b +e a 0.71 b e +a 0.001 b e a 0.999

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) 26

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

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

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 29

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 30

Example: Alarm Network 31

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? 32

Example: Alarm Network Burglary Earthquake Alarm John calls Mary calls