Sampling Methods. Bishop PRML Ch. 11. Alireza Ghane. Sampling Rejection Sampling Importance Sampling Markov Chain Monte Carlo
|
|
- Avice Knight
- 5 years ago
- Views:
Transcription
1 Sampling Methods Bishop PRML h. 11 Alireza Ghane Sampling Methods A. Ghane /. Möller / G. Mori 1
2 Recall Inference or General Graphs Junction tree algorithm is an exact inference method for arbitrary graphs A particular tree structure defined over cliques of variables Inference ends up being exponential in maximum clique size herefore slow in many cases Sampling methods: represent desired distribution with a set of samples, as more samples are used, obtain more accurate representation Sampling Methods A. Ghane /. Möller / G. Mori 2
3 Outline Sampling Rejection Sampling Importance Sampling Markov hain Monte arlo Sampling Methods A. Ghane /. Möller / G. Mori 3
4 Outline Sampling Rejection Sampling Importance Sampling Markov hain Monte arlo Sampling Methods A. Ghane /. Möller / G. Mori 4
5 Sampling he fundamental problem we address in this lecture is how to obtain samples from a probability distribution p(z) his could be a conditional distribution p(z e) We often wish to evaluate expectations such as E[f] = f(z)p(z)dz e.g. mean when f(z) = z or complicated p(z), this is difficult to do exactly, approximate as ˆf = 1 L f(z (l) ) L l=1 where {z (l) l = 1,..., L} are independent samples from p(z) Sampling Methods A. Ghane /. Möller / G. Mori 5
6 Sampling p(z) f(z) z Approximate ˆf = 1 L L f(z (l) ) l=1 where {z (l) l = 1,..., L} are independent samples from p(z) Sampling Methods A. Ghane /. Möller / G. Mori 6
7 Bayesian Networks - Generating air Samples P() loudy P(S ).10 [from Russell and Norvig, AIMA] Sprinkler S Wet Grass R P(W S,R) Rain P(R ) How can we generate a fair set of samples from this BN? Sampling Methods A. Ghane /. Möller / G. Mori 7
8 Sampling from Bayesian Networks Sampling from discrete Bayesian networks with no observations is straight-forward, using ancestral sampling Bayesian network specifies factorization of joint distribution P (z 1,..., z n ) = n P (z i pa(z i )) i=1 Sample in-order, sample parents before children Possible because graph is a DAG hoose value for z i from p(z i pa(z i )) Sampling Methods A. Ghane /. Möller / G. Mori 8
9 Sampling rom Empty Network Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 9
10 Sampling rom Empty Network Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 10
11 Sampling rom Empty Network Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 11
12 Sampling rom Empty Network Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 12
13 Sampling rom Empty Network Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 13
14 Sampling rom Empty Network Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 14
15 Sampling rom Empty Network Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 15
16 Ancestral Sampling his sampling procedure is fair, the fraction of samples with a particular value tends towards the joint probability of that value Define S P S (z 1,..., z n ) to be the probability of generating the event (z 1,..., z n ) his is equal to p(z 1,..., z n ) due to the semantics of the Bayesian network Define N P S (z 1,..., z n ) to be the number of times we generate the event (z 1,..., z n ) N P S (z 1,..., z n ) lim = S P S (z 1,..., z n ) = p(z 1,..., z n ) N N Sampling Methods A. Ghane /. Möller / G. Mori 16
17 Sampling Marginals P() Note that this procedure can be applied to generate samples for marginals as well P(S ).10 Sprinkler loudy Rain P(R ) Simply discard portions of sample which are not needed S R Wet Grass P(W S,R) e.g. or marginal p(rain), sample (cloudy = t, sprinkler = f, rain = t, wg = t) just becomes (rain = t) Still a fair sampling procedure Sampling Methods A. Ghane /. Möller / G. Mori 17
18 Sampling with Evidence What if we observe some values and want samples from p(z e)? Naive method, logic sampling: Generate N samples from p(z) using ancestral sampling Discard those samples that do not have correct evidence values e.g. or p(rain cloudy = t, spr = t, wg = t), sample (cloudy = t, spr = f, rain = t, wg = t) discarded Generates fair samples, but wastes time Many samples will be discarded for low p(e) Sampling Methods A. Ghane /. Möller / G. Mori 18
19 Other Problems ontinuous variables? Gaussian okay, Box-Muller and other methods More complex distributions? Undirected graphs (MRs)? Sampling Methods A. Ghane /. Möller / G. Mori 19
20 Outline Sampling Rejection Sampling Importance Sampling Markov hain Monte arlo Sampling Methods A. Ghane /. Möller / G. Mori 20
21 Rejection Sampling p(z) f(z) z onsider the case of an arbitrary, continuous p(z) How can we draw samples from it? Assume we can evaluate p(z), up to some normalization constant p(z) = 1 Z p p(z) where p(z) can be efficiently evaluated (e.g. MR) Sampling Methods A. Ghane /. Möller / G. Mori 21
22 Proposal Distribution kq(z 0 ) kq(z) u 0 p(z) z 0 z Let s also assume that we have some simpler distribution q(z) called a proposal distribution from which we can easily draw samples e.g. q(z) is a Gaussian We can then draw samples from q(z) and use these But these wouldn t be fair samples from p(z)?! Sampling Methods A. Ghane /. Möller / G. Mori 22
23 omparison unction and Rejection kq(z 0 ) kq(z) u 0 p(z) z 0 z Introduce constant k such that kq(z) p(z) for all z Rejection sampling procedure: Generate z 0 from q(z) Generate u 0 from [0, kq(z 0 )] uniformly If u 0 > p(z) reject sample z 0, otherwise keep it Original samples are uniform in grey region Kept samples uniform in white region hence samples from p(z) Sampling Methods A. Ghane /. Möller / G. Mori 23
24 Rejection Sampling Analysis How likely are we to keep samples? Probability a sample is accepted is: p(accept) = { p(z)/kq(z)}q(z)dz = 1 p(z)dz k Smaller k is better subject to kq(z) p(z) for all z If q(z) is similar to p(z), this is easier In high-dim spaces, acceptance ratio falls off exponentially inding a suitable k challenging Sampling Methods A. Ghane /. Möller / G. Mori 24
25 Outline Sampling Rejection Sampling Importance Sampling Markov hain Monte arlo Sampling Methods A. Ghane /. Möller / G. Mori 25
26 Discretization Importance sampling is a sampling technique for computing expectations: E[f] = f(z)p(z)dz ould approximate using discretization over a uniform grid: E[f] L f(z (l) )p(z (l) ) l=1 c.f. Riemannian sum Much wasted computation, exponential scaling in dimension Instead, again use a proposal distribution instead of a uniform grid Sampling Methods A. Ghane /. Möller / G. Mori 26
27 Importance sampling p(z) q(z) f(z) z Approximate expectation E[f] = f(z)p(z)dz = 1 L L l=1 f(z (l) ) p(z(l) ) q(z (l) ) f(z) p(z) q(z) q(z)dz Quantities p(z (l) )/q(z (l) ) are known as importance weights orrect for use of wrong distribution q(z) in sampling Sampling Methods A. Ghane /. Möller / G. Mori 27
28 Likelihood Weighted Sampling onsider the case where we have evidence e and again desire an expectation over p(x e) If we have a Bayesian network, we can use a particular type of importance sampling called likelihood weighted sampling: Perform ancestral sampling If a variable z i is in the evidence set, set its value rather than sampling Importance weights are:?? Sampling Methods A. Ghane /. Möller / G. Mori 28
29 Likelihood Weighted Sampling onsider the case where we have evidence e and again desire an expectation over p(x e) If we have a Bayesian network, we can use a particular type of importance sampling called likelihood weighted sampling: Perform ancestral sampling If a variable z i is in the evidence set, set its value rather than sampling Importance weights are: p(z (l) ) q(z (l) ) =? Sampling Methods A. Ghane /. Möller / G. Mori 29
30 Likelihood Weighted Sampling onsider the case where we have evidence e and again desire an expectation over p(x e) If we have a Bayesian network, we can use a particular type of importance sampling called likelihood weighted sampling: Perform ancestral sampling If a variable z i is in the evidence set, set its value rather than sampling Importance weights are: p(z (l) ) q(z (l) ) = p(x, e) p(e) 1 z i e p(z i pa i ) z i e p(z i pa i ) Sampling Methods A. Ghane /. Möller / G. Mori 30
31 Likelihood Weighted Sampling Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] w = 1.0 S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 31
32 Likelihood Weighted Sampling Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] w = 1.0 S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 32
33 Likelihood Weighted Sampling Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] w = S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 33
34 Likelihood Weighted Sampling Example P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass [from Russell and Norvig, AIMA] w = S R P(W S,R) Sampling Methods A. Ghane /. Möller / G. Mori 34
35 Likelihood Weighted Sampling Example P() loudy P(S ).10 Sprinkler [from Russell and Norvig, AIMA] w = = S Wet Grass R P(W S,R) Rain P(R ) Sampling Methods A. Ghane /. Möller / G. Mori 35
36 Sampling Importance Resampling Note that importance sampling, e.g. likelihood weighted sampling, gives approximation to expectation, not samples But samples can be obtained using these ideas Sampling-importance-resampling uses a proposal distribution q(z) to generate samples Unlike rejection sampling, no parameter k is needed Sampling Methods A. Ghane /. Möller / G. Mori 36
37 SIR - Algorithm Sampling-importance-resampling algorithm has two stages Sampling: Draw samples z (1),..., z (L) from proposal distribution q(z) Importance resampling: Put weights on samples p(z (l) )/q(z (l) ) w l = m p(z(m) )/q(z (m) ) Draw samples from the discrete set z (1),..., z (L) according to weights w l (uniform distribution) his two stage process is correct in the limit as L Sampling Methods A. Ghane /. Möller / G. Mori 37
38 Outline Sampling Rejection Sampling Importance Sampling Markov hain Monte arlo Sampling Methods A. Ghane /. Möller / G. Mori 38
39 Markov hain Monte arlo Markov chain Monte arlo (MM) methods also use a proposal distribution to generate samples from another distribution Unlike the previous methods, we keep track of the samples generated z (1),..., z (τ) he proposal distribution depends on the current state: q(z z (τ) ) Intuitively, walking around in state space, each step depends only on the current state Sampling Methods A. Ghane /. Möller / G. Mori 39
40 Metropolis Algorithm Simple algorithm for walking around in state space: Draw sample z q(z z (τ) ) Accept sample with probability ( A(z, z (τ) p(z ) ) ) = min 1, p(z (τ) ) If accepted z (τ+1) = z, else z (τ+1) = z (τ) Note that if z is better than z (τ), it is always accepted Every iteration produces a sample hough sometimes it s the same as previous ontrast with rejection sampling he basic Metropolis algorithm assumes the proposal distribution is symmetric q(z A z B ) = q(z B z A ) Sampling Methods A. Ghane /. Möller / G. Mori 40
41 Metropolis Algorithm Simple algorithm for walking around in state space: Draw sample z q(z z (τ) ) Accept sample with probability ( A(z, z (τ) p(z ) ) ) = min 1, p(z (τ) ) If accepted z (τ+1) = z, else z (τ+1) = z (τ) Note that if z is better than z (τ), it is always accepted Every iteration produces a sample hough sometimes it s the same as previous ontrast with rejection sampling he basic Metropolis algorithm assumes the proposal distribution is symmetric q(z A z B ) = q(z B z A ) Sampling Methods A. Ghane /. Möller / G. Mori 41
42 Metropolis Algorithm Simple algorithm for walking around in state space: Draw sample z q(z z (τ) ) Accept sample with probability ( A(z, z (τ) p(z ) ) ) = min 1, p(z (τ) ) If accepted z (τ+1) = z, else z (τ+1) = z (τ) Note that if z is better than z (τ), it is always accepted Every iteration produces a sample hough sometimes it s the same as previous ontrast with rejection sampling he basic Metropolis algorithm assumes the proposal distribution is symmetric q(z A z B ) = q(z B z A ) Sampling Methods A. Ghane /. Möller / G. Mori 42
43 Metropolis Algorithm Simple algorithm for walking around in state space: Draw sample z q(z z (τ) ) Accept sample with probability ( A(z, z (τ) p(z ) ) ) = min 1, p(z (τ) ) If accepted z (τ+1) = z, else z (τ+1) = z (τ) Note that if z is better than z (τ), it is always accepted Every iteration produces a sample hough sometimes it s the same as previous ontrast with rejection sampling he basic Metropolis algorithm assumes the proposal distribution is symmetric q(z A z B ) = q(z B z A ) Sampling Methods A. Ghane /. Möller / G. Mori 43
44 Metropolis Example p(z) is anisotropic Gaussian, proposal distribution q(z) is isotropic Gaussian Red lines show rejected moves, green lines show accepted moves As τ, distribution of z (τ) tends to p(z) rue if q(z A z B ) > 0 In practice, burn-in the chain, collect samples after some iterations Only keep every M th sample Sampling Methods A. Ghane /. Möller / G. Mori 44
45 Metropolis Example - Graphical Model P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass S R P(W S,R) onsider running Metropolis algorithm to draw samples from p(cloudy, rain spr = t, wg = t) Define q(z z τ ) to be uniformly pick from cloudy, rain, uniformly reset its value Sampling Methods A. Ghane /. Möller / G. Mori 45
46 Metropolis Example loudy loudy Sprinkler Rain Sprinkler Rain Wet Grass Wet Grass loudy loudy Sprinkler Rain Sprinkler Rain Wet Grass Wet Grass Walk around in this state space, keep track of how many times each state occurs Sampling Methods A. Ghane /. Möller / G. Mori 46
47 Metropolis-Hastings Algorithm A generalization of the previous algorithm for asymmetric proposal distributions known as the Metropolis-Hastings algorithm Accept a step with probability ( A(z, z (τ) ) = min 1, ) p(z )q(z (τ) z ) p(z (τ) )q(z z (τ) ) A sufficient condition for this algorithm to produce the correct distribution is detailed balance Sampling Methods A. Ghane /. Möller / G. Mori 47
48 Gibbs Sampling A simple coordinate-wise MM method Given distribution p(z) = p(z 1,..., z M ), sample each variable (either in pre-defined or random order) Sample z (τ+1) 1 p(z 1 z (τ) 2, z(τ) 3,..., z(τ) M ) Sample z (τ+1) 2 p(z 2 z (τ+1) 1, z (τ) 3,..., z(τ) M )... Sample z (τ+1) M p(z M z (τ+1) 1, z (τ+1) 2,..., z (τ+1) M 1 ) hese are easy if Markov blanket is small, e.g. in MR with small cliques, and forms amenable to sampling Sampling Methods A. Ghane /. Möller / G. Mori 48
49 Gibbs Sampling - Example z 2 L l z 1 Sampling Methods A. Ghane /. Möller / G. Mori 49
50 Gibbs Sampling Example - Graphical Model P() loudy P(S ).10 Sprinkler Rain P(R ) Wet Grass S R P(W S,R) onsider running Gibbs sampling on p(cloudy, rain spr = t, wg = t) q(z z τ ): pick from cloudy, rain, reset its value according to p(cloudy rain, spr, wg) (or p(rain cloudy, spr, wg)) his is often easy only need to look at Markov blanket Sampling Methods A. Ghane /. Möller / G. Mori 50
51 onclusion Readings: h (we skipped much of it) Sampling methods use proposal distributions to obtain samples from complicated distributions Different methods, different methods of correcting for proposal distribution not matching desired distribution In practice, effectiveness relies on having good proposal distribution, which matches desired distribution well Sampling Methods A. Ghane /. Möller / G. Mori 51
Sampling 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 informationSampling Rejection Sampling Importance Sampling Markov Chain Monte Carlo. Sampling Methods. Oliver Schulte - CMPT 419/726. Bishop PRML Ch.
Sampling Methods Oliver Schulte - CMP 419/726 Bishop PRML Ch. 11 Recall Inference or General Graphs Junction tree algorithm is an exact inference method for arbitrary graphs A particular tree structure
More informationBasic Sampling Methods
Basic Sampling Methods Sargur Srihari srihari@cedar.buffalo.edu 1 1. Motivation Topics Intractability in ML How sampling can help 2. Ancestral Sampling Using BNs 3. Transforming a Uniform Distribution
More informationPattern Recognition and Machine Learning. Bishop Chapter 11: Sampling Methods
Pattern Recognition and Machine Learning Chapter 11: Sampling Methods Elise Arnaud Jakob Verbeek May 22, 2008 Outline of the chapter 11.1 Basic Sampling Algorithms 11.2 Markov Chain Monte Carlo 11.3 Gibbs
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 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 informationInformatics 2D Reasoning and Agents Semester 2,
Informatics 2D Reasoning and Agents Semester 2, 2018 2019 Alex Lascarides alex@inf.ed.ac.uk Lecture 25 Approximate Inference in Bayesian Networks 19th March 2019 Informatics UoE Informatics 2D 1 Where
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 informationStatistical Machine Learning Lecture 8: Markov Chain Monte Carlo Sampling
1 / 27 Statistical Machine Learning Lecture 8: Markov Chain Monte Carlo Sampling Melih Kandemir Özyeğin University, İstanbul, Turkey 2 / 27 Monte Carlo Integration The big question : Evaluate E p(z) [f(z)]
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 2018 Outlines Overview Introduction Linear Algebra Probability Linear Regression
More informationBayes Nets: Sampling
Bayes Nets: Sampling [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.] Approximate Inference:
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 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 informationBayesian networks. Independence. Bayesian networks. Markov conditions Inference. by enumeration rejection sampling Gibbs sampler
Bayesian networks Independence Bayesian networks Markov conditions Inference by enumeration rejection sampling Gibbs sampler Independence if P(A=a,B=a) = P(A=a)P(B=b) for all a and b, then we call A and
More informationSTA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Computer Science! Department of Statistical Sciences! rsalakhu@cs.toronto.edu! h0p://www.cs.utoronto.ca/~rsalakhu/ Lecture 7 Approximate
More informationAnnouncements. Inference. Mid-term. Inference by Enumeration. Reminder: Alarm Network. Introduction to Artificial Intelligence. V22.
Introduction to Artificial Intelligence V22.0472-001 Fall 2009 Lecture 15: Bayes Nets 3 Midterms graded Assignment 2 graded Announcements Rob Fergus Dept of Computer Science, Courant Institute, NYU Slides
More informationProbabilistic Graphical Models Lecture 17: Markov chain Monte Carlo
Probabilistic Graphical Models Lecture 17: Markov chain Monte Carlo Andrew Gordon Wilson www.cs.cmu.edu/~andrewgw Carnegie Mellon University March 18, 2015 1 / 45 Resources and Attribution Image credits,
More informationMarkov Chain Monte Carlo
1 Motivation 1.1 Bayesian Learning Markov Chain Monte Carlo Yale Chang In Bayesian learning, given data X, we make assumptions on the generative process of X by introducing hidden variables Z: p(z): prior
More informationCOMS 4771 Probabilistic Reasoning via Graphical Models. Nakul Verma
COMS 4771 Probabilistic Reasoning via Graphical Models Nakul Verma Last time Dimensionality Reduction Linear vs non-linear Dimensionality Reduction Principal Component Analysis (PCA) Non-linear methods
More informationBayes Net Representation. CS 188: Artificial Intelligence. Approximate Inference: Sampling. Variable Elimination. Sampling.
188: Artificial Intelligence Bayes Nets: ampling Bayes Net epresentation A directed, acyclic graph, one node per random variable A conditional probability table (PT) for each node A collection of distributions
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 information17 : Markov Chain Monte Carlo
10-708: Probabilistic Graphical Models, Spring 2015 17 : Markov Chain Monte Carlo Lecturer: Eric P. Xing Scribes: Heran Lin, Bin Deng, Yun Huang 1 Review of Monte Carlo Methods 1.1 Overview Monte Carlo
More informationMarkov Networks.
Markov Networks www.biostat.wisc.edu/~dpage/cs760/ Goals for the lecture you should understand the following concepts Markov network syntax Markov network semantics Potential functions Partition function
More informationBayesian Networks. instructor: Matteo Pozzi. x 1. x 2. x 3 x 4. x 5. x 6. x 7. x 8. x 9. Lec : Urban Systems Modeling
12735: Urban Systems Modeling Lec. 09 Bayesian Networks instructor: Matteo Pozzi x 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 1 outline example of applications how to shape a problem as a BN complexity of the inference
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 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 informationBayesian Inference and MCMC
Bayesian Inference and MCMC Aryan Arbabi Partly based on MCMC slides from CSC412 Fall 2018 1 / 18 Bayesian Inference - Motivation Consider we have a data set D = {x 1,..., x n }. E.g each x i can be the
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 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 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 informationMarkov chain Monte Carlo Lecture 9
Markov chain Monte Carlo Lecture 9 David Sontag New York University Slides adapted from Eric Xing and Qirong Ho (CMU) Limitations of Monte Carlo Direct (unconditional) sampling Hard to get rare events
More informationMCMC and Gibbs Sampling. Kayhan Batmanghelich
MCMC and Gibbs Sampling Kayhan Batmanghelich 1 Approaches to inference l Exact inference algorithms l l l The elimination algorithm Message-passing algorithm (sum-product, belief propagation) The junction
More informationApproximate Inference using MCMC
Approximate Inference using MCMC 9.520 Class 22 Ruslan Salakhutdinov BCS and CSAIL, MIT 1 Plan 1. Introduction/Notation. 2. Examples of successful Bayesian models. 3. Basic Sampling Algorithms. 4. Markov
More informationApril 20th, Advanced Topics in Machine Learning California Institute of Technology. Markov Chain Monte Carlo for Machine Learning
for for Advanced Topics in California Institute of Technology April 20th, 2017 1 / 50 Table of Contents for 1 2 3 4 2 / 50 History of methods for Enrico Fermi used to calculate incredibly accurate predictions
More informationMCMC and Gibbs Sampling. Sargur Srihari
MCMC and Gibbs Sampling Sargur srihari@cedar.buffalo.edu 1 Topics 1. Markov Chain Monte Carlo 2. Markov Chains 3. Gibbs Sampling 4. Basic Metropolis Algorithm 5. Metropolis-Hastings Algorithm 6. Slice
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 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 informationMachine Learning for Data Science (CS4786) Lecture 24
Machine Learning for Data Science (CS4786) Lecture 24 Graphical Models: Approximate Inference Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2016sp/ BELIEF PROPAGATION OR MESSAGE PASSING Each
More informationA Brief Introduction to Graphical Models. Presenter: Yijuan Lu November 12,2004
A Brief Introduction to Graphical Models Presenter: Yijuan Lu November 12,2004 References Introduction to Graphical Models, Kevin Murphy, Technical Report, May 2001 Learning in Graphical Models, Michael
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 information6.047 / Computational Biology: Genomes, Networks, Evolution Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.047 / 6.878 Computational Biology: Genomes, Networks, Evolution Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationBayesian networks: approximate inference
Bayesian networks: approximate inference Machine Intelligence Thomas D. Nielsen September 2008 Approximative inference September 2008 1 / 25 Motivation Because of the (worst-case) intractability of exact
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 informationBayes Nets III: Inference
1 Hal Daumé III (me@hal3.name) Bayes Nets III: Inference Hal Daumé III Computer Science University of Maryland me@hal3.name CS 421: Introduction to Artificial Intelligence 10 Apr 2012 Many slides courtesy
More informationSampling Algorithms for Probabilistic Graphical models
Sampling Algorithms for Probabilistic Graphical models Vibhav Gogate University of Washington References: Chapter 12 of Probabilistic Graphical models: Principles and Techniques by Daphne Koller and Nir
More informationSampling from Bayes Nets
from Bayes Nets http://www.youtube.com/watch?v=mvrtaljp8dm http://www.youtube.com/watch?v=geqip_0vjec Paper reviews Should be useful feedback for the authors A critique of the paper No paper is perfect!
More informationDAG models and Markov Chain Monte Carlo methods a short overview
DAG models and Markov Chain Monte Carlo methods a short overview Søren Højsgaard Institute of Genetics and Biotechnology University of Aarhus August 18, 2008 Printed: August 18, 2008 File: DAGMC-Lecture.tex
More informationBayesian Machine Learning
Bayesian Machine Learning Andrew Gordon Wilson ORIE 6741 Lecture 4 Occam s Razor, Model Construction, and Directed Graphical Models https://people.orie.cornell.edu/andrew/orie6741 Cornell University September
More informationPart I. C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS
Part I C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS Probabilistic Graphical Models Graphical representation of a probabilistic model Each variable corresponds to a
More informationProbabilistic Graphical Models (I)
Probabilistic Graphical Models (I) Hongxin Zhang zhx@cad.zju.edu.cn State Key Lab of CAD&CG, ZJU 2015-03-31 Probabilistic Graphical Models Modeling many real-world problems => a large number of random
More informationECE521 Tutorial 11. Topic Review. ECE521 Winter Credits to Alireza Makhzani, Alex Schwing, Rich Zemel and TAs for slides. ECE521 Tutorial 11 / 4
ECE52 Tutorial Topic Review ECE52 Winter 206 Credits to Alireza Makhzani, Alex Schwing, Rich Zemel and TAs for slides ECE52 Tutorial ECE52 Winter 206 Credits to Alireza / 4 Outline K-means, PCA 2 Bayesian
More informationInference in Bayesian Networks
Andrea Passerini passerini@disi.unitn.it Machine Learning Inference in graphical models Description Assume we have evidence e on the state of a subset of variables E in the model (i.e. Bayesian Network)
More informationLecture 17: May 29, 2002
EE596 Pat. Recog. II: Introduction to Graphical Models University of Washington Spring 2000 Dept. of Electrical Engineering Lecture 17: May 29, 2002 Lecturer: Jeff ilmes Scribe: Kurt Partridge, Salvador
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 informationCPSC 540: Machine Learning
CPSC 540: Machine Learning MCMC and Non-Parametric Bayes Mark Schmidt University of British Columbia Winter 2016 Admin I went through project proposals: Some of you got a message on Piazza. No news is
More informationApproximate Inference
Approximate Inference Simulation has a name: sampling Sampling is a hot topic in machine learning, and it s really simple Basic idea: Draw N samples from a sampling distribution S Compute an approximate
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 information27 : Distributed Monte Carlo Markov Chain. 1 Recap of MCMC and Naive Parallel Gibbs Sampling
10-708: Probabilistic Graphical Models 10-708, Spring 2014 27 : Distributed Monte Carlo Markov Chain Lecturer: Eric P. Xing Scribes: Pengtao Xie, Khoa Luu In this scribe, we are going to review the Parallel
More informationBayesian networks. Instructor: Vincent Conitzer
Bayesian networks Instructor: Vincent Conitzer Rain and sprinklers example raining (X) sprinklers (Y) P(X=1) =.3 P(Y=1) =.4 grass wet (Z) Each node has a conditional probability table (CPT) P(Z=1 X=0,
More informationLecture 8: Bayesian Networks
Lecture 8: Bayesian Networks Bayesian Networks Inference in Bayesian Networks COMP-652 and ECSE 608, Lecture 8 - January 31, 2017 1 Bayes nets P(E) E=1 E=0 0.005 0.995 E B P(B) B=1 B=0 0.01 0.99 E=0 E=1
More informationDirected and Undirected Graphical Models
Directed and Undirected Davide Bacciu Dipartimento di Informatica Università di Pisa bacciu@di.unipi.it Machine Learning: Neural Networks and Advanced Models (AA2) Last Lecture Refresher Lecture Plan Directed
More informationMarkov Chain Monte Carlo (MCMC)
School of Computer Science 10-708 Probabilistic Graphical Models Markov Chain Monte Carlo (MCMC) Readings: MacKay Ch. 29 Jordan Ch. 21 Matt Gormley Lecture 16 March 14, 2016 1 Homework 2 Housekeeping Due
More informationIntroduction to Machine Learning CMU-10701
Introduction to Machine Learning CMU-10701 Markov Chain Monte Carlo Methods Barnabás Póczos & Aarti Singh Contents Markov Chain Monte Carlo Methods Goal & Motivation Sampling Rejection Importance Markov
More informationMachine Learning for Data Science (CS4786) Lecture 24
Machine Learning for Data Science (CS4786) Lecture 24 HMM Particle Filter Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2017fa/ Rejection Sampling Rejection Sampling Sample variables from joint
More informationMachine Learning Lecture 14
Many slides adapted from B. Schiele, S. Roth, Z. Gharahmani Machine Learning Lecture 14 Undirected Graphical Models & Inference 23.06.2015 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de/ leibe@vision.rwth-aachen.de
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 informationChris Bishop s PRML Ch. 8: Graphical Models
Chris Bishop s PRML Ch. 8: Graphical Models January 24, 2008 Introduction Visualize the structure of a probabilistic model Design and motivate new models Insights into the model s properties, in particular
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 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 information16 : Markov Chain Monte Carlo (MCMC)
10-708: Probabilistic Graphical Models 10-708, Spring 2014 16 : Markov Chain Monte Carlo MCMC Lecturer: Matthew Gormley Scribes: Yining Wang, Renato Negrinho 1 Sampling from low-dimensional distributions
More informationCS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling
CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling Professor Erik Sudderth Brown University Computer Science October 27, 2016 Some figures and materials courtesy
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 informationProbabilistic Graphical Models
2016 Robert Nowak Probabilistic Graphical Models 1 Introduction We have focused mainly on linear models for signals, in particular the subspace model x = Uθ, where U is a n k matrix and θ R k is a vector
More informationLECTURE 15 Markov chain Monte Carlo
LECTURE 15 Markov chain Monte Carlo There are many settings when posterior computation is a challenge in that one does not have a closed form expression for the posterior distribution. Markov chain Monte
More informationMarkov Chain Monte Carlo Inference. Siamak Ravanbakhsh Winter 2018
Graphical Models Markov Chain Monte Carlo Inference Siamak Ravanbakhsh Winter 2018 Learning objectives Markov chains the idea behind Markov Chain Monte Carlo (MCMC) two important examples: Gibbs sampling
More information18 : Advanced topics in MCMC. 1 Gibbs Sampling (Continued from the last lecture)
10-708: Probabilistic Graphical Models 10-708, Spring 2014 18 : Advanced topics in MCMC Lecturer: Eric P. Xing Scribes: Jessica Chemali, Seungwhan Moon 1 Gibbs Sampling (Continued from the last lecture)
More informationProbabilistic Graphical Networks: Definitions and Basic Results
This document gives a cursory overview of Probabilistic Graphical Networks. The material has been gleaned from different sources. I make no claim to original authorship of this material. Bayesian Graphical
More informationBayesian Networks Introduction to Machine Learning. Matt Gormley Lecture 24 April 9, 2018
10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University Bayesian Networks Matt Gormley Lecture 24 April 9, 2018 1 Homework 7: HMMs Reminders
More informationT Machine Learning: Basic Principles
Machine Learning: Basic Principles Bayesian Networks Laboratory of Computer and Information Science (CIS) Department of Computer Science and Engineering Helsinki University of Technology (TKK) Autumn 2007
More informationGraphical Models. Lecture 15: Approximate Inference by Sampling. Andrew McCallum
Graphical Models Lecture 15: Approximate Inference by Sampling Andrew McCallum mccallum@cs.umass.edu Thanks to Noah Smith and Carlos Guestrin for some slide materials. 1 General Idea Set of random variables
More informationThe Monte Carlo Method: Bayesian Networks
The Method: Bayesian Networks Dieter W. Heermann Methods 2009 Dieter W. Heermann ( Methods)The Method: Bayesian Networks 2009 1 / 18 Outline 1 Bayesian Networks 2 Gene Expression Data 3 Bayesian Networks
More informationOutline. Spring It Introduction Representation. Markov Random Field. Conclusion. Conditional Independence Inference: Variable elimination
Probabilistic Graphical Models COMP 790-90 Seminar Spring 2011 The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Outline It Introduction ti Representation Bayesian network Conditional Independence Inference:
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 informationAn Introduction to Bayesian Networks: Representation and Approximate Inference
An Introduction to Bayesian Networks: Representation and Approximate Inference Marek Grześ Department of Computer Science University of York Graphical Models Reading Group May 7, 2009 Data and Probabilities
More information1 Undirected Graphical Models. 2 Markov Random Fields (MRFs)
Machine Learning (ML, F16) Lecture#07 (Thursday Nov. 3rd) Lecturer: Byron Boots Undirected Graphical Models 1 Undirected Graphical Models In the previous lecture, we discussed directed graphical models.
More information(5) Multi-parameter models - Gibbs sampling. ST440/540: Applied Bayesian Analysis
Summarizing a posterior Given the data and prior the posterior is determined Summarizing the posterior gives parameter estimates, intervals, and hypothesis tests Most of these computations are integrals
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 informationComputational statistics
Computational statistics Markov Chain Monte Carlo methods Thierry Denœux March 2017 Thierry Denœux Computational statistics March 2017 1 / 71 Contents of this chapter When a target density f can be evaluated
More informationMarkov Networks. l Like Bayes Nets. l Graph model that describes joint probability distribution using tables (AKA potentials)
Markov Networks l Like Bayes Nets l Graph model that describes joint probability distribution using tables (AKA potentials) l Nodes are random variables l Labels are outcomes over the variables Markov
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 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 informationCS Lecture 3. More Bayesian Networks
CS 6347 Lecture 3 More Bayesian Networks Recap Last time: Complexity challenges Representing distributions Computing probabilities/doing inference Introduction to Bayesian networks Today: D-separation,
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 informationVariational Inference (11/04/13)
STA561: Probabilistic machine learning Variational Inference (11/04/13) Lecturer: Barbara Engelhardt Scribes: Matt Dickenson, Alireza Samany, Tracy Schifeling 1 Introduction In this lecture we will further
More informationComputer Vision Group Prof. Daniel Cremers. 14. Sampling Methods
Prof. Daniel Cremers 14. Sampling Methods Sampling Methods Sampling Methods are widely used in Computer Science as an approximation of a deterministic algorithm to represent uncertainty without a parametric
More informationMarkov chain Monte Carlo
Markov chain Monte Carlo Markov chain Monte Carlo (MCMC) Gibbs and Metropolis Hastings Slice sampling Practical details Iain Murray http://iainmurray.net/ Reminder Need to sample large, non-standard distributions:
More informationDirected Graphical Models
Directed Graphical Models Instructor: Alan Ritter Many Slides from Tom Mitchell Graphical Models Key Idea: Conditional independence assumptions useful but Naïve Bayes is extreme! Graphical models express
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Brown University CSCI 2950-P, Spring 2013 Prof. Erik Sudderth Lecture 13: Learning in Gaussian Graphical Models, Non-Gaussian Inference, Monte Carlo Methods Some figures
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning Undirected Graphical Models Mark Schmidt University of British Columbia Winter 2016 Admin Assignment 3: 2 late days to hand it in today, Thursday is final day. Assignment 4:
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 information