Probability Theory & Uncertainty Read Chapter 13 of textbook

Size: px
Start display at page:

Download "Probability Theory & Uncertainty Read Chapter 13 of textbook"

Transcription

1 AI: / Mar 1, 2007 Probability Theory & Uncertainty Read Chapter 13 of textbook What you will learn today fundamental role of uncertainty in AI probability theory can be applied to many of these problems probability as uncertainty probability theory is the calculus of reasoning with uncertainty probability and uncertainty in different contexts review of basis probabilistic concepts - discrete and continuous probability - joint and marginal probability - calculating probability next probability lecture: the process of probabilistic inference 2

2 What is the role of probability and inference in AI? Many algorithms are designed as if knowledge is perfect, but it rarely is There are almost always things that are unknown, or not precisely known Examples: - bus schedule - quickest way to the airport - sensors - joint positions - finding an H-bomb An agent making optimal decisions must take into account uncertainty 3 Probability as frequency: k out of n possibilities Suppose we re drawing cards from a standard deck: - P(card is the Jack standard deck) = 1/52 - P(card is a standard deck) = 13/52 = 1/4 What s the probability of a drawing a pair in 5-card poker? - P(hand contains pair standard deck) = of hands with pairs total of hands - Counting can be tricky (take a course in combinatorics) - Other ways to solve the problem? General probability of event given some conditions: P(event conditions) 4

3 Making rational decisions when faced with uncertainty Probability the precise representation of knowledge and uncertainty Probability theory how to optimally update your knowledge based on new information Decision theory: probability theory + utility theory how to use this information to achieve maximum expected utility Consider again the bus schedule What s the utility function? - Suppose the schedule says the bus comes at 8:05 - Situation A: You have a class at 8:30 - Situation B: You have a class at 8:30, and it s cold and raining - Situation C: You have a final exam at 8:30 5 Probability of uncountable events How do we calculate probability that it will rain tomorrow? - Look at historical trends? - Assume it generalizes? What s the probability that there was life on Mars? What was the probability the sea level will rise 1 meter within the century? What s the probability that candidate X will win the election? 6

4 The Iowa Electronic Markets: placing probabilities on single events The Iowa Electronic Markets are real-money futures markets in which contract payoffs depend on economic and political events such as elections Typical bet: predict vote share of candidate X - a vote share market 7 Political futures market predicted vs actual outcomes 8

5 John Craven and the missing H-Bomb In Jan 1966, used Bayesian probability and subjective odds to locate H-bomb missing in the Mediterranean ocean 9 Probabilistic Methodology type of collision prevailing wind direction 0, 1, or 2 parachutes open? 10

6 Probabilistic assessment of dangerous climate change from Mastrandrea and Schneider (2004) from Forrest et al (2001) 11 Factoring in Risk Using Decision Theory P( DAI = 558%) Dangerous Climate Change P( DAI = 274% Carbon Tax 2050 = $174/Ton 12

7 Uncertainty in vision: What are these? 13 Uncertainty in vision 14

8 Edges are not as obvious they seem 15 An example from Antonio Torralba What s this? 16

9 We constantly use other information to resolve uncertainty 17 Image interpretation is heavily context dependent 18

10 This phenomenon is even more prevalent in speech perception It is very difficult to recognize phonemes from naturally spoken speech when they are presented in isolation All modern speech recognition systems rely heavily on context (as do we) HMMs model this contextual dependence explicitly This allows the recognition of words, even if there is a great deal of uncertainty in each of the individual parts 19 De Finetti s definition of probability Was there life on Mars? You promise to pay $1 if there is, and $0 if there is not Suppose NASA will give us the answer tomorrow Suppose you have an oppenent - You set the odds (or the subjective probability ) of the outcome - But your oppenent decides which side of the bet will be yours de Finetti showed that the price you set has to obey the axioms of probability or you face certain loss, ie you ll lose every time 20

11 Axioms of probability Axioms (Kolmogorov): 0 P(A) 1 P(true) = 1 P(false) = 0 P(A or B) = P(A) + P(B) P(A and B) Corollaries: - A single random variable must sum to 1: n P (D = d i ) = 1 i=1 - The joint probability of a set of variables must also sum to 1 - If A and B are mutually exclusive: P(A or B) = P(A) + P(B) 21 Rules of probability conditional probability P r(a B) = corollary (Bayes rule) P r(a and B), P r(b) > 0 P r(b) P r(b A)P r(a) = P r(a and B) = P r(a B)P r(b) P r(b A) = P r(a B)P r(b) P r(a) 22

12 Discrete probability distributions discrete probability distribution joint probability distribution marginal probability distribution Bayes rule independence 23 A*3,B$(1+,C(<+'(9D+($1 E3=(%3,F$',G:H(1),:,I$(1+,2(<+'(9D+($1, $F,7,J:'(:9;3<> 6 7:H3,:,+'D+*,+:9;3,;(<+(1),:;;, =$G9(1:+($1<,$F,J:;D3<,$F,&$D', J:'(:9;3<,K(F,+*3'3,:'3,7,L$$;3:1, J:'(:9;3<,+*31,+*3,+:9;3,4(;;,*:J3, 7, '$4<M6 6 N$',3:=*,=$G9(1:+($1,$F,J:;D3</, <:&,*$4,%'$9:9;3,(+,(<6 O6 PF,&$D,<D9<='(93,+$,+*3,:Q($G<,$F, %'$9:9(;(+&/,+*$<3,1DG93'<,GD<+, <DG,+$,6 ' 0 RQ:G%;3>,L$$;3:1, J:'(:9;3<,0/,L/, & 6S % 6 6S 6S $ 6 6O L All the nice looking slides like this one from now on are from Andrew Moore 6O 6S 6 6S 6S 6 6S 6 6 6S 24

13 A*3,B$(1+,C(<+'(9D+($1 E3=(%3,F$',G:H(1),:,I$(1+,2(<+'(9D+($1, $F,7,J:'(:9;3<> 6 7:H3,:,+'D+*,+:9;3,;(<+(1),:;;, =$G9(1:+($1<,$F,J:;D3<,$F,&$D', J:'(:9;3<,K(F,+*3'3,:'3,7,L$$;3:1, J:'(:9;3<,+*31,+*3,+:9;3,4(;;,*:J3, 7, '$4<M6 6 N$',3:=*,=$G9(1:+($1,$F,J:;D3</, <:&,*$4,%'$9:9;3,(+,(<6 O6 PF,&$D,<D9<='(93,+$,+*3,:Q($G<,$F, %'$9:9(;(+&/,+*$<3,1DG93'<,GD<+, <DG,+$,6 ' 0 RQ:G%;3>,L$$;3:1, J:'(:9;3<,0/,L/, & 6S % 6 6S 6S $ 6O 6S 6 6S 6S 6 6S 6 6 6S 6O L 6 25 A*3,B$(1+,C(<+'(9D+($1 E3=(%3,F$',G:H(1),:,I$(1+,2(<+'(9D+($1, $F,7,J:'(:9;3<> 6 7:H3,:,+'D+*,+:9;3,;(<+(1),:;;, =$G9(1:+($1<,$F,J:;D3<,$F,&$D', J:'(:9;3<,K(F,+*3'3,:'3,7,L$$;3:1, J:'(:9;3<,+*31,+*3,+:9;3,4(;;,*:J3, 7, '$4<M6 6 N$',3:=*,=$G9(1:+($1,$F,J:;D3</, <:&,*$4,%'$9:9;3,(+,(<6 O6 PF,&$D,<D9<='(93,+$,+*3,:Q($G<,$F, %'$9:9(;(+&/,+*$<3,1DG93'<,GD<+, <DG,+$,6 ' 0 RQ:G%;3>,L$$;3:1, J:'(:9;3<,0/,L/, & 6S % 6 6S $ 6O 6S 6 6S 6S 6 6S 6 6 6S 6S 6O L 6 26

14 T<(1),+*3, B$(1+ U13,&$D,*:J3,+*3,BC,&$D,=:1, :<H,F$',+*3,%'$9:9(;(+&,$F,:1&, ;$)(=:;,3Q%'3<<($1,(1J$;J(1), &$D',:++'(9D+3 / *+,-$%&'() /*+, $%&'()*+,-,/,012'34,56,7$$'3 27 8'$9:9(;(<+(=,01:;&+(=<>,?;(23,@ T<(1),+*3, B$(1+ U13,&$D,*:J3,+*3,BC,&$D,=:1, :<H,F$',+*3,%'$9:9(;(+&,$F,:1&, ;$)(=:;,3Q%'3<<($1,(1J$;J(1), &$D',:++'(9D+3 8D8&+7:;3E+F+-6@GH@ / *+,-$%&'() /*+, $%&'()*+,-,/,012'34,56,7$$'3 28 8'$9:9(;(<+(=,01:;&+(=<>,?;(23,@

15 T<(1),+*3, B$(1+ U13,&$D,*:J3,+*3,BC,&$D,=:1, :<H,F$',+*3,%'$9:9(;(+&,$F,:1&, ;$)(=:;,3Q%'3<<($1,(1J$;J(1), &$D',:++'(9D+3 / *+,-$%&'() /*+, $%&'()*+,-,/,012'34,56,7$$'3 29 C2D4'42>4, T<(1),+*3, 5(+*,+*4, B$(1+ E$(2+ 2 U13,&$D,*:J3,+*3,BC,&$D,=:1, :<H,F$',+*3,%'$9:9(;(+&,$F,:1&, ;$)(=:;,3Q%'3<<($1,(1J$;J(1), 2 &$D',:++'(9D+3 1/ 1 2,-1 /*+,,-/$%&'()*+ %*0 *+,-$%&'(),-/$%&'()*+ 2,-1 9G8;<4 H,9$$'I,J,7AFBA,K,7LFA,J,7F/, $%&'()*+,-,/,012'34,56,7$$'3 30 8'$9:9(;(<+(=,01:;&+(=<>,?;(23,@

16 Continuous probability distributions probability density function (pdf) joint probability density marginal probability calculating probabilities using the pdf Bayes rule =B+C+1D4&'E;2+1(4>+'2+- more of Andrew s nice slides $%&'()*+,+-/0+123& &4 32 9&:;:'<'*%+=42>'*'4>?+@<'34+A

17 1+9=B+C+1D4&'E;2+1(4>+'2+- G4*+H+:4+;+E2*'2II>+&;23D+ J;&';:<47 KC+$LMN+'>+;+9&:;:'<'*%+=42>'*%+ BI2E*'2+C&+H+*)42O & & % $ ' % $ $ $ & )'( % $ $ ' %$ %&'( $ &'( P+7F &'( $ %$ $%&'()*+,+-/0+123& &4 33 9&:;:'<'*%+=42>'*'4>?+@<'34+F What does p(x) mean? It does not mean a probability First of all, it s not a value between 0 and 1 It s just a value, and an arbitrary one at that The likelihood of p(a) can only be compared relatively to other values p(b) It indicates the relative probability of the integrated density over a small delta: OJ+ *)42+ & % $ $ % $ $ $% $ & & & % $ $ % $ $ 34

18 BC$4D*;*'2> BEFG+H+*)4+4C$4D*43+I;<J4+K+ &;23L+I;&';:<4+F H+*)4+;I4&;(4+I;<J4+54M3+>44+ 'K+54+*N+;+I4&%+<;&(4+2JL:4&+ K+&;23L+>;L$<4>+K+F $ $ $%&'()*+,+-/0+123& &4 35 9&:;:'<'*%+=42>'*'4>?+@<'34+/A BC$4D*;*'2> BE;(4GHQR7OA BEFG+H+*)4+4C$4D*43+I;<J4+K+ &;23L+I;&';:<4+F H+*)4+;I4&;(4+I;<J4+54M3+>44+ 'K+54+*N+;+I4&%+<;&(4+2JL:4&+ K+&;23L+>;L$<4>+K+F $ $ H+*)4+K'&>*+LL42*+K+*)4+ >);$4+K&L43+:%+*)4+;C4>+;23+ *)4+:<J4+DJ&I4 H+*)4+:4>*+I;<J4+*+D)>4+'K+ %J+LJ>*+(J4>>+;2+J2N252+ $4&>2M>+;(4+;23+%JM<<+:4+ K'243+*)4+>PJ;&4+K+%J&+4&&& $%&'()*+,+-/0+123& &4 36 9&:;:'<'*%+=42>'*'4>?+@<'34+/O

19 AB%3C+:+($1,$D,:,DE1C+($1 & $+,- %()*%'%& & $+,- % (**'% FAGDHIJK,F,+*3,3B%3C+32, L:;E3,$D,DHBJ,4*3'3,B,(=,2':41, D'$M,IN=,2(=+'(9E+($16, F,+*3,:L3':)3,L:;E3,43N2,=33, (D,43,+$$O,:,L3'&,;:')3,1EM93', $D,':12$M,=:M%;3=,$D,DHIJ % %$ $ P$+3,+*:+,(1,)313':;> & $ $ & $ & $ % $%&'()*+,-,/,012'34,56,7$$'3 37 8'$9:9(;(+&,<31=(+(3=>,?;(23,@ Q:'(:1C3 ' F,Q:'GIK,F,+*3, 3B%3C+32,=RE:'32, 2(DD3'31C3, , ' % B,:12,AGIK, 1+2 $+,- % &0*'/ %$ $ F,:M$E1+,&$EN2,3B%3C+,+$,;$=3, (D,&$E,ME=+,)E3==,:1,E1O1$41, %3'=$1N=,:)3,:12,&$EN;;,93, D(132,+*3,=RE:'3,$D,&$E',3''$'/, :12,:==EM(1),&$E,%;:&, $%+(M:;;& $%&'()*+,-,/,012'34,56,7$$'3 38 8'$9:9(;(+&,<31=(+(3=>,?;(23,

20 - A+B:&CDE+A+*)3+ 3F$3G*32+=HI:&32+ 2'JJ3&31G3+93*4331+ % F+:12+KCDE+ */-*+,) % % %0 &'(%$ %$ $ & A+:LI1*+%IM2+3F$3G*+*+;=3+ 'J+%I+LI=*+(I3==+:1+I1N141+ $3&=1M=+:(3+:12+%IM;;+93+ J'132+*)3+=HI:&3+J+%I&+3&&&/+ :12+:==IL'1(+%I+$;:%+ $*'L:;;% A+?*:12:&2+<3@':*'1+A+ O*%$'G:;P+23@':*'1+J+D+J&L+ '*=+L3:1 % */- $ ) $%&'()*+,+-/+012& &3 39 8&9:9';'*%+<31='*'3=>+?;'23+- Q1+-+ 2'L31='1= $RF/%S+A+$&9:9';'*%+231='*%+J+ &:12L+@:&':9;3=+RD/TS+:*+ ;G:*'1+RF/%S $%&'()*+,+-/+012& &3 40 8&9:9';'*%+<31='*'3=>+?;'23+--

21 A1,, 2(B31=($1= C3+,D/E, 93,:,%:(',$F,G$1+(1H$H=,':12$B, I:'(:9;3=/,:12,;3+,J,93,=$B3,'3)($1,$F,KD/EL, =%:G3M (' & % $$ $%&'()*+,-,/,012'34,56,7$$'3 41 8'$9:9(;(+&,<31=(+(3=>,?;(23,@ A1,, 2(B31=($1= C3+,D/E, 93,:,%:(',$F,G$1+(1H$H=,':12$B, I:'(:9;3=/,:12,;3+,J,93,=$B3,'3)($1,$F,KD/EL, =%:G3M (' & % $$ 8K,OB%)O@,:12 PO43()*+O@L,Q :'3:,H123',+*3,R2,=H'F:G3,4(+*(1, +*3,'32,'3G+:1);3 $%&'()*+,-,/,012'34,56,7$$'3 42 8'$9:9(;(+&,<31=(+(3=>,?;(23,N

22 B2,, 3(C42>($2> D4+,E0F, :4,;,%;(',$G,H$2+(2I$I>,';23$C, J;'(;:<4>0,;23,<4+,K,:4,>$C4,'4)($2,$G,LE0FM, >%;H4N (' & % $$ 9L,OLC%)PAMQ/R S, OL54()*+P//MQA//R T,,M,U ;'4;,I234',+*4,P3,>I'G;H4,5(+*(2, +*4,'43,$J;< $%&'()*+,-,//0,123'45,67,8$$'4 43 9'$:;:(<(+&,=42>(+(4>?,@<(34,A B2,, 3(C42>($2> D4+,E0F, :4,;,%;(',$G,H$2+(2I$I>,';23$C, J;'(;:<4>0,;23,<4+,K,:4,>$C4,'4)($2,$G,LE0FM, >%;H4N (' & % $$ W;X4,+*4,>%4H(;<,H;>4,$G,'4)($2,K,U,Y4J4'&5*4'4Z7 K4C4C:4',+*;+,5(+*,%'$:;:(<(+&,0,LE0FM,5(<<,:4,3';52,G'$C, $ $ %$ %$ % $$ $ $%&'()*+,-,//0,123'45,67,8$$'4 44 9'$:;:(<(+&,=42>(+(4>?,@<(34,V

23 B2,C, 3(C42>($2> D4+,LE 0E 0NE C M :4,;2,2P+I%<4 $G,H$2+(2I$I>, ';23$C,J;'(;:<4>0,;23,<4+,K,:4,>$C4,'4)($2, $G, C N (' + ' $ *** ' * + $ *** *** * % + $ *** * $ * *** $ $ $ + $%&'()*+,-,//0,123'45,67,8$$'4 45 9'$:;:(<(+&,=42>(+(4>?,@<(34,O B234%42342C4 % $ $ ())$' & %$ BD,E,;23,F,;'4,(234%42342+, +*42,G2$5(2),+*4,H;<I4,$D,E, 3$4>,2$+,*4<%,%'43(C+,+*4, H;<I4,$D,F J%)054()*+,KLM, (234% $%&'()*+,-,//0,123'45,67,8$$'4 46 9'$:;:(<(+&,=42>(+(4>?,@<(34,A

24 B234%42342C4 % $ $ ())$' & %$ BD,E,;23,F,;'4,(234%42342+, +*42,G2$5(2),+*4,H;<I4,$D,E, 3$4>,2$+,*4<%,%'43(C+,+*4, H;<I4,$D,F +*4,C$2+$I'>,>;&,+*;+, ;CC4<4';+($2,;23,54()*+,;'4, (234% $%&'()*+,-,//0,123'45,67,8$$'4 47 9'$:;:(<(+&,=42>(+(4>?,@<(34,N/ 8B<+(C;'(;+4,DE%4F+;+($2 $ DGH%)054()*+I,J KL7M0//N O*4,F42+'$(3,$P,+*4, F<$B3 $%&'()*+,-,//0,123'45,67,8$$'4 48 9'$:;:(<(+&,=42>(+(4>?,@<(34,A

25 8B<+(C;'(;+4,DE%4F+;+($2 $ $ $ $%&'()*+,-,//0,123'45,67,8$$'4 49 9'$:;:(<(+&,=42>(+(4>?,@<(34,A B4>+,&$C',C234'>+;23(2) 34'(5-&1 2/0'1,-')'*+%&'( $ $ $ D1<<,+*4,+(E4F DG2<&,5*42,H,;23,I,;'4,(234%42342+F DJ+,K;2,L;(<,4M42,(L,H,;23,I,;'4,(234%42342+F $%&'()*+,-,//0,123'45,67,8$$'4 50 9'$:;:(<(+&,=42>(+(4>?,@<(34,AA

26 O(M;'(;+4,PQ%4K+;+($2 $ (,& 6 % + (,& 6 % + ',& 6 % + $%$& - (,& 6 % + &50'1 $ (, 6 + & ',& 6 % + $%$& - (,& 6 % + %50'1 $ (, 6 + % ',& 6 % + $%$& - (,& 6 % + & %50'1 $ (, 6 +,& % + ',& 6 % + $%$& $ $ $ $%&'()*+,-,//0,123'45,67,8$$'4 51 9'$:;:(<(+&,=42>(+(4>?,@<(34,AN C(D;'(;+4,$D;'(;2E4 $ &'($ $ % $ % $ $ ) $ $ &'($ $ % $ $ &'( $ $ $ % $ $ ) $ $ &'($ % $ &'( $ $ % $ ) ) $%&'()*+,-,//0,123'45,67,8$$'4 52 9'$:;:(<(+&,=42>(+(4>?,@<(34,AB

27 C(D;'(;+4,$D;'(;2E4 $ &'($ $ % $ % $ $ ) $ $ &'($ $ % $ $ &'( $ $ $ % $ $ ) $ $ &'($ % $ &'( $ $ % $ * $ ' /01+-*) $ )( %*%*+,- ) & ) ) ) * * $% $* ) $ % $, $ $ ( +, + ) ) ) ' & $%&'()*+,-,//0,123'45,67,8$$'4 53 9'$:;:(<(+&,=42>(+(4>?,@<(34,AF $C;'(;2D4,E2+F(+($2 '()$*+ %&& GHI%)054()*+J,K LM7N0O//P '()$*+ %&& $ $ $%&'()*+,-,//0,123'45,67,8$$'4 54 9'$:;:(<(+&,=42>(+(4>?,@<(34,AB

28 $C;'(;2D4,E2+F(+($2 9'(2D(%;< G()42C4D+$' $R, '()$*+ %&& GHI%)054()*+J,K LM7N0O//P '()$*+ %&& $ $ $%&'()*+,-,//0,123'45,67,8$$'4 55 9'$:;:(<(+&,=42>(+(4>?,@<(34,AQ $B:'(:1C3,DE1,D:C+= &) ) $%$ $ ' '& ( ( ' ' $ %& % $ %) ) FG'E3,$',D:;=3>,HI,) J& K,,+*31,L,:12,M,:'3, (123% FG'E3,$',D:;=3>,HI,L,:12,M,:'3,(123%31231+, +*31,) J& K, FG'E3,$',D:;=3>,HI,) J& K,) J ) & +*31,L,:12,M,:'3, 23+3'N(1(=+(C:;;&,'3;:+32 FG'E3,$',D:;=3>,HI,L,:12,M,:'3,23+3'N(1(=+(C:;;&, '3;:+32,+*31,) J& K,) J ) & O$4,C$E;2, &$E,%'$B3, $',2(=%'$B3, +*3=3P $%&'()*+,-,/,012'34,56,7$$'3 56 8'$9:9(;(+&,<31=(+(3=>,?;(23,@A

29 R313':;,$B:'(:1C3 S3+, K,TL /L /,U,L V W 93,:,B3C+$',$I,V C$1+(1E$E=,':12$N,B:'(:9;3= $%$ $ ' '& ( %& ( % $ ' * % * )( ) ( ' +,- ' ) ) (?,(=,:,V,J,V,=&NN3+'(C,1$1X13):+(B3,23I(1(+3,N:+'(J HI,:;;,2(=+'(9E+($1=,:'3,;(13:';&,(123%31231+,(+,(=,%$=(+(B3,23I(1(+3 HI,+*3,2(=+'(9E+($1=,:'3,;(13:';&,23%31231+,(+,*:=,23+3'N(1:1+,Y3'$ $%&'()*+,-,/,012'34,56,7$$'3 57 8'$9:9(;(+&,<31=(+(3=>,?;(23,Q 7:')(1:;,<(=+'(9B+($1= $ %$ ),( + ),( 6 & + '& & $%&'()*+,-,/,012'34,56,7$$'3 58 8'$9:9(;(+&,<31=(+(3=>,?;(23,@

30 %- 4(2, $123 /00+ 12'*'1:;+ <'=*&'9B*'1= %- 4(2, $ %- 4(2, $ $%&'()*+,+--/+012& &3 %-$, + ()*)')&'$% 8&9:9';'*%+<31='*'3=>+?;'23+@A 59 %- 4(2, $123 /00+ 12'*'1:;+ <'=*&'9B*'1= %-$, + %-$ 7 + %- + 5)%C $%&'()*+,+--/+012& &3 %-$, + ()*)')&'$% 8&9:9';'*%+<31='*'3=>+?;'23+@@ 60

31 C234%42342D4,E4F(>(+43 % $ $ ())$' & %$ C+G>,4;>&,+$,%'$F4,+*;+,+*4>4,>+;+4H42+>,;'4,4IJ(F;<42+K ' & %$ $ ' & %$ * $ ' & %$ * $%&'()*+,-,/0,123'45,67,8$$'4 61 9'$:;:(<(+&,=42>(+(4>?,@<(34,AB & % '& 8$'4,J>4MJ<,>+JMM * & + * ' * ' * ' OP*4>4,D;2,;<<,:4, %'$F43,M'$H, 34M(2(+($2>,$2, %'4F($J>,><(34>Q * * N;&4> EJ<4 $%&'()*+,-,/0,123'45,67,8$$'4 62 9'$:;:(<(+&,=42>(+(4>?,@<(34,AL

32 Next time: The process of probabilistic inference 1 define model of problem 2 derive posterior distributions and estimators 3 estimate parameters from data 4 evaluate model accuracy 63

Final Examination CS540: Introduction to Artificial Intelligence

Final Examination CS540: Introduction to Artificial Intelligence Final Examination CS540: Introduction to Artificial Intelligence December 2008 LAST NAME: FIRST NAME: Problem Score Max Score 1 15 2 15 3 10 4 20 5 10 6 20 7 10 Total 100 Question 1. [15] Probabilistic

More information

Week 1 Quantitative Analysis of Financial Markets Probabilities

Week 1 Quantitative Analysis of Financial Markets Probabilities Week 1 Quantitative Analysis of Financial Markets Probabilities Christopher Ting http://www.mysmu.edu/faculty/christophert/ Christopher Ting : christopherting@smu.edu.sg : 6828 0364 : LKCSB 5036 October

More information

Homework 9 (for lectures on 4/2)

Homework 9 (for lectures on 4/2) Spring 2015 MTH122 Survey of Calculus and its Applications II Homework 9 (for lectures on 4/2) Yin Su 2015.4. Problems: 1. Suppose X, Y are discrete random variables with the following distributions: X

More information

Chapter 7: Estimation Sections

Chapter 7: Estimation Sections 1 / 31 : Estimation Sections 7.1 Statistical Inference Bayesian Methods: 7.2 Prior and Posterior Distributions 7.3 Conjugate Prior Distributions 7.4 Bayes Estimators Frequentist Methods: 7.5 Maximum Likelihood

More information

PROBABILITY AND STATISTICS, A16, TEST 1

PROBABILITY AND STATISTICS, A16, TEST 1 PROBABILITY AND STATISTICS, A16, TEST 1 Name: Student number (1) (1.5 marks) i) Let A and B be mutually exclusive events with p(a) = 0.7 and p(b) = 0.2. Determine p(a B ) and also p(a B). ii) Let C and

More information

Lecture 12: Introduction to reasoning under uncertainty. Actions and Consequences

Lecture 12: Introduction to reasoning under uncertainty. Actions and Consequences Lecture 12: Introduction to reasoning under uncertainty Preferences Utility functions Maximizing expected utility Value of information Bandit problems and the exploration-exploitation trade-off COMP-424,

More information

CUR 412: Game Theory and its Applications, Lecture 11

CUR 412: Game Theory and its Applications, Lecture 11 CUR 412: Game Theory and its Applications, Lecture 11 Prof. Ronaldo CARPIO May 17, 2016 Announcements Homework #4 will be posted on the web site later today, due in two weeks. Review of Last Week An extensive

More information

Chapter 7: Estimation Sections

Chapter 7: Estimation Sections 1 / 40 Chapter 7: Estimation Sections 7.1 Statistical Inference Bayesian Methods: Chapter 7 7.2 Prior and Posterior Distributions 7.3 Conjugate Prior Distributions 7.4 Bayes Estimators Frequentist Methods:

More information

Subsidiaries (Section 9 TCA 1997) Part

Subsidiaries (Section 9 TCA 1997) Part Subsidiaries (Section 9 TCA 1997) Part 01-00-04 This document should be read in conjunction with section 9 of the Taxes Consolidation Act 1997 Document last reviewed on July 2018 1. Introduction Section

More information

Decision Making. BUS 735: Business Decision Making and Research. exercises. Assess what we have learned. 2 Decision Making Without Probabilities

Decision Making. BUS 735: Business Decision Making and Research. exercises. Assess what we have learned. 2 Decision Making Without Probabilities Making BUS 735: Business Making and Research 1 1.1 Goals and Agenda Goals and Agenda Learning Objective Learn how to make decisions with uncertainty, without using probabilities. Practice what we learn.

More information

CS 361: Probability & Statistics

CS 361: Probability & Statistics March 12, 2018 CS 361: Probability & Statistics Inference Binomial likelihood: Example Suppose we have a coin with an unknown probability of heads. We flip the coin 10 times and observe 2 heads. What can

More information

Probability. Logic and Decision Making Unit 1

Probability. Logic and Decision Making Unit 1 Probability Logic and Decision Making Unit 1 Questioning the probability concept In risky situations the decision maker is able to assign probabilities to the states But when we talk about a probability

More information

The Ohio State University Department of Economics Second Midterm Examination Answers

The Ohio State University Department of Economics Second Midterm Examination Answers Econ 5001 Spring 2018 Prof. James Peck The Ohio State University Department of Economics Second Midterm Examination Answers Note: There were 4 versions of the test: A, B, C, and D, based on player 1 s

More information

Continuous distributions. Lecture 6: Probability. Probabilities from continuous distributions. From histograms to continuous distributions

Continuous distributions. Lecture 6: Probability. Probabilities from continuous distributions. From histograms to continuous distributions Lecture 6: Probability Below is a histogram of the distribution of heights of US adults. The proportion of data that falls in the shaded bins gives the probability that a randomly sampled US adult is between

More information

Chapter 7: Estimation Sections

Chapter 7: Estimation Sections Chapter 7: Estimation Sections 7.1 Statistical Inference Bayesian Methods: 7.2 Prior and Posterior Distributions 7.3 Conjugate Prior Distributions Frequentist Methods: 7.5 Maximum Likelihood Estimators

More information

Problem Set #4. Econ 103. (b) Let A be the event that you get at least one head. List all the basic outcomes in A.

Problem Set #4. Econ 103. (b) Let A be the event that you get at least one head. List all the basic outcomes in A. Problem Set #4 Econ 103 Part I Problems from the Textbook Chapter 3: 1, 3, 5, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29 Part II Additional Problems 1. Suppose you flip a fair coin twice. (a) List all the

More information

Lecture 16: Risk Analysis II

Lecture 16: Risk Analysis II Lecture 16: Risk Analysis II In the last lecture, we discussed how to deal with the uncertainty that must always be present in predicting the future. Here, we take into account the fact that we may be

More information

Duopoly models Multistage games with observed actions Subgame perfect equilibrium Extensive form of a game Two-stage prisoner s dilemma

Duopoly models Multistage games with observed actions Subgame perfect equilibrium Extensive form of a game Two-stage prisoner s dilemma Recap Last class (September 20, 2016) Duopoly models Multistage games with observed actions Subgame perfect equilibrium Extensive form of a game Two-stage prisoner s dilemma Today (October 13, 2016) Finitely

More information

Chapter 4 Random Variables & Probability. Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables

Chapter 4 Random Variables & Probability. Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables Chapter 4.5, 6, 8 Probability for Continuous Random Variables Discrete vs. continuous random variables Examples of continuous distributions o Uniform o Exponential o Normal Recall: A random variable =

More information

Math 135: Answers to Practice Problems

Math 135: Answers to Practice Problems Math 35: Answers to Practice Problems Answers to problems from the textbook: Many of the problems from the textbook have answers in the back of the book. Here are the answers to the problems that don t

More information

Utilities and Decision Theory. Lirong Xia

Utilities and Decision Theory. Lirong Xia Utilities and Decision Theory Lirong Xia Checking conditional independence from BN graph ØGiven random variables Z 1, Z p, we are asked whether X Y Z 1, Z p dependent if there exists a path where all triples

More information

Random Variables and Applications OPRE 6301

Random Variables and Applications OPRE 6301 Random Variables and Applications OPRE 6301 Random Variables... As noted earlier, variability is omnipresent in the business world. To model variability probabilistically, we need the concept of a random

More information

Decision Making. BUS 735: Business Decision Making and Research. Learn how to conduct regression analysis with a dummy independent variable.

Decision Making. BUS 735: Business Decision Making and Research. Learn how to conduct regression analysis with a dummy independent variable. Making BUS 735: Business Making and Research 1 Goals of this section Specific goals: Learn how to conduct regression analysis with a dummy independent variable. Learning objectives: LO5: Be able to use

More information

The EM algorithm for HMMs

The EM algorithm for HMMs The EM algorithm for HMMs Michael Collins February 22, 2012 Maximum-Likelihood Estimation for Fully Observed Data (Recap from earlier) We have fully observed data, x i,1... x i,m, s i,1... s i,m for i

More information

Subject : Computer Science. Paper: Machine Learning. Module: Decision Theory and Bayesian Decision Theory. Module No: CS/ML/10.

Subject : Computer Science. Paper: Machine Learning. Module: Decision Theory and Bayesian Decision Theory. Module No: CS/ML/10. e-pg Pathshala Subject : Computer Science Paper: Machine Learning Module: Decision Theory and Bayesian Decision Theory Module No: CS/ML/0 Quadrant I e-text Welcome to the e-pg Pathshala Lecture Series

More information

CS 237: Probability in Computing

CS 237: Probability in Computing CS 237: Probability in Computing Wayne Snyder Computer Science Department Boston University Lecture 12: Continuous Distributions Uniform Distribution Normal Distribution (motivation) Discrete vs Continuous

More information

Mean, Median and Mode. Lecture 2 - Introduction to Probability. Where do they come from? We start with a set of 21 numbers, Statistics 102

Mean, Median and Mode. Lecture 2 - Introduction to Probability. Where do they come from? We start with a set of 21 numbers, Statistics 102 Mean, Median and Mode Lecture 2 - Statistics 102 Colin Rundel January 15, 2013 We start with a set of 21 numbers, ## [1] -2.2-1.6-1.0-0.5-0.4-0.3-0.2 0.1 0.1 0.2 0.4 ## [12] 0.4 0.5 0.6 0.7 0.7 0.9 1.2

More information

Contents Part I Descriptive Statistics 1 Introduction and Framework Population, Sample, and Observations Variables Quali

Contents Part I Descriptive Statistics 1 Introduction and Framework Population, Sample, and Observations Variables Quali Part I Descriptive Statistics 1 Introduction and Framework... 3 1.1 Population, Sample, and Observations... 3 1.2 Variables.... 4 1.2.1 Qualitative and Quantitative Variables.... 5 1.2.2 Discrete and Continuous

More information

Intro to Decision Theory

Intro to Decision Theory Intro to Decision Theory Rebecca C. Steorts Bayesian Methods and Modern Statistics: STA 360/601 Lecture 3 1 Please be patient with the Windows machine... 2 Topics Loss function Risk Posterior Risk Bayes

More information

Econ 711 Final Solutions

Econ 711 Final Solutions Econ 711 Final Solutions April 24, 2015 1.1 For all periods, play Cc if history is Cc for all prior periods. If not, play Dd. Payoffs for 2 cooperating on the equilibrium path are optimal for and deviating

More information

Reasoning with Uncertainty

Reasoning with Uncertainty Reasoning with Uncertainty Markov Decision Models Manfred Huber 2015 1 Markov Decision Process Models Markov models represent the behavior of a random process, including its internal state and the externally

More information

IE 343 Midterm Exam 1

IE 343 Midterm Exam 1 IE 343 Midterm Exam 1 Feb 17, 2012 Version A Closed book, closed notes. Write your printed name in the spaces provided above on every page. Show all of your work in the spaces provided. Interest rate tables

More information

PROBABILITY and BAYES THEOREM

PROBABILITY and BAYES THEOREM PROBABILITY and BAYES THEOREM From: http://ocw.metu.edu.tr/pluginfile.php/2277/mod_resource/content/0/ ocw_iam530/2.conditional%20probability%20and%20bayes%20theorem.pdf CONTINGENCY (CROSS- TABULATION)

More information

Exact Inference (9/30/13) 2 A brief review of Forward-Backward and EM for HMMs

Exact Inference (9/30/13) 2 A brief review of Forward-Backward and EM for HMMs STA561: Probabilistic machine learning Exact Inference (9/30/13) Lecturer: Barbara Engelhardt Scribes: Jiawei Liang, He Jiang, Brittany Cohen 1 Validation for Clustering If we have two centroids, η 1 and

More information

TIm 206 Lecture notes Decision Analysis

TIm 206 Lecture notes Decision Analysis TIm 206 Lecture notes Decision Analysis Instructor: Kevin Ross 2005 Scribes: Geoff Ryder, Chris George, Lewis N 2010 Scribe: Aaron Michelony 1 Decision Analysis: A Framework for Rational Decision- Making

More information

Sequential Rationality and Weak Perfect Bayesian Equilibrium

Sequential Rationality and Weak Perfect Bayesian Equilibrium Sequential Rationality and Weak Perfect Bayesian Equilibrium Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu June 16th, 2016 C. Hurtado (UIUC - Economics)

More information

Credibility. Chapters Stat Loss Models. Chapters (Stat 477) Credibility Brian Hartman - BYU 1 / 31

Credibility. Chapters Stat Loss Models. Chapters (Stat 477) Credibility Brian Hartman - BYU 1 / 31 Credibility Chapters 17-19 Stat 477 - Loss Models Chapters 17-19 (Stat 477) Credibility Brian Hartman - BYU 1 / 31 Why Credibility? You purchase an auto insurance policy and it costs $150. That price is

More information

Education Assistance In your opinion is the cost to a student of a university education a good long-term investment or not?

Education Assistance In your opinion is the cost to a student of a university education a good long-term investment or not? In your opinion is the cost to a student of a university education a good long-term investment or not? Proportions/Means: Columns Tested (5% risk level) - A/B/C/D/E/F - G/H - I/J - K/L/M/O - N/O REGION

More information

CS 4100 // artificial intelligence

CS 4100 // artificial intelligence CS 4100 // artificial intelligence instructor: byron wallace (Playing with) uncertainties and expectations Attribution: many of these slides are modified versions of those distributed with the UC Berkeley

More information

The Beauty of Uncertainty

The Beauty of Uncertainty Massimo Marinacci AXA-Bocconi Chair in Risk Inaugural Lecture 12 June 2012 Relevance Relevance Uncertainty is pervasive. Yet, its pervasiveness became especially stark in the past few years Partly because

More information

Signaling Games. Farhad Ghassemi

Signaling Games. Farhad Ghassemi Signaling Games Farhad Ghassemi Abstract - We give an overview of signaling games and their relevant solution concept, perfect Bayesian equilibrium. We introduce an example of signaling games and analyze

More information

DECISION ANALYSIS: INTRODUCTION. Métodos Cuantitativos M. En C. Eduardo Bustos Farias 1

DECISION ANALYSIS: INTRODUCTION. Métodos Cuantitativos M. En C. Eduardo Bustos Farias 1 DECISION ANALYSIS: INTRODUCTION Cuantitativos M. En C. Eduardo Bustos Farias 1 Agenda Decision analysis in general Structuring decision problems Decision making under uncertainty - without probability

More information

Finish what s been left... CS286r Fall 08 Finish what s been left... 1

Finish what s been left... CS286r Fall 08 Finish what s been left... 1 Finish what s been left... CS286r Fall 08 Finish what s been left... 1 Perfect Bayesian Equilibrium A strategy-belief pair, (σ, µ) is a perfect Bayesian equilibrium if (Beliefs) At every information set

More information

Accounting Information Systems, Investor Learning, and Stock Return Regularities

Accounting Information Systems, Investor Learning, and Stock Return Regularities Accounting Information Systems, Investor Learning, and Stock Return Regularities Kai Du Steve Huddart Penn State University Nov 2016 Introduction Model States and Accounting Signals Informativeness and

More information

Iterated Dominance and Nash Equilibrium

Iterated Dominance and Nash Equilibrium Chapter 11 Iterated Dominance and Nash Equilibrium In the previous chapter we examined simultaneous move games in which each player had a dominant strategy; the Prisoner s Dilemma game was one example.

More information

Exercises Solutions: Game Theory

Exercises Solutions: Game Theory Exercises Solutions: Game Theory Exercise. (U, R).. (U, L) and (D, R). 3. (D, R). 4. (U, L) and (D, R). 5. First, eliminate R as it is strictly dominated by M for player. Second, eliminate M as it is strictly

More information

Chapter 3. Dynamic discrete games and auctions: an introduction

Chapter 3. Dynamic discrete games and auctions: an introduction Chapter 3. Dynamic discrete games and auctions: an introduction Joan Llull Structural Micro. IDEA PhD Program I. Dynamic Discrete Games with Imperfect Information A. Motivating example: firm entry and

More information

Module 3: "Dynamic games of complete information" Lecture 23: "Bertrand Paradox in an Infinitely repeated game" The Lecture Contains:

Module 3: Dynamic games of complete information Lecture 23: Bertrand Paradox in an Infinitely repeated game The Lecture Contains: The Lecture Contains: Bertrand Paradox: Resolving the Paradox Bertrand Paradox in an Infinitely repeated game file:///d /Web%20Course%20(Ganesh%20Rana)/COURSE%20FOR%20UPLOAD/game_theory%204-6-2015/lecture23/23_1.htm[6/5/2015

More information

Computer Vision Group Prof. Daniel Cremers. 7. Sequential Data

Computer Vision Group Prof. Daniel Cremers. 7. Sequential Data Group Prof. Daniel Cremers 7. Sequential Data Bayes Filter (Rep.) We can describe the overall process using a Dynamic Bayes Network: This incorporates the following Markov assumptions: (measurement) (state)!2

More information

Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50)

Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50) Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 5 Sequential Monte Carlo methods I January

More information

CPSC 540: Machine Learning

CPSC 540: Machine Learning CPSC 540: Machine Learning Monte Carlo Methods Mark Schmidt University of British Columbia Winter 2019 Last Time: Markov Chains We can use Markov chains for density estimation, d p(x) = p(x 1 ) p(x }{{}

More information

Point Estimation. Some General Concepts of Point Estimation. Example. Estimator quality

Point Estimation. Some General Concepts of Point Estimation. Example. Estimator quality Point Estimation Some General Concepts of Point Estimation Statistical inference = conclusions about parameters Parameters == population characteristics A point estimate of a parameter is a value (based

More information

SOCIETY OF ACTUARIES EXAM STAM SHORT-TERM ACTUARIAL MATHEMATICS EXAM STAM SAMPLE QUESTIONS

SOCIETY OF ACTUARIES EXAM STAM SHORT-TERM ACTUARIAL MATHEMATICS EXAM STAM SAMPLE QUESTIONS SOCIETY OF ACTUARIES EXAM STAM SHORT-TERM ACTUARIAL MATHEMATICS EXAM STAM SAMPLE QUESTIONS Questions 1-307 have been taken from the previous set of Exam C sample questions. Questions no longer relevant

More information

V. Lesser CS683 F2004

V. Lesser CS683 F2004 The value of information Lecture 15: Uncertainty - 6 Example 1: You consider buying a program to manage your finances that costs $100. There is a prior probability of 0.7 that the program is suitable in

More information

Factors of 10 = = 2 5 Possible pairs of factors:

Factors of 10 = = 2 5 Possible pairs of factors: Factoring Trinomials Worksheet #1 1. b 2 + 8b + 7 Signs inside the two binomials are identical and positive. Factors of b 2 = b b Factors of 7 = 1 7 b 2 + 8b + 7 = (b + 1)(b + 7) 2. n 2 11n + 10 Signs

More information

Lecture 17: More on Markov Decision Processes. Reinforcement learning

Lecture 17: More on Markov Decision Processes. Reinforcement learning Lecture 17: More on Markov Decision Processes. Reinforcement learning Learning a model: maximum likelihood Learning a value function directly Monte Carlo Temporal-difference (TD) learning COMP-424, Lecture

More information

Basic Data Analysis. Stephen Turnbull Business Administration and Public Policy Lecture 4: May 2, Abstract

Basic Data Analysis. Stephen Turnbull Business Administration and Public Policy Lecture 4: May 2, Abstract Basic Data Analysis Stephen Turnbull Business Administration and Public Policy Lecture 4: May 2, 2013 Abstract Introduct the normal distribution. Introduce basic notions of uncertainty, probability, events,

More information

Lecture 3. Sample spaces, events, probability

Lecture 3. Sample spaces, events, probability 18.440: Lecture 3 s, events, probability Scott Sheffield MIT 1 Outline Formalizing probability 2 Outline Formalizing probability 3 What does I d say there s a thirty percent chance it will rain tomorrow

More information

CHAPTER 10: Introducing Probability

CHAPTER 10: Introducing Probability CHAPTER 10: Introducing Probability The Basic Practice of Statistics 6 th Edition Moore / Notz / Fligner Lecture PowerPoint Slides Chapter 10 Concepts 2 The Idea of Probability Probability Models Probability

More information

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017 ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2017 These notes have been used and commented on before. If you can still spot any errors or have any suggestions for improvement, please

More information

Examples: On a menu, there are 5 appetizers, 10 entrees, 6 desserts, and 4 beverages. How many possible dinners are there?

Examples: On a menu, there are 5 appetizers, 10 entrees, 6 desserts, and 4 beverages. How many possible dinners are there? Notes Probability AP Statistics Probability: A branch of mathematics that describes the pattern of chance outcomes. Probability outcomes are the basis for inference. Randomness: (not haphazardous) A kind

More information

Inverse reinforcement learning from summary data

Inverse reinforcement learning from summary data Inverse reinforcement learning from summary data Antti Kangasrääsiö, Samuel Kaski Aalto University, Finland ECML PKDD 2018 journal track Published in Machine Learning (2018), 107:1517 1535 September 12,

More information

Review for Final Exam Spring 2014 Jeremy Orloff and Jonathan Bloom

Review for Final Exam Spring 2014 Jeremy Orloff and Jonathan Bloom Review for Final Exam 18.05 Spring 2014 Jeremy Orloff and Jonathan Bloom THANK YOU!!!! JON!! PETER!! RUTHI!! ERIKA!! ALL OF YOU!!!! Probability Counting Sets Inclusion-exclusion principle Rule of product

More information

343H: Honors AI. Lecture 7: Expectimax Search 2/6/2014. Kristen Grauman UT-Austin. Slides courtesy of Dan Klein, UC-Berkeley Unless otherwise noted

343H: Honors AI. Lecture 7: Expectimax Search 2/6/2014. Kristen Grauman UT-Austin. Slides courtesy of Dan Klein, UC-Berkeley Unless otherwise noted 343H: Honors AI Lecture 7: Expectimax Search 2/6/2014 Kristen Grauman UT-Austin Slides courtesy of Dan Klein, UC-Berkeley Unless otherwise noted 1 Announcements PS1 is out, due in 2 weeks Last time Adversarial

More information

Lecture 1 Introduction and Definition of TU games

Lecture 1 Introduction and Definition of TU games Lecture 1 Introduction and Definition of TU games 1.1 Introduction Game theory is composed by different fields. Probably the most well known is the field of strategic games that analyse interaction between

More information

Expectimax and other Games

Expectimax and other Games Expectimax and other Games 2018/01/30 Chapter 5 in R&N 3rd Ø Announcement: q Slides for this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse471/lectures/games.pdf q Project 2 released,

More information

Using the Maximin Principle

Using the Maximin Principle Using the Maximin Principle Under the maximin principle, it is easy to see that Rose should choose a, making her worst-case payoff 0. Colin s similar rationality as a player induces him to play (under

More information

UNIT 4 MATHEMATICAL METHODS

UNIT 4 MATHEMATICAL METHODS UNIT 4 MATHEMATICAL METHODS PROBABILITY Section 1: Introductory Probability Basic Probability Facts Probabilities of Simple Events Overview of Set Language Venn Diagrams Probabilities of Compound Events

More information

Somerset County Public Schools Unit III Classified Employee Salary Scales FY 2018

Somerset County Public Schools Unit III Classified Employee Salary Scales FY 2018 Unit III Classified Employee Salary Scales FY 2018 Unit 3 Salary Scales FY18 - Food and Nutrition Service Food Service Worker Grade 1 183 Days F8A F8B F8C F8D F8E F8F F8G 7 Hour 6.5 Hour 6 Hour 5.5 Hour

More information

Overview: Representation Techniques

Overview: Representation Techniques 1 Overview: Representation Techniques Week 6 Representations for classical planning problems deterministic environment; complete information Week 7 Logic programs for problem representations including

More information

Decision Analysis. Introduction. Job Counseling

Decision Analysis. Introduction. Job Counseling Decision Analysis Max, min, minimax, maximin, maximax, minimin All good cat names! 1 Introduction Models provide insight and understanding We make decisions Decision making is difficult because: future

More information

chapter 13: Binomial Distribution Exercises (binomial)13.6, 13.12, 13.22, 13.43

chapter 13: Binomial Distribution Exercises (binomial)13.6, 13.12, 13.22, 13.43 chapter 13: Binomial Distribution ch13-links binom-tossing-4-coins binom-coin-example ch13 image Exercises (binomial)13.6, 13.12, 13.22, 13.43 CHAPTER 13: Binomial Distributions The Basic Practice of Statistics

More information

6.825 Homework 3: Solutions

6.825 Homework 3: Solutions 6.825 Homework 3: Solutions 1 Easy EM You are given the network structure shown in Figure 1 and the data in the following table, with actual observed values for A, B, and C, and expected counts for D.

More information

ECONS 424 STRATEGY AND GAME THEORY HANDOUT ON PERFECT BAYESIAN EQUILIBRIUM- III Semi-Separating equilibrium

ECONS 424 STRATEGY AND GAME THEORY HANDOUT ON PERFECT BAYESIAN EQUILIBRIUM- III Semi-Separating equilibrium ECONS 424 STRATEGY AND GAME THEORY HANDOUT ON PERFECT BAYESIAN EQUILIBRIUM- III Semi-Separating equilibrium Let us consider the following sequential game with incomplete information. Two players are playing

More information

The Ohio State University Department of Economics Econ 601 Prof. James Peck Extra Practice Problems Answers (for final)

The Ohio State University Department of Economics Econ 601 Prof. James Peck Extra Practice Problems Answers (for final) The Ohio State University Department of Economics Econ 601 Prof. James Peck Extra Practice Problems Answers (for final) Watson, Chapter 15, Exercise 1(part a). Looking at the final subgame, player 1 must

More information

CPSC 540: Machine Learning

CPSC 540: Machine Learning CPSC 540: Machine Learning Monte Carlo Methods Mark Schmidt University of British Columbia Winter 2018 Last Time: Markov Chains We can use Markov chains for density estimation, p(x) = p(x 1 ) }{{} d p(x

More information

Uncertainty. Contingent consumption Subjective probability. Utility functions. BEE2017 Microeconomics

Uncertainty. Contingent consumption Subjective probability. Utility functions. BEE2017 Microeconomics Uncertainty BEE217 Microeconomics Uncertainty: The share prices of Amazon and the difficulty of investment decisions Contingent consumption 1. What consumption or wealth will you get in each possible outcome

More information

CS 5522: Artificial Intelligence II

CS 5522: Artificial Intelligence II CS 5522: Artificial Intelligence II Uncertainty and Utilities Instructor: Alan Ritter Ohio State University [These slides were adapted from CS188 Intro to AI at UC Berkeley. All materials available at

More information

Bayesian course - problem set 3 (lecture 4)

Bayesian course - problem set 3 (lecture 4) Bayesian course - problem set 3 (lecture 4) Ben Lambert November 14, 2016 1 Ticked off Imagine once again that you are investigating the occurrence of Lyme disease in the UK. This is a vector-borne disease

More information

Chapter Six Probability

Chapter Six Probability Chapter Six Probability Copyright 2005 Brooks/Cole, a division of Thomson Learning, Inc. 6.1 Random Experiment a random experiment is an action or process that leads to one of several possible outcomes.

More information

Maximum Likelihood Estimation

Maximum Likelihood Estimation Maximum Likelihood Estimation EPSY 905: Fundamentals of Multivariate Modeling Online Lecture #6 EPSY 905: Maximum Likelihood In This Lecture The basics of maximum likelihood estimation Ø The engine that

More information

MAT 4250: Lecture 1 Eric Chung

MAT 4250: Lecture 1 Eric Chung 1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose

More information

ECON FINANCIAL ECONOMICS

ECON FINANCIAL ECONOMICS ECON 337901 FINANCIAL ECONOMICS Peter Ireland Boston College Fall 2017 These lecture notes by Peter Ireland are licensed under a Creative Commons Attribution-NonCommerical-ShareAlike 4.0 International

More information

Probability and Expected Utility

Probability and Expected Utility Probability and Expected Utility Economics 282 - Introduction to Game Theory Shih En Lu Simon Fraser University ECON 282 (SFU) Probability and Expected Utility 1 / 12 Topics 1 Basic Probability 2 Preferences

More information

m 11 m 12 Non-Zero Sum Games Matrix Form of Zero-Sum Games R&N Section 17.6

m 11 m 12 Non-Zero Sum Games Matrix Form of Zero-Sum Games R&N Section 17.6 Non-Zero Sum Games R&N Section 17.6 Matrix Form of Zero-Sum Games m 11 m 12 m 21 m 22 m ij = Player A s payoff if Player A follows pure strategy i and Player B follows pure strategy j 1 Results so far

More information

Optimal Voting Rules. Alexander Scheer. November 14, 2012

Optimal Voting Rules. Alexander Scheer. November 14, 2012 Optimal Voting Rules Alexander Scheer November 14, 2012 1 Introduction What we have seen in the last weeks: Borda's Count Condorcet's Paradox 2 Introduction What we have seen in the last weeks: Independence

More information

PubPol/Econ 541. Subsidies and Countervailing Duties. by Alan V. Deardorff University of Michigan 2018

PubPol/Econ 541. Subsidies and Countervailing Duties. by Alan V. Deardorff University of Michigan 2018 ubol/econ 541 Subsidies and Countervailing Duties by Alan V. Deardorff University of Michigan 2018 Subsidies and Countervailing Duties Subsidies are assistance provided by government to firms or industries

More information

Introduction to Fall 2007 Artificial Intelligence Final Exam

Introduction to Fall 2007 Artificial Intelligence Final Exam NAME: SID#: Login: Sec: 1 CS 188 Introduction to Fall 2007 Artificial Intelligence Final Exam You have 180 minutes. The exam is closed book, closed notes except a two-page crib sheet, basic calculators

More information

Committee on Payments and Market Infrastructures

Committee on Payments and Market Infrastructures Committee on Payments and Market Infrastructures Outline of the new structure of statistical tables Statistics on payments and financial market infrastructures in the CPMI countries (Red Book statistics)

More information

ECON FINANCIAL ECONOMICS

ECON FINANCIAL ECONOMICS ECON 337901 FINANCIAL ECONOMICS Peter Ireland Boston College Spring 2018 These lecture notes by Peter Ireland are licensed under a Creative Commons Attribution-NonCommerical-ShareAlike 4.0 International

More information

Microeconomic Theory (501b) Comprehensive Exam

Microeconomic Theory (501b) Comprehensive Exam Dirk Bergemann Department of Economics Yale University Microeconomic Theory (50b) Comprehensive Exam. (5) Consider a moral hazard model where a worker chooses an e ort level e [0; ]; and as a result, either

More information

Optimal Incentive Contract with Costly and Flexible Monitoring

Optimal Incentive Contract with Costly and Flexible Monitoring Optimal Incentive Contract with Costly and Flexible Monitoring Anqi Li 1 Ming Yang 2 1 Department of Economics, Washington University in St. Louis 2 Fuqua School of Business, Duke University January 2016

More information

Expectimax Search Trees. CS 188: Artificial Intelligence Fall Expectimax Quantities. Expectimax Pseudocode. Expectimax Pruning?

Expectimax Search Trees. CS 188: Artificial Intelligence Fall Expectimax Quantities. Expectimax Pseudocode. Expectimax Pruning? CS 188: Artificial Intelligence Fall 2010 Expectimax Search Trees What if we don t know what the result of an action will be? E.g., In solitaire, next card is unknown In minesweeper, mine locations In

More information

Expectimax Search Trees. CS 188: Artificial Intelligence Fall Expectimax Example. Expectimax Pseudocode. Expectimax Pruning?

Expectimax Search Trees. CS 188: Artificial Intelligence Fall Expectimax Example. Expectimax Pseudocode. Expectimax Pruning? CS 188: Artificial Intelligence Fall 2011 Expectimax Search Trees What if we don t know what the result of an action will be? E.g., In solitaire, next card is unknown In minesweeper, mine locations In

More information

Molecular Phylogenetics

Molecular Phylogenetics Mole_Oce Lecture # 16: Molecular Phylogenetics Maximum Likelihood & Bahesian Statistics Optimality criterion: a rule used to decide which of two trees is best. Four optimality criteria are currently widely

More information

Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50)

Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50) Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 1 Introduction January 16, 2018 M. Wiktorsson

More information

Chapter ! Bell Shaped

Chapter ! Bell Shaped Chapter 6 6-1 Business Statistics: A First Course 5 th Edition Chapter 7 Continuous Probability Distributions Learning Objectives In this chapter, you learn:! To compute probabilities from the normal distribution!

More information

CS 188: Artificial Intelligence Fall 2011

CS 188: Artificial Intelligence Fall 2011 CS 188: Artificial Intelligence Fall 2011 Lecture 7: Expectimax Search 9/15/2011 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore 1 Expectimax Search

More information

Some Practice Questions for Test 1

Some Practice Questions for Test 1 ENGI 44 Probability and Statistics Faculty of Engineering and Applied Science Some Practice Questions for Test. Note that this question attempts to cover various aspects of descriptive statistics. In the

More information

Some Characteristics of Data

Some Characteristics of Data Some Characteristics of Data Not all data is the same, and depending on some characteristics of a particular dataset, there are some limitations as to what can and cannot be done with that data. Some key

More information