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

Similar documents
CS 188: Artificial Intelligence Spring Announcements

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

CSE 473: Artificial Intelligence Autumn 2011

CS 188: Artificial Intelligence Fall 2009

CS 343: Artificial Intelligence

CS 188: Artificial Intelligence Fall 2008

Bayes Nets: Independence

CS 5522: Artificial Intelligence II

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

CS 5522: Artificial Intelligence II

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

Probabilistic Models

Product rule. Chain rule

Artificial Intelligence Bayes Nets: Independence

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

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

CS 188: Artificial Intelligence Spring Announcements

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

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

Bayesian networks (1) Lirong Xia

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

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 Bayes Net Semantics. Probabilities in BNs. All Conditional Independences

Recap: Bayes Nets. CS 473: Artificial Intelligence Bayes Nets: Independence. Conditional Independence. Bayes Nets. Independence in a BN

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

Bayes Nets III: Inference

Introduction to Artificial Intelligence. Unit # 11

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

Bayesian networks. Chapter 14, Sections 1 4

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

Review: Bayesian learning and inference

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

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

Bayesian Networks BY: MOHAMAD ALSABBAGH

CS 188: Artificial Intelligence. Bayes Nets

CSEP 573: Artificial Intelligence

CS 343: Artificial Intelligence

Quantifying uncertainty & Bayesian networks

Probabilistic Reasoning. (Mostly using Bayesian Networks)

CS 188: Artificial Intelligence

Directed Graphical Models

Informatics 2D Reasoning and Agents Semester 2,

CSE 473: Artificial Intelligence

CS 188: Artificial Intelligence. Our Status in CS188

last two digits of your SID

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

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

Bayesian Networks. Motivation

Bayesian networks. Chapter Chapter

CS 188: Artificial Intelligence Spring Announcements

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

CS 188: Artificial Intelligence Fall 2009

CS 188: Artificial Intelligence Spring Announcements

Introduction to Artificial Intelligence Belief networks

Learning Bayesian Networks (part 1) Goals for the lecture

Probabilistic representation and reasoning

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

Probabilistic Reasoning Systems

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

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

PROBABILISTIC REASONING SYSTEMS

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

CS 188: Artificial Intelligence Fall 2011

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

Probabilistic representation and reasoning

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

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

Bayesian Networks. Material used

Another look at Bayesian. inference

Probability. CS 3793/5233 Artificial Intelligence Probability 1

Y. Xiang, Inference with Uncertain Knowledge 1

Probabilistic Reasoning. Kee-Eung Kim KAIST Computer Science

EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS

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

Graphical Models - Part I

Lecture 10: Introduction to reasoning under uncertainty. Uncertainty

CS Lecture 3. More Bayesian Networks

Bayesian networks. Chapter AIMA2e Slides, Stuart Russell and Peter Norvig, Completed by Kazim Fouladi, Fall 2008 Chapter 14.

Uncertainty and Bayesian Networks

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

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

Probabilistic Representation and Reasoning

Bayes Net Representation. CS 188: Artificial Intelligence. Approximate Inference: Sampling. Variable Elimination. Sampling.

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

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

Bayesian networks: Modeling

COMP5211 Lecture Note on Reasoning under Uncertainty

CS 188: Artificial Intelligence Spring 2009

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

Implementing Machine Reasoning using Bayesian Network in Big Data Analytics

Probabilistic Classification

Which coin will I use? Which coin will I use? Logistics. Statistical Learning. Topics. 573 Topics. Coin Flip. Coin Flip

14 PROBABILISTIC REASONING

Bayes Nets: Sampling

Bayesian Networks. Machine Learning, Fall Slides based on material from the Russell and Norvig AI Book, Ch. 14

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

Bayesian belief networks. Inference.

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

CS 188: Artificial Intelligence Spring Today

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

Transcription:

CS 188: Artificial Intelligence Spring 2010 Lecture 15: Bayes Nets II Independence 3/9/2010 Pieter Abbeel UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell, Andrew Moore Current readings Require login Assignments W4 due Thursday Announcements Midterm 3/18, 6-9pm, 0010 Evans --- no lecture on 3/18 We will be posting practice midterms One page note sheet, non-programmable calculators Topics go through Thursday, not next Tuesday 2 Thus far: Probability Outline Today: Bayes nets Semantics (Conditional) Independence Conditional probability Product rule Chain rule, independent iff: Probability recap 3 and are conditionally independent given iff: 4 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 WA 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 5 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!) 8 1

Example: Coin Flips N independent coin flips 1 2 n No interactions between variables: absolute independence 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? R T 9 10 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! 11 12 Bayes Net Semantics Probabilities in BNs Let s formalize the semantics of a Bayes net A set of nodes, one per variable A directed, acyclic graph A conditional distribution for each node A collection of distributions over, one for each combination of parents values A 1 A n 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: CPT: conditional probability table Description of a noisy causal process A Bayes net = Topology (graph) + Local Conditional Probabilities 13 This lets us reconstruct any entry of the full joint Not every BN can represent every joint distribution The topology enforces certain conditional independencies 14 2

Example: Coin Flips Example: Traffic 1 2 n R +r 1/4 r 3/4 T +r +t 3/4 t 1/4 r +t 1/2 t 1/2 Only distributions whose variables are absolutely independent can be represented by a Bayes net with no arcs. 15 16 Example: Alarm Network Size of a Bayes Net B P(B) +b 0.001 b 0.999 Burglary Earthqk E P(E) +e 0.002 e 0.998 How big is a joint distribution over N Boolean variables? 2 N 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 How big is an N-node net if nodes have up to k parents? O(N * 2 k+1 ) Both give you the power to calculate BNs: Huge space savings! Also easier to elicit local CPTs Also turns out to be faster to answer queries (coming) 18 Bayes Nets So far: how a Bayes net encodes a joint distribution Next: how to answer queries about that distribution Key idea: conditional independence After that: how to answer numerical queries (inference) more efficiently than by first constructing the joint distribution Conditional Independence Reminder: independence and are independent if and are conditionally independent given (Conditional) independence is a property of a distribution 19 23 3

Example: Independence Topology Limits Distributions For this graph, you can fiddle with θ (the CPTs) all you want, but you won t be able to represent any distribution in which the flips are dependent! 1 2 All distributions 24 Given some graph topology G, only certain joint distributions can be encoded The graph structure guarantees certain (conditional) independences (There might be more independence) Adding arcs increases the set of distributions, but has several costs Full conditioning can encode any distribution 25 Independence in a BN Important question about a BN: Are two nodes independent given certain evidence? If yes, can prove using algebra (tedious in general) If no, can prove with a counter example Example: Causal Chains This configuration is a causal chain Is independent of given? : Low pressure : Rain : Traffic Question: are and necessarily independent? Answer: no. Example: low pressure causes rain, which causes traffic. can influence, can influence (via ) Addendum: they could be independent: how? es! Evidence along the chain blocks the influence 27 Common Cause Common Effect Another basic configuration: two effects of the same cause Are and independent? Are and independent given? Observing the cause blocks influence between effects. es! : Project due : Newsgroup busy : Lab full 28 Last configuration: two causes of one effect (v-structures) Are and independent? es: the ballgame and the rain cause traffic, but they are not correlated Still need to prove they must be (try it!) Are and independent given? No: seeing traffic puts the rain and the ballgame in competition as explanation? This is backwards from the other cases Observing an effect activates influence between possible causes. : Raining : Ballgame : Traffic 29 4

The General Case Any complex example can be analyzed using these three canonical cases General question: in a given BN, are two variables independent (given evidence)? Solution: analyze the graph 30 5