COMP14112: Artificial Intelligence Fundamentals L ecture 3 - Foundations of Probabilistic Reasoning Lecturer: Xiao-Jun Zeng

Slides:



Advertisements
Similar presentations
The Monty Hall Problem Madeleine Jetter 6/1/2000.
Advertisements

ABC Welcome to the Monty Hall show! Behind one of these doors is a shiny new car. Behind two of these doors are goats Our contestant will select a door.
Utility Theory.
Decision Making Under Uncertainty CSE 495 Resources: –Russell and Norwick’s book.
Bayes Rule for probability. Let A 1, A 2, …, A k denote a set of events such that An generalization of Bayes Rule for all i and j. Then.
Abby Yinger Mathematics o Statistics o Decision Theory.
Great Theoretical Ideas in Computer Science.
Algorithmic Foundations of Computational Biology Statistical Significance in Bioinformatics Statistics Probability Theory.
1 Probability Part 1 – Definitions * Event * Probability * Union * Intersection * Complement Part 2 – Rules Part 1 – Definitions * Event * Probability.
Lecture 4 on Individual Optimization Risk Aversion
1 Discrete Structures & Algorithms Discrete Probability.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
Probabilistic thinking – part 2
1 Many people debate basic questions of chance in games such as lotteries. The Monty Hall problem is a fun brain teaser that Marilyn vos Savant addressed.
1 Discrete Math CS 280 Prof. Bart Selman Module Probability --- Part a) Introduction.
CSE115/ENGR160 Discrete Mathematics 02/07/12
1 Section 5.1 Discrete Probability. 2 LaPlace’s definition of probability Number of successful outcomes divided by the number of possible outcomes This.
I The meaning of chance Axiomatization. E Plurbus Unum.
Rights and Wrongs of Belief II Pascal, Blackburn.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
COMP14112 : Artificial Intelligence Fundamentals L ecture 0 –Very Brief Overview Lecturer: Xiao-Jun Zeng
Mathematics Probability: Odds Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement Fund Department.
What is the probability that it will snow on Christmas day in Huntingdon?
Chapter 14 sec 4 Expected Value. Questions How many of you have car insurance? How many of you have health insurance? Do you wonder how the insurance.
A Practical Course in Graphical Bayesian Modeling; Class 1 Eric-Jan Wagenmakers.
GAMES AGAINST NATURE Topic #3. Games Against Nature In game theory, for reasons that will be explained later, the alternatives (e.g., LEFT and RIGHT)
Probability, Bayes’ Theorem and the Monty Hall Problem
1 9/8/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
Independence and Dependence 1 Krishna.V.Palem Kenneth and Audrey Kennedy Professor of Computing Department of Computer Science, Rice University.
Key Stone Problem… Key Stone Problem… next Set 22 © 2007 Herbert I. Gross.
Brian Duddy.  Two players, X and Y, are playing a card game- goal is to find optimal strategy for X  X has red ace (A), black ace (A), and red two (2)
Decision Analysis (cont)
Please turn off cell phones, pagers, etc. The lecture will begin shortly.
1 Introduction to Discrete Probability Rosen, Section 6.1 Based on slides by Aaron Bloomfield and …
1 9/23/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
Section 7.1. Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning.
Chapter 7 With Question/Answer Animations. Section 7.1.
10.2 Tests of Significance Use confidence intervals when the goal is to estimate the population parameter If the goal is to.
Topic 2: Intro to probability CEE 11 Spring 2002 Dr. Amelia Regan These notes draw liberally from the class text, Probability and Statistics for Engineering.
Making sense of randomness
1 Civil Systems Planning Benefit/Cost Analysis Scott Matthews Courses: / / Lecture 12.
1 Parrondo's Paradox. 2 Two losing games can be combined to make a winning game. Game A: repeatedly flip a biased coin (coin a) that comes up head with.
Part 3 Linear Programming
Natural Language Processing Giuseppe Attardi Introduction to Probability IP notice: some slides from: Dan Jurafsky, Jim Martin, Sandiway Fong, Dan Klein.
Probability. The Birthday Paradox How many people would you need in a room to have at least two of them share the same birthday. The answer is less.
Student Guide : Writing personal statements Personal statements – what to write and what not to write Interview questions – including problem solving and.
V7 Foundations of Probability Theory „Probability“ : degree of confidence that an event of an uncertain nature will occur. „Events“ : we will assume that.
MATH 256 Probability and Random Processes Yrd. Doç. Dr. Didem Kivanc Tureli 14/10/2011Lecture 3 OKAN UNIVERSITY.
Independence and Dependence 1 Krishna.V.Palem Kenneth and Audrey Kennedy Professor of Computing Department of Computer Science, Rice University.
Great Theoretical Ideas in Computer Science for Some.
1 Learning Objectives Bayes’ Formula The student will be able to solve problems involving finding the probability of an earlier event conditioned on the.
Section 7.1. Probability of an Event We first define these key terms: An experiment is a procedure that yields one of a given set of possible outcomes.
Uncertainty and confidence Although the sample mean,, is a unique number for any particular sample, if you pick a different sample you will probably get.
Incomplete Information and Bayes-Nash Equilibrium.
Chance We will base on the frequency theory to study chances (or probability).
The Law of Averages. What does the law of average say? We know that, from the definition of probability, in the long run the frequency of some event will.
Ray Karol 2/26/2013. Let’s Make a Deal Monte Hall Problem Suppose you’re on a game show, and you’re given a choice of three doors: Behind one door is.
Ch 11.7 Probability. Definitions Experiment – any happening for which the result is uncertain Experiment – any happening for which the result is uncertain.
Uncertainty and Games (Ch. 15). Uncertainty If a game outcome is certain can it achieve meaningful play? –Example of such a game? Two kinds of uncertainty:
1 COMP2121 Discrete Mathematics Principle of Inclusion and Exclusion Probability Hubert Chan (Chapters 7.4, 7.5, 6) [O1 Abstract Concepts] [O3 Basic Analysis.
Introduction to Discrete Probability
Where are we in CS 440? Now leaving: sequential, deterministic reasoning Entering: probabilistic reasoning and machine learning.
Discrete Probability Chapter 7 With Question/Answer Animations
Game Theory.
Great Theoretical Ideas In Computer Science
Probabilities and Proportions
Lecture 2: Probability.
Introduction to Probability (CSCE 317)
Prisoners of Probability
Introduction to Probability (CSCE 317)
Presentation transcript:

COMP14112: Artificial Intelligence Fundamentals L ecture 3 - Foundations of Probabilistic Reasoning Lecturer: Xiao-Jun Zeng

1 Foundations of Probabilistic Reasoning Outline Monty Hall Problem Dutch Book Reasoning of Dutch Book Reasoning of Monty Hall Problem

2 Last Lecture In the last two lectures, we discuss the robot localization problem and show how to apply the probabilistic reasoning approach to determine the location of the robot. In this lecture, probabilistic reasoning approach is going to be further discussed by applying it to solve the Monty Hall paradox and avoid Dutch Book in betting.

3 Monty Hall Problem The Monty Hall problem is a probability puzzle based on the American television game show Let's Make a Deal, hosted by Monty Hall. In the game, you're given the choice of three doors: –Behind one door is a car; –behind the others, goats. You pick a door, say A, and the host, who knows what's behind the doors, opens another door, say B, which he knows has a goat. He then says to you, "Do you want to pick door C?" Problem. Is it to your advantage to switch your choice?

4 Monty Hall Problem The infamous Monty Hall paradox is as follows Now Monty Hall says "Do you want to pick door C?" Question: do you switch or stick?

5 Dutch Book Uncertainty can be understood in terms of betting. Let be any event, e.g. Red Rum will win the Grand National tomorrow Consider the price (in £) you would consider fair for the following ticket: This number is said to be your degree of belief in. We shall assume that there always is a price you consider fair for such a ticket, between £0 and £1, and that this price is proportional to the stake. £1 if E £0 if otherwise

6 Dutch Book What is the fair for the ticket: Suppose that your degree of belief is p(E)=0.6=60% and you bet 10 times, then –Case 1. If the price is £0.5, you pay £0.5x10 times=£5 and you gain 60%x10 times x £1=£6. This is a too low price because you gain £1 and the bookmaker loses £1. –Case 1. If the price is £0.7, you pay £0.7x10 times=£7 and you gain 60%x10 times x £1=£6. This is a too high price because you lose £1 and the bookmaker gains £1. –CASE 3. If the price is £0.6, you pay £0.6x10 times=£6 and you gain 60%x10 times x £1=£6. This is a fair price as either you or the bookmaker does not gain or lose. This is why the fair price = £p(E). £1 if E £0 if otherwise

7 Dutch Book Now what is the fair for the following ticket: Suppose that your degree of belief is p(E) and you bet n times, then –You pay is –you gain is –To make the price be fair, you gain should be the same as you pay, that is, £x if E £0 if otherwise

8 Dutch Book A Dutch Book is –a sequence of bets, each of which the agent is disposed – given his degrees of belief – to accept, yet which taken together will cause the agent to lose money no matter what happens. –in other words, a Dutch Book is a set of bets, each of which you consider fair, that collectively guarantee your loss.

9 Dutch Book Let and be events, and suppose an agent adopts the following probabilities: the agent will then accept the following bets bet 1:£1 if 60p bet 2:£1 if 50p bet 3:£1 if 25p Bet 4:£1 if 70p

10 Dutch Book The payoffs are: bet 1bet 2bet 3bet 4outcome TT +40p+50p-25p-70p-5p TF +40p-50p-25p+30p-5p FT -60p+50p-25p+30p-5p FF -60p-50p+75p+30p-5p

11 Reasoning of Dutch Book The above shows, the agent decides the prices based on his degree of belief. Unfortunately these prices are wrong as Dutch Book occurs and the agent will lose money no matter what happens. Question. What conditions need to be satisfied in order to avoid the Dutch Book?

12 Reasoning of Dutch Book Question: What conditions need to be satisfied in order to avoid the Dutch Book? Answer ( Ramsey – de Finetti Theorem): –If the agent’s degree of belief is a probability distribution function, i.e. it assigns a real number in [0,1] for each event and satisfies (i) (K1) (ii) If then (K2) –Otherwise, a Dutch Book can be constructed.

13 Reasoning of Dutch Book Now we analyse why the previous example leads to the Dutch book. Assume that the agent’s degree of belief is a probability distribution This is contradict to the property of a probability distribution: In other words, the agent’s degree of belief is not a probability distribution and this is why the Dutch Book occurs.

14 Reasoning of Dutch Book The Dutch book result suggests that an agent’s degrees of belief should be represented as a probability distribution. There are many other ways of representing uncertainty in AI, but none has the mathematical and philosophical grounding enjoyed by probability theory.

15 Reasoning of Dutch Book Let, be any events. Consider the price (in £) you would consider fair for the following ticket: This number is said to be your (conditional) degree of belief in given, denoted. We shall assume that there always is a price you consider fair for such a ticket, between £0 and £1. £1 if £0 if Money back if

16 Reasoning of Dutch Book Definition: Given a probability distribution and two events and with, the conditional probability of given is defined by Proposal: If an agent’s current degrees of belief match the probability distribution, then his conditional degrees of belief should match his conditional probabilities: whenever.

17 Reasoning of Dutch Book The following (synchronic) Dutch book justifies this proposal. Suppose an agent takes the conditional bet to be worth £x. Now compare this ticket with the following pair of tickets:. £1 if £0 if Money back if £1 if £0 if otherwise £x if £0 if otherwise

18 Reasoning of Dutch Book These two sets of objects have equal value, so a rational agent ought to assign them equal prices £1 if £0 if Money back if £1 if £0 if otherwise £ if £0 if otherwise Price: £

19 Reasoning of Dutch Book The reason that these two sets of objects have equal value can be verified by the table below: Let the ticket at the top be T and the two tickets at the bottom be T1 and T2 respectively, then EventTT1T2T=T1+T2? EF TT£1 £0Yes TF£x £0Yes FT£0 Yes FF£x £0Yes

20 Reasoning of Dutch Book Thus

21 Reasoning of Dutch Book What should happen to an agent’s degrees of belief when new information arrives? Let and be any events and be an agent’s degrees of belief, with. Denote the agent’s new degrees of belief on learning (and nothing else) by. Proposal: Agents should revise their beliefs by conditionalizing on the total new evidence. That is: for all events and with.

22 Reasoning of Dutch Book The following diachronic Dutch book argument is often taken as a justification for this proposal. Suppose first that and consider the following buying and selling pattern £1 if £0 if Money back if £1 if £0 if otherwise £ if £0 if otherwise Buy at £ Sell at: £ if and when F turns out true. Buy at: £

23 Reasoning of Dutch Book The payoffs for the agent (what he gets minus what he pays) in £ are:

24 Reasoning of Dutch Book Let the two tickets at the top be T1 and T2 and the ticket at the bottom as T3, then the payoffs for the agent can be verified as below: EventTicket 1Ticket 2Ticket 3Total EFGainPayGainPayGainPay TT+1- p(E|F)+a-ap(F)+P F (E)- p(E|F)+a- ap(F)+P F (E) TF0- p(E|F)+a-ap(F)0+P F (E)- p(E|F)+a- ap(F)+P F (E) FT+p(E|F)- p(E|F)+0-ap(F)N/A -ap(F) FF+p(E|F)- p(E|F)+0-ap(F)N/A -ap(F)

25 Reasoning of Dutch Book The latter payoff is negative provided ; the former is also negative if i.e., i.e., (assuming ) if Thus, if the agent has, we choose any a such that, and the agent loses in every case. If the agent has, reverse buying and selling instructions.

26 Reasoning of Dutch Book Hence, if, we can make money out of the agent using a diachronic Dutch book Hence (so the argument goes), rational agents satisfy That is: they respond to new evidence by performing Bayesian updating.

27 Reasoning of Monty Hall Problem You have to be careful with Bayesian updating. Recall the Monty Hall puzzle, and let A stand for the proposition “The car is behind door A” (similarly, with B and C). Note that Gulp! This suggests that it does not matter whether we switch or not! Yet we know that switchers have 2/3 chance to win the car than non-switchers.

28 Reasoning of Monty Hall Problem The answer to the puzzle involves getting the ‘right’ representation. Here a solution is going to give to show how to get the right representation

29 Reasoning of Monty Hall Problem Solution: Let M-B stand for “Monty Hall opens door B”, then Under event A, as Monty Hall can open B or C; Under event B, as Monty Hall only opens the no- car door; Under event C, as Monty Hall can not opens door C and has to open door B; Now apply Bayes’ theorem (alternative form):

30 Reasoning of Monty Hall Problem This reason to get the conclusion that the stick and the switch has the same probability to win is due to believing that the event not B (i.e., the car is not behind B) is the same event as M-B (i.e., “Monty Hall opens door B”). But they are different. The former is a pure random event but the latter is not as Monty Hall only opens the “no-car” door. This can be seen as the probability for event “Not B” is 2/3 whereas the probability for event “M-B” is 1/2. Therefore You have to be careful with Bayesian updating.

31 Probabilistic Reasoning You have been warned!