46 1 introduction
play

46.1 Introduction chapter overview: 46. Introduction and - PowerPoint PPT Presentation

Apr 14, 2023 •122 likes •213 views

Foundations of Artificial Intelligence May 24, 2017 46. Uncertainty: Introduction and Quantification Foundations of Artificial Intelligence 46.1 Introduction 46. Uncertainty: Introduction and Quantification 46.2 Probability Theory Malte

  1. Foundations of Artificial Intelligence May 24, 2017 — 46. Uncertainty: Introduction and Quantification Foundations of Artificial Intelligence 46.1 Introduction 46. Uncertainty: Introduction and Quantification 46.2 Probability Theory Malte Helmert and Gabriele R¨ oger 46.3 Inference from Full Joint Distributions University of Basel 46.4 Bayes’ Rule May 24, 2017 46.5 Summary M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 1 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 2 / 30 46. Uncertainty: Introduction and Quantification Introduction Uncertainty: Overview 46.1 Introduction chapter overview: ◮ 46. Introduction and Quantification ◮ 47. Representation of Uncertainty M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 3 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 4 / 30

  2. 46. Uncertainty: Introduction and Quantification Introduction 46. Uncertainty: Introduction and Quantification Introduction Motivation Example Have to get from Aarau to Basel to attend a lecture at 9:00. Uncertainty in our knowledge of the world caused by ◮ partial observability, Different options: ◮ unreliable information (e.g. from sensors), ◮ 7:36–8:12 IR2256 to Basel ◮ nondeterminism, ◮ 7:40–7:53 S 23 to Olten, 8:05–9:29 IC 1058 to Basel ◮ laziness to collect more information, ◮ 7:40–7:57 IR 2160 to Olten, 8:05–9:29 IC 1058 to Basel ◮ . . . ◮ 8:13–8:24 RE 4760 to Olten, 8:30–8:55 IR 2310 to Basel Yet we have to act! ◮ leave by car at 8:00 and drive approx. 45 minutes ◮ . . . Option 1: Try to find solution that works in all possible worlds Option 1: � often there is no such solution Different utilities (travel time, cost, slack time, convenience, . . . ) Option 2: Quantify uncertainty (degree of belief) and and different probabilities of actually achieving the goal (traffic Option 2: maximize expected utility jams, accidents, broken trains, missed connections, . . . ). M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 5 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 6 / 30 46. Uncertainty: Introduction and Quantification Introduction 46. Uncertainty: Introduction and Quantification Probability Theory Uncertainty and Logical Rules Example: diagnosing a dental patient’s toothache ◮ toothache → cavity Wrong: not all patients with toothache have a cavity. 46.2 Probability Theory ◮ toothache → cavity ∨ gumproblem ∨ abscess ∨ . . . Almost unlimited list of possible problems. ◮ cavity → pain Wrong: not all cavities cause pain. � Logic approach not suitable for domain like medical diagnosis. Instead: Use probabilities to express degree of belief, e.g. there is a Instead: 80% chance that the patient with toothache has a cavity. M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 7 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 8 / 30

  3. 46. Uncertainty: Introduction and Quantification Probability Theory 46. Uncertainty: Introduction and Quantification Probability Theory Probability Model Factored Representation of Possible Worlds Sample space Ω is countable set of possible worlds Definition ◮ Possible worlds defined in terms of random variables. A probability model associates a numerical probability P ( ω ) ◮ variables Die 1 and Die 2 with domain { 1 , . . . , 6 } with each possible world such that for the values of two dice. ◮ Describe sets of possible worlds by logical formulas (called 0 ≤ P ( ω ) ≤ 1 for every ω ∈ Ω and propositions) over random variables. ◮ Die 1 = 1 � P ( ω ) = 1 . ◮ (Die 1 = 2 ∨ Die 1 = 4 ∨ Die 1 = 6) ∧ (Die 2 = 2 ∨ Die 2 = 4 ∨ Die 2 = 6) ω ∈ Ω ◮ also use informal descriptions if meaning is clear, For Ω ′ ⊆ Ω the probability of Ω ′ is defined as e.g. “both values even” � P (Ω ′ ) = P ( ω ) . ω ∈ Ω ′ M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 9 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 10 / 30 46. Uncertainty: Introduction and Quantification Probability Theory 46. Uncertainty: Introduction and Quantification Probability Theory Probability Model: Example Relationships Two dice ◮ Ω = {� 1 , 1 � , . . . , � 1 , 6 � , . . . , � 6 , 1 � , . . . , � 6 , 6 �} The following rules can be derived from the definition of a probability model: ◮ P ( � x , y � ) = 1 / 36 for all x , y ∈ { 1 , . . . , 6 } (fair dice) ◮ P ( a ∨ b ) = P ( a ) + P ( b ) − P ( a ∧ b ) ◮ P ( {� 1 , 1 � , � 1 , 2 � , � 1 , 3 � , � 1 , 4 � , � 1 , 5 � , � 1 , 6 �} ) = 6 / 36 = 1 / 6 ◮ P ( ¬ a ) = 1 − P ( a ) ◮ Propositions to describe sets of possible worlds ◮ P (Die 1 = 1) = 1 / 6 ◮ P (both values even) = P ( {� 2 , 2 � , � 2 , 4 � , � 2 , 6 � , � 4 , 2 � , � 4 , 4 � , � 4 , 6 � , � 4 , 2 � , � 4 , 4 � , � 4 , 6 �} ) = 9 / 36 = 1 / 4 ◮ P (Total ≥ 11) = P ( {� 6 , 5 � , � 5 , 6 � , � 6 , 6 �} ) = 3 / 36 = 1 / 12 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 11 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 12 / 30

  4. 46. Uncertainty: Introduction and Quantification Probability Theory 46. Uncertainty: Introduction and Quantification Probability Theory Probability Distribution Joint Probability Distribution Convention: names of random variables begin with uppercase Convention: letters and names of values with lowercase letters. For multiple random variables, the joint probability distribution defines values for all possible combinations of the values. Random variable Weather with P ( Weather , Headache ) P ( Weather = sunny) = 0 . 6 headache ¬ headache P ( Weather = rain) = 0 . 1 sunny P ( sunny ∧ headache ) P ( sunny ∧ ¬ headache ) P ( Weather = cloudy) = 0 . 29 rain P ( Weather = snow) = 0 . 01 cloudy . . . Abbreviated: P ( Weather ) = � 0 . 6 , 0 . 1 , 0 . 29 , 0 . 01 � snow A probability distribution P is the vector of probabilities for the (ordered) domain of a random variable. M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 13 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 14 / 30 46. Uncertainty: Introduction and Quantification Probability Theory 46. Uncertainty: Introduction and Quantification Probability Theory Conditional Probability: Intuition Conditional Probability P ( x ) denotes the unconditional or prior probability that x will Definition appear in the absence of any other information, e.g. The conditional probability for proposition a given proposition b with P ( b ) > 0 is defined as P ( cavity ) = 0 . 6 . P ( a | b ) = P ( a ∧ b ) . P ( b ) The probability of a cavity increases if we know that a patient has toothache. Example: P ( both values even | Die 2 = 4) =? P ( cavity | toothache ) = 0 . 8 Product Rule: P ( a ∧ b ) = P ( a | b ) P ( b ) � conditional probability (or posterior probability) M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 15 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 16 / 30

  5. 46. Uncertainty: Introduction and Quantification Probability Theory 46. Uncertainty: Introduction and Quantification Inference from Full Joint Distributions Independence 46.3 Inference from Full Joint ◮ X and Y are independent if P ( X ∧ Y ) = P ( X ) P ( Y ). Distributions ◮ For independent variables X and Y with P ( Y ) > 0 it holds that P ( X | Y ) = P ( X ). M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 17 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 18 / 30 46. Uncertainty: Introduction and Quantification Inference from Full Joint Distributions 46. Uncertainty: Introduction and Quantification Inference from Full Joint Distributions Full Joint Distribution Marginalization full joint distribution: joint distribution for all random variables. For any sets of variables Y and Z : toothache ¬ toothache � P ( Y ) = P ( Y , z ) , catch ¬ catch catch ¬ catch z ∈ Z cavity 0 . 108 0 . 012 0 . 072 0 . 008 ¬ cavity 0 . 016 0 . 064 0 . 144 0 . 576 where � z ∈ Z means to sum over all possible combinations of values of the variables in Z . Sum of entries is always 1. (Why?) P ( Cavity ) = � blackboard Sufficient for calculating the probability of any proposition. M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 19 / 30 M. Helmert, G. R¨ oger (University of Basel) Foundations of Artificial Intelligence May 24, 2017 20 / 30

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

TRAINING COURSE ON SOCIAL PROTECTION & FORMALIZATION TRINIDAD AND TOBAGO MARCH 15, 2017 INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION Design of the NIS Assistance from the

547 views • 23 slides
INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

Patterns of variation in the expression of case and agreement Andrs Brny Leiden University Centre for Linguistics 9 November 2019, BaSIS Workshop a.barany@hum.leidenuniv.nl INTRODUCTION Introduction 2/42 INTRODUCTION

1.37k views • 42 slides
Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures Definition and concepts Process and product properties Principles SE Approaches Motivation Software and the economy The economies of

1.03k views • 49 slides
Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1 https://www.cdc.gov/std/stats17/infographic.htm Introduction Epidemiology in Western Colorado CPHE Surveillance Data Report, May 2018 Chlamydia Epidemiology in Western

977 views • 39 slides
DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every meeting (2) Some ideas of diagrams for section 7.1 (Introduction) of TP. Giles Barr 25 Jan 2018, Pembroke College On DUNE, the reality is there is a

474 views • 10 slides
INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

ADVANCED COMPUTER SECURITY INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT IS SECURITY? A systems security policies describe What the system is supposed to do Store and provide access

479 views • 16 slides
Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout World Wide

387 views • 14 slides
14 Introduction Introduction Bad guys can put malware into Example: hosts

14 Introduction Introduction Bad guys can put malware into Example: hosts

Introduction Introduction source Encapsulation ISO/OSI reference model message M application segment H t H t M transport network datagram H n H n H t M presentation: allow applications to frame link H l H n H t M interpret

583 views • 4 slides
Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout

322 views • 8 slides
Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Introduction Zynq Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL Processing System Processor Peripherals Data Buses AXI Bus Conclusion BTE5380 - Embedded Systems Octobre 2014 Andreas Habegger

1.81k views • 30 slides
2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04 Project References S E 5 PART.1 SMILE5 Introduction M I L Introduction STORION-SMILE5 Residential Energy Storage System Inverter 5kW Output Input

1.06k views • 25 slides
Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an application server? Why use an application server? Course introduction Services provided by CICS How CICS applications are defined Scaling CICS to meet

1.84k views • 146 slides
Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic building blocks Node Links (relationship between nodes) Spatial information Network data

584 views • 9 slides
Introduction Introduction (1) Main argument of the paper: universities are not only

Introduction Introduction (1) Main argument of the paper: universities are not only

Le jugement des pairs comme outil de management des universits Peer-review as a management tool Christine Musselin (CSO, Sciences Po et CNRS) Avril 2013, Lirrsistible ascension du capitalisme acadmique Introduction Introduction (1)

590 views • 28 slides
Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Moreno Baricevic Gilberto Daz Axel Kohlmeyer Stefano Cozzini ULA ICTP CNR-IOM DEMOCRITOS Merida, VENEZUELA Trieste, ITALY Trieste, ITALY Introduction Introduction to storage and to storage and filesystems filesystems Introduction

1.19k views • 51 slides
JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of the brand new JA-100 alarm system Visions Basic architecture System components Setting Help us with final validations You are the FIRST ones

1.69k views • 111 slides
219323 Probability and Statistics for Software and Knowledge Engineers Lecture 3: Random

219323 Probability and Statistics for Software and Knowledge Engineers Lecture 3: Random

219323 Probability and Statistics for Software and Knowledge Engineers Lecture 3: Random Variables II Monchai Sopitkamon, Ph.D. Outline Discrete Random Variables (2.1) Continuous Random Variables (2.2) Expectation of a Random

876 views • 31 slides
CS 630 Basic Probability and Information Theory Tim Campbell 21 January 2003 Probability

CS 630 Basic Probability and Information Theory Tim Campbell 21 January 2003 Probability

CS 630 Basic Probability and Information Theory Tim Campbell 21 January 2003 Probability Theory Probability Theory is the study of how best to predict outcomes of events. An experiment (or trial or event) is a pro- cess by which

379 views • 22 slides
Introduction to Machine Learning ML-Basics: Data Learning goals 10 Understand structure of

Introduction to Machine Learning ML-Basics: Data Learning goals 10 Understand structure of

Introduction to Machine Learning ML-Basics: Data Learning goals 10 Understand structure of tabular data in ML 5 Understand difference between 0 y target and features 5 Understand difference between labeled and unlabeled data 10

670 views • 9 slides
Language models Chapter 3 in Martin/Jurafsky Probabilistic Language Models Goal: assign a

Language models Chapter 3 in Martin/Jurafsky Probabilistic Language Models Goal: assign a

10/17/19 Language models Chapter 3 in Martin/Jurafsky Probabilistic Language Models Goal: assign a probability to a sentence Machine Translation: Why? P(hi high h winds tonite) > P(la large winds tonite) Spell Correction

321 views • 11 slides
Natural Language Processing CSCI 4152/6509 Lecture 14 Probabilistic Modeling Instructor:

Natural Language Processing CSCI 4152/6509 Lecture 14 Probabilistic Modeling Instructor:

Natural Language Processing CSCI 4152/6509 Lecture 14 Probabilistic Modeling Instructor: Vlado Keselj Time and date: 09:3510:25, 6-Feb-2020 Location: Dunn 135 CSCI 4152/6509, Vlado Keselj Lecture 14 1 / 19 Previous Lecture

658 views • 19 slides
CELL SELECTION IN Guy Grebla OFDMA WIRELESS NETWORKS Slides: Moshe Gabel MOSHE GABEL 1 MODERN

CELL SELECTION IN Guy Grebla OFDMA WIRELESS NETWORKS Slides: Moshe Gabel MOSHE GABEL 1 MODERN

JOINT SCHEDULING AND FAST Reuven Cohen CELL SELECTION IN Guy Grebla OFDMA WIRELESS NETWORKS Slides: Moshe Gabel MOSHE GABEL 1 MODERN CELLULAR NETWORKS One base station per cell Multiple users in cell A1 A2 Divide cell to 3 or 6 sectors,

1.08k views • 44 slides
CSE 447 / 547 Natural Language Processing Winter 2018 Hidden Markov Models Yejin Choi

CSE 447 / 547 Natural Language Processing Winter 2018 Hidden Markov Models Yejin Choi

CSE 447 / 547 Natural Language Processing Winter 2018 Hidden Markov Models Yejin Choi University of Washington [Many slides from Dan Klein, Michael Collins, Luke Zettlemoyer] Overview Hidden Markov Models Learning Supervised: Maximum

971 views • 51 slides
Maximizing Expected U=lity for Stochas=c Combinatorial Op=miza=on

Maximizing Expected U=lity for Stochas=c Combinatorial Op=miza=on

ISMP 2012. Berlin Maximizing Expected U=lity for Stochas=c Combinatorial Op=miza=on Problems Jian Li Ins)tute of Interdisiplinary Informa)on Sciences Tsinghua University Aug.

741 views • 35 slides

More recommend