Probabilistic Models

Similar documents
CS 5522: Artificial Intelligence II

CS 188: Artificial Intelligence Fall 2009

CS 343: Artificial Intelligence

CS 188: Artificial Intelligence Spring Announcements

CS 188: Artificial Intelligence Fall 2008

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

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

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

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

Bayesian networks (1) Lirong Xia

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

CS 5522: Artificial Intelligence II

CS 188: Artificial Intelligence. Our Status in CS188

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

CS 188: Artificial Intelligence Fall 2009

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

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

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

CSE 473: Artificial Intelligence

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

Bayes Nets: Independence

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

CS 5522: Artificial Intelligence II

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

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

Review: Bayesian learning and inference

Quantifying uncertainty & Bayesian networks

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

Bayes Nets III: Inference

Product rule. Chain rule

Artificial Intelligence Bayes Nets: Independence

Uncertainty. Outline

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

Probabilistic Reasoning. (Mostly using Bayesian Networks)

Artificial Intelligence

CMPSCI 240: Reasoning about Uncertainty

Uncertainty. Chapter 13

Uncertainty. Chapter 13

Probabilistic Reasoning. Kee-Eung Kim KAIST Computer Science

Artificial Intelligence Uncertainty

Graphical Models - Part I

Introduction to Artificial Intelligence. Unit # 11

PROBABILISTIC REASONING SYSTEMS

Informatics 2D Reasoning and Agents Semester 2,

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

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

Bayesian networks. Chapter 14, Sections 1 4

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

CS 188: Artificial Intelligence Fall 2011

Lecture 10: Introduction to reasoning under uncertainty. Uncertainty

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

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

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

Bayesian Networks BY: MOHAMAD ALSABBAGH

13.4 INDEPENDENCE. 494 Chapter 13. Quantifying Uncertainty

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

Uncertainty and Bayesian Networks

Probabilistic Reasoning

Bayesian Networks. Motivation

An AI-ish view of Probability, Conditional Probability & Bayes Theorem

10/18/2017. An AI-ish view of Probability, Conditional Probability & Bayes Theorem. Making decisions under uncertainty.

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

Probabilistic representation and reasoning

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

Reasoning under Uncertainty: Intro to Probability

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

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

Uncertain Knowledge and Reasoning

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

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

Bayesian networks. Chapter Chapter

Markov Models and Hidden Markov Models

Recall from last time. Lecture 3: Conditional independence and graph structure. Example: A Bayesian (belief) network.

Directed Graphical Models

Reasoning Under Uncertainty

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

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

Uncertainty. Outline. Probability Syntax and Semantics Inference Independence and Bayes Rule. AIMA2e Chapter 13

Events A and B are independent P(A) = P(A B) = P(A B) / P(B)

Y. Xiang, Inference with Uncertain Knowledge 1

Pengju XJTU 2016

Reasoning Under Uncertainty

Reasoning Under Uncertainty: Bayesian networks intro

Pengju

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

COMP5211 Lecture Note on Reasoning under Uncertainty

Learning Bayesian Networks (part 1) Goals for the lecture

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

ARTIFICIAL INTELLIGENCE. Uncertainty: probabilistic reasoning

Outline. Uncertainty. Methods for handling uncertainty. Uncertainty. Making decisions under uncertainty. Probability. Uncertainty

UNCERTAINTY. In which we see what an agent should do when not all is crystal-clear.

Probabilistic Reasoning

Uncertainty. Russell & Norvig Chapter 13.

CS 343: Artificial Intelligence

Transcription:

Bayes Nets 1

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 2

Model for Ghostbusters Reminder: ghost is hidden, sensors are noisy Joint Distribution T: Top sensor is red B: Bottom sensor is red G: Ghost is in the top Queries: P( +g) =.5 P( +g +t) = 4/6 P( +g +t, -b) = 24/28 Problem: joint distribution too large / complex to encode as a table (consider 50 variables instead of 3)

Independence Two variables are independent if: This says that their joint distribution factors into a product of 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}?

Example: Independence N fair, independent coin flips: 5

Example: Independence 6

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 7

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

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

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

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 this lecture, we ll be vague about how these interactions are specified

Example Bayes Net: Car Insurance The power of Bayes net: by specifying only the direct connections we get a tool for answering queries that takes into account all indirect chains of reasoning

Example: Bayes Net: Car Why does my car not start? 13

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

N independent coin flips Example: Coin Flips No interactions between variables: absolute (marginal) independence 15

Variables: R: It rains T: There is traffic Example: Traffic Model 1: independence Model 2: rain causes traffic Why is an agent using model 2 better? We can draw more useful deductions Agent with model 1 is limited in certain ways, it can not draw the inference such because there is rain there is probably traffic so leave earlier 16

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

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

Bayes Net Semantics Let s formalize the semantics of a Bayes net A set of nodes, one per variable X Bayes Net: a way of compactly representing a joint distribution between all variables 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 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: P(+cavity, +catch, toothache) = P(+cavity) P( +catch +cavity) P( toothache +cavity) This lets us reconstruct any entry of the full joint distribution Not every BN can represent every joint distribution The topology enforces certain conditional independencies 20

Example: Coin Flips P(h, h, t, h) = P(x 1, x 2,..., x n ) = Π P(x i parent(x i )) = Π P(x i ) Only distributions whose variables are absolutely independent can be represented by a Bayes net with no arcs. 21

Example: traffic the joint probability based on structure of BN P( +r, t ) = P( +r) P( t +r) = ¼ * ¼ 22

Example: Alarm Network P(+b, +e, -a, -j, -m) = P(+b) P(+e) P(-a +b, +e) P(-j -a) P(-m -a) =.001 *.002 *.05 *.95 *.99 23

Example: Traffic 24

Example: Reverse Traffic Reverse causality? Formally all that really matters is conditional independencies encoded by the Bayes Net

Casuality? 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 26

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