Artificial Intelligence Uncertainty

Similar documents
Artificial Intelligence

Uncertainty. Chapter 13

Uncertainty. Outline

Uncertainty. Chapter 13

Uncertainty. Chapter 13, Sections 1 6

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

Probabilistic Reasoning

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

Pengju XJTU 2016

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

Uncertain Knowledge and Reasoning

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

Uncertainty. Chapter 13. Chapter 13 1

Web-Mining Agents Data Mining

Chapter 13 Quantifying Uncertainty

Probability theory: elements

Pengju

CS 561: Artificial Intelligence

Quantifying uncertainty & Bayesian networks

Probabilistic Robotics

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.

Basic Probability and Decisions

Fusion in simple models

Uncertainty. CmpE 540 Principles of Artificial Intelligence Pınar Yolum Uncertainty. Sources of Uncertainty

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

Uncertainty and Bayesian Networks

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

Probabilistic Reasoning

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

CS 5100: Founda.ons of Ar.ficial Intelligence

CS 188: Artificial Intelligence Fall 2009

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

ARTIFICIAL INTELLIGENCE. Uncertainty: probabilistic reasoning

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

Reasoning with Uncertainty. Chapter 13

Uncertainty. Russell & Norvig Chapter 13.

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

Probabilistic representation and reasoning

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

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

Probabilistic Reasoning. Kee-Eung Kim KAIST Computer Science

CS 188: Artificial Intelligence. Our Status in CS188

Where are we in CS 440?

CSE 473: Artificial Intelligence

Where are we in CS 440?

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

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

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

13.4 INDEPENDENCE. 494 Chapter 13. Quantifying Uncertainty

Uncertainty (Chapter 13, Russell & Norvig)

Probabilistic representation and reasoning

Cartesian-product sample spaces and independence

Probability and Decision Theory

PROBABILISTIC REASONING Outline

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

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

Lecture 10: Introduction to reasoning under uncertainty. Uncertainty

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

Probabilistic Reasoning Systems

Probabilistic Reasoning. (Mostly using Bayesian Networks)

Probabilistic Models

Artificial Intelligence CS 6364

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

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

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

CS 188: Artificial Intelligence Fall 2009

CS 188: Artificial Intelligence Fall 2011

Artificial Intelligence Programming Probability

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

CS 5522: Artificial Intelligence II

CS 188: Artificial Intelligence Spring Announcements

Graphical Models - Part I

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 Robotics. Slides from Autonomous Robots (Siegwart and Nourbaksh), Chapter 5 Probabilistic Robotics (S. Thurn et al.

Reasoning Under Uncertainty

CS 343: Artificial Intelligence

PROBABILITY. Inference: constraint propagation

CS 188: Artificial Intelligence Fall 2008

Reasoning Under Uncertainty

Our Status in CSE 5522

CS 687 Jana Kosecka. Uncertainty, Bayesian Networks Chapter 13, Russell and Norvig Chapter 14,

Bayesian networks (1) Lirong Xia

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

CS 343: Artificial Intelligence

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

Computer Science CPSC 322. Lecture 18 Marginalization, Conditioning

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

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

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

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

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

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

CSE 473: Artificial Intelligence Autumn 2011

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

Course Overview. Summary. Outline

CS 188: Artificial Intelligence Spring Announcements

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

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

Probability. CS 3793/5233 Artificial Intelligence Probability 1

Transcription:

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 state, other drivers' plans, etc.) noisy sensors (traffic reports) uncertainty in action outcomes (flat tire, etc.) immense complexity of modeling and predicting traffic

Probability Probabilistic assertions summarize effects of laziness: failure to enumerate exceptions, qualifications, etc. ignorance: lack of relevant facts, initial conditions, etc. Subjective (Bayesian) probability: Probabilities relate events 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 events 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

Basic probability theory Probability theory has to do with experiments that have a set of distinct outcomes/values E.g. toss a coin with outcome being head or tail The set of all outcomes of an experiment is called the domain (outcome space, sample space, ) Atomic domain values must be exhaustive and mutually exclusive In the case of a finite domain, every subset of the outcome space is called an event e.g., Weather = (sunny rainy) A subset containing exactly one outcome is called an elementary (atomic) event e.g., Weather = sunny

Random variable A random variable is a function on a domain: it assigns a unique value to each outcome in the domain A Boolean random variable is one whose domain is {True, False}. e.g., Cavity (do I have a cavity?) A discrete random variable is one whose domain is finite or countably infinite. e.g., Weather is one of <sunny,rainy,cloudy,snow> A continuous random variable is one whose domain is a real valued interval. e.g., Temperature of the classroom

Axioms of probability A random variable has an associated probability distribution and frequently also a probability density function. P(Weather) = <0.72,0.1,0.08,0.1> For any events A, B Ω (domain space) 0 P(A), P(B) 1 P(Ω) = 1 If A B =, P (A U B) = P(A) + P(B) Consequences: P(A B) = P(A) + P(B) - P(A B)

Prior probability Prior or unconditional probabilities of events 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 (multivariate 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!

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

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) Chain rule is derived by successive application of product rule: P(Weather,Cavity,Toothache) =

Inference by enumeration Start with the joint probability distribution: For any event φ, sum the atomic events where φ is true: P(φ) = Σ ω:ω φ P(ω)

Inference by enumeration Start with the joint probability distribution: For any event φ, sum the atomic events where it is true: P(φ) = Σ ω:ω φ P(ω) P(toothache) =

Inference by enumeration Start with the joint probability distribution: For any event φ, sum the atomic events where it is true: P(φ) = Σ ω:ω φ P(ω) P(cavity toothache) =

Inference by enumeration Start with the joint probability distribution: Can also compute conditional probabilities: P( cavity toothache) =

Normalization Denominator can be viewed as a normalization constant α P(Cavity toothache) =

A general inference problem Typically, we are interested in the posterior joint distribution of the query variables Y given specific values e for the evidence variables E Let the hidden variables be H = X - Y - E General idea: compute distribution on query variable by fixing evidence variables and summing over hidden variables Then the required summation of joint entries is done by summing out the hidden variables (marginalization / total probability rule): P(Y E = e) = αp(y,e = e) = ασ h P(Y,E= e, H = h) P(Cavity toothache)=

Complexity of inference The terms in the summation are joint entries because Y, E and H together exhaust the set of random variables Obvious problems: 1. Worst-case time complexity O(d n ) where d is the largest arity 2. Space complexity O(d n ) to store the joint distribution 3. How to find the numbers for O(d n ) entries?

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 P(Toothache, Cavity, Catch) has 2 3 1 = 7 independent entries 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)

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) I.e., 2 + 2 + 1 = 5 independent numbers 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!

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

Breast Cancer A screening test has a 90% chance of registering breast cancer if it exists, as well as a 20% chance of falsely registering cancer when it does not exist. About one in one hundred women requesting the screening test end up diagnosed with breast cancer. Ms. X has just been told that her screening test was positive. What is the probability that she has breast cancer? What is the probability that Ms. X has breast cancer? 1. About 1%. 2. About 90%. 3. About 85%. 4. About 80%. 5. About 4%.