PROBABILITY. Uncertainty  Let action A t = leave for airport t minutes before flight from Logan Airport  Will A t get me there on time ? Problems :

Slides:



Advertisements
Similar presentations
Probability. Uncertainty Let action A t = leave for airport t minutes before flight –Will A t get me there on time? Problems: Partial observability (road.
Advertisements

Decision Making Under Uncertainty CSE 495 Resources: –Russell and Norwick’s book.
Probability: Review The state of the world is described using random variables Probabilities are defined over events –Sets of world states characterized.
This lecture: Read Chapter 13 Next Lecture: Read Chapter
Where are we in CS 440? Now leaving: sequential, deterministic reasoning Entering: probabilistic reasoning and machine learning.
CPSC 7373: Artificial Intelligence Lecture 4: Uncertainty
Uncertain Reasoning CPSC 315 – Programming Studio Spring 2009 Project 2, Lecture 6.
CPSC 422 Review Of Probability Theory.
Probability.
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.
CS 416 Artificial Intelligence Lecture 13 Uncertainty Chapter 13 Lecture 13 Uncertainty Chapter 13.
KI2 - 2 Kunstmatige Intelligentie / RuG Probabilities Revisited AIMA, Chapter 13.
1 Bayesian Reasoning Chapter 13 CMSC 471 Adapted from slides by Tim Finin and Marie desJardins.
University College Cork (Ireland) Department of Civil and Environmental Engineering Course: Engineering Artificial Intelligence Dr. Radu Marinescu Lecture.
Uncertainty Management for Intelligent Systems : for SEP502 June 2006 김 진형 KAIST
Representing Uncertainty CSE 473. © Daniel S. Weld 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one.
Ai in game programming it university of copenhagen Welcome to... the Crash Course Probability Theory Marco Loog.
Probability and Information Copyright, 1996 © Dale Carnegie & Associates, Inc. A brief review (Chapter 13)
Uncertainty Logical approach problem: we do not always know complete truth about the environment Example: Leave(t) = leave for airport t minutes before.
Uncertainty Chapter 13.
Uncertainty Chapter 13.
Methods in Computational Linguistics II Queens College Lecture 2: Counting Things.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Feb 28 and March 13-15, 2012.
Handling Uncertainty. Uncertain knowledge Typical example: Diagnosis. Consider:  x Symptom(x, Toothache)  Disease(x, Cavity). The problem is that this.
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.
An Introduction to Artificial Intelligence Chapter 13 & : Uncertainty & Bayesian Networks Ramin Halavati
Probability and Uncertainty Warm-up and Review for Bayesian Networks and Machine Learning This lecture: Read Chapter 13 Next Lecture: Read Chapter
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes March 13, 2012.
Uncertainty Chapter 13. Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule.
1 Chapter 13 Uncertainty. 2 Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule.
Uncertainty Chapter 13. Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule.
Probability and naïve Bayes Classifier Louis Oliphant cs540 section 2 Fall 2005.
An Introduction to Artificial Intelligence Chapter 13 & : Uncertainty & Bayesian Networks Ramin Halavati
Uncertainty Uncertain Knowledge Probability Review Bayes’ Theorem Summary.
Chapter 13 February 19, Acting Under Uncertainty Rational Decision – Depends on the relative importance of the goals and the likelihood of.
Uncertainty. Assumptions Inherent in Deductive Logic-based Systems All the assertions we wish to make and use are universally true. Observations of the.
Probability and Information Copyright, 1996 © Dale Carnegie & Associates, Inc. A brief review.
Marginalization & Conditioning Marginalization (summing out): for any sets of variables Y and Z: Conditioning(variant of marginalization):
Uncertainty Chapter 13. Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule.
Uncertainty Chapter 13. Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule.
2101INT – Principles of Intelligent Systems Lecture 9.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 13 –Reasoning with Uncertainty Tuesday –AIMA, Ch. 14.
Web-Mining Agents Data Mining Prof. Dr. Ralf Möller Universität zu Lübeck Institut für Informationssysteme Karsten Martiny (Übungen)
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.
Uncertainty 1. 2 ♦ Uncertainty ♦ Probability ♦ Syntax and Semantics ♦ Inference ♦ Independence and Bayes’ Rule Outline.
CSE 473 Uncertainty. © UW CSE AI Faculty 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one has stood.
Uncertainty Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Outline [AIMA Ch 13] 1 Uncertainty Probability Syntax and Semantics Inference Independence and Bayes' Rule.
Uncertainty & Probability CIS 391 – Introduction to Artificial Intelligence AIMA, Chapter 13 Many slides adapted from CMSC 421 (U. Maryland) by Bonnie.
AIMA 3e Chapter 13: Quantifying Uncertainty
Introduction to Artificial Intelligence
ECE 448 Lecture 12: Probability
Where are we in CS 440? Now leaving: sequential, deterministic reasoning Entering: probabilistic reasoning and machine learning.
Uncertainty Chapter 13.
Uncertainty Chapter 13.
Where are we in CS 440? Now leaving: sequential, deterministic reasoning Entering: probabilistic reasoning and machine learning.
Uncertainty.
Probability and Information
Uncertainty in Environments
Representing Uncertainty
Introduction to Artificial Intelligence
Probability and Information
CS 188: Artificial Intelligence Fall 2008
CS 188: Artificial Intelligence Fall 2007
CS 188: Artificial Intelligence Fall 2007
Uncertainty Logical approach problem: we do not always know complete truth about the environment Example: Leave(t) = leave for airport t minutes before.
Uncertainty Chapter 13.
Uncertainty Chapter 13.
Uncertainty Chapter 13.
Uncertainty Chapter 13.
Presentation transcript:

PROBABILITY

Uncertainty  Let action A t = leave for airport t minutes before flight from Logan Airport  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.

Uncertainty  Let action A t = leave for airport t minutes before flight from Logan Airport  Will A t get me there on time ? A purely logical approach either : 1) risks falsehood : “ A 120 will get me there on time,” or 2) leads to conclusions that are too weak for decision making : “ A 120 will get me there on time if there ' s no accident on I -90 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 … )

Methods for handling uncertainty  Default logic :  Assume my car does not have a flat tire  Assume A 120 works unless contradicted by evidence  Issues : What assumptions are reasonable ? How to handle contradiction ?  Probability  Model agent ' s degree of belief  Given the available evidence, A 120 will get me there on time with probability 0.4

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 120 | no reported accidents ) = 0.6  These are not assertions about the world, but represent belief about the whether the assertion is true.  Probabilities of propositions change with new evidence :  e. g., P ( A 120 | no reported accidents, 5 a. m.) = 0.15

Making decisions under uncertainty  Suppose I believe the following : P ( A 135 gets me there on time |...) = 0.04 P ( A 180 gets me there on time |...) = 0.70 P ( A 240 gets me there on time |...) = 0.95 P ( A 1440 gets me there on time |...) =  Which action to choose ?  Depends on my preferences for missing flight vs. airport cuisine, etc.  Utility theory is used to represent and infer preferences  Decision theory = utility theory + probability theory

Quick Question  You go to the doctor and are tested for a disease. The test is 98% accurate if you have the disease. 3.6% of the population has the disease while 4% of the population tests positive.  How likely is it you have the disease ?

Syntax  Basic element : random variable  Boolean random variables  e. g., Cavity ( do I have a cavity ?)  Discrete random variables  e. g., Weather is one of  Continuous random variables  represented by probability density functions ( PDFs ), valued [0,1]

Syntax  Elementary propositions constructed by assignment of a value to a random variable  e. g., Weather = sunny, Cavity = false  ( abbreviated as sunny or  cavity )  Complex propositions formed from elementary propositions and standard logical connectives  e. g., ( Weather = sunny  Cavity = false )  e. g., ( sunny   cavity )

Syntax  Atomic event :  A complete specification of the state of the world.  A complete assignment of values to variables.  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

Axioms of probability ( Kolmogorov ’ s Axioms )  For any propositions A, B 1. 0 ≤ P ( A ) ≤ 1 2. P ( true ) = 1 and P ( false ) = 0 3. P ( A  B ) = P ( A ) + P ( B ) - P ( A  B )

Priors  Prior or unconditional probabilities of propositions correspond to belief prior to arrival of any ( new ) evidence. e. g., P ( cavity ) = P ( Cavity = true )= 0.1 P ( Weather = sunny ) = 0.72 P ( cavity  Weather = sunny ) = 0.072

Distributions  Probability distribution gives probabilities of all possible values of the random variable.  Weather is one of  P ( Weather ) =  ( Normalized, i. e., sums to 1. Also note the bold font..)

Joint Probability The entire table sums to 1.

Inference by Enumeration

Conditional Probability

Inference by Enumeration

Conditional Probability

Absolute Independence

 Absolute independence powerful but rare  For n independent biased coins, O (2 n ) →O ( n ) 2*2*2*4=32 entries 2*2*2+4=12 entries

Conditional independence  If I have a cavity, the probability that the probe catches in it doesn ' t depend on whether I have a toothache :  P ( catch | toothache, cavity ) = P ( catch | cavity )  The same independence holds if I haven ' t got a cavity :  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 )

Bayes ' Rule

Much easier to calculate/estimate than the part on the left!

Bayes Rule : Example Note: probability of meningitis still very small!

Bayes ' Rule and conditional independence

Naïve Bayes Model

Summary  Probability is a formalism for uncertain knowledge  Basic probability statements include prior probabilities and conditional probabilities  The full joint probability distribution specifies probability of each complete assignment of values to variables.  Usually too large to create and use in its explicit form.  Absolute independence between subsets of random variables allows the full joint distribution to be factored into smaller joint distributions.  Absolute independent rarely occurs in practice.  Bayes ’ rule allows unknown probabilities to be computed from known conditional probabilities.  Applying Bayes ’ rule with many variables runs into the same scaling problem as above.  Conditional independence, brought about by direct causal relationships in the domain, may allow the full joint distribution to be factored into smaller, conditional distributions.  Naïve Bayes model assumes conditional independence of all effect variables.