CS70: Jean Walrand: Lecture 15b.

Similar documents
Continuing Probability.

Probability Space: Formalism Simplest physical model of a uniform probability space:

Probability Basics Review

CS70: Jean Walrand: Lecture 16.

Lecture 9b: Events, Conditional Probability, Independence, Bayes' Rule Lecturer: Lale Özkahya

V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE

SDS 321: Introduction to Probability and Statistics

Mathematical Foundations of Computer Science Lecture Outline October 18, 2018

Probability: Sets, Sample Spaces, Events

MODULE 2 RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES DISTRIBUTION FUNCTION AND ITS PROPERTIES

6.2 Introduction to Probability. The Deal. Possible outcomes: STAT1010 Intro to probability. Definitions. Terms: What are the chances of?

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 16. Random Variables: Distribution and Expectation

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

Event A: at least one tail observed A:

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation

1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ).

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 14. Random Variables: Distribution and Expectation

CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 7 Probability. Outline. Terminology and background. Arthur G.

Introduction to Randomized Algorithms: Quick Sort and Quick Selection

Probability and random variables

Probability: Terminology and Examples Class 2, Jeremy Orloff and Jonathan Bloom

MAE 493G, CpE 493M, Mobile Robotics. 6. Basic Probability

12 1 = = 1

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

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10

Discrete Mathematics for CS Spring 2006 Vazirani Lecture 22

Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events

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

Lecture 3 Probability Basics

Elementary Discrete Probability

Monty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch

Great Theoretical Ideas in Computer Science

Expected Value 7/7/2006

P [(E and F )] P [F ]

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B).

Chapter 14. From Randomness to Probability. Copyright 2012, 2008, 2005 Pearson Education, Inc.

STA Module 4 Probability Concepts. Rev.F08 1

Chap 4 Probability p227 The probability of any outcome in a random phenomenon is the proportion of times the outcome would occur in a long series of

Lecture Lecture 5

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 15. Random Variables: Distributions, Independence, and Expectations

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

Lecture 5: Introduction to Probability

CS 361: Probability & Statistics

Mutually Exclusive Events

Grades 7 & 8, Math Circles 24/25/26 October, Probability

k P (X = k)

Introduction to Probability

6.041/6.431 Spring 2009 Quiz 1 Wednesday, March 11, 7:30-9:30 PM. SOLUTIONS

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

ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables

EE126: Probability and Random Processes

324 Stat Lecture Notes (1) Probability

6.042/18.062J Mathematics for Computer Science November 28, 2006 Tom Leighton and Ronitt Rubinfeld. Random Variables

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

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

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

CMPSCI 240: Reasoning Under Uncertainty

CS 361: Probability & Statistics

Chapter 2 PROBABILITY SAMPLE SPACE

HST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007

Lecture 6: The Pigeonhole Principle and Probability Spaces

the time it takes until a radioactive substance undergoes a decay

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

CS70: Jean Walrand: Lecture 19.

Lecture Notes. Here are some handy facts about the probability of various combinations of sets:

Discrete Structures for Computer Science

CS70: Jean Walrand: Lecture 26.


Formal Modeling in Cognitive Science Lecture 19: Application of Bayes Theorem; Discrete Random Variables; Distributions. Background.

Formal Modeling in Cognitive Science

Statistics 251: Statistical Methods

Lecture 3. January 7, () Lecture 3 January 7, / 35

Formalizing Probability. Choosing the Sample Space. Probability Measures

Lecture 1 Introduction to Probability and Set Theory Text: A Course in Probability by Weiss

6.3 Bernoulli Trials Example Consider the following random experiments

Entropy. Probability and Computing. Presentation 22. Probability and Computing Presentation 22 Entropy 1/39

Examples of frequentist probability include games of chance, sample surveys, and randomized experiments. We will focus on frequentist probability sinc

Chapter 2: Probability Part 1

Lecture 1: Probability Fundamentals

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

Lecture 1. ABC of Probability

3 PROBABILITY TOPICS

Probability Theory and Simulation Methods

Business Statistics. Lecture 3: Random Variables and the Normal Distribution

Deep Learning for Computer Vision

Lecture 1 : The Mathematical Theory of Probability

Probability: Part 1 Naima Hammoud

Chapter 2: The Random Variable

MA : Introductory Probability

Dynamic Programming Lecture #4

Probability Year 9. Terminology

Probability Experiments, Trials, Outcomes, Sample Spaces Example 1 Example 2

What is Probability? Probability. Sample Spaces and Events. Simple Event

Bayesian inference. Fredrik Ronquist and Peter Beerli. October 3, 2007

Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr( )

First Digit Tally Marks Final Count

CSC Discrete Math I, Spring Discrete Probability

Example 1. The sample space of an experiment where we flip a pair of coins is denoted by:

Presentation on Theo e ry r y o f P r P o r bab a il i i l t i y

Outline. 1. Define likelihood 2. Interpretations of likelihoods 3. Likelihood plots 4. Maximum likelihood 5. Likelihood ratio benchmarks

Transcription:

CS70: Jean Walrand: Lecture 15b. Modeling Uncertainty: Probability Space 1. Key Points 2. Random Experiments 3. Probability Space

Key Points Uncertainty does not mean nothing is known How to best make decisions under uncertainty? Buy stocks Detect signals (transmitted bits, speech, images, radar, diseases, etc.) Control systems (Internet, airplane, robots, self-driving cars, schedule surgeries in a hospital, etc.) How to best use artificial uncertainty? Play games of chance Design randomized algorithms. Probability Models knowledge about uncertainty Discovers best way to use that knowledge in making decisions

The Magic of Probability Uncertainty: vague, fuzzy, confusing, scary, hard to think about. Probability: A precise, unambiguous, simple(!) way to think about uncertainty. Our mission: help you discover the serenity of Probability, i.e., enable you to think clearly about uncertainty. Your cost: focused attention and practice on examples and problems.

Random Experiment: Flip one Fair Coin Flip a fair coin: (One flips or tosses a coin) Possible outcomes: Heads (H) and Tails (T ) (One flip yields either heads or tails.) Likelihoods: H : 50% and T : 50%

Random Experiment: Flip one Fair Coin Flip a fair coin: What do we mean by the likelihood of tails is 50%? Two interpretations: Single coin flip: 50% chance of tails [subjectivist] Willingness to bet on the outcome of a single flip Many coin flips: About half yield tails [frequentist] Makes sense for many flips Question: Why does the fraction of tails converge to the same value every time? Statistical Regularity! Deep!

Random Experiment: Flip one Fair Coin Flip a fair coin: model The physical experiment is complex. (Shape, density, initial momentum and position,...) The Probability model is simple: A set Ω of outcomes: Ω = {H,T }. A probability assigned to each outcome: Pr[H] = 0.5,Pr[T ] = 0.5.

Random Experiment: Flip one Unfair Coin Flip an unfair (biased, loaded) coin: Possible outcomes: Heads (H) and Tails (T ) Likelihoods: H : p (0,1) and T : 1 p Frequentist Interpretation: Flip many times Fraction 1 p of tails Question: How can one figure out p? Flip many times Tautolgy? No: Statistical regularity!

Random Experiment: Flip one Unfair Coin Flip an unfair (biased, loaded) coin: model H p T 1-p Physical Experiment Probability Model

Flip Two Fair Coins Possible outcomes: {HH,HT,TH,TT } {H,T } 2. Note: A B := {(a,b) a A,b B} and A 2 := A A. Likelihoods: 1/4 each.

Flip Glued Coins Flips two coins glued together side by side: Possible outcomes: {HH, TT }. Likelihoods: HH : 0.5,TT : 0.5. Note: Coins are glued so that they show the same face.

Flip Glued Coins Flips two coins glued together side by side: Possible outcomes: {HT, TH}. Likelihoods: HT : 0.5,TH : 0.5. Note: Coins are glued so that they show different faces.

Flip two Attached Coins Flips two coins attached by a spring: Possible outcomes: {HH,HT,TH,TT }. Likelihoods: HH : 0.4,HT : 0.1,TH : 0.1,TT : 0.4. Note: Coins are attached so that they tend to show the same face, unless the spring twists enough.

Flipping Two Coins Here is a way to summarize the four random experiments: Ω is the set of possible outcomes; Each outcome has a probability (likelihood); The probabilities are 0 and add up to 1; Fair coins: [1]; Glued coins: [3],[4]; Spring-attached coins: [2];

Flipping Two Coins Here is a way to summarize the four random experiments: Important remarks: Each outcome describes the two coins. E.g., HT is one outcome of the experiment. It is wrong to think that the outcomes are {H,T } and that one picks twice from that set. Indeed, this viewpoint misses the relationship between the two flips. Each ω Ω describes one outcome of the complete experiment. Ω and the probabilities specify the random experiment.

Flipping n times Flip a fair coin n times (some n 1): Possible outcomes: {TT T,TT H,...,HH H}. Thus, 2 n possible outcomes. Note: {TT T,TT H,...,HH H} = {H,T } n. A n := {(a 1,...,a n ) a 1 A,...,a n A}. A n = A n. Likelihoods: 1/2 n each.

Roll two Dice Roll a balanced 6-sided die twice: Possible outcomes: {1,2,3,4,5,6} 2 = {(a,b) 1 a,b 6}. Likelihoods: 1/36 for each.

Probability Space. 1. A random experiment : (a) Flip a biased coin; (b) Flip two fair coins; (c) Deal a poker hand. 2. A set of possible outcomes: Ω. (a) Ω = {H,T }; (b) Ω = {HH,HT,TH,TT }; Ω = 4; (c) Ω = { A A A A K, A A A A Q,...} Ω = ( 52) 5. 3. Assign a probability to each outcome: Pr : Ω [0,1]. (a) Pr[H] = p,pr[t ] = 1 p for some p [0,1] (b) Pr[HH] = Pr[HT ] = Pr[TH] = Pr[TT ] = 1 4 (c) Pr[ A A A A K ] = = 1/ ( 52) 5

Probability Space: formalism. Ω is the sample space. ω Ω is a sample point. (Also called an outcome.) Sample point ω has a probability Pr[ω] where 0 Pr[ω] 1; ω Ω Pr[ω] = 1.

Probability Space: Formalism. In a uniform probability space each outcome ω is equally probable: Pr[ω] = 1 Ω for all ω Ω. Examples: Flipping two fair coins, dealing a poker hand are uniform probability spaces. Flipping a biased coin is not a uniform probability space.

Probability Space: Formalism Simplest physical model of a uniform probability space: Red Green... Maroon Pr[!] 1/8 1/8... 1/8 Physical experiment Probability model A bag of identical balls, except for their color (or a label). If the bag is well shaken, every ball is equally likely to be picked. Ω = {white, red, yellow, grey, purple, blue, maroon, green} Pr[blue] = 1 8.

Probability Space: Formalism Simplest physical model of a non-uniform probability space: Red Green Yellow Blue Pr[!] 3/10 4/10 2/10 1/10 Physical experiment Probability model Ω = {Red, Green, Yellow, Blue} Pr[Red] = 3 10,Pr[Green] = 4 10, etc. Note: Probabilities are restricted to rational numbers: N k N.

Probability Space: Formalism Physical model of a general non-uniform probability space:! p! Pr[!] p 3 3 2 1 Green = 1 Purple = 2... Yellow! p 1 p 2... p! p 2 Fraction p 1 of circumference Physical experiment Probability model The roulette wheel stops in sector ω with probability p ω. Ω = {1,2,3,...,N},Pr[ω] = p ω.

An important remark The random experiment selects one and only one outcome in Ω. For instance, when we flip a fair coin twice Ω = {HH,TH,HT,TT } The experiment selects one of the elements of Ω. In this case, its would be wrong to think that Ω = {H,T } and that the experiment selects two outcomes. Why? Because this would not describe how the two coin flips are related to each other. For instance, say we glue the coins side-by-side so that they face up the same way. Then one gets HH or TT with probability 50% each. This is not captured by picking two outcomes.

Lecture 15: Summary Modeling Uncertainty: Probability Space 1. Random Experiment 2. Probability Space: Ω;Pr[ω] [0,1]; ω Pr[ω] = 1. 3. Uniform Probability Space: Pr[ω] = 1/ Ω for all ω Ω.