basic probability (most slides borrowed, with permission, from andrew moore of cmu and google)...

68
Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) http://www.cs.cmu.edu/~awm/ tutorials

Upload: bruce-dickerson

Post on 22-Dec-2015

222 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

Basic Probability

(most slides borrowed, with permission, from Andrew Moore of CMU and Google)http://www.cs.cmu.edu/~awm/tutorials

Page 2: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 3: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 4: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 5: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 6: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 7: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 8: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

A

Page 9: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

A

B

Page 10: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

Notation Digression

• P(A) is shorthand for P(A=true)• P(~A) is shorthand for P(A=false)• Same notation applies to other binary RVs:

P(Gender=M), P(Gender=F)• Same notation applies to multivalued RVs:

P(Major=history), P(Age=19), P(Q=c)• Note: upper case letters/names for variables,

lower case letters/names for values• For multivalued RVs, P(Q) is shorthand for

P(Q=q) for some unknown q

Page 11: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

Page 12: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

k

k…

Page 13: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

k

k

Page 14: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

k

k

Integration over nuisance variables

Page 15: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 16: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 17: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 18: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 19: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 20: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

R

QS

P(H|F) = R/(Q+R)

P(F|H) = R/(S+R)

Page 21: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 22: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 23: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 24: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 25: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

Let’s-Make-A-Deal Problem

• Game show with 3 doors• Behind one door is a prize• Player chooses a door, say door 1• Host opens door 2 to reveal no prize• Host offers player opportunity to switch from

door 1 to door 3.• Should player stay with door 1, switch to door

3, or does it not matter?

Page 26: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

Let’s-Make-A-Deal Problem• D = door containing prize

C = contestant’s choiceH = door revealed by host

• P(D = d | C, H)• P(D = d | C, H) ~ P(H | D=d, C) P(D = d|C)• P(D = d | C, H) ~ P(H | D=d, C) P(D = d)• E.g., C=1, H=2:

• P(H=2|C=1,D=1) = .5• P(H=2|C=1,D=2) = 0 • P(H=2|C=1,D=3) = 1

Page 27: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

Let’s-Make-A-Deal Problem: Lessons

• Likelihood function is based on a generative model of the environment (host’s behavior)

• Griffiths and Tenenbaum made their own generative assumptions– About how the experimenter would pick an age

ttotal

• Solving a problem involves modeling the generative environment– Equivalent to learning the joint probability

distribution

Page 28: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 29: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 30: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 31: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 32: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 33: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 34: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 35: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 36: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 37: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

If you have joint distribution, you can perform anyinference in the domain.

Page 38: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 39: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 40: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 41: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 42: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

e.g., model of the environment

Page 43: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 44: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 45: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 46: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 47: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 48: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 49: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 50: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 51: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 52: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 53: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 54: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 55: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 56: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 57: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 58: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 59: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 60: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 61: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 62: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

Naïve Bayes Model

Page 63: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 64: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 65: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 66: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

Bayes Classifier

• Assume you want to predict some output Y which has arity n and values y1, y2, y3, … yn.

• Assume there are m input attributes called X1, X2, X3, … Xm.

• For each of n values yi, build a density estimator, Di, that estimatesP(X1, X2, X3, … Xm |Y=yi)

• Ypredict = argmaxy P(Y=y| X1, X2, X3, … Xm ) = argmaxy P(X1, X2, X3, … Xm | Y=y) P(Y=y)

Page 67: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials
Page 68: Basic Probability (most slides borrowed, with permission, from Andrew Moore of CMU and Google) awm/tutorials

Machine Learning Vs. Cognitive Science

• For machine learning, density estimation is required to do classification, prediction, etc.

• For cognitive science, density estimation under a particular model is a theory about what is going on in the brain when an individual learns.