CMPSCI 240: Reasoning Under Uncertainty

Similar documents
CMPSCI 240: Reasoning about Uncertainty

CMPSCI 240: Reasoning Under Uncertainty

CMPSCI 240: Reasoning Under Uncertainty

CMPSCI 240: Reasoning Under Uncertainty

Lecture 1. ABC of Probability

CMPSCI 240: Reasoning about Uncertainty

ECE 302: Chapter 02 Probability Model

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

Decision Trees. Nicholas Ruozzi University of Texas at Dallas. Based on the slides of Vibhav Gogate and David Sontag

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability

SDS 321: Introduction to Probability and Statistics

Venn Diagrams; Probability Laws. Notes. Set Operations and Relations. Venn Diagram 2.1. Venn Diagrams; Probability Laws. Notes

Sample Space: Specify all possible outcomes from an experiment. Event: Specify a particular outcome or combination of outcomes.

Recap. The study of randomness and uncertainty Chances, odds, likelihood, expected, probably, on average,... PROBABILITY INFERENTIAL STATISTICS

Introduction to Probability

Topic 5 Basics of Probability

Probability Notes. Definitions: The probability of an event is the likelihood of choosing an outcome from that event.

When working with probabilities we often perform more than one event in a sequence - this is called a compound probability.

Probability Rules. MATH 130, Elements of Statistics I. J. Robert Buchanan. Fall Department of Mathematics

Lecture notes for probability. Math 124

CIS 2033 Lecture 5, Fall

Probability & Random Variables

I - Probability. What is Probability? the chance of an event occuring. 1classical probability. 2empirical probability. 3subjective probability

Chapter 2. Probability. Math 371. University of Hawai i at Mānoa. Summer 2011

MATH MW Elementary Probability Course Notes Part I: Models and Counting

Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com

Basic Probabilistic Reasoning SEG

Communication Theory II

AMS7: WEEK 2. CLASS 2

Probabilistic Systems Analysis Spring 2018 Lecture 6. Random Variables: Probability Mass Function and Expectation

STA Module 4 Probability Concepts. Rev.F08 1

the time it takes until a radioactive substance undergoes a decay

Deep Learning for Computer Vision

Data Mining Techniques. Lecture 3: Probability

Origins of Probability Theory

The enumeration of all possible outcomes of an experiment is called the sample space, denoted S. E.g.: S={head, tail}

CMPSCI 240: Reasoning Under Uncertainty

4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio

Topic 2 Probability. Basic probability Conditional probability and independence Bayes rule Basic reliability

Chapter 2: Probability Part 1

Lecture 1: Probability Fundamentals

Randomized Algorithms. Andreas Klappenecker

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14

Lecture 9: Naive Bayes, SVM, Kernels. Saravanan Thirumuruganathan

Recitation 2: Probability

Lecture 3 - Axioms of Probability

EE 178 Lecture Notes 0 Course Introduction. About EE178. About Probability. Course Goals. Course Topics. Lecture Notes EE 178

Lecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics?

Lecture Lecture 5

Independence Solutions STAT-UB.0103 Statistics for Business Control and Regression Models

Probabilistic models

CPSC340. Probability. Nando de Freitas September, 2012 University of British Columbia

From Bayes Theorem to Pattern Recognition via Bayes Rule

Probability: Part 1 Naima Hammoud

Probability Theory. Probability and Statistics for Data Science CSE594 - Spring 2016

Introduction to Probability. Ariel Yadin. Lecture 1. We begin with an example [this is known as Bertrand s paradox]. *** Nov.

Basic Probability. Introduction

Statistical Theory 1

STA111 - Lecture 1 Welcome to STA111! 1 What is the difference between Probability and Statistics?

Probability- describes the pattern of chance outcomes

Introductory Probability

Probability Theory Review

The probability of an event is viewed as a numerical measure of the chance that the event will occur.

4. Probability of an event A for equally likely outcomes:

Probability Year 10. Terminology

Ch 14 Randomness and Probability

Chapter 1: Introduction to Probability Theory

Recall from last time. Lecture 3: Conditional independence and graph structure. Example: A Bayesian (belief) network.

Compound Events. The event E = E c (the complement of E) is the event consisting of those outcomes which are not in E.

Probability Review. Chao Lan

2.4. Conditional Probability

Lecture 2. October 21, Department of Biostatistics Johns Hopkins Bloomberg School of Public Health Johns Hopkins University.

Review Basic Probability Concept

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

Bayes Theorem. Jan Kracík. Department of Applied Mathematics FEECS, VŠB - TU Ostrava

2. Probability. Chris Piech and Mehran Sahami. Oct 2017

Math 1313 Experiments, Events and Sample Spaces

Statistical Methods for the Social Sciences, Autumn 2012

Lecture 10: Probability distributions TUESDAY, FEBRUARY 19, 2019

Probability, Random Processes and Inference

MA : Introductory Probability

Week 2. Section Texas A& M University. Department of Mathematics Texas A& M University, College Station 22 January-24 January 2019

CSCI 5832 Natural Language Processing. Today 1/31. Probability Basics. Lecture 6. Probability. Language Modeling (N-grams)

STA 247 Solutions to Assignment #1

Vina Nguyen HSSP July 6, 2008

Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya

Generative Learning. INFO-4604, Applied Machine Learning University of Colorado Boulder. November 29, 2018 Prof. Michael Paul

Probabilities and Expectations

= 2 5 Note how we need to be somewhat careful with how we define the total number of outcomes in b) and d). We will return to this later.

ECE 340 Probabilistic Methods in Engineering M/W 3-4:15. Lecture 2: Random Experiments. Prof. Vince Calhoun

Probability Theory and Applications

Probability with Engineering Applications ECE 313 Section C Lecture 2. Lav R. Varshney 30 August 2017

Statistical Inference

CS 441 Discrete Mathematics for CS Lecture 19. Probabilities. CS 441 Discrete mathematics for CS. Probabilities

Chapter 6: Probability The Study of Randomness

Probability Year 9. Terminology

Chap 1: Experiments, Models, and Probabilities. Random Processes. Chap 1 : Experiments, Models, and Probabilities

Lecture 3. Probability and elements of combinatorics

Statistics 1 - Lecture Notes Chapter 1

CS4705. Probability Review and Naïve Bayes. Slides from Dragomir Radev

Transcription:

CMPSCI 240: Reasoning Under Uncertainty Lecture 2 Prof. Hanna Wallach wallach@cs.umass.edu January 26, 2012

Reminders Pick up a copy of B&T Check the course website: http://www.cs.umass.edu/ ~wallach/courses/s12/cmpsci240/ NO cell phones or laptops in class

Recap

Last Time... Experiment: a process that results in exactly one of several possible outcomes, e.g., rolling a die

Last Time... Experiment: a process that results in exactly one of several possible outcomes, e.g., rolling a die Sample space: the set of all possible outcomes of an experiment, e.g., Ω = {1, 2, 3, 4, 5, 6}

Last Time... Experiment: a process that results in exactly one of several possible outcomes, e.g., rolling a die Sample space: the set of all possible outcomes of an experiment, e.g., Ω = {1, 2, 3, 4, 5, 6} Event: a subset of Ω, e.g., A = odd number = {1, 3, 5}

Last Time... Experiment: a process that results in exactly one of several possible outcomes, e.g., rolling a die Sample space: the set of all possible outcomes of an experiment, e.g., Ω = {1, 2, 3, 4, 5, 6} Event: a subset of Ω, e.g., A = odd number = {1, 3, 5} Atomic event: event consisting of a single outcome, e.g., {1}

Last Time... Probability law: assigns a probability P(A) to any event A Ω encoding our knowledge or beliefs about the collective likelihood of the elements of event A; satisfies 3 axioms

Last Time... Probability law: assigns a probability P(A) to any event A Ω encoding our knowledge or beliefs about the collective likelihood of the elements of event A; satisfies 3 axioms Nonnegativity: P(A) 0 for every A Ω

Last Time... Probability law: assigns a probability P(A) to any event A Ω encoding our knowledge or beliefs about the collective likelihood of the elements of event A; satisfies 3 axioms Nonnegativity: P(A) 0 for every A Ω Additivity: P(A B) = P(A) + P(B) if A and B are disjoint

Last Time... Probability law: assigns a probability P(A) to any event A Ω encoding our knowledge or beliefs about the collective likelihood of the elements of event A; satisfies 3 axioms Nonnegativity: P(A) 0 for every A Ω Additivity: P(A B) = P(A) + P(B) if A and B are disjoint Normalization: P(Ω) = 1

Probabilistic Models

Derivative Properties of Probabilities P( ) = 0

Derivative Properties of Probabilities P( ) = 0 P(A c ) = 1 P(A)

Derivative Properties of Probabilities P( ) = 0 P(A c ) = 1 P(A) If A B, then P(A) P(B)

Derivative Properties of Probabilities P( ) = 0 P(A c ) = 1 P(A) If A B, then P(A) P(B) P(A B) = P(A) + P(B) P(A B)

Derivative Properties of Probabilities P( ) = 0 P(A c ) = 1 P(A) If A B, then P(A) P(B) P(A B) = P(A) + P(B) P(A B) P(A B) P(A) + P(B)

Derivative Properties of Probabilities P( ) = 0 P(A c ) = 1 P(A) If A B, then P(A) P(B) P(A B) = P(A) + P(B) P(A B) P(A B) P(A) + P(B) P(A B C) = P(A) + P(A c B) + P(A c B c C)

Discrete Probability Laws If Ω is finite, the probability of any event can be derived from the probabilities of the atomic events, i.e., if A = {x 1, x 2,..., x n } then P(A) = P(x 1 ) +... + P(x n )

Discrete Probability Laws If Ω is finite, the probability of any event can be derived from the probabilities of the atomic events, i.e., if A = {x 1, x 2,..., x n } then P(A) = P(x 1 ) +... + P(x n ) For a finite sample space, the probabilities of the atomic events completely specify the probability law

Discrete Probability Laws If Ω is finite, the probability of any event can be derived from the probabilities of the atomic events, i.e., if A = {x 1, x 2,..., x n } then P(A) = P(x 1 ) +... + P(x n ) For a finite sample space, the probabilities of the atomic events completely specify the probability law Discrete uniform probability law: if Ω is finite and all outcomes are equally likely, then P(A) = A / Ω

Examples of Discrete Probability Laws e.g., flipping a coin: what is the probability law?

Examples of Discrete Probability Laws e.g., flipping a coin: what is the probability law? e.g., rolling two 4-sided dice: Ω = {(1, 1), (1, 2),..., (4, 4)}, what is the probability that the sum of the rolls is even? What is the probability that the first roll is equal to the second? What is the probability that at least one roll is a 4?

Conditional Probability

Conditional Probability Laws Conditional probability provides a way to reason about the outcome of an experiment using partial information

Conditional Probability Laws Conditional probability provides a way to reason about the outcome of an experiment using partial information e.g., rolling a die: if we know the number rolled is odd, what is the probability that the number is < 3?

Conditional Probability Laws Conditional probability provides a way to reason about the outcome of an experiment using partial information e.g., rolling a die: if we know the number rolled is odd, what is the probability that the number is < 3? Conditional probability law: assigns a conditional probability P(A B) to any event A encoding our knowledge or beliefs about the collective likelihood of the elements of A given that we know the outcome is within event B

Conditional Probability Conditional probability of event A given event B: P(A B) = P(A B) P(B) assuming P(B) > 0

Conditional Probability Conditional probability of event A given event B: P(A B) = P(A B) P(B) assuming P(B) > 0 If all outcomes are equally likely, P(A B) = A B / B

Conditional Probability Conditional probability of event A given event B: P(A B) = P(A B) P(B) assuming P(B) > 0 If all outcomes are equally likely, P(A B) = A B / B All the conditional probability is concentrated on B

Conditional Probability Conditional probability of event A given event B: P(A B) = P(A B) P(B) assuming P(B) > 0 If all outcomes are equally likely, P(A B) = A B / B All the conditional probability is concentrated on B Conditional probabilities satisfy the probability axioms

Examples of Conditional Probability e.g., flipping two coins in a row: what is the probability that the first coin is tails given that at least one coin is tails?

Examples of Conditional Probability e.g., flipping two coins in a row: what is the probability that the first coin is tails given that at least one coin is tails? e.g., I eat a cookie with probability 0.5, a brownie with probability 0.25, and an apple with probability 0.25: what is the probability I ate a cookie given that I ate a baked good?

Examples of Conditional Probability e.g., Competitive eaters Takeru Kobayashi and Joey Chestnut are asked to eat 60 hot dogs in 10 minutes. From past experience, we know that the probability that Takeru is successful is 2 / 3, the probability that Joey is successful is 1 / 3, and the probability that at least one of them is successful is 3 / 4. Assuming that exactly one of them was successful, what is the probability that it was Joey?

Multiplication Rule For sequential experiments, it can be easier to specify the probability law by specifying conditional probabilities and using them to derive unconditional probabilities:

Multiplication Rule For sequential experiments, it can be easier to specify the probability law by specifying conditional probabilities and using them to derive unconditional probabilities: P(A... B) = P(A 1 ) P(A 2 A 1 )... P(A n A 1... A n 1 )

Multiplication Rule For sequential experiments, it can be easier to specify the probability law by specifying conditional probabilities and using them to derive unconditional probabilities: P(A... B) = P(A 1 ) P(A 2 A 1 )... P(A n A 1... A n 1 ) If n =2, this is the definition of conditional probability

Examples of the Multiplication Rule e.g., If there s an intruder, my alarm will sound with probability 0.99. If there s no intruder, my alarm will sound with probability 0.1. The probability of an intruder is 0.05. What is the probability of no intruder and my alarm sounding?

Multiplication Rule as a Tree Form a tree where atomic events are associated with leaves

Multiplication Rule as a Tree Form a tree where atomic events are associated with leaves Internal nodes are associated with other intersection events

Multiplication Rule as a Tree Form a tree where atomic events are associated with leaves Internal nodes are associated with other intersection events Record conditional probabilities on the branches of the tree

Multiplication Rule as a Tree Form a tree where atomic events are associated with leaves Internal nodes are associated with other intersection events Record conditional probabilities on the branches of the tree View the occurrence of an atomic event as the traversal of the branches from the root to the corresponding leaf = can obtain the probability of the atomic event by multiplying the conditional probabilities on these branches

For Next Time Read B&T 1.4, 1.5 Check the course website: http://www.cs.umass.edu/ ~wallach/courses/s12/cmpsci240/