Artificial Intelligence CS 6364

Size: px
Start display at page:

Download "Artificial Intelligence CS 6364"

Transcription

1 Artificial Intelligence CS 6364 rofessor Dan Moldovan Section 12 robabilistic Reasoning

2 Acting under uncertainty Logical agents assume propositions are - True - False - Unknown acting under uncertainty Example: diagnosis for medicine dental diagnosis using 1 st order logic: Wrong: not all patients p with toothaches have cavities! Some have gum disease, an abscess or other problems p Symptom p, Toothache Disease p, Cavity Conclusion: To make the rule true, we have to add an almost unlimited list of possible causes p Symptom p, Toothache Disease p, Cavity Disease p, GumDisease Disease p, Abscess 429

3 Medical Diagnosis Trying to use first-order logic to cope with a domain like medical diagnosis fails because 1. Laziness too much work to list the complete list of rules + too hard to use such rules Example of causal rule: p Disease p, Cavity Symptom p, Toothache wrong, not all cavities cause pain need to augment the antecedent with all conditions that cause toothaches 2. Theoretical ignorance: Medical science has no complete theory for the domain 3. ractical ignorance: Even if we know all the rules, we might be uncertain about a particular patient, because not all necessary tests have been or can be run 430

4 Degree of belief When propositions are not known to be true or false, the agent can at best provide a degree of belief in relevant sentences. The main tool for dealing with degrees of belief is the robability Theory function DT-AGENTpercept returns an action static belief_state, probabilistic beliefs about the current state of the world action, the agent s action update belief_state based on action and percept calculate outcome probabilities for actions, given action descriptions and current belief_state select action with highest expected utility given probabilities of outcomes and utility information return action 431

5 Basic robability Notation Random Variables thought as referring to a part of the world whose status is unknown Random variables have domains values they may take. Depending on the domain, random variables may be classified as - Boolean random variables have the domain <true, false> Example: Cavity = true Cavity = false cavity - Discrete random variables take values from a countable domain - Continuous random variables values from the real numbers Example: the proposition x=4.20 asserts that the random variable x has the exact value We can also have propositions that use inequalities like x

6 Atomic Events An atomic event is a complete specification of the state of the world about which the agent is uncertain. If the world is described by a set of random variables, an atomic event is a particular assignment of values to the random variables Example: 2 random variables: Cavity and Toothache How many atomic events? 4 E E E E cavity cavity cavity cavity false toothache false toothache true toothache true toothache false true false true roperties: a Mutually exclusive: at most one can be true b The set of all possible atomic events is exhaustive 433

7 rior probability rior probability or unconditional probability associated with proposition a is the degree of belief accorded to it in the absence of any other information Example: pcavity = true = 0.1 Important: a can be used only when there is no other information. As soon as some new information is known, we must reason with the conditional probability of a, given that new information Sometimes we are interested in all possible values of a random variable use expressions such as weather which denotes a vector of values for the probabilities of each individual state of the weather Example: weather = sunny = 0.7 weather = rain = 0.2 weather = cloudy = 0.08 weather = snow = 0.02 also written as: weather = <0.7, 0.2, 0.08, 0.02> 434

8 robability distributions Example 1: Hair_color is a discrete random variable. It has the domain <blond, brown, red, black, white, none> Out of a sample of people, we find that 1872 had blond hair, 4325 had brown hair, 2135 had black hair, 652 had red hair, 321 had white hair and the rest were bald The probability distribution is: Hair_color = <0.1872, , , , , > Example 2: UTD_student is a binary random variable the domain is True or False Out of a sample of 1000 youngsters between 19 and 21 in the Dallas area, 321 were students at UTD UTD_student = <0.321, 0.679> 435

9 Full Joint robability Distribution Suppose the world consists only of the variables Cavity Toothache Weather 2 values binary random variable 2 values binary random variable 4 values sunny, rain cloudy, snow Cavity = <0.23,0.77> Toothache = <0.35,0.65> Weather = <0.7,0.2,0.08,0.02> Represent the joint probability distribution: Cavity Cavity Weather Toothache Toothache Toothache Toothache Sunny???? Rain???? Cloudy???? 2x2x4=16 entries for the joint distribution We need to know to compute conditional probabilities Snow???? 436

10 robability Density Functions For continuous variables, it is not possible to write out the entire distribution as a table, because there are infinitely many values. Instead, we define the probability that a random variable takes on some value x as a parameterized function of x. Example: Let the random variable X denote tomorrow s maximum rain fall in Dallas. The sentence X=x = U[1,3]x expresses the belief that X is distributed uniformly between 1in and 3in 437

11 Conditional robability When new evidence concerning a previously unknown random variable is found, prior probabilities no longer apply. We use conditional probabilities: - If a a random variable - b a random variable - a b denotes the probability of a, given that all we know is b Example: cavity toothache = 0.8 How do we compute a b? a b a b b Same rule: ab = a bb the product rule! 438

12 Conditional Distributions If two random variables X and Y define the world, X Y gives the values for X=x i Y=y i for each possible i and j. Expressed with the product rule, this becomes: X=x 1 Y=y 1 = X=x 1 Y=y 1 Y=y 1 X=x 1 Y=y 2 = X=x 1 Y=y 2 Y=y 2 This can be combined in a single equation: X,Y = X YY This denotes a set of equations relating the corresponding individual entries in the tables, not a matrix multiplication of the tables! 439

13 Axioms of robability 1. 0 a 1 2. true = 1, false = 0 3. ab = a + b ab We can deduce a = 1 a because true = a + a false aa =1 ab = 0 a + a = 1 440

14 Inference Using Full Joint Distribution Example: The domains consist of three boolean variables: Toothache, Cavity and Catch the dentist s nasty steel probe catches in my tooth Toothache Toothache catch catch catch catch Cavity Cavity How many atomic events? 2 3 = 8 as many entries as in the table! e 1 cavity=falsetoothache=falsecatch=false e 1 =0.576 e 2 cavity=falsetoothache=falsecatch=true e 2 =0.144 e 3 cavity=falsetoothache=truecatch=false e 3 =0.064 e 4 cavity=falsetoothache=truecatch=true e 4 =0.016 e 5 cavity=truetoothache=falsecatch=false e 5 =0.008 e 6 cavity=truetoothache=falsecatch=true e 6 =0.072 e 7 cavity=truetoothache=truecatch=false e 7 =0.012 e 8 cavity=truetoothache=truecatch=true e 8 =

15 Inferring robabilities Given any proposition a, we can derive its probability as the sum of the probabilities of the atomic events in which it holds Example 1: a = cavity toothache Toothache Toothache catch catch catch catch Cavity Cavity a e e a i e a = cavity toothache Six events: e 5, e 6, e 7, e 8, e 3, e 4 cavity = =0.2 i e 1 cavity=falsetoothache=falsecatch=false e 1 =0.576 e 2 cavity=falsetoothache=falsecatch=true e 2 =0.144 e 3 cavity=falsetoothache=truecatch=false e 3 =0.064 e 4 cavity=falsetoothache=truecatch=true e 4 =0.016 e 5 cavity=truetoothache=falsecatch=false e 5 =0.008 e 6 cavity=truetoothache=falsecatch=true e 6 =0.072 e 7 cavity=truetoothache=truecatch=false e 7 =0.012 When adding all probabilities in a row we obtain the unconditional or marginal probability e 8 cavity=truetoothache=truecatch=true e 8 =

16 Marginalization and Conditioning Rules Given any two random variables Y and Z, Y Y, Z z marginalization rule A variant involves conditional probabilities, instead of joint probabilities: conditioning rule cavity = 0.2 cavity=0.8 toothache= =0.2 toothache=0.8 catch= =0.34 catch=0.66 Y Y Z Z z 443

17 444 Marginalization and Conditioning Rules If we have three random variables X, Y and Z From the product rule: y z z y X X,, y z z z y z y X X,,,,,, c c b c b a c b c b a bc a,, c c b bc a c b a Why? marginalization rule

18 Conditional robabilities cavity toothache cavity toothache toothache toothache toothache catch catch catch catch cavity cavity Also: cavity toothache cavity toothache toothache Notice: 1toothache remains the same in both calculations it acts like a normalization constant for the distribution Cavity toothache 445

19 Normalization Constants normalization constant Cavity toothache = Cavity,toothache = [Cavity,toothache,catch + Cavity,toothache,catch] = [<0.108, 0.016> + <0.012, 0.064>] = [<0.12, 0.08>] toothache toothache catch catch catch catch cavity cavity Normalization Constants are useful shortcuts in many probability computations! = <0.6, 0.4> = = 1/ = 1/0.2 = =50.12= =50.08=

20 General inference rocedure A notation: - X is a query variable Cavity in the example - E is the set of evidence variables Toothache in the example - e are the observed values for the evidence The query: X e Evaluated as X e X, e X, e, y y 447

21 robabilistic Inference by Enumeration Given a full join distribution to work with, ENUMERATE-JOIN-ASK is a complete algorithm for answering probabilistic queries for discrete variables 448

22 robabilistic Inference by Enumeration roblems: domain described by n Boolean variables Table of size O2 n and O2 n time to process it! Full joint distribution in tabular form is not a practical tool for building reasoning systems. It can be viewed as the theoretical foundation on which more effective approaches may be built. 449

23 Independence toothache toothache catch catch catch catch cavity cavity Let us add a fourth variable Weather The full distribution becomes Toothache, Catch, Cavity, Weather which has 32 entries 8 before 4 values for Weather This table contains four editions of the full table, one for each kind of weather. What relations do these editions have to each other and to the original 3- variable table? How are toothache, catch, cavity, Weather=cloudy and toothache, catch, cavity related? Use the product rule: toothache, catch, cavity, Weather=cloudy = = Weather=cloudy toothache,catch,cavity toothache,catch,cavity But Weather=cloudy toothache,catch,cavity= Weather=cloudy 450

24 Absolute Independence Weather is independent of one s dental problems. Toothache, Catch, Cavity, Weather = Toothache, Catch, Cavity Weather The 32-element table can be constructed from one 8-element table and one 4-element table. 451

25 Independence in Equations If propositions a and b are independent a b = a b a b = a a b a b b Independence between variables X and Y is written: X, Y = X Y X Y = X Y X = Y 452

26 453 Bayes Rule From the product rule: a b = a b b = b a a Then: a b b = b a a For multi-valued variables, Bayes Rule is: a set of equations, each dealing with specific values of the variables. a b b a a b X Y Y X X Y Bayes Rule

27 Examples Cavity Toothache Toothache Cavity Cavity Toothache cavity toothache toothache cavity cavity toothache cavity toothache toothache cavity cavity toothache cavity toothache toothache cavity cavity toothache cavity toothache toothache cavity cavity toothache 454

28 Applying Bayes Rule: The Simple Case Example: Medical diagnosis A doctor knows that meningitis causes a stiff neck 50% of the time: s m=0.5 The doctor also knows some unconditional facts: - the prior probability that the patient has meningitis is 1/50,000 m=1/50,000 - the prior probability that any patient has a stiff neck is 1/20 s=1/20 s m m 0.51/ 50,000 m s s 1/ Only 1 in 5,000 patients with a stiff neck is expected to have meningitis 455

29 456 Another way We can still compute m s without knowing s - instead compute the posterior probability for each value of the query variable here m and m and normalizing the results: s=s mm + s mm Then: Similarly: M s = < s mm, s mm> this can be obtained also from applying Bayes Rule with normalization 20 1/ 1/ 50, s m m s s m small because m=1/50,000 << s=1/ m m s m m s m m s m m s m m s s m 1 1 m m s m m s s m

30 Bayes Rule with Normalization M s = < s mm, s mm> this can be obtained also from applying Bayes Rule with normalization Y X = X YY is a normalization constant needed to make the entries in Y X sum to 1 457

31 Example of Bayes Rule with Normalization We have two discrete random variables: X describing weather conditions, with the domain: X={sunny, rain, cloudy, snow} Y describing clothes: Y={t-shirt, long-sleeves, coat} The distributions of X and Y are: X = <0.331, 0.26, 0.159, 0.25> Y = <0.5, 0.3, 0.2> We also have values of joint probabilities: t-shirt, sunny=0.32 t-shirt, rain=0.08 t-shirt, cloudy=0.09 t-shirt, snow=0.01 long-sleeves, sunny=0.01 long-sleeves, rain=0.15 long-sleeves, cloudy=0.05 long-sleeves, snow=0.09 coat, sunny=0.001 coat, rain=0.03 coat, cloudy=0.019 coat, snow=

32 Example of Bayes Rule with Normalization From these calculate conditional probabilities Y X, that is probability of clothing given weather. t-shirt sunny=t-shirt, sunny/sunny=0.32/ =.967 long-sleeves sunny= long-sleeves, sunny/sunny= 0.01/0.331= coat sunny= coat, sunny/sunny= 0.001/0.331= t-shirt rain= t-shirt, rain/rain= 0.08/0.26=0.307 long-sleeves rain= long-sleeves, rain/rain= 0.15/0.26=0.577 coat rain= coat, rain/rain= 0.03/0.26= t-shirt cloudy= t-shirt, cloudy/cloudy= 0.09/0.159=0.566 long-sleeves cloudy= long-sleeves, cloudy/cloudy= 0.05/0.159=0.314 coat cloudy=coat, cloudy/cloudy = 0.019/0.159= t-shirt snow= t-shirt, snow/snow= 0.01/0.25=0.04 long-sleeves snow= long-sleeves, snow/snow= 0.09/0.25=0.36 coat snow= coat, snow/snow= 0.15/0.25=

33 Computing the Normalization Constant Bayes s Rule: trying to guess the weather from the clothes people wear: X Y = Y XX = X,Y X Y add up to 1 for each value of Y 1. sunny t-shirt= 1 t-shirt, sunny= = = rain t-shirt= 1 t-shirt, rain= =2 0.08= cloudy t-shirt= 1 t-shirt, cloudy= =2 0.09= snow t-shirt= 1 t-shirt, snow= =2 0.01= = 1 1 =1/0.5 = 2 1. sunny long-sleeves= 2 long-sleeves, sunny= = = rain long-sleeves= 2 long-sleeves, rain= = = cloudy long-sleeves= 2 long-sleeves, cloudy= = = snow long-sleeves= 2 long-sleeves, snow= = = = 1 2 =1/0.3 = 3, sunny coat= 3 coat, sunny= = = rain coat= 3 coat, rain= =5 0.03= cloudy coat= 3 coat, cloudy= = = snow coat= 3 coat, snow= =5 0.15= = 1 3 =1/0.2 = 5 460

34 Example - Summary X sunny rain cloudy snow t-shirt Joint robabilities X, Y Y long-sleeve coat Y weather X t-shirt long-sleeve coat sunny X rain Y X clothes Y cloudy snow Conditional robabilities X clothes Y sunny rain cloudy snow t-shirt X Y weather X Y long-sleeve coat Conditional robabilities 461

35 More on Bayes rule What happens if one has the conditional probability in one direction but not the other? - Example: meningitis domain The doctor knows that a stiff neck implies meningitis in 1 of 5000 cases the doctor has quantitative information in the diagnostic direction from symptoms to causes. Lucky case the doctor has no need to use Bayes s rule 462

36 Causal Knowledge Note: Unfortunately, diagnostic knowledge is often more fragile than causal knowledge. Why? If there is a sudden epidemic of meningitis, the prior probability of meningitis m will go up. Because of this, the doctor who designed the diagnostic probability m S directly from statistical information, will not know how to update m s. But m s should go up s m m m s proportionally with m s Important: s m is unaffected by epidemic because it reflects how meningitis works. Conclusions: Using Causal or model-based knowledge provides robustness feasible probabilistic reasoning 463

37 Combining Evidence Until now, we considered probabilistic information available in the form effect cause single evidence What happens when there are multiple pieces of evidence? Example: dentist domain Cavity toothache catch = <0.108,0.016> <0.871, 0.129> This will not scale up to larger numbers of variables Cavity toothache catch = toothache catch CavityCavity we need to know the values of the conditional probabilities of the conjunction toothache catch for all values of Cavity If we have n possible evidence variables X rays, diet, oral hygiene, these are 2 n possible combinations of observed values, and for each we need to know the conditional probabilities. 464

38 Solution Consider the notion of independence Three variables: Cavity, Toothache, Catch which are independent? - Cavity, Catch? if the probe catches in the tooth, it probably has a cavity and that probably causes a toothache - Toothache, Catch? if there is a cavity, there will be a toothache, regardless of the probable catching the tooth - Toothache,Cavity? if there is a cavity, it might cause a toothache, but toothaches are not only caused by cavities 465

39 Conditional Independence toothach e catch Cavity toothache Cavity catch Cavity Conditional independence of toothache and catch given Cavity We also know: Cavity toothache catch toothache catch Cavity Cavity then interpret: Cavity toothache catch toothache Cavity catch Cavity cavity Cavity toothache catch cause effect1 effect2 toothache Cavity catch Cavity Cavity effect1 given cause effect2 given cause cause 466

40 Computational Complexity General definition of conditional independence of two variables X and Y given a third variable Z X, Y Z X Z Y Z Example: Toothach e, Catch Cavity Toothache Cavity Catch Cavity We can now derive the decomposition: Toothache, Catch, Cavity Toothache, Catch Cavity Cavity Toothache Cavity Catch Cavity Cavity Table 1 Table 2 Table 3 product rule Initial table-size = = 7 values 2 3 all, but since they sum to 1, we do not need the last one Table1-size = 2 values ; each row sums to 1 Table2-size = 2 values Table3-size = 1 value Thus total number of values = 2+2+1=5 instead of 7. In general the size of the representation grows as On instead of O2 n 467

41 Separation Cause, Effect1,..., Effect n Cause Effect i i Cause Toothache, Catch, Cavity Toothpaste Cavity Catch Cavity Cavity here Cavity separates Toothache and Catch because it is a Cause to both of them! Naïve Bayes model It is called Naïve because it works surprisingly well even when the effect variables are not conditionally independent 468

42 The Wumpus World Revisited After finding a breeze in both [1,2] and [2,1], the agent is stuck because there is no safe place to explore 1,4 2,4 3,4 4,4 1,3 2,3 3,3 4,3 1,2 1,1 B OK OK 2,2 3,2 4,2 2,1 B OK 3,1 4,1 Goal: compute the probability that the 3 neighboring squares contain a pit pit[1,3], pit[2,2], pit[3,1] Information: - a pit causes a breeze in all neighboring squares - each square other than [1,1] contains a pit with probability 0.2 Step 1: Identify random variables i,j =1 if square [i,j] contains a pit [i,j] = only for observed squares, e.g [1,1],[1,2],[2,1] B ij = 1 if square [i,j] is breezy ij, B ij are boolean variables 469

43 robabilistic Reasoning for the Wumpus Next step: specify the full distribution: 11 41, 12, 42 B,, 11 13, B, 43, 12 14, B, 44, B 21 21, 11, B 11 22, 12 23, B,...,, , 31 11, 32,...,, 44 33, 34, The prior probability of a pit configuration: 4,4 11,..., 44 ij i, j1,1 If there are n pits,,..., n 16n

44 Combining Evidence The evidence: - observed breeze in each square visited + each square visited contains no pit b b 11 b 12 known p 11 Query : 13 b 21 p 12 p known, b 21 How likely is that [1,3] contains a pit, given the observation so far 1,4 2,4 3,4 4,4 1,3 2,3 3,3 4,3 1,2 1,1 B OK OK 2,2 3,2 4,2 2,1 B OK 3,1 4,1 1,4 2,4 3,4 4,4 1,3 2,3 3,3OTHER4,3 QUERY 1,2 1,1 B OK KNOWN OK 2,2 3,2 4,2 2,1 FRINGE B OK 3,1 4,1 471

45 Answering the Query To answer 13 known,b we sum over the entries from the full distribution. Let unknown be a composite variable consisting of the ij variables for squares other than known and the query square [1,3] known, b, unknown, known, b unknown How many squares? =12 the summation contains 2 12 = 4096 terms too many! known query 472

46 Careful Computation Why would the contents of [4,4] affect whether [1,3] has a pit? Let us consider the set Fringe made of variables of the visited squares. Fringe={[2,2],[3,1]} Let us also consider the set Other containing variables of the unknown squares 10 of them The observed breezes are conditionally independent 13 known, b b known,, fringe, other, known, fringe, other fringe other fringe other b unknown b known, , unknown, known, fringe 13 13, known, 13, known, unknown fringe, other conditional independent 473

47 Continue Computation 13 known, b b known, 13, fringe 13, known, fringe other fringe, other The first term in this expression does not depend on the other variables we can move the summation inwards fringe b known, 13, fringe 13 other, known, fringe, other The prior term can be factored 13 known, b b known, 13, fringe 13 known fringe other fringe known 13 b known, 13 fringe other b known,, fringe fringe ' fringe, fringe fringe other other 474

48 Finishing 13 known, b ' 13 b known, 13, fringe {[2,2],[3,1]} fringe fringe fringe How do we build models for the Fringe? Since B 12 and B 21 we may have a pit in 13, 22 or 31 a b Model Model Model Model Model5 475

49 Likelihood of it at [1,3] 13 known, b ' 13 b known, 13, fringe fringe fringe Use Model 1,2&3 for 13 = 1 Model 4,5 for 13 = 0 13 known,b = < , > 13 =1 Model1 Model2 Model3 Model4 Model5 = < , > = <0.072, 0.016> <0.3103, > Because = 1/0.232 =

50 Interpretation From 13 known,b = <0.3103, > we know that [1,3] and [3,1] by symmetry contains a pit roughly 31% probability. Similarly, 22 known,b contains a pit roughly 86% probability The wumpus should avoid [2,2]! Lessons: seemingly complicated problems can be formulated precisely in probability theory and solved using simple algorithms Efficient solutions are obtained when independence and conditional independence relationships are used to simplify the summations Independence corresponds to our natural understanding of how the problem should be decomposed 477

13.4 INDEPENDENCE. 494 Chapter 13. Quantifying Uncertainty

13.4 INDEPENDENCE. 494 Chapter 13. Quantifying Uncertainty 494 Chapter 13. Quantifying Uncertainty table. In a realistic problem we could easily have n>100, makingo(2 n ) impractical. The full joint distribution in tabular form is just not a practical tool for

More information

Uncertainty. Variables. assigns to each sentence numerical degree of belief between 0 and 1. uncertainty

Uncertainty. Variables. assigns to each sentence numerical degree of belief between 0 and 1. uncertainty Bayes Classification n Uncertainty & robability n Baye's rule n Choosing Hypotheses- Maximum a posteriori n Maximum Likelihood - Baye's concept learning n Maximum Likelihood of real valued function n Bayes

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Dr Ahmed Rafat Abas Computer Science Dept, Faculty of Computers and Informatics, Zagazig University arabas@zu.edu.eg http://www.arsaliem.faculty.zu.edu.eg/ Uncertainty Chapter 13

More information

Pengju XJTU 2016

Pengju XJTU 2016 Introduction to AI Chapter13 Uncertainty Pengju Ren@IAIR Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes Rule Wumpus World Environment Squares adjacent to wumpus are

More information

Artificial Intelligence Uncertainty

Artificial Intelligence Uncertainty Artificial Intelligence Uncertainty Ch. 13 Uncertainty Let action A t = leave for airport t minutes before flight Will A t get me there on time? A 25, A 60, A 3600 Uncertainty: partial observability (road

More information

Probabilistic Reasoning

Probabilistic Reasoning Course 16 :198 :520 : Introduction To Artificial Intelligence Lecture 7 Probabilistic Reasoning Abdeslam Boularias Monday, September 28, 2015 1 / 17 Outline We show how to reason and act under uncertainty.

More information

Uncertainty and Belief Networks. Introduction to Artificial Intelligence CS 151 Lecture 1 continued Ok, Lecture 2!

Uncertainty and Belief Networks. Introduction to Artificial Intelligence CS 151 Lecture 1 continued Ok, Lecture 2! Uncertainty and Belief Networks Introduction to Artificial Intelligence CS 151 Lecture 1 continued Ok, Lecture 2! This lecture Conditional Independence Bayesian (Belief) Networks: Syntax and semantics

More information

COMP9414/ 9814/ 3411: Artificial Intelligence. 14. Uncertainty. Russell & Norvig, Chapter 13. UNSW c AIMA, 2004, Alan Blair, 2012

COMP9414/ 9814/ 3411: Artificial Intelligence. 14. Uncertainty. Russell & Norvig, Chapter 13. UNSW c AIMA, 2004, Alan Blair, 2012 COMP9414/ 9814/ 3411: Artificial Intelligence 14. Uncertainty Russell & Norvig, Chapter 13. COMP9414/9814/3411 14s1 Uncertainty 1 Outline Uncertainty Probability Syntax and Semantics Inference Independence

More information

Uncertainty. Chapter 13

Uncertainty. Chapter 13 Uncertainty Chapter 13 Uncertainty Let action A t = leave for airport t minutes before flight Will A t get me there on time? Problems: 1. partial observability (road state, other drivers' plans, noisy

More information

Uncertainty. Outline

Uncertainty. Outline Uncertainty Chapter 13 Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule 1 Uncertainty Let action A t = leave for airport t minutes before flight Will A t get

More information

UNCERTAINTY. In which we see what an agent should do when not all is crystal-clear.

UNCERTAINTY. In which we see what an agent should do when not all is crystal-clear. UNCERTAINTY In which we see what an agent should do when not all is crystal-clear. Outline Uncertainty Probabilistic Theory Axioms of Probability Probabilistic Reasoning Independency Bayes Rule Summary

More information

Uncertainty. Introduction to Artificial Intelligence CS 151 Lecture 2 April 1, CS151, Spring 2004

Uncertainty. Introduction to Artificial Intelligence CS 151 Lecture 2 April 1, CS151, Spring 2004 Uncertainty Introduction to Artificial Intelligence CS 151 Lecture 2 April 1, 2004 Administration PA 1 will be handed out today. There will be a MATLAB tutorial tomorrow, Friday, April 2 in AP&M 4882 at

More information

Probabilistic Reasoning

Probabilistic Reasoning Probabilistic Reasoning Philipp Koehn 4 April 2017 Outline 1 Uncertainty Probability Inference Independence and Bayes Rule 2 uncertainty Uncertainty 3 Let action A t = leave for airport t minutes before

More information

Chapter 13 Quantifying Uncertainty

Chapter 13 Quantifying Uncertainty Chapter 13 Quantifying Uncertainty CS5811 - Artificial Intelligence Nilufer Onder Department of Computer Science Michigan Technological University Outline Probability basics Syntax and semantics Inference

More information

Artificial Intelligence Programming Probability

Artificial Intelligence Programming Probability Artificial Intelligence Programming Probability Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/?? 13-0: Uncertainty

More information

Uncertainty. Chapter 13

Uncertainty. Chapter 13 Uncertainty Chapter 13 Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes Rule Uncertainty Let s say you want to get to the airport in time for a flight. Let action A

More information

Uncertainty. Chapter 13. Chapter 13 1

Uncertainty. Chapter 13. Chapter 13 1 Uncertainty Chapter 13 Chapter 13 1 Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes Rule Chapter 13 2 Uncertainty Let action A t = leave for airport t minutes before

More information

Uncertainty. Chapter 13, Sections 1 6

Uncertainty. Chapter 13, Sections 1 6 Uncertainty Chapter 13, Sections 1 6 Artificial Intelligence, spring 2013, Peter Ljunglöf; based on AIMA Slides c Stuart Russel and Peter Norvig, 2004 Chapter 13, Sections 1 6 1 Outline Uncertainty Probability

More information

Pengju

Pengju Introduction to AI Chapter13 Uncertainty Pengju Ren@IAIR Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes Rule Example: Car diagnosis Wumpus World Environment Squares

More information

This lecture. Reading. Conditional Independence Bayesian (Belief) Networks: Syntax and semantics. Chapter CS151, Spring 2004

This lecture. Reading. Conditional Independence Bayesian (Belief) Networks: Syntax and semantics. Chapter CS151, Spring 2004 This lecture Conditional Independence Bayesian (Belief) Networks: Syntax and semantics Reading Chapter 14.1-14.2 Propositions and Random Variables Letting A refer to a proposition which may either be true

More information

Uncertainty. Outline. Probability Syntax and Semantics Inference Independence and Bayes Rule. AIMA2e Chapter 13

Uncertainty. Outline. Probability Syntax and Semantics Inference Independence and Bayes Rule. AIMA2e Chapter 13 Uncertainty AIMA2e Chapter 13 1 Outline Uncertainty Probability Syntax and Semantics Inference Independence and ayes Rule 2 Uncertainty Let action A t = leave for airport t minutes before flight Will A

More information

An AI-ish view of Probability, Conditional Probability & Bayes Theorem

An AI-ish view of Probability, Conditional Probability & Bayes Theorem An AI-ish view of Probability, Conditional Probability & Bayes Theorem Review: Uncertainty and Truth Values: a mismatch Let action A t = leave for airport t minutes before flight. Will A 15 get me there

More information

10/18/2017. An AI-ish view of Probability, Conditional Probability & Bayes Theorem. Making decisions under uncertainty.

10/18/2017. An AI-ish view of Probability, Conditional Probability & Bayes Theorem. Making decisions under uncertainty. An AI-ish view of Probability, Conditional Probability & Bayes Theorem Review: Uncertainty and Truth Values: a mismatch Let action A t = leave for airport t minutes before flight. Will A 15 get me there

More information

CS188 Outline. CS 188: Artificial Intelligence. Today. Inference in Ghostbusters. Probability. We re done with Part I: Search and Planning!

CS188 Outline. CS 188: Artificial Intelligence. Today. Inference in Ghostbusters. Probability. We re done with Part I: Search and Planning! CS188 Outline We re done with art I: Search and lanning! CS 188: Artificial Intelligence robability art II: robabilistic Reasoning Diagnosis Speech recognition Tracking objects Robot mapping Genetics Error

More information

CS 561: Artificial Intelligence

CS 561: Artificial Intelligence CS 561: Artificial Intelligence Instructor: TAs: Sofus A. Macskassy, macskass@usc.edu Nadeesha Ranashinghe (nadeeshr@usc.edu) William Yeoh (wyeoh@usc.edu) Harris Chiu (chiciu@usc.edu) Lectures: MW 5:00-6:20pm,

More information

Outline. Uncertainty. Methods for handling uncertainty. Uncertainty. Making decisions under uncertainty. Probability. Uncertainty

Outline. Uncertainty. Methods for handling uncertainty. Uncertainty. Making decisions under uncertainty. Probability. Uncertainty Outline Uncertainty Uncertainty Chapter 13 Probability Syntax and Semantics Inference Independence and ayes Rule Chapter 13 1 Chapter 13 2 Uncertainty et action A t =leaveforairportt minutes before flight

More information

Uncertain Knowledge and Reasoning

Uncertain Knowledge and Reasoning Uncertainty Part IV Uncertain Knowledge and Reasoning et action A t = leave for airport t minutes before flight Will A t get me there on time? Problems: 1) partial observability (road state, other drivers

More information

Web-Mining Agents Data Mining

Web-Mining Agents Data Mining Web-Mining Agents Data Mining Prof. Dr. Ralf Möller Dr. Özgür L. Özçep Universität zu Lübeck Institut für Informationssysteme Tanya Braun (Übungen) 2 Uncertainty AIMA Chapter 13 3 Outline Agents Uncertainty

More information

Reasoning with Uncertainty. Chapter 13

Reasoning with Uncertainty. Chapter 13 Reasoning with Uncertainty Chapter 13 1 Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes Rule 2 The real world is an uncertain place... Example: I need a plan that

More information

CS 188: Artificial Intelligence. Our Status in CS188

CS 188: Artificial Intelligence. Our Status in CS188 CS 188: Artificial Intelligence Probability Pieter Abbeel UC Berkeley Many slides adapted from Dan Klein. 1 Our Status in CS188 We re done with Part I Search and Planning! Part II: Probabilistic Reasoning

More information

CS 188: Artificial Intelligence Fall 2009

CS 188: Artificial Intelligence Fall 2009 CS 188: Artificial Intelligence Fall 2009 Lecture 13: Probability 10/8/2009 Dan Klein UC Berkeley 1 Announcements Upcoming P3 Due 10/12 W2 Due 10/15 Midterm in evening of 10/22 Review sessions: Probability

More information

Probability Hal Daumé III. Computer Science University of Maryland CS 421: Introduction to Artificial Intelligence 27 Mar 2012

Probability Hal Daumé III. Computer Science University of Maryland CS 421: Introduction to Artificial Intelligence 27 Mar 2012 1 Hal Daumé III (me@hal3.name) Probability 101++ Hal Daumé III Computer Science University of Maryland me@hal3.name CS 421: Introduction to Artificial Intelligence 27 Mar 2012 Many slides courtesy of Dan

More information

Quantifying uncertainty & Bayesian networks

Quantifying uncertainty & Bayesian networks Quantifying uncertainty & Bayesian networks CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2016 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition,

More information

Uncertainty. Logic and Uncertainty. Russell & Norvig. Readings: Chapter 13. One problem with logical-agent approaches: C:145 Artificial

Uncertainty. Logic and Uncertainty. Russell & Norvig. Readings: Chapter 13. One problem with logical-agent approaches: C:145 Artificial C:145 Artificial Intelligence@ Uncertainty Readings: Chapter 13 Russell & Norvig. Artificial Intelligence p.1/43 Logic and Uncertainty One problem with logical-agent approaches: Agents almost never have

More information

Where are we in CS 440?

Where are we in CS 440? Where are we in CS 440? Now leaving: sequential deterministic reasoning Entering: probabilistic reasoning and machine learning robability: Review of main concepts Chapter 3 Motivation: lanning under uncertainty

More information

CSE 473: Artificial Intelligence

CSE 473: Artificial Intelligence CSE 473: Artificial Intelligence Probability Steve Tanimoto University of Washington [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials

More information

Our Status. We re done with Part I Search and Planning!

Our Status. We re done with Part I Search and Planning! Probability [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.] Our Status We re done with Part

More information

Probabilistic Robotics. Slides from Autonomous Robots (Siegwart and Nourbaksh), Chapter 5 Probabilistic Robotics (S. Thurn et al.

Probabilistic Robotics. Slides from Autonomous Robots (Siegwart and Nourbaksh), Chapter 5 Probabilistic Robotics (S. Thurn et al. robabilistic Robotics Slides from Autonomous Robots Siegwart and Nourbaksh Chapter 5 robabilistic Robotics S. Thurn et al. Today Overview of probability Representing uncertainty ropagation of uncertainty

More information

Where are we in CS 440?

Where are we in CS 440? Where are we in CS 440? Now leaving: sequential deterministic reasoning Entering: probabilistic reasoning and machine learning robability: Review of main concepts Chapter 3 Making decisions under uncertainty

More information

Basic Probability. Robert Platt Northeastern University. Some images and slides are used from: 1. AIMA 2. Chris Amato

Basic Probability. Robert Platt Northeastern University. Some images and slides are used from: 1. AIMA 2. Chris Amato Basic Probability Robert Platt Northeastern University Some images and slides are used from: 1. AIMA 2. Chris Amato (Discrete) Random variables What is a random variable? Suppose that the variable a denotes

More information

Uncertainty. 22c:145 Artificial Intelligence. Problem of Logic Agents. Foundations of Probability. Axioms of Probability

Uncertainty. 22c:145 Artificial Intelligence. Problem of Logic Agents. Foundations of Probability. Axioms of Probability Problem of Logic Agents 22c:145 Artificial Intelligence Uncertainty Reading: Ch 13. Russell & Norvig Logic-agents almost never have access to the whole truth about their environments. A rational agent

More information

Quantifying Uncertainty & Probabilistic Reasoning. Abdulla AlKhenji Khaled AlEmadi Mohammed AlAnsari

Quantifying Uncertainty & Probabilistic Reasoning. Abdulla AlKhenji Khaled AlEmadi Mohammed AlAnsari Quantifying Uncertainty & Probabilistic Reasoning Abdulla AlKhenji Khaled AlEmadi Mohammed AlAnsari Outline Previous Implementations What is Uncertainty? Acting Under Uncertainty Rational Decisions Basic

More information

CS 188: Artificial Intelligence Fall 2011

CS 188: Artificial Intelligence Fall 2011 CS 188: Artificial Intelligence Fall 2011 Lecture 12: Probability 10/4/2011 Dan Klein UC Berkeley 1 Today Probability Random Variables Joint and Marginal Distributions Conditional Distribution Product

More information

Probability theory: elements

Probability theory: elements Probability theory: elements Peter Antal antal@mit.bme.hu A.I. February 17, 2017 1 Joint distribution Conditional robability Indeendence, conditional indeendence Bayes rule Marginalization/Exansion Chain

More information

Answering. Question Answering: Result. Application of the Theorem Prover: Question. Overview. Question Answering: Example.

Answering. Question Answering: Result. Application of the Theorem Prover: Question. Overview. Question Answering: Example. ! &0/ $% &) &% &0/ $% &) &% 5 % 4! pplication of the Theorem rover: Question nswering iven a database of facts (ground instances) and axioms we can pose questions in predicate calculus and answer them

More information

Uncertainty and Bayesian Networks

Uncertainty and Bayesian Networks Uncertainty and Bayesian Networks Tutorial 3 Tutorial 3 1 Outline Uncertainty Probability Syntax and Semantics for Uncertainty Inference Independence and Bayes Rule Syntax and Semantics for Bayesian Networks

More information

Probabilistic Robotics

Probabilistic Robotics Probabilistic Robotics Overview of probability, Representing uncertainty Propagation of uncertainty, Bayes Rule Application to Localization and Mapping Slides from Autonomous Robots (Siegwart and Nourbaksh),

More information

Y. Xiang, Inference with Uncertain Knowledge 1

Y. Xiang, Inference with Uncertain Knowledge 1 Inference with Uncertain Knowledge Objectives Why must agent use uncertain knowledge? Fundamentals of Bayesian probability Inference with full joint distributions Inference with Bayes rule Bayesian networks

More information

Uncertainty (Chapter 13, Russell & Norvig) Introduction to Artificial Intelligence CS 150 Lecture 14

Uncertainty (Chapter 13, Russell & Norvig) Introduction to Artificial Intelligence CS 150 Lecture 14 Uncertainty (Chapter 13, Russell & Norvig) Introduction to Artificial Intelligence CS 150 Lecture 14 Administration Last Programming assignment will be handed out later this week. I am doing probability

More information

Computer Science CPSC 322. Lecture 18 Marginalization, Conditioning

Computer Science CPSC 322. Lecture 18 Marginalization, Conditioning Computer Science CPSC 322 Lecture 18 Marginalization, Conditioning Lecture Overview Recap Lecture 17 Joint Probability Distribution, Marginalization Conditioning Inference by Enumeration Bayes Rule, Chain

More information

Probabilistic representation and reasoning

Probabilistic representation and reasoning Probabilistic representation and reasoning Applied artificial intelligence (EDA132) Lecture 09 2017-02-15 Elin A. Topp Material based on course book, chapter 13, 14.1-3 1 Show time! Two boxes of chocolates,

More information

Fusion in simple models

Fusion in simple models Fusion in simple models Peter Antal antal@mit.bme.hu A.I. February 8, 2018 1 Basic concepts of probability theory Joint distribution Conditional probability Bayes rule Chain rule Marginalization General

More information

10/15/2015 A FAST REVIEW OF DISCRETE PROBABILITY (PART 2) Probability, Conditional Probability & Bayes Rule. Discrete random variables

10/15/2015 A FAST REVIEW OF DISCRETE PROBABILITY (PART 2) Probability, Conditional Probability & Bayes Rule. Discrete random variables Probability, Conditional Probability & Bayes Rule A FAST REVIEW OF DISCRETE PROBABILITY (PART 2) 2 Discrete random variables A random variable can take on one of a set of different values, each with an

More information

Basic Probability and Decisions

Basic Probability and Decisions Basic Probability and Decisions Chris Amato Northeastern University Some images and slides are used from: Rob Platt, CS188 UC Berkeley, AIMA Uncertainty Let action A t = leave for airport t minutes before

More information

Lecture 10: Introduction to reasoning under uncertainty. Uncertainty

Lecture 10: Introduction to reasoning under uncertainty. Uncertainty Lecture 10: Introduction to reasoning under uncertainty Introduction to reasoning under uncertainty Review of probability Axioms and inference Conditional probability Probability distributions COMP-424,

More information

Reasoning under Uncertainty: Intro to Probability

Reasoning under Uncertainty: Intro to Probability Reasoning under Uncertainty: Intro to Probability Computer Science cpsc322, Lecture 24 (Textbook Chpt 6.1, 6.1.1) March, 15, 2010 CPSC 322, Lecture 24 Slide 1 To complete your Learning about Logics Review

More information

CS188 Outline. We re done with Part I: Search and Planning! Part II: Probabilistic Reasoning. Part III: Machine Learning

CS188 Outline. We re done with Part I: Search and Planning! Part II: Probabilistic Reasoning. Part III: Machine Learning CS188 Outline We re done with Part I: Search and Planning! Part II: Probabilistic Reasoning Diagnosis Speech recognition Tracking objects Robot mapping Genetics Error correcting codes lots more! Part III:

More information

Modeling and reasoning with uncertainty

Modeling and reasoning with uncertainty CS 2710 Foundations of AI Lecture 18 Modeling and reasoning with uncertainty Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square KB systems. Medical example. We want to build a KB system for the diagnosis

More information

Our Status in CSE 5522

Our Status in CSE 5522 Our Status in CSE 5522 We re done with Part I Search and Planning! Part II: Probabilistic Reasoning Diagnosis Speech recognition Tracking objects Robot mapping Genetics Error correcting codes lots more!

More information

CS 343: Artificial Intelligence

CS 343: Artificial Intelligence CS 343: Artificial Intelligence Probability 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. All CS188

More information

Course Introduction. Probabilistic Modelling and Reasoning. Relationships between courses. Dealing with Uncertainty. Chris Williams.

Course Introduction. Probabilistic Modelling and Reasoning. Relationships between courses. Dealing with Uncertainty. Chris Williams. Course Introduction Probabilistic Modelling and Reasoning Chris Williams School of Informatics, University of Edinburgh September 2008 Welcome Administration Handout Books Assignments Tutorials Course

More information

In today s lecture. Conditional probability and independence. COSC343: Artificial Intelligence. Curse of dimensionality.

In today s lecture. Conditional probability and independence. COSC343: Artificial Intelligence. Curse of dimensionality. In today s lecture COSC343: Artificial Intelligence Lecture 5: Bayesian Reasoning Conditional probability independence Curse of dimensionality Lech Szymanski Dept. of Computer Science, University of Otago

More information

Cartesian-product sample spaces and independence

Cartesian-product sample spaces and independence CS 70 Discrete Mathematics for CS Fall 003 Wagner Lecture 4 The final two lectures on probability will cover some basic methods for answering questions about probability spaces. We will apply them to the

More information

Uncertainty. Russell & Norvig Chapter 13.

Uncertainty. Russell & Norvig Chapter 13. Uncertainty Russell & Norvig Chapter 13 http://toonut.com/wp-content/uploads/2011/12/69wp.jpg Uncertainty Let A t be the action of leaving for the airport t minutes before your flight Will A t get you

More information

Reasoning Under Uncertainty

Reasoning Under Uncertainty Reasoning Under Uncertainty Introduction Representing uncertain knowledge: logic and probability (a reminder!) Probabilistic inference using the joint probability distribution Bayesian networks (theory

More information

Reasoning Under Uncertainty

Reasoning Under Uncertainty Reasoning Under Uncertainty Introduction Representing uncertain knowledge: logic and probability (a reminder!) Probabilistic inference using the joint probability distribution Bayesian networks The Importance

More information

Introduction to Machine Learning

Introduction to Machine Learning Introduction to Machine Learning CS4375 --- Fall 2018 Bayesian a Learning Reading: Sections 13.1-13.6, 20.1-20.2, R&N Sections 6.1-6.3, 6.7, 6.9, Mitchell 1 Uncertainty Most real-world problems deal with

More information

n How to represent uncertainty in knowledge? n Which action to choose under uncertainty? q Assume the car does not have a flat tire

n How to represent uncertainty in knowledge? n Which action to choose under uncertainty? q Assume the car does not have a flat tire Uncertainty Uncertainty Russell & Norvig Chapter 13 Let A t be the action of leaving for the airport t minutes before your flight Will A t get you there on time? A purely logical approach either 1. risks

More information

Introduction to Machine Learning

Introduction to Machine Learning Uncertainty Introduction to Machine Learning CS4375 --- Fall 2018 a Bayesian Learning Reading: Sections 13.1-13.6, 20.1-20.2, R&N Sections 6.1-6.3, 6.7, 6.9, Mitchell Most real-world problems deal with

More information

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence Foundations of Artificial Intelligence 12. Making Simple Decisions under Uncertainty Probability Theory, Bayesian Networks, Other Approaches Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität

More information

Reasoning under Uncertainty: Intro to Probability

Reasoning under Uncertainty: Intro to Probability Reasoning under Uncertainty: Intro to Probability Computer Science cpsc322, Lecture 24 (Textbook Chpt 6.1, 6.1.1) Nov, 2, 2012 CPSC 322, Lecture 24 Slide 1 Tracing Datalog proofs in AIspace You can trace

More information

Ch.6 Uncertain Knowledge. Logic and Uncertainty. Representation. One problem with logical approaches: Department of Computer Science

Ch.6 Uncertain Knowledge. Logic and Uncertainty. Representation. One problem with logical approaches: Department of Computer Science Ch.6 Uncertain Knowledge Representation Hantao Zhang http://www.cs.uiowa.edu/ hzhang/c145 The University of Iowa Department of Computer Science Artificial Intelligence p.1/39 Logic and Uncertainty One

More information

Probabilistic representation and reasoning

Probabilistic representation and reasoning Probabilistic representation and reasoning Applied artificial intelligence (EDAF70) Lecture 04 2019-02-01 Elin A. Topp Material based on course book, chapter 13, 14.1-3 1 Show time! Two boxes of chocolates,

More information

COMP9414: Artificial Intelligence Reasoning Under Uncertainty

COMP9414: Artificial Intelligence Reasoning Under Uncertainty COMP9414, Monday 16 April, 2012 Reasoning Under Uncertainty 2 COMP9414: Artificial Intelligence Reasoning Under Uncertainty Overview Problems with Logical Approach What Do the Numbers Mean? Wayne Wobcke

More information

CS 5100: Founda.ons of Ar.ficial Intelligence

CS 5100: Founda.ons of Ar.ficial Intelligence CS 5100: Founda.ons of Ar.ficial Intelligence Probabilistic Inference Prof. Amy Sliva November 3, 2011 Outline Discuss Midterm Class presentations start next week! Reasoning under uncertainty Probability

More information

Bayesian networks. Soleymani. CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018

Bayesian networks. Soleymani. CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018 Bayesian networks CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018 Soleymani Slides have been adopted from Klein and Abdeel, CS188, UC Berkeley. Outline Probability

More information

Artificial Intelligence Chapter 7: Logical Agents

Artificial Intelligence Chapter 7: Logical Agents Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents

More information

Logical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14

Logical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14 0/0/4 Knowledge based agents Logical Agents Agents need to be able to: Store information about their environment Update and reason about that information Russell and Norvig, chapter 7 Knowledge based agents

More information

PROBABILITY. Inference: constraint propagation

PROBABILITY. Inference: constraint propagation PROBABILITY Inference: constraint propagation! Use the constraints to reduce the number of legal values for a variable! Possible to find a solution without searching! Node consistency " A node is node-consistent

More information

CS 188: Artificial Intelligence Spring Announcements

CS 188: Artificial Intelligence Spring Announcements CS 188: Artificial Intelligence Spring 2011 Lecture 12: Probability 3/2/2011 Pieter Abbeel UC Berkeley Many slides adapted from Dan Klein. 1 Announcements P3 due on Monday (3/7) at 4:59pm W3 going out

More information

Brief Intro. to Bayesian Networks. Extracted and modified from four lectures in Intro to AI, Spring 2008 Paul S. Rosenbloom

Brief Intro. to Bayesian Networks. Extracted and modified from four lectures in Intro to AI, Spring 2008 Paul S. Rosenbloom Brief Intro. to Bayesian Networks Extracted and modified from four lectures in Intro to AI, Spring 2008 Paul S. Rosenbloom Factor Graph Review Tame combinatorics in many calculations Decoding codes (origin

More information

Lecture Overview. Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 11: Uncertainty. Uncertainty.

Lecture Overview. Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 11: Uncertainty. Uncertainty. Lecture Overview COMP 3501 / COMP 4704-4 Lecture 11: Uncertainty Return HW 1/Midterm Short HW 2 discussion Uncertainty / Probability Prof. JGH 318 Uncertainty Previous approaches dealt with relatively

More information

ARTIFICIAL INTELLIGENCE. Uncertainty: probabilistic reasoning

ARTIFICIAL INTELLIGENCE. Uncertainty: probabilistic reasoning INFOB2KI 2017-2018 Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Uncertainty: probabilistic reasoning Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from

More information

Machine Learning. CS Spring 2015 a Bayesian Learning (I) Uncertainty

Machine Learning. CS Spring 2015 a Bayesian Learning (I) Uncertainty Machine Learning CS6375 --- Spring 2015 a Bayesian Learning (I) 1 Uncertainty Most real-world problems deal with uncertain information Diagnosis: Likely disease given observed symptoms Equipment repair:

More information

Bayesian Reasoning. Adapted from slides by Tim Finin and Marie desjardins.

Bayesian Reasoning. Adapted from slides by Tim Finin and Marie desjardins. Bayesian Reasoning Adapted from slides by Tim Finin and Marie desjardins. 1 Outline Probability theory Bayesian inference From the joint distribution Using independence/factoring From sources of evidence

More information

CS 188: Artificial Intelligence Fall 2009

CS 188: Artificial Intelligence Fall 2009 CS 188: Artificial Intelligence Fall 2009 Lecture 14: Bayes Nets 10/13/2009 Dan Klein UC Berkeley Announcements Assignments P3 due yesterday W2 due Thursday W1 returned in front (after lecture) Midterm

More information

Resolution or modus ponens are exact there is no possibility of mistake if the rules are followed exactly.

Resolution or modus ponens are exact there is no possibility of mistake if the rules are followed exactly. THE WEAKEST LINK Resolution or modus ponens are exact there is no possibility of mistake if the rules are followed exactly. These methods of inference (also known as deductive methods) require that information

More information

CS 188: Artificial Intelligence Fall 2008

CS 188: Artificial Intelligence Fall 2008 CS 188: Artificial Intelligence Fall 2008 Lecture 14: Bayes Nets 10/14/2008 Dan Klein UC Berkeley 1 1 Announcements Midterm 10/21! One page note sheet Review sessions Friday and Sunday (similar) OHs on

More information

Bayesian Learning. Examples. Conditional Probability. Two Roles for Bayesian Methods. Prior Probability and Random Variables. The Chain Rule P (B)

Bayesian Learning. Examples. Conditional Probability. Two Roles for Bayesian Methods. Prior Probability and Random Variables. The Chain Rule P (B) Examples My mood can take 2 possible values: happy, sad. The weather can take 3 possible vales: sunny, rainy, cloudy My friends know me pretty well and say that: P(Mood=happy Weather=rainy) = 0.25 P(Mood=happy

More information

Probabilistic Reasoning. Kee-Eung Kim KAIST Computer Science

Probabilistic Reasoning. Kee-Eung Kim KAIST Computer Science Probabilistic Reasoning Kee-Eung Kim KAIST Computer Science Outline #1 Acting under uncertainty Probabilities Inference with Probabilities Independence and Bayes Rule Bayesian networks Inference in Bayesian

More information

Artificial Intelligence. Propositional logic

Artificial Intelligence. Propositional logic Artificial Intelligence Propositional logic Propositional Logic: Syntax Syntax of propositional logic defines allowable sentences Atomic sentences consists of a single proposition symbol Each symbol stands

More information

PROBABILISTIC REASONING SYSTEMS

PROBABILISTIC 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 information

Kecerdasan Buatan M. Ali Fauzi

Kecerdasan Buatan M. Ali Fauzi Kecerdasan Buatan M. Ali Fauzi Artificial Intelligence M. Ali Fauzi Logical Agents M. Ali Fauzi In which we design agents that can form representations of the would, use a process of inference to derive

More information

Objectives. Probabilistic Reasoning Systems. Outline. Independence. Conditional independence. Conditional independence II.

Objectives. 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 information

Reinforcement Learning Wrap-up

Reinforcement Learning Wrap-up Reinforcement Learning Wrap-up Slides courtesy of Dan Klein and Pieter Abbeel University of California, Berkeley [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.

More information

Random Variables. A random variable is some aspect of the world about which we (may) have uncertainty

Random Variables. A random variable is some aspect of the world about which we (may) have uncertainty Review Probability Random Variables Joint and Marginal Distributions Conditional Distribution Product Rule, Chain Rule, Bayes Rule Inference Independence 1 Random Variables A random variable is some aspect

More information

Probabilistic Reasoning Systems

Probabilistic 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

Probability and Decision Theory

Probability and Decision Theory Probability and Decision Theory Robert Platt Northeastern University Some images and slides are used from: 1. AIMA 2. Chris Amato 3. Stacy Marsella QUANTIFYING UNCERTAINTY WITH PROBABILITIES Generally

More information

Uncertainty Chapter 13. Mausam (Based on slides by UW-AI faculty)

Uncertainty Chapter 13. Mausam (Based on slides by UW-AI faculty) Uncertaint Chapter 13 Mausam Based on slides b UW-AI facult Knowledge Representation KR Language Ontological Commitment Epistemological Commitment ropositional Logic facts true, false, unknown First Order

More information

Reasoning Under Uncertainty: Conditioning, Bayes Rule & the Chain Rule

Reasoning Under Uncertainty: Conditioning, Bayes Rule & the Chain Rule Reasoning Under Uncertainty: Conditioning, Bayes Rule & the Chain Rule Alan Mackworth UBC CS 322 Uncertainty 2 March 13, 2013 Textbook 6.1.3 Lecture Overview Recap: Probability & Possible World Semantics

More information