BAYESIAN NETWORKS AIMA2E CHAPTER (SOME TOPICS EXCLUDED) AIMA2e Chapter (some topics excluded) 1
|
|
- Kathryn Clarke
- 5 years ago
- Views:
Transcription
1 BAYESIAN NEWORKS AIMA2E HAPER (SOME OPIS EXLUDED) AIMA2e hapter (some topics excluded) 1
2 } Syntax } Semantics } Parameterized distributions } Inference Outline ffl Exact inference (enumeration, variable elimination) ffl Approximate inference (stochastic simulation) AIMA2e hapter (some topics excluded) 2
3 P(X i jp arents(x i )) Bayesian networks A simple, graphical notation for conditional independence assertions and hence for compact specification of full joint distributions Syntax: Random Variables: a set of nodes, one per variable opology: a directed, acyclic graph ß (link directly influences ) Probabilities: a conditional distribution for each node given its parents: In the simplest case, conditional distribution represented as a conditional probability table (P) giving the distribution X over i for each combination of parent values AIMA2e hapter (some topics excluded) 3
4 Example W eather is independent of the other variables oothache and atch are conditionally independent given avity P ( oothache; catch; avity; W eather) =? opology of network encodes conditional independence assertions: Weather avity oothache atch AIMA2e hapter (some topics excluded) 4
5 Example W eather is independent of the other variables oothache and atch are conditionally independent given avity ( oothache; atch; avity; W eather) = P ( oothachejavity) P (atchjavity)p (avity)p (W eather) P opology of network encodes conditional independence assertions: Weather avity oothache atch AIMA2e hapter (some topics excluded) 5
6 Example I m at work, neighbor John calls to say my alarm is ringing, but neighbor Mary doesn t call. Sometimes it s set off by minor earthquakes. Is there a burglar? Variables: Burglar, Earthquake, Alarm, Maryalls Johnalls, Network topology reflects causal knowledge: A burglar can set the alarm off An earthquake can set the alarm off he alarm can cause Mary to call he alarm can cause John to call AIMA2e hapter (some topics excluded) 6
7 Example contd. Burglary Johnalls P(B).001 Alarm A P(J).05 Earthquake P(E).002 B E P(A) Maryalls A P(M) AIMA2e hapter (some topics excluded) 7
8 ompactness A P X for Boolean k i with Boolean parents has rows for the combinations of parent values k 2 B E Each row requires one p number X for = true i (the number X for = false i is 1 just p) If each variable has no more k than parents, the complete network O(n 2 requires ) numbers k J A M I.e., grows linearly with n, vs.o(2 n ) for the full joint distribution or burglary net, =10numbers (vs = 31) AIMA2e hapter (some topics excluded) 8
9 = Global semantics Global semantics defines the full joint distribution as the product of the local conditional distributions: B E A P(X 1 ;:::;X n ) = Π n i =1P(X i jparents(x i )) e.g., P (j ^ m ^ a ^ :b ^ :e) J M AIMA2e hapter (some topics excluded) 9
10 Global semantics = P (jja)p (mja)p (aj:b; :e)p (:b)p (:e) Global semantics defines the full joint distribution as the product of the local conditional distributions: B E A P(X 1 ;:::;X n ) = Π n i =1P(X i jparents(x i )) e.g., P (j ^ m ^ a ^ :b ^ :e) J M AIMA2e hapter (some topics excluded) 10
11 Local semantics Local semantics: each node is conditionally independent of its nondescendants given its parents U 1... U m Z 1j X Z nj Y 1... Y n heorem: Local semantics, global semantics AIMA2e hapter (some topics excluded) 11
12 Markov blanket Each node is conditionally independent of all others given its Markov blanket: parents + children + children s parents U 1... U m Z 1j X Z nj Y 1... Y n AIMA2e hapter (some topics excluded) 12
13 onstructing Bayesian networks P(X i jp arents(x i )) = P(X i jx 1 ; :::; X i 1 ) Need a method such that a series of locally testable assertions of conditional independence guarantees the required global semantics 1. hoose an ordering of X variables ;:::;X n 1 2. i =1ton or X add i to the network select parents X from ;:::;X i 1 1 such that his choice of parents guarantees the global semantics: P(X 1 ;:::;X n ) = Π n i =1P(X i jx 1 ; :::; X i 1 ) (chain rule) = Π n i =1P(X i jparents(x i )) (by construction) AIMA2e hapter (some topics excluded) 13
14 Suppose we choose the ordering M, J, A, B, E P (JjM ) = P (J)? Example Maryalls Johnalls AIMA2e hapter (some topics excluded) 14
15 Suppose we choose the ordering M, J, A, B, E Example (JjM ) = P (J)? No P (AjJ;M) = P (AjJ)? P (AjJ;M) = P (A)? P Maryalls Alarm Johnalls AIMA2e hapter (some topics excluded) 15
16 Suppose we choose the ordering M, J, A, B, E Example Maryalls Johnalls Alarm Burglary (JjM ) = P (J)? No P (AjJ;M) = P (AjJ)? P (AjJ;M) = P (A)? No P (BjA; J;M) = P (BjA)? P P (BjA; J;M) = P (B)? AIMA2e hapter (some topics excluded) 16
17 Suppose we choose the ordering M, J, A, B, E Example Maryalls Johnalls Alarm Burglary Earthquake (JjM ) = P (J)? No P (AjJ;M) = P (AjJ)? P (AjJ;M) = P (A)? No P (BjA; J;M) = P (BjA)? Yes P (BjA; J;M) = P (B)? No P (EjB; A; J;M) = P (EjA)? P (EjB; A; J;M) = P (EjA; B)? P AIMA2e hapter (some topics excluded) 17
18 Suppose we choose the ordering M, J, A, B, E Example Maryalls Johnalls Alarm Burglary Earthquake (JjM ) = P (J)? No P (AjJ;M) = P (AjJ)? P (AjJ;M) = P (A)? No P (BjA; J;M) = P (BjA)? Yes P (BjA; J;M) = P (B)? No P (EjB; A; J;M) = P (EjA)? No P (EjB; A; J;M) = P (EjA; B)? Yes P AIMA2e hapter (some topics excluded) 18
19 Example contd. Maryalls Johnalls Alarm Burglary Earthquake Deciding conditional independence is hard in noncausal directions (ausal models and conditional independence seem hardwired for humans!) Assessing conditional probabilities is hard in noncausal directions AIMA2e hapter (some topics excluded) 19
20 Network is less compact: =13numbers needed AIMA2e hapter (some topics excluded) 20
21 Example: ar diagnosis Initial evidence: car won t start estable variables (green), broken, so fix it variables (orange) Hidden variables (gray) ensure sparse structure, reduce parameters battery age alternator broken fanbelt broken battery dead no charging battery meter battery flat no oil no gas fuel line blocked starter broken lights oil light gas gauge car won t start dipstick AIMA2e hapter (some topics excluded) 21
22 Example: ar insurance SocioEcon Age GoodStudent Mileage RiskAversion Seniorrain Extraar VehicleYear DrivingSkill MakeModel DrivingHist DrivQuality Antilock Airbag arvalue HomeBase Antiheft Ruggedness Accident heft OwnDamage ushioning Otherost Ownost Medicalost Liabilityost Propertyost AIMA2e hapter (some topics excluded) 22
23 ompact conditional distributions X = f (P arents(x)) for some function f N orthamerican, anadian _ U S _ P grows exponentially with no. of parents P becomes infinite with continuous-valued parent or child Solution: canonical distributions that are defined compactly Deterministic nodes are the simplest case: E.g., Boolean functions E.g., numerical relationships among continuous variables = inflow + precipitation - outflow - evaporation AIMA2e hapter (some topics excluded) 23
24 ompact conditional distributions contd. ) P (XjU 1 :::U j ; :U j+1 ::::U k ) = 1 Π j i =1q i Noisy-OR distributions model multiple noninteracting causes 1) U Parents :::U k 1 include all causes (can add leak node) 2) Independent failure q probability i for each cause alone lu Malaria P (ever) P (:ever) old 1: : : :98 0:02 = 0:2 0:1 0: :94 0:06 = 0:6 0:1 0:88 0:12 = 0:6 0:2 0:988 0:012 = 0:6 0:2 0:1 Number of parameters linear in number of parents AIMA2e hapter (some topics excluded) 24
25 ontinuous nodes Networks may have discrete RVs, continuous RVs, or a mix of the two. All continuous (e.g., conditional Gaussian). Linear dynamic sysyems (Kalman filter). Discrete parents, continuous children (e.g., conditional Gaussian). Gaussian mixture models. ontinuous parents, discrete children (e.g., probit and logit functions). Difficult to deal with. AIMA2e hapter (some topics excluded) 25
26 Inference tasks Simple queries: compute posterior marginal P(X i je = e) e.g., P (NoGasjGauge = empty; Lights = on; Starts = false) onjunctive P(X queries: ;X j i = e) = P(X je i = e)p(x je jx i ; j = e) E Optimal decisions: decision networks include utility information; probabilistic inference required P (outcomejaction; evidence) for Value of information: which evidence to seek next? Sensitivity analysis: which probability values are most critical? Explanation: why do I need a new starter motor? AIMA2e hapter (some topics excluded) 26
27 m) P(Bjj; P(B;j;m)=P (j; m) = = ffp(b; j; m) = ff± e ± a P(B; e; a; j; m) Inference by enumeration m) P(Bjj; ff± e ± a P(B)P (e)p(ajb;e)p (jja)p (mja) = = ffp(b)± e P (e)± a P(ajB;e)P (jja)p (mja) Slightly intelligent way to sum out variables from the joint without actually constructing its explicit representation Simple query on the burglary network: B E A J M Rewrite full joint entries using product of P entries: Recursive depth-first enumeration: O(n) space, O(d n ) time AIMA2e hapter (some topics excluded) 27
28 Enumeration algorithm function ENUMERAION-ASK(X, e, bn) returns a distribution over X inputs: X, the query variable e, observed values for variables E bn, a Bayesian network with fxg [ variables [ E Y ) ψ a distribution over X, initially empty Q(X for each xi value of X do extend e with xi value for X ψ ENUMERAE-ALL(VARS[bn], e) Q(xi) return NORMALIZE(Q(X)) function ENUMERAE-ALL(vars, e) returns a real number if EMPY?(vars) then return 1.0 ψ Y IRS(vars) if Y has value y in e then P (y j P a(y )) return ENUMERAE-ALL(RES(vars), e) else return y P (y j Pa(Y )) ENUMERAE-ALL(RES(vars), ey) where P is e extended with Y = y ey AIMA2e hapter (some topics excluded) 28
29 Evaluation tree Enumeration is inefficient: repeated computation e.g., computes P (jja)p (mja) for each value of e P(b).001 P(e).002 P( e).998 P(a b,e) P( a b,e) P(a b, e) P( a b, e) P(j a) P(j a) P(j a).05 P(j a).05 P(m a) P(m a) P(m a) P(m a) AIMA2e hapter (some topics excluded) 29
30 m) P(Bjj; ff P(B) = Inference by variable elimination z } B P (e) z } ±e E P(ajB;e) z } ±a A (jja) z } P P (mja) z } M J = ffp(b)± e P (e)± a P(ajB;e)P (jja)f M (a) = ffp(b)± e P (e)± a P(ajB;e)f J (a)f M (a) = fff B (b) f μ E μ AJM (b) Variable elimination: carry out summations right-to-left, storing intermediate results (factors) to avoid recomputation ffp(b)±ep (e)±afa(a; b; e)fj(a)fm (a) = ffp(b)± e P (e)f μ AJM (b; e) (sum out A) = ffp(b)f μ E μ AJM (b) (sum out E) = AIMA2e hapter (some topics excluded) 30
31 Variable elimination: Basic operations E.g., f 1 (a; b) f 2 (b; c) = f (a; b; c) Summing out a variable from a product of factors: move any constant factors outside the summation add up submatrices in pointwise product of remaining factors ±xf 1 f k = f 1 f i ± x f i+1 f k = f 1 f i f μ X assuming f 1 ;:::;f i do not depend on X Pointwise product of factors f 1 and f 2 : 1 (x 1 ;:::;x j ;y 1 ;:::;y k ) f 2 (y 1 ;:::;y k ;z 1 ;:::;z l ) f f (x = ;:::;xj;y 1 ;:::;yk;z 1 ;:::;zl) 1 AIMA2e hapter (some topics excluded) 31
32 Variable elimination algorithm function ELIMINAION-ASK(X, e, bn) returns a distribution over X inputs: X, the query variable e, evidence specified as an event bn, a belief network specifying joint P(X distribution ;:::;Xn) 1 ψ factors []; ψ vars REVERSE(VARS[bn]) for each var in vars do ψ [MAKE-AOR(var; e)jfactors] factors if var is a hidden variable then ψ factors SUM-OU(var, factors) return NORMALIZE(POINWISE-PRODU(factors)) AIMA2e hapter (some topics excluded) 32
33 Irrelevant variables P (Jjb) = ffp (b) X e P (e) X a P (ajb; e)p (Jja) X m P (mja) hm 1: Y is irrelevant unless Y 2 Ancestors(fXg[E) Ancestors(fXg[E) = falarm; Earthquakeg onsider the query P (JohnallsjBurglary = true) B E A Sum over m is identically 1; M is irrelevant to the query J M Here, X = Johnalls, E = fburglaryg, and so M is irrelevant AIMA2e hapter (some topics excluded) 33
34 omplexity of exact inference Singly connected networks (or polytrees): any two nodes are connected by at most one (undirected) path time and space cost of variable elimination are O(d k n) Multiply connected networks: can reduce 3SA to exact ) inference NP-hard equivalent to counting 3SA ) models #P-complete AIMA2e hapter (some topics excluded) 34
35 Inference by stochastic simulation Basic idea: 1) N Draw samples from a sampling S distribution 2) ompute an approximate posterior probability ^P 3) Show this converges to the true probability P 0.5 Outline: Sampling from an empty network Rejection sampling: reject samples disagreeing with evidence Likelihood weighting: use evidence to weight samples oin AIMA2e hapter (some topics excluded) 35
36 Sampling from an empty network xi ψ a random sample from P(Xi j Parents(Xi)) function PRIOR-SAMPLE(bn) returns an event sampled from bn inputs: bn, a belief network specifying joint distribution P(X 1 ;:::;Xn) ψ x an event n with elements i = 1 for n to do return x AIMA2e hapter (some topics excluded) 36
37 Example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 37
38 Example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 38
39 Example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 39
40 Example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 40
41 Example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 41
42 Example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 42
43 Example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 43
44 x1;:::;xn Sampling from an empty network contd. N!1 ^P (x 1 ;:::;xn) = lim lim NPS(x 1 ;:::;xn)=n N!1 = SPS(x 1 ;:::;xn) = P (x 1 :::x n ) Shorthand: ^P (x 1 ;:::;x n ) ß P (x 1 :::x n ) Probability that PRIORSAMPLE generates a particular event i.e., the true prior probability SPS(x 1 :::x n ) = Π n i =1 P (x ijparents(x i )) = P (x 1 :::x n ) S E.g., (t; f; t; t) = 0:5 0:9 0:8 0:9 = 0:324 = P (t; f; t; t) PS N Let (x 1 :::x n ) PS be the number of samples generated for event hen we have hat is, estimates derived from PRIORSAMPLE are consistent AIMA2e hapter (some topics excluded) 44
45 ^P(RainjSprinkler = true) = NORMALIZE(h8; 19i) = h0:296; 0:704i Rejection sampling ^P(Xje) estimated from samples agreeing with e function REJEION-SAMPLING(X, e, bn, N) returns an estimate P (Xje) of local variables: N, a vector of counts over X, initially zero for =1toN j do ψ x PRIOR-SAMPLE(bn) if x is consistent with e then ψ N[x] N[x]+1 where x is the value of X in x return NORMALIZE(N[X]) E.g., estimate P(RainjSprinkler = true) using 100 samples 27 samples have Sprinkler = true Of these, 8 have Rain = true and 19 have Rain = false. Similar to a basic real-world empirical estimation procedure AIMA2e hapter (some topics excluded) 45
46 of rejection sampling Analysis = ffnps(x; e) (algorithm defn.) ^P(Xje) N PS (X; e)=n PS (e) (normalized by N PS (e)) = P(X; e)=p (e) (property of PRIORSAMPLE) ß P(Xje) (defn. of conditional probability) = Hence rejection sampling returns consistent posterior estimates Problem: hopelessly expensive if P (e) is small P (e) drops off exponentially with number of evidence variables! AIMA2e hapter (some topics excluded) 46
47 Likelihood weighting Idea: fix evidence variables, sample only nonevidence variables, and weight each sample by the likelihood it accords the evidence function LIKELIHOOD-WEIGHING(X, e, bn, N) returns an estimate P (Xje) of local variables: W, a vector of weighted counts over X, initially zero for j =1toN do x, w ψ WEIGHED-SAMPLE(bn) ] ψ W[x ]+w where x is the value of X in x W[x NORMALIZE(W[X return ]) function WEIGHED-SAMPLE(bn, e) returns an event and a weight ψ x an event n with elements; ψ w 1 for i n =1to do Xi if has a xi value in e then ψ w P (Xi = xi j Parents(Xi)) w xi ψ else a random sample P(Xi j Parents(Xi)) from return x, w AIMA2e hapter (some topics excluded) 47
48 w = 1:0 Likelihood weighting example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 48
49 w = 1:0 Likelihood weighting example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 49
50 w = 1:0 Likelihood weighting example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 50
51 w = 1:0 0:1 Likelihood weighting example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 51
52 w = 1:0 0:1 Likelihood weighting example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 52
53 w = 1:0 0:1 Likelihood weighting example P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 53
54 Likelihood weighting example w = 1:0 0:1 0:99 = 0:099 P(S ).10 Sprinkler P() loudy Wet Grass S R P(W S,R) Rain P(R ) AIMA2e hapter (some topics excluded) 54
55 Likelihood weighting analysis w(z; e) = Π m i =1 P (e ijp arents(e i )) SWS(z; e)w(z; e) Sampling probability for WEIGHEDSAMPLE is Note: pays attention to evidence in ancestors only SWS(z; e) = Π l i =1P (z i jp arents(z i )) loudy somewhere in between prior and ) posterior distribution Sprinkler Rain Weight for a given sample z; e is Wet Grass Weighted sampling probability is = Π l i =1P (z i jp arents(z i )) Π m i =1P (e i jp arents(e i )) = P (z; e) (by standard global semantics of network) Hence likelihood weighting returns consistent estimates but performance still degrades with many evidence variables because a few samples have nearly all the total weight AIMA2e hapter (some topics excluded) 55
Introduction to Artificial Intelligence Belief networks
Introduction to Artificial Intelligence Belief networks Chapter 15.1 2 Dieter Fox Based on AIMA Slides c S. Russell and P. Norvig, 1998 Chapter 15.1 2 0-0 Outline Bayesian networks: syntax and semantics
More informationBayesian networks. Chapter Chapter
Bayesian networks Chapter 14.1 3 Chapter 14.1 3 1 Outline Syntax Semantics Parameterized distributions Chapter 14.1 3 2 Bayesian networks A simple, graphical notation for conditional independence assertions
More informationCS 380: ARTIFICIAL INTELLIGENCE UNCERTAINTY. Santiago Ontañón
CS 380: ARTIFICIAL INTELLIGENCE UNCERTAINTY Santiago Ontañón so367@drexel.edu Summary Probability is a rigorous formalism for uncertain knowledge Joint probability distribution specifies probability of
More informationBayesian networks. Chapter Chapter Outline. Syntax Semantics Parameterized distributions. Chapter
Bayesian networks Chapter 14.1 3 Chapter 14.1 3 1 Outline Syntax Semantics Parameterized distributions Chapter 14.1 3 2 Bayesian networks A simple, graphical notation for conditional independence assertions
More informationBayesian networks. Chapter Chapter
Bayesian networks Chapter 14.1 3 Chapter 14.1 3 1 Outline Syntax Semantics Parameterized distributions Chapter 14.1 3 2 Bayesian networks A simple, graphical notation for conditional independence assertions
More informationBayesian Network. Outline. Bayesian Network. Syntax Semantics Exact inference by enumeration Exact inference by variable elimination
Outline Syntax Semantics Exact inference by enumeration Exact inference by variable elimination s A simple, graphical notation for conditional independence assertions and hence for compact specication
More informationInference in Bayesian networks
Inference in Bayesian networks AIMA2e hapter 14.4 5 1 Outline Exact inference by enumeration Exact inference by variable elimination Approximate inference by stochastic simulation Approximate inference
More informationOutline } Conditional independence } Bayesian networks: syntax and semantics } Exact inference } Approximate inference AIMA Slides cstuart Russell and
Belief networks Chapter 15.1{2 AIMA Slides cstuart Russell and Peter Norvig, 1998 Chapter 15.1{2 1 Outline } Conditional independence } Bayesian networks: syntax and semantics } Exact inference } Approximate
More informationBayesian networks. Chapter AIMA2e Slides, Stuart Russell and Peter Norvig, Completed by Kazim Fouladi, Fall 2008 Chapter 14.
Bayesian networks Chapter 14.1 3 AIMA2e Slides, Stuart Russell and Peter Norvig, Completed by Kazim Fouladi, Fall 2008 Chapter 14.1 3 1 Outline Syntax Semantics Parameterized distributions AIMA2e Slides,
More informationBayesian Networks. Philipp Koehn. 6 April 2017
Bayesian Networks Philipp Koehn 6 April 2017 Outline 1 Bayesian Networks Parameterized distributions Exact inference Approximate inference 2 bayesian networks Bayesian Networks 3 A simple, graphical notation
More informationBayesian networks: Modeling
Bayesian networks: Modeling CS194-10 Fall 2011 Lecture 21 CS194-10 Fall 2011 Lecture 21 1 Outline Overview of Bayes nets Syntax and semantics Examples Compact conditional distributions CS194-10 Fall 2011
More informationBayesian Networks. Philipp Koehn. 29 October 2015
Bayesian Networks Philipp Koehn 29 October 2015 Outline 1 Bayesian Networks Parameterized distributions Exact inference Approximate inference 2 bayesian networks Bayesian Networks 3 A simple, graphical
More informationCS Belief networks. Chapter
CS 580 1 Belief networks Chapter 15.1 2 CS 580 2 Outline Conditional independence Bayesian networks: syntax and semantics Exact inference Approximate inference CS 580 3 Independence Two random variables
More informationExample. Bayesian networks. Outline. Example. Bayesian networks. Example contd. Topology of network encodes conditional independence assertions:
opology of network encodes conditional independence assertions: ayesian networks Weather Cavity Chapter 4. 3 oothache Catch W eather is independent of the other variables oothache and Catch are conditionally
More informationOutline. Bayesian networks. Example. Bayesian networks. Example contd. Example. Syntax. Semantics Parameterized distributions. Chapter 14.
Outline Syntax ayesian networks Semantics Parameterized distributions Chapter 4. 3 Chapter 4. 3 Chapter 4. 3 2 ayesian networks simple, graphical notation for conditional independence assertions and hence
More informationArtificial Intelligence Methods. Inference in Bayesian networks
Artificial Intelligence Methods Inference in Bayesian networks In which we explain how to build network models to reason under uncertainty according to the laws of probability theory. Dr. Igor rajkovski
More informationInference in Bayesian networks
Inference in Bayesian networks hapter 14.4 5 hapter 14.4 5 1 Exact inference by enumeration Outline Approximate inference by stochastic simulation hapter 14.4 5 2 Inference tasks Simple queries: compute
More informationOutline } Exact inference by enumeration } Exact inference by variable elimination } Approximate inference by stochastic simulation } Approximate infe
Inference in belief networks Chapter 15.3{4 + new AIMA Slides cstuart Russell and Peter Norvig, 1998 Chapter 15.3{4 + new 1 Outline } Exact inference by enumeration } Exact inference by variable elimination
More informationBayesian networks. Chapter 14, Sections 1 4
Bayesian networks Chapter 14, Sections 1 4 Artificial Intelligence, spring 2013, Peter Ljunglöf; based on AIMA Slides c Stuart Russel and Peter Norvig, 2004 Chapter 14, Sections 1 4 1 Bayesian networks
More informationCourse Overview. Summary. Outline
Course Overview Lecture 9 Baysian Networks Marco Chiarandini Deptartment of Mathematics & Computer Science University of Southern Denmark Slides by Stuart Russell and Peter Norvig Introduction Artificial
More informationStochastic inference in Bayesian networks, Markov chain Monte Carlo methods
Stochastic inference in Bayesian networks, Markov chain Monte Carlo methods AI: Stochastic inference in BNs AI: Stochastic inference in BNs 1 Outline ypes of inference in (causal) BNs Hardness of exact
More informationInference in Bayesian Networks
Lecture 7 Inference in Bayesian Networks Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Slides by Stuart Russell and Peter Norvig Course Overview Introduction
More informationObjectives. Probabilistic Reasoning Systems. Outline. Independence. Conditional independence. Conditional independence II.
Copyright Richard J. Povinelli rev 1.0, 10/1//2001 Page 1 Probabilistic Reasoning Systems Dr. Richard J. Povinelli Objectives You should be able to apply belief networks to model a problem with uncertainty.
More informationProbabilistic Reasoning Systems
Probabilistic Reasoning Systems Dr. Richard J. Povinelli Copyright Richard J. Povinelli rev 1.0, 10/7/2001 Page 1 Objectives You should be able to apply belief networks to model a problem with uncertainty.
More informationUncertainty and Bayesian Networks
Uncertainty and Bayesian Networks Tutorial 3 Tutorial 3 1 Outline Uncertainty Probability Syntax and Semantics for Uncertainty Inference Independence and Bayes Rule Syntax and Semantics for Bayesian Networks
More informationBelief Networks for Probabilistic Inference
1 Belief Networks for Probabilistic Inference Liliana Mamani Sanchez lmamanis@tcd.ie October 27, 2015 Background Last lecture we saw that using joint distributions for probabilistic inference presented
More informationBayesian networks. AIMA2e Chapter 14
Bayesian networks AIMA2e Chapter 14 Outline Syntax Semantics Parameterized distributions Bayesian networks A simple, graphical notation for conditional independence assertions and hence for compact specification
More informationGraphical Models - Part I
Graphical Models - Part I Oliver Schulte - CMPT 726 Bishop PRML Ch. 8, some slides from Russell and Norvig AIMA2e Outline Probabilistic Models Bayesian Networks Markov Random Fields Inference Outline Probabilistic
More informationPROBABILISTIC REASONING SYSTEMS
PROBABILISTIC REASONING SYSTEMS In which we explain how to build reasoning systems that use network models to reason with uncertainty according to the laws of probability theory. Outline Knowledge in uncertain
More informationEE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 16, 6/1/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes Uncertainty & Bayesian Networks
More informationLecture 10: Bayesian Networks and Inference
Lecture 10: Bayesian Networks and Inference CS 580 (001) - Spring 2016 Amarda Shehu Department of Computer Science George Mason University, Fairfax, VA, USA Apr 13-20, 2016 Amarda Shehu (580) 1 1 Outline
More informationReview: Bayesian learning and inference
Review: Bayesian learning and inference Suppose the agent has to make decisions about the value of an unobserved query variable X based on the values of an observed evidence variable E Inference problem:
More informationProbabilistic Reasoning. (Mostly using Bayesian Networks)
Probabilistic Reasoning (Mostly using Bayesian Networks) Introduction: Why probabilistic reasoning? The world is not deterministic. (Usually because information is limited.) Ways of coping with uncertainty
More informationp(x) p(x Z) = y p(y X, Z) = αp(x Y, Z)p(Y Z)
Graphical Models Foundations of Data Analysis Torsten Möller Möller/Mori 1 Reading Chapter 8 Pattern Recognition and Machine Learning by Bishop some slides from Russell and Norvig AIMA2e Möller/Mori 2
More informationGraphical Models - Part II
Graphical Models - Part II Bishop PRML Ch. 8 Alireza Ghane Outline Probabilistic Models Bayesian Networks Markov Random Fields Inference Graphical Models Alireza Ghane / Greg Mori 1 Outline Probabilistic
More informationProbabilistic Models Bayesian Networks Markov Random Fields Inference. Graphical Models. Foundations of Data Analysis
Graphical Models Foundations of Data Analysis Torsten Möller and Thomas Torsney-Weir Möller/Mori 1 Reading Chapter 8 Pattern Recognition and Machine Learning by Bishop some slides from Russell and Norvig
More informationArtificial Intelligence
ICS461 Fall 2010 Nancy E. Reed nreed@hawaii.edu 1 Lecture #14B Outline Inference in Bayesian Networks Exact inference by enumeration Exact inference by variable elimination Approximate inference by stochastic
More informationBelief networks Chapter 15.1í2. AIMA Slides cæstuart Russell and Peter Norvig, 1998 Chapter 15.1í2 1
Belief networks Chapter 15.1í2 AIMA Slides cæstuart Russell and Peter Norvig, 1998 Chapter 15.1í2 1 í Conditional independence Outline í Bayesian networks: syntax and semantics í Exact inference í Approximate
More information14 PROBABILISTIC REASONING
228 14 PROBABILISTIC REASONING A Bayesian network is a directed graph in which each node is annotated with quantitative probability information 1. A set of random variables makes up the nodes of the network.
More informationProbabilistic representation and reasoning
Probabilistic representation and reasoning Applied artificial intelligence (EDAF70) Lecture 04 2019-02-01 Elin A. Topp Material based on course book, chapter 13, 14.1-3 1 Show time! Two boxes of chocolates,
More informationQuantifying uncertainty & Bayesian networks
Quantifying uncertainty & Bayesian networks CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2016 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition,
More informationProbabilistic representation and reasoning
Probabilistic representation and reasoning Applied artificial intelligence (EDA132) Lecture 09 2017-02-15 Elin A. Topp Material based on course book, chapter 13, 14.1-3 1 Show time! Two boxes of chocolates,
More informationBayesian Networks BY: MOHAMAD ALSABBAGH
Bayesian Networks BY: MOHAMAD ALSABBAGH Outlines Introduction Bayes Rule Bayesian Networks (BN) Representation Size of a Bayesian Network Inference via BN BN Learning Dynamic BN Introduction Conditional
More informationBayes Networks 6.872/HST.950
Bayes Networks 6.872/HST.950 What Probabilistic Models Should We Use? Full joint distribution Completely expressive Hugely data-hungry Exponential computational complexity Naive Bayes (full conditional
More informationArtificial Intelligence Bayes Nets: Independence
Artificial Intelligence Bayes Nets: Independence Instructors: David Suter and Qince Li Course Delivered @ Harbin Institute of Technology [Many slides adapted from those created by Dan Klein and Pieter
More informationOutline. CSE 573: Artificial Intelligence Autumn Bayes Nets: Big Picture. Bayes Net Semantics. Hidden Markov Models. Example Bayes Net: Car
CSE 573: Artificial Intelligence Autumn 2012 Bayesian Networks Dan Weld Many slides adapted from Dan Klein, Stuart Russell, Andrew Moore & Luke Zettlemoyer Outline Probabilistic models (and inference)
More informationInformatics 2D Reasoning and Agents Semester 2,
Informatics 2D Reasoning and Agents Semester 2, 2017 2018 Alex Lascarides alex@inf.ed.ac.uk Lecture 23 Probabilistic Reasoning with Bayesian Networks 15th March 2018 Informatics UoE Informatics 2D 1 Where
More informationReasoning Under Uncertainty
Reasoning Under Uncertainty Introduction Representing uncertain knowledge: logic and probability (a reminder!) Probabilistic inference using the joint probability distribution Bayesian networks The Importance
More informationProbabilistic Reasoning. Kee-Eung Kim KAIST Computer Science
Probabilistic Reasoning Kee-Eung Kim KAIST Computer Science Outline #1 Acting under uncertainty Probabilities Inference with Probabilities Independence and Bayes Rule Bayesian networks Inference in Bayesian
More informationBayes Nets: Independence
Bayes Nets: Independence [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at http://ai.berkeley.edu.] Bayes Nets A Bayes
More informationAnother look at Bayesian. inference
Another look at Bayesian A general scenario: - Query variables: X inference - Evidence (observed) variables and their values: E = e - Unobserved variables: Y Inference problem: answer questions about the
More informationBayesian networks. Soleymani. CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018
Bayesian networks CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018 Soleymani Slides have been adopted from Klein and Abdeel, CS188, UC Berkeley. Outline Probability
More informationCS 5522: Artificial Intelligence II
CS 5522: Artificial Intelligence II Bayes Nets: Independence Instructor: Alan Ritter Ohio State University [These slides were adapted from CS188 Intro to AI at UC Berkeley. All materials available at http://ai.berkeley.edu.]
More informationCSE 473: Artificial Intelligence Autumn 2011
CSE 473: Artificial Intelligence Autumn 2011 Bayesian Networks Luke Zettlemoyer Many slides over the course adapted from either Dan Klein, Stuart Russell or Andrew Moore 1 Outline Probabilistic models
More informationBayesian Belief Network
Bayesian Belief Network a! b) = a) b) toothache, catch, cavity, Weather = cloudy) = = Weather = cloudy) toothache, catch, cavity) The decomposition of large probabilistic domains into weakly connected
More informationBayesian Networks. Vibhav Gogate The University of Texas at Dallas
Bayesian Networks Vibhav Gogate The University of Texas at Dallas Intro to AI (CS 6364) Many slides over the course adapted from either Dan Klein, Luke Zettlemoyer, Stuart Russell or Andrew Moore 1 Outline
More informationBayesian Networks. Semantics of Bayes Nets. Example (Binary valued Variables) CSC384: Intro to Artificial Intelligence Reasoning under Uncertainty-III
CSC384: Intro to Artificial Intelligence Reasoning under Uncertainty-III Bayesian Networks Announcements: Drop deadline is this Sunday Nov 5 th. All lecture notes needed for T3 posted (L13,,L17). T3 sample
More informationDirected Graphical Models
CS 2750: Machine Learning Directed Graphical Models Prof. Adriana Kovashka University of Pittsburgh March 28, 2017 Graphical Models If no assumption of independence is made, must estimate an exponential
More informationReasoning Under Uncertainty
Reasoning Under Uncertainty Introduction Representing uncertain knowledge: logic and probability (a reminder!) Probabilistic inference using the joint probability distribution Bayesian networks (theory
More informationCS 2750: Machine Learning. Bayesian Networks. Prof. Adriana Kovashka University of Pittsburgh March 14, 2016
CS 2750: Machine Learning Bayesian Networks Prof. Adriana Kovashka University of Pittsburgh March 14, 2016 Plan for today and next week Today and next time: Bayesian networks (Bishop Sec. 8.1) Conditional
More informationProbabilistic Graphical Models and Bayesian Networks. Artificial Intelligence Bert Huang Virginia Tech
Probabilistic Graphical Models and Bayesian Networks Artificial Intelligence Bert Huang Virginia Tech Concept Map for Segment Probabilistic Graphical Models Probabilistic Time Series Models Particle Filters
More informationUncertainty. 22c:145 Artificial Intelligence. Problem of Logic Agents. Foundations of Probability. Axioms of Probability
Problem of Logic Agents 22c:145 Artificial Intelligence Uncertainty Reading: Ch 13. Russell & Norvig Logic-agents almost never have access to the whole truth about their environments. A rational agent
More informationQuantifying Uncertainty
Quantifying Uncertainty CSL 302 ARTIFICIAL INTELLIGENCE SPRING 2014 Outline Probability theory - basics Probabilistic Inference oinference by enumeration Conditional Independence Bayesian Networks Learning
More informationArtificial Intelligence Bayesian Networks
Artificial Intelligence Bayesian Networks Stephan Dreiseitl FH Hagenberg Software Engineering & Interactive Media Stephan Dreiseitl (Hagenberg/SE/IM) Lecture 11: Bayesian Networks Artificial Intelligence
More informationAnnouncements. CS 188: Artificial Intelligence Fall Causality? Example: Traffic. Topology Limits Distributions. Example: Reverse Traffic
CS 188: Artificial Intelligence Fall 2008 Lecture 16: Bayes Nets III 10/23/2008 Announcements Midterms graded, up on glookup, back Tuesday W4 also graded, back in sections / box Past homeworks in return
More informationProbabilistic Models. Models describe how (a portion of) the world works
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
More informationSchool of EECS Washington State University. Artificial Intelligence
School of EECS Washington State University Artificial Intelligence 1 } Full joint probability distribution Can answer any query But typically too large } Conditional independence Can reduce the number
More informationBayesian Networks. Vibhav Gogate The University of Texas at Dallas
Bayesian Networks Vibhav Gogate The University of Texas at Dallas Intro to AI (CS 4365) Many slides over the course adapted from either Dan Klein, Luke Zettlemoyer, Stuart Russell or Andrew Moore 1 Outline
More informationCS 484 Data Mining. Classification 7. Some slides are from Professor Padhraic Smyth at UC Irvine
CS 484 Data Mining Classification 7 Some slides are from Professor Padhraic Smyth at UC Irvine Bayesian Belief networks Conditional independence assumption of Naïve Bayes classifier is too strong. Allows
More informationCS 188: Artificial Intelligence. Bayes Nets
CS 188: Artificial Intelligence Probabilistic Inference: Enumeration, Variable Elimination, Sampling Pieter Abbeel UC Berkeley Many slides over this course adapted from Dan Klein, Stuart Russell, Andrew
More informationqfundamental Assumption qbeyond the Bayes net Chain rule conditional independence assumptions,
Bayes Nets: Conditional Independence qfundamental Assumption qbeyond the Bayes net Chain rule conditional independence assumptions, oadditional conditional independencies, that can be read off the graph.
More informationOutline. CSE 473: Artificial Intelligence Spring Bayes Nets: Big Picture. Bayes Net Semantics. Hidden Markov Models. Example Bayes Net: Car
CSE 473: rtificial Intelligence Spring 2012 ayesian Networks Dan Weld Outline Probabilistic models (and inference) ayesian Networks (Ns) Independence in Ns Efficient Inference in Ns Learning Many slides
More informationDirected Graphical Models or Bayesian Networks
Directed Graphical Models or Bayesian Networks Le Song Machine Learning II: Advanced Topics CSE 8803ML, Spring 2012 Bayesian Networks One of the most exciting recent advancements in statistical AI Compact
More informationOutline. CSE 573: Artificial Intelligence Autumn Agent. Partial Observability. Markov Decision Process (MDP) 10/31/2012
CSE 573: Artificial Intelligence Autumn 2012 Reasoning about Uncertainty & Hidden Markov Models Daniel Weld Many slides adapted from Dan Klein, Stuart Russell, Andrew Moore & Luke Zettlemoyer 1 Outline
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2011 Lecture 16: Bayes Nets IV Inference 3/28/2011 Pieter Abbeel UC Berkeley Many slides over this course adapted from Dan Klein, Stuart Russell, Andrew Moore Announcements
More informationPROBABILISTIC REASONING Outline
PROBABILISTIC REASONING Outline Danica Kragic Uncertainty Probability Syntax and Semantics Inference Independence and Bayes Rule September 23, 2005 Uncertainty - Let action A t = leave for airport t minutes
More informationSampling Rejection Sampling Importance Sampling Markov Chain Monte Carlo. Sampling Methods. Machine Learning. Torsten Möller.
Sampling Methods Machine Learning orsten Möller Möller/Mori 1 Recall Inference or General Graphs Junction tree algorithm is an exact inference method for arbitrary graphs A particular tree structure defined
More informationAnnouncements. CS 188: Artificial Intelligence Spring Probability recap. Outline. Bayes Nets: Big Picture. Graphical Model Notation
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
More informationProduct rule. Chain rule
Probability Recap CS 188: Artificial Intelligence ayes Nets: Independence Conditional probability Product rule Chain rule, independent if and only if: and are conditionally independent given if and only
More informationIntelligent Systems (AI-2)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 11 Oct, 3, 2016 CPSC 422, Lecture 11 Slide 1 422 big picture: Where are we? Query Planning Deterministic Logics First Order Logics Ontologies
More informationBayesian networks (1) Lirong Xia
Bayesian networks (1) Lirong Xia Random variables and joint distributions Ø A random variable is a variable with a domain Random variables: capital letters, e.g. W, D, L values: small letters, e.g. w,
More informationlast two digits of your SID
Announcements Midterm: Wednesday 7pm-9pm See midterm prep page (posted on Piazza, inst.eecs page) Four rooms; your room determined by last two digits of your SID: 00-32: Dwinelle 155 33-45: Genetics and
More informationUncertainty. Introduction to Artificial Intelligence CS 151 Lecture 2 April 1, CS151, Spring 2004
Uncertainty Introduction to Artificial Intelligence CS 151 Lecture 2 April 1, 2004 Administration PA 1 will be handed out today. There will be a MATLAB tutorial tomorrow, Friday, April 2 in AP&M 4882 at
More informationBayesian Networks. Motivation
Bayesian Networks Computer Sciences 760 Spring 2014 http://pages.cs.wisc.edu/~dpage/cs760/ Motivation Assume we have five Boolean variables,,,, The joint probability is,,,, How many state configurations
More informationSampling Methods. Bishop PRML Ch. 11. Alireza Ghane. Sampling Rejection Sampling Importance Sampling Markov Chain Monte Carlo
Sampling Methods Bishop PRML h. 11 Alireza Ghane Sampling Methods A. Ghane /. Möller / G. Mori 1 Recall Inference or General Graphs Junction tree algorithm is an exact inference method for arbitrary graphs
More informationBayes Networks. CS540 Bryan R Gibson University of Wisconsin-Madison. Slides adapted from those used by Prof. Jerry Zhu, CS540-1
Bayes Networks CS540 Bryan R Gibson University of Wisconsin-Madison Slides adapted from those used by Prof. Jerry Zhu, CS540-1 1 / 59 Outline Joint Probability: great for inference, terrible to obtain
More informationIntroduction to Artificial Intelligence. Unit # 11
Introduction to Artificial Intelligence Unit # 11 1 Course Outline Overview of Artificial Intelligence State Space Representation Search Techniques Machine Learning Logic Probabilistic Reasoning/Bayesian
More informationCS 343: Artificial Intelligence
CS 343: Artificial Intelligence Bayes Nets: Sampling Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationProbabilistic Models
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
More informationBayes 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 Fall 2010 Lecture 15: ayes Nets II Independence 10/14/2010 an Klein UC erkeley A ayes net is an efficient encoding of a probabilistic model of a domain ayes Nets Questions
More informationIntroduction to Bayesian Networks
Introduction to Bayesian Networks Ying Wu Electrical Engineering and Computer Science Northwestern University Evanston, IL 60208 http://www.eecs.northwestern.edu/~yingwu 1/23 Outline Basic Concepts Bayesian
More informationLecture 10: Introduction to reasoning under uncertainty. Uncertainty
Lecture 10: Introduction to reasoning under uncertainty Introduction to reasoning under uncertainty Review of probability Axioms and inference Conditional probability Probability distributions COMP-424,
More informationProbability. CS 3793/5233 Artificial Intelligence Probability 1
CS 3793/5233 Artificial Intelligence 1 Motivation Motivation Random Variables Semantics Dice Example Joint Dist. Ex. Axioms Agents don t have complete knowledge about the world. Agents need to make decisions
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 12. Making Simple Decisions under Uncertainty Probability Theory, Bayesian Networks, Other Approaches Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität
More informationGraphical Models and Kernel Methods
Graphical Models and Kernel Methods Jerry Zhu Department of Computer Sciences University of Wisconsin Madison, USA MLSS June 17, 2014 1 / 123 Outline Graphical Models Probabilistic Inference Directed vs.
More informationCOS402- Artificial Intelligence Fall Lecture 10: Bayesian Networks & Exact Inference
COS402- Artificial Intelligence Fall 2015 Lecture 10: Bayesian Networks & Exact Inference Outline Logical inference and probabilistic inference Independence and conditional independence Bayes Nets Semantics
More informationArtificial Intelligence Bayes Nets
rtificial Intelligence ayes Nets print troubleshooter (part of Windows 95) Nilsson - hapter 19 Russell and Norvig - hapter 14 ayes Nets; page 1 of 21 ayes Nets; page 2 of 21 joint probability distributions
More informationIntroduction to Probabilistic Reasoning. Image credit: NASA. Assignment
Introduction to Probabilistic Reasoning Brian C. Williams 16.410/16.413 November 17 th, 2010 11/17/10 copyright Brian Williams, 2005-10 1 Brian C. Williams, copyright 2000-09 Image credit: NASA. Assignment
More informationInference in Graphical Models Variable Elimination and Message Passing Algorithm
Inference in Graphical Models Variable Elimination and Message Passing lgorithm Le Song Machine Learning II: dvanced Topics SE 8803ML, Spring 2012 onditional Independence ssumptions Local Markov ssumption
More informationIntroduction to Bayes Nets. CS 486/686: Introduction to Artificial Intelligence Fall 2013
Introduction to Bayes Nets CS 486/686: Introduction to Artificial Intelligence Fall 2013 1 Introduction Review probabilistic inference, independence and conditional independence Bayesian Networks - - What
More information