DOC PREVIEW
CMU CS 10601 - Recitation

This preview shows page 1-2-3-4-29-30-31-32-59-60-61-62 out of 62 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 62 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

10-601 Recitation Wednesday, October 19th, 2011Will BishopMarkov BlanketsMain idea: Want the simplest form we can express probability of a random variable conditioned on all other random variables in the graph. Very simple. Can simply condition on: 1) Parents2) Co-Parents3) ChildrenB CDA EFP(B|A,C,D,E,F) = ?Markov BlanketsMain idea: Want this simplest form we can express probability of a random variable conditioned on all other random variables in the graph. Very simple. Can simply condition on: 1) Parents2) Co-Parents3) ChildrenB CDA EFP(B|A,C,D,E,F) = ?Markov BlanketsMain idea: Want this simplest form we can express probability of a random variable conditioned on all other random variables in the graph. Very simple. Can simply condition on: 1) Parents2) Co-Parents3) ChildrenB CDA EFP(B|A,C,D,E,F) = ?Markov BlanketsMain idea: Want this simplest form we can express probability of a random variable conditioned on all other random variables in the graph. Very simple. Can simply condition on: 1) Parents2) Co-Parents3) ChildrenB CDA EFP(B|A,C,D,E,F) = ?Markov BlanketsMain idea: Want this simplest form we can express probability of a random variable conditioned on all other random variables in the graph. Very simple. Can simply condition on: 1) Parents2) Co-Parents3) ChildrenB CDA EFP(B|A,C,D,E,F) = P(B|A, C, D)Inference7 Example • Bird flu and Allegies both cause Sinus problems • Sinus problems cause Headaches and runny Nose Prob. of joint assignment: easy • Suppose we are interested in joint assignment <F=f,A=a,S=s,H=h,N=n> What is P(f,a,s,h,n)? let’s use p(a,b) as shorthand for p(A=a, B=b) From class: How do we calculate P(N = 1)?Inference7 Example • Bird flu and Allegies both cause Sinus problems • Sinus problems cause Headaches and runny Nose Prob. of joint assignment: easy • Suppose we are interested in joint assignment <F=f,A=a,S=s,H=h,N=n> What is P(f,a,s,h,n)? let’s use p(a,b) as shorthand for p(A=a, B=b) From class: How do we calculate P(N = 1)?P (N = 1) =2Xa=12Xf=12Xs=12Xh=1P (A = a, F = f,S = s, H = h, N = 1)Inference7 Example • Bird flu and Allegies both cause Sinus problems • Sinus problems cause Headaches and runny Nose Prob. of joint assignment: easy • Suppose we are interested in joint assignment <F=f,A=a,S=s,H=h,N=n> What is P(f,a,s,h,n)? let’s use p(a,b) as shorthand for p(A=a, B=b) From class: How do we calculate P(N = 1)?P (N = 1) =2Xa=12Xf=12Xs=12Xh=1P (A = a, F = f,S = s, H = h, N = 1)Requires 2^4 = 16 calculations.Can we do better?Inference7 Example • Bird flu and Allegies both cause Sinus problems • Sinus problems cause Headaches and runny Nose Prob. of joint assignment: easy • Suppose we are interested in joint assignment <F=f,A=a,S=s,H=h,N=n> What is P(f,a,s,h,n)? let’s use p(a,b) as shorthand for p(A=a, B=b) From class: How do we calculate P(N = 1)?P (A, F, S, H, N)=P (A)P (F )P (S|A, F )P (H|S)P (N|S)Let’s think about how we can rearrange the sum. P (N = 1) =XAXFXSXHP (A, F, S, H, N = 1)=XAXFXSXHP (A)P (F )P (S|A, F )P (H|S)P (N =1|S)=XSXHP (H|S)P (N =1|S) XAXFP (A)P (F )P (S|A, F )!=XSXHP (H|S)P (N =1|S) P (S)Inference7 Example • Bird flu and Allegies both cause Sinus problems • Sinus problems cause Headaches and runny Nose Prob. of joint assignment: easy • Suppose we are interested in joint assignment <F=f,A=a,S=s,H=h,N=n> What is P(f,a,s,h,n)? let’s use p(a,b) as shorthand for p(A=a, B=b) From class: How do we calculate P(N = 1)?P (A, F, S, H, N )=P (A)P (F )P (S|A, F )P (H|S)P (N|S)Let’s think about how we can rearrange the sum. P (N = 1) =XAXFXSXHP (A, F, S, H, N = 1)=XAXFXSXHP (A)P (F )P (S|A, F )P (H|S)P (N =1|S)=XSXHP (H|S)P (N =1|S) XAXFP (A)P (F )P (S|A, F )!=XSXHP (H|S)P (N =1|S) P (S)Inference7 Example • Bird flu and Allegies both cause Sinus problems • Sinus problems cause Headaches and runny Nose Prob. of joint assignment: easy • Suppose we are interested in joint assignment <F=f,A=a,S=s,H=h,N=n> What is P(f,a,s,h,n)? let’s use p(a,b) as shorthand for p(A=a, B=b) From class: How do we calculate P(N = 1)?P (A, F, S, H, N )=P (A)P (F )P (S|A, F )P (H|S)P (N|S)Let’s think about how we can rearrange the sum. P (N = 1) =XAXFXSXHP (A, F, S, H, N = 1)=XAXFXSXHP (A)P (F )P (S|A, F )P (H|S)P (N =1|S)=XSXHP (H|S)P (N =1|S) XAXFP (A)P (F )P (S|A, F )!=XSXHP (H|S)P (N =1|S) P (S)Inference7 Example • Bird flu and Allegies both cause Sinus problems • Sinus problems cause Headaches and runny Nose Prob. of joint assignment: easy • Suppose we are interested in joint assignment <F=f,A=a,S=s,H=h,N=n> What is P(f,a,s,h,n)? let’s use p(a,b) as shorthand for p(A=a, B=b) From class: How do we calculate P(N = 1)?P (A, F, S, H, N )=P (A)P (F )P (S|A, F )P (H|S)P (N|S)Let’s think about how we can rearrange the sum. P (N = 1) =XAXFXSXHP (A, F, S, H, N = 1)=XAXFXSXHP (A)P (F )P (S|A, F )P (H|S)P (N =1|S)=XSXHP (H|S)P (N =1|S) XAXFP (A)P (F )P (S|A, F )!=XSXHP (H|S)P (N =1|S) P (S)Inference7 Example • Bird flu and Allegies both cause Sinus problems • Sinus problems cause Headaches and runny Nose Prob. of joint assignment: easy • Suppose we are interested in joint assignment <F=f,A=a,S=s,H=h,N=n> What is P(f,a,s,h,n)? let’s use p(a,b) as shorthand for p(A=a, B=b) From class: How do we calculate P(N = 1)?P (A, F, S, H, N )=P (A)P (F )P (S|A, F )P (H|S)P (N|S)Let’s think about how we can rearrange the sum. P (N = 1) =XAXFXSXHP (A, F, S, H, N = 1)=XAXFXSXHP (A)P (F )P (S|A, F )P (H|S)P (N =1|S)=XSXHP (H|S)P (N =1|S) XAXFP (A)P (F )P (S|A, F )!=XSXHP (H|S)P (N =1|S) P (S)4 Calculations4 CalculationsLearningAssume graph structure is known and all data is observed.Key Idea: Can just solve this with the standard MLE techniques we already know.LearningAssume graph structure is known and some data is unobserved.Key Idea: Pick parameters that make observed data the most probable.Expectation MaximizationE-Step:M-Step:Calculated usingˆ✓tRepeat until convergence :)Q(✓|ˆ✓t)=EP (Z|X,ˆ✓t)(log (P (X, Z|✓))ˆ✓t+1= argmax✓hQ(✓|ˆ✓t)iEM & Clustering: A simple exampleCan we draw a directed graph to represent this model? • Z can be either 0 or 1 but we do not know the prior probab i l ity of Z being0 or 1.• If Z is 0, then we pull a sample for X from a Normal distribution withunknown mean µ0and known variance 2.• If Z is 1, then we pull a sample for X from a Normal distribution withunknown


View Full Document

CMU CS 10601 - Recitation

Documents in this Course
lecture

lecture

40 pages

Problem

Problem

12 pages

lecture

lecture

36 pages

Lecture

Lecture

31 pages

Review

Review

32 pages

Lecture

Lecture

11 pages

Lecture

Lecture

18 pages

Notes

Notes

10 pages

Boosting

Boosting

21 pages

review

review

21 pages

review

review

28 pages

Lecture

Lecture

31 pages

lecture

lecture

52 pages

Review

Review

26 pages

review

review

29 pages

Lecture

Lecture

37 pages

Lecture

Lecture

35 pages

Boosting

Boosting

17 pages

Review

Review

35 pages

lecture

lecture

32 pages

Lecture

Lecture

28 pages

Lecture

Lecture

30 pages

lecture

lecture

29 pages

leecture

leecture

41 pages

lecture

lecture

34 pages

review

review

38 pages

review

review

31 pages

Lecture

Lecture

41 pages

Lecture

Lecture

15 pages

Lecture

Lecture

21 pages

Lecture

Lecture

38 pages

Notes

Notes

37 pages

lecture

lecture

29 pages

Load more
Download Recitation
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Recitation and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Recitation 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?