Uncertainty. Outline

Similar documents
Artificial Intelligence

Uncertainty. Chapter 13

Artificial Intelligence Uncertainty

Uncertainty. Chapter 13

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

Pengju XJTU 2016

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

Uncertainty. Chapter 13, Sections 1 6

Probabilistic Reasoning

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

Web-Mining Agents Data Mining

Uncertainty. Chapter 13. Chapter 13 1

Uncertain Knowledge and Reasoning

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

CS 561: Artificial Intelligence

Probabilistic Robotics

Chapter 13 Quantifying Uncertainty

Quantifying uncertainty & Bayesian networks

Probability theory: elements

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

Uncertainty and Bayesian Networks

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

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

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

Basic Probability and Decisions

Pengju

CS 5100: Founda.ons of Ar.ficial Intelligence

Uncertainty. Russell & Norvig Chapter 13.

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. CmpE 540 Principles of Artificial Intelligence Pınar Yolum Uncertainty. Sources of Uncertainty

ARTIFICIAL INTELLIGENCE. Uncertainty: probabilistic reasoning

Fusion in simple models

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

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

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

Uncertainty (Chapter 13, Russell & Norvig)

Reasoning with Uncertainty. Chapter 13

Where are we in CS 440?

Where are we in CS 440?

Lecture 10: Introduction to reasoning under uncertainty. Uncertainty

Probabilistic Reasoning

CS 188: Artificial Intelligence Fall 2009

Probabilistic representation and reasoning

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

Probabilistic Reasoning. Kee-Eung Kim KAIST Computer Science

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

13.4 INDEPENDENCE. 494 Chapter 13. Quantifying Uncertainty

CSE 473: Artificial Intelligence

Cartesian-product sample spaces and independence

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

Probabilistic Models

Probability and Decision Theory

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

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

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

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

CS 188: Artificial Intelligence. Our Status in CS188

Web-Mining Agents. Prof. Dr. Ralf Möller Dr. Özgür Özçep. Universität zu Lübeck Institut für Informationssysteme. Tanya Braun (Lab Class)

Probabilistic representation and reasoning

PROBABILISTIC REASONING Outline

CS 188: Artificial Intelligence Fall 2009

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

Probabilistic Reasoning. (Mostly using Bayesian Networks)

CS 5522: Artificial Intelligence II

CS 188: Artificial Intelligence Spring Announcements

Artificial Intelligence CS 6364

CS 343: Artificial Intelligence

CS 188: Artificial Intelligence Fall 2008

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

Probabilistic Reasoning Systems

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

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

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

Probabilistic Models. Models describe how (a portion of) the world works

CSE 473: Artificial Intelligence Autumn 2011

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

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

Bayesian networks (1) Lirong Xia

Stochastic Methods. 5.0 Introduction 5.1 The Elements of Counting 5.2 Elements of Probability Theory

Artificial Intelligence Programming Probability

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

Basic Probability and Statistics

Graphical Models - Part I

Computer Science CPSC 322. Lecture 18 Marginalization, Conditioning

Reasoning Under Uncertainty

Reasoning Under Uncertainty

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

Reasoning under Uncertainty: Intro to Probability

CS 188: Artificial Intelligence Fall 2011

PROBABILISTIC REASONING SYSTEMS

Probability. CS 3793/5233 Artificial Intelligence Probability 1

Outline. CSE 573: Artificial Intelligence Autumn Agent. Partial Observability. Markov Decision Process (MDP) 10/31/2012

Course Overview. Summary. Outline

Probability, Markov models and HMMs. Vibhav Gogate The University of Texas at Dallas

Consider an experiment that may have different outcomes. We are interested to know what is the probability of a particular set of outcomes.

Probability and Uncertainty. Bayesian Networks

CS 188: Artificial Intelligence Spring Announcements

Uncertainty in the World. Representing Uncertainty. Uncertainty in the World and our Models. Uncertainty

Probability Review Lecturer: Ji Liu Thank Jerry Zhu for sharing his slides

Transcription:

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 me there on time? Problems: 1. partial observability (road state, other drivers' plans, etc.) 2. noisy sensors (traffic reports) 3. uncertainty in action outcomes (flat tire, etc.) 4. immense complexity of modeling and predicting traffic Hence a purely logical approach either 1. risks falsehood: A 25 will get me there on time, or 2. leads to conclusions that are too weak for decision making: A 25 will get me there on time if there's no accident on the bridge and it doesn't rain and my tires remain intact etc etc. (A 1440 might reasonably be said to get me there on time but I'd have to stay overnight in the airport ) But A decision must be made! No intelligent system can afford to consider all eventualities, wait until all the data is in and complete, or try all possibilities to see what happens 2

Quick Overview of Reasoning Systems Logic:True or false, nothing in between. No uncertainty Non-monotonic logic:true or false, but new information can change it. Probability:Degree of belief, but in the end it s either true or false Fuzzy:Degree of belief, allows overlapping of true and false states Logic: All birds fly Examples Non-monotonic Tweety flies, since he s a bird and no evidence he doesn t fly 3

Probability Probabilistic assertions summarize effects of laziness: failure to enumerate exceptions, qualifications, etc. ignorance: lack of relevant facts, initial conditions, etc. Subjective probability: Probabilities relate propositions to agent's own state of knowledge e.g., P(A 25 no reported accidents) = 0.06 These are not assertions about the world Probabilities of propositions change with new evidence: e.g., P(A 25 no reported accidents, 5 a.m.) = 0.15 Making decisions under uncertainty Suppose I believe the following: P(A 25 gets me there on time ) = 0.04 P(A 90 gets me there on time ) = 0.70 P(A 120 gets me there on time ) = 0.95 P(A 1440 gets me there on time ) = 0.9999 Which action to choose? Depends on my preferences for missing flight vs. time spent waiting, etc. Utility theory is used to represent and infer preferences Decision theory = probability theory + utility theory 4

Syntax Basic element: random variable Similar to propositional logic: possible worlds defined by assignment of values to random variables. Boolean random variables e.g., Cavity (do I have a cavity?) Discrete random variables e.g., Weather is one of <sunny,rainy,cloudy,snow> Domain values must be exhaustive and mutually exclusive Elementary proposition constructed by assignment of a value to a random variable: e.g., Weather = sunny, Cavity = false (abbreviated as cavity) Complex propositions formed from elementary propositions and standard logical connectives e.g., Weather = sunny Cavity = false Syntax Atomic event: A complete specification of the state of the world about which the agent is uncertain E.g., if the world consists of only two Boolean variables Cavity and Toothache, then there are 4 distinct atomic events: Cavity = false Toothache = false Cavity = false Toothache = true Cavity = true Toothache = false Cavity = true Toothache = true Atomic events are mutually exclusive and exhaustive 5

Axioms of probability For any propositions A, B 0 P(A) 1 P(true) = 1 and P(false) = 0 P(A B) = P(A) + P(B) - P(A B) Prior probability Prior or unconditional probabilities of propositions e.g., P(Cavity = true) = 0.1 and P(Weather = sunny) = 0.72 correspond to belief prior to arrival of any (new) evidence Probability distribution gives values for all possible assignments: P(Weather) = <0.72,0.1,0.08,0.1> (normalized, i.e., sums to 1) Joint probability distribution for a set of random variables gives the probability of every atomic event on those random variables P(Weather,Cavity) = a 4 2 matrix of values: Weather = sunny rainy cloudy snow Cavity = true 0.144 0.02 0.016 0.02 Cavity = false 0.576 0.08 0.064 0.08 Every question about a domain can be answered by the joint distribution 6

How could we estimate the full joint distribution? Parameter estimates are provided by expert knowledge, statistics on data samples, or a combination of both. Suppose you have 20 variables. Expert knowledge: P(X1=0,X2=0,,X13=1,,X20=0) vs. P(X1=0,X2=0,,X13=0,,X20=0)? Data Samples: practically speaking, we don t typically have enough data Conditional probability Conditional or posterior probabilities e.g., P(cavity toothache) = 0.8 i.e., given that toothache is all I know (Notation for conditional distributions: P(Cavity Toothache) = 2-element vector of 2-element vectors) If we know more, e.g., cavity is also given, then we have P(cavity toothache,cavity) = 1 New evidence may be irrelevant, allowing simplification, e.g., P(cavity toothache, sunny) = P(cavity toothache) = 0.8 This kind of inference, sanctioned by domain knowledge, is crucial 7

More on Conditional Probabilities P (CarWontStart NoGas) This predicts a symptom based on an underlying cause These can be generated empirically (Drain N gastanks, see how many cars start) or using expert knowledge P (NoGas CarWontStart) Diagnosis. We have a symptom and want to predict the cause. This is what the system wants to determine Conditional probability Definition of conditional probability: P(a b) = P(a b) / P(b) if P(b) > 0 Product rule gives an alternative formulation: P(a b) = P(a b) P(b) = P(b a) P(a) A general version holds for whole distributions, e.g., P(Weather,Cavity) = P(Weather Cavity) P(Cavity) (View as a set of 4 2 equations, not matrix mult.) Chain rule is derived by successive application of product rule: P(X 1,,X n ) = P(X 1,...,X n-1 ) P(X n X 1,...,X n-1 ) = P(X 1,...,X n-2 ) P(X n-1 X 1,...,X n-2 ) P(X n X 1,...,X n-1 ) = = π i= 1^n P(X i X 1,,X i-1 ) 8

Inference by enumeration Start with the joint probability distribution: For any proposition φ, sum the atomic events where it is true: P(φ) = Σ ω:ω φ P(ω) Inference by enumeration Start with the joint probability distribution: For any proposition φ, sum the atomic events where it is true: P(φ) = Σ ω:ω φ P(ω) P(toothache) = 0.108 + 0.012 + 0.016 + 0.064 = 0.2 9

Inference by enumeration Start with the joint probability distribution: Can also compute conditional probabilities: P( cavity toothache) = P( cavity toothache) P(toothache) = 0.016+0.064 0.108 + 0.012 + 0.016 + 0.064 = 0.4 Normalization Denominator can be viewed as a normalization constant α P(Cavity toothache) = α, P(Cavity,toothache) = α, [P(Cavity,toothache,catch) + P(Cavity,toothache, catch)] = α, [<0.108,0.016> + <0.012,0.064>] = α, <0.12,0.08> = <0.6,0.4> 10

Independence A and B are independent iff P(A B) = P(A) or P(B A) = P(B) or P(A, B) = P(A) P(B) P(Toothache, Catch, Cavity, Weather) = P(Toothache, Catch, Cavity) P(Weather) 32 entries reduced to 12; for n independent biased coins, O(2 n ) O(n) Absolute independence powerful but rare Dentistry is a large field with hundreds of variables, none of which are independent. What to do? Conditional independence If I have a cavity, the probability that the probe catches in it doesn't depend on whether I have a toothache: (1) P(catch toothache, cavity) = P(catch cavity) The same independence holds if I haven't got a cavity: (2) P(catch toothache, cavity) = P(catch cavity) Catch is conditionally independent of Toothache given Cavity: P(Catch Toothache,Cavity) = P(Catch Cavity) Equivalent statements: P(Toothache Catch, Cavity) = P(Toothache Cavity) P(Toothache, Catch Cavity) = P(Toothache Cavity) P(Catch Cavity) 11

Conditional independence contd. Write out full joint distribution using chain rule: P(Toothache, Catch, Cavity) = P(Toothache Catch, Cavity) P(Catch, Cavity) = P(Toothache Catch, Cavity) P(Catch Cavity) P(Cavity) = P(Toothache Cavity) P(Catch Cavity) P(Cavity) In most cases, the use of conditional independence reduces the size of the representation of the joint distribution from exponential in n to linear in n. Conditional independence is our most basic and robust form of knowledge about uncertain environments. Bayes' Rule Product rule P(a b) = P(a b) P(b) = P(b a) P(a) Bayes' rule: P(a b) = P(b a) P(a) / P(b) or in distribution form P(Y X) = P(X Y) P(Y) / P(X) = αp(x Y) P(Y) Useful for assessing diagnostic probability from causal probability: P(Cause Effect) = P(Effect Cause) P(Cause) / P(Effect) E.g., let M be meningitis, S be stiff neck: P(m s) = P(s m) P(m) / P(s) = 0.8 0.0001 / 0.1 = 0.0008 Note: posterior probability of meningitis still very small! 12

Bayes' Rule and conditional independence P(Cavity toothache catch) = αp(toothache catch Cavity) P(Cavity) = αp(toothache Cavity) P(catch Cavity) P(Cavity) This is an example of a naïve Bayes model: P(Cause,Effect 1,,Effect n ) = P(Cause) π i P(Effect i Cause) Total number of parameters is linear in n All features/symptoms/effects conditionally independent of each other given the class/diagnosis/cause Summary Probability is a rigorous formalism for uncertain knowledge Joint probability distribution specifies probability of every atomic event Queries can be answered by summing over atomic events For nontrivial domains, we must find a way to reduce the joint size Independence and conditional independence provide the tools 13