CS 188: Artificial Intelligence Fall Probabilistic Models

Similar documents
Probabilistic Models. CS 188: Artificial Intelligence Fall Independence. Example: Independence. Example: Independence? Conditional Independence

Representing Knowledge. CS 188: Artificial Intelligence Fall Properties of BNs. Independence? Reachability (the Bayes Ball) Example

Bayes Nets. CS 188: Artificial Intelligence Spring Example: Alarm Network. Building the (Entire) Joint

CS 188: Artificial Intelligence Fall 2008

Reinforcement learning

CS 188: Artificial Intelligence Fall 2009

CS 343: Artificial Intelligence

Sections 3.1 and 3.4 Exponential Functions (Growth and Decay)

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

CS 188: Artificial Intelligence Fall Announcements

CS 188: Artificial Intelligence Spring Announcements

Announcements. CS 188: Artificial Intelligence Fall Today. Uncertainty. Random Variables. Probabilities. Lecture 14: Probability 10/17/2006

CS 5522: Artificial Intelligence II

Computer Propagation Analysis Tools

, on the power of the transmitter P t fed to it, and on the distance R between the antenna and the observation point as. r r t

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

Probabilistic Models

Lecture-V Stochastic Processes and the Basic Term-Structure Equation 1 Stochastic Processes Any variable whose value changes over time in an uncertain

[ ] 0. = (2) = a q dimensional vector of observable instrumental variables that are in the information set m constituents of u

General Non-Arbitrage Model. I. Partial Differential Equation for Pricing A. Traded Underlying Security

The Production of Polarization

Kalman Filter: an instance of Bayes Filter. Kalman Filter: an instance of Bayes Filter. Kalman Filter. Linear dynamics with Gaussian noise

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

Exponential and Logarithmic Equations and Properties of Logarithms. Properties. Properties. log. Exponential. Logarithmic.

156 There are 9 books stacked on a shelf. The thickness of each book is either 1 inch or 2

Two-dimensional Effects on the CSR Interaction Forces for an Energy-Chirped Bunch. Rui Li, J. Bisognano, R. Legg, and R. Bosch

STUDY OF THE STRESS-STRENGTH RELIABILITY AMONG THE PARAMETERS OF GENERALIZED INVERSE WEIBULL DISTRIBUTION

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

Lecture 22 Electromagnetic Waves

Assignment 6. Tyler Shendruk December 6, 2010

Bayes Nets: Independence

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

Lecture 17: Kinetics of Phase Growth in a Two-component System:

Section 5: Chain Rule

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

7 Wave Equation in Higher Dimensions

Biol. 356 Lab 8. Mortality, Recruitment, and Migration Rates

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

CS 5522: Artificial Intelligence II

The sudden release of a large amount of energy E into a background fluid of density

Lecture 18: Kinetics of Phase Growth in a Two-component System: general kinetics analysis based on the dilute-solution approximation

Chapter 2 The Derivative Applied Calculus 107. We ll need a rule for finding the derivative of a product so we don t have to multiply everything out.

Low-complexity Algorithms for MIMO Multiplexing Systems

Notes for Lecture 17-18

KINEMATICS OF RIGID BODIES

The k-filtering Applied to Wave Electric and Magnetic Field Measurements from Cluster

Laplace transfom: t-translation rule , Haynes Miller and Jeremy Orloff

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

Relative and Circular Motion

V The Fourier Transform

Welcome Back to Physics 215!

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

Introduction to AC Power, RMS RMS. ECE 2210 AC Power p1. Use RMS in power calculations. AC Power P =? DC Power P =. V I = R =. I 2 R. V p.

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

Chapter 2. First Order Scalar Equations

Physics 180A Fall 2008 Test points. Provide the best answer to the following questions and problems. Watch your sig figs.

ENGI 4430 Advanced Calculus for Engineering Faculty of Engineering and Applied Science Problem Set 9 Solutions [Theorems of Gauss and Stokes]

( ) a system of differential equations with continuous parametrization ( T = R + These look like, respectively:

Lecture 5. Chapter 3. Electromagnetic Theory, Photons, and Light

Artificial Intelligence Bayes Nets: Independence

On Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature

CSE 473: Artificial Intelligence Autumn 2011

Combinatorial Approach to M/M/1 Queues. Using Hypergeometric Functions

= ( ) ) or a system of differential equations with continuous parametrization (T = R

CS 188: Artificial Intelligence Spring Announcements

Unit Root Time Series. Univariate random walk

Risk tolerance and optimal portfolio choice

Today - Lecture 13. Today s lecture continue with rotations, torque, Note that chapters 11, 12, 13 all involve rotations

Echocardiography Project and Finite Fourier Series

R t. C t P t. + u t. C t = αp t + βr t + v t. + β + w t

Today. CS 188: Artificial Intelligence Spring Probabilities. Uncertainty. Probabilistic Models. What Are Probabilities?

Dynamic Estimation of OD Matrices for Freeways and Arterials

An Open cycle and Closed cycle Gas Turbine Engines. Methods to improve the performance of simple gas turbine plants

Comparing Means: t-tests for One Sample & Two Related Samples

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Math 301: The Erdős-Stone-Simonovitz Theorem and Extremal Numbers for Bipartite Graphs

Understanding the asymptotic behaviour of empirical Bayes methods

Reinforcement learning

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!

ODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004

Introduction D P. r = constant discount rate, g = Gordon Model (1962): constant dividend growth rate.

Variance and Covariance Processes

GEOGRAPHY PAPER

Measures the linear dependence or the correlation between r t and r t-p. (summarizes serial dependence)

Explaining Total Factor Productivity. Ulrich Kohli University of Geneva December 2015

Expert Advice for Amateurs

Two Coupled Oscillators / Normal Modes

Physical Limitations of Logic Gates Week 10a

h[n] is the impulse response of the discrete-time system:

Final Spring 2007

Of all of the intellectual hurdles which the human mind has confronted and has overcome in the last fifteen hundred years, the one which seems to me

Math 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:

5. Stochastic processes (1)

The Global Trade and Environment Model: GTEM

Instructor: Barry McQuarrie Page 1 of 5

Designing Information Devices and Systems I Spring 2019 Lecture Notes Note 17

EXERCISES FOR SECTION 1.5

The Substring Search Problem

Transcription:

CS 188: Aificial Inelligence Fall 2007 Lecue 15: Bayes Nes 10/18/2007 Dan Klein UC Bekeley Pobabilisic Models A pobabilisic model is a join disibuion ove a se of vaiables Given a join disibuion, we can eason abou unobseved vaiables given obsevaions (evidence) Geneal fom of a quey: Suff you cae abou Suff you aleady know his kind of poseio disibuion is also called he belief funcion of an agen which uses his model 1

Independence wo vaiables ae independen if: his says ha hei join disibuion facos ino a poduc wo simple disibuions Independence is a modeling assumpion Empiical join disibuions: a bes close o independen Wha could we assume fo {Weahe, affic, Caviy, oohache}? How many paamees in he join model? How many paamees in he independen model? Independence is like somehing fom CSPs: wha? Example: Independence N fai, independen coin flips: H H H 2

Example: Independence? Mos join disibuions ae no independen Mos ae pooly modeled as independen wam cold P S sun ain P 0.6 0.4 S P S P wam wam sun ain 0.4 0.1 wam wam sun ain 0.3 0.2 cold cold sun ain 0.2 0.3 cold cold sun ain 0.3 0.2 Condiional Independence P(oohache,Caviy,Cach)? If I have a caviy, he pobabiliy ha he pobe caches in i doesn' depend on whehe I have a oohache: P(cach oohache, caviy) = P(cach caviy) he same independence holds if I don have a caviy: P(cach oohache, caviy) = P(cach caviy) Cach is condiionally independen of oohache given Caviy: P(Cach oohache, Caviy) = P(Cach Caviy) Equivalen saemens: P(oohache Cach, Caviy) = P(oohache Caviy) P(oohache, Cach Caviy) = P(oohache Caviy) P(Cach Caviy) 3

Condiional Independence Uncondiional (absolue) independence is vey ae (why?) Condiional independence is ou mos basic and obus fom of knowledge abou unceain envionmens: Wha abou his domain: affic Umbella Raining Wha abou fie, smoke, alam? he Chain Rule II Can always faco any join disibuion as an incemenal poduc of condiional disibuions Why? his acually claims nohing Wha ae he sizes of he ables we supply? 4

ivial decomposiion: he Chain Rule III Wih condiional independence: Condiional independence is ou mos basic and obus fom of knowledge abou unceain envionmens Gaphical models help us manage independence Gaphical Models Models ae descipions of how (a poion of) he wold woks Models ae always simplificaions May no accoun fo evey vaiable May no accoun fo all ineacions beween vaiables Wha do we do wih pobabilisic models? We (o ou agens) need o eason abou unknown vaiables, given evidence Example: explanaion (diagnosic easoning) Example: pedicion (causal easoning) Example: value of infomaion 5

Bayes Nes: Big Picue wo poblems wih using full join disibuions fo pobabilisic models: Unless hee ae only a few vaiables, he join is WAY oo big o epesen explicily Had o esimae anyhing empiically abou moe han a few vaiables a a ime Bayes nes (moe popely called gaphical models) ae a echnique fo descibing complex join disibuions (models) using a bunch of simple, local disibuions We descibe how vaiables locally ineac Local ineacions chain ogehe o give global, indiec ineacions Fo abou 10 min, we ll be vey vague abou how hese ineacions ae specified Gaphical Model Noaion Nodes: vaiables (wih domains) Can be assigned (obseved) o unassigned (unobseved) Acs: ineacions Simila o CSP consains Indicae diec influence beween vaiables Fo now: imagine ha aows mean causaion 6

Example: Coin Flips N independen coin flips X 1 X 2 X n No ineacions beween vaiables: absolue independence Example: affic Vaiables: R: I ains : hee is affic R Model 1: independence Model 2: ain causes affic Why is an agen using model 2 bee? 7

Example: affic II Le s build a causal gaphical model Vaiables : affic R: I ains L: Low pessue D: Roof dips B: Ballgame C: Caviy Example: Alam Newok Vaiables B: Buglay A: Alam goes off M: May calls J: John calls E: Eahquake! 8

Bayes Ne Semanics Le s fomalize he semanics of a Bayes ne A se of nodes, one pe vaiable X A dieced, acyclic gaph A condiional disibuion fo each node A collecion of disibuions ove X, one fo each combinaion of paens values A 1 X A n CP: condiional pobabiliy able Descipion of a noisy causal pocess A Bayes ne = opology (gaph) + Local Condiional Pobabiliies Pobabiliies in BNs Bayes nes implicily encode join disibuions As a poduc of local condiional disibuions o see wha pobabiliy a BN gives o a full assignmen, muliply all he elevan condiionals ogehe: Example: his les us econsuc any eny of he full join No evey BN can epesen evey join disibuion he opology enfoces ceain condiional independencies 9

Example: Coin Flips X 1 X 2 X n h h h Only disibuions whose vaiables ae absoluely independen can be epesened by a Bayes ne wih no acs. Example: affic R 1/4 3/4 3/4 1/4 1/2 1/2 10

Example: Alam Newok Example: Naïve Bayes Imagine we have one cause y and seveal effecs x: his is a naïve Bayes model We ll use hese fo classificaion lae 11

Example: affic II Vaiables : affic R: I ains L: Low pessue D: Roof dips B: Ballgame D L R B Size of a Bayes Ne How big is a join disibuion ove N Boolean vaiables? How big is an N-node ne if nodes have k paens? Boh give you he powe o calculae BNs: Huge space savings! Also easie o elici local CPs Also uns ou o be fase o answe queies (nex class) 12

Building he (Enie) Join We can ake a Bayes ne and build he full join disibuion i encodes ypically, hee s no eason o build ALL of i Bu i s impoan o know you could! o emphasize: evey BN ove a domain implicily epesens some join disibuion ove ha domain Basic affic ne Example: affic Le s muliply ou he join R 1/4 3/4 3/16 1/16 6/16 3/4 1/4 6/16 1/2 1/2 13

Example: Revese affic Revese causaliy? R 9/16 7/16 1/3 2/3 3/16 1/16 6/16 6/16 1/7 6/7 Causaliy? When Bayes nes eflec he ue causal paens: Ofen simple (nodes have fewe paens) Ofen easie o hink abou Ofen easie o elici fom expes BNs need no acually be causal Someimes no causal ne exiss ove he domain (especially if vaiables ae missing) E.g. conside he vaiables affic and Dips End up wih aows ha eflec coelaion, no causaion Wha do he aows eally mean? opology may happen o encode causal sucue opology eally encodes condiional independencies 14

Ceaing Bayes Nes So fa, we alked abou how any fixed Bayes ne encodes a join disibuion Nex: how o epesen a fixed disibuion as a Bayes ne Key ingedien: condiional independence he execise we did in causal assembly of BNs was a kind of inuiive use of condiional independence Now we have o fomalize he pocess Afe ha: how o answe queies (infeence) 15