Will Monroe July 5, with materials by Mehran Sahami and Chris Piech. image: Therightclicks. Independence

Size: px
Start display at page:

Download "Will Monroe July 5, with materials by Mehran Sahami and Chris Piech. image: Therightclicks. Independence"

Transcription

1 Will Monroe July 5, 2017 with materials by Mehran Sahami and Chris Piech image: Therightclicks Independence

2 Announcements: Problem Set 1 due! Solutions to be posted next Wednesday (no submissions allowed >1 week late, even if you're willing to take lots of late penalties!)

3 Announcements: Problem Set 2 out (Cell phone location sensing) Due next Wednesday, 7/12, at 12:30pm (before class). 13 problems 1 coding problem (this time with a bit of data to work with!)

4 Review: Conditional probability The conditional probability P(E F) is the probability that E happens, given that F has happened. F is the new sample space. P( EF) P(E F )= P( F) S E EF F

5 Conditional probability: A cautionary tale xkcd by Randall Munroe

6 Review: Chain rule of probability The probability of all events happening is the probability of the first happening times the prob. of the second given the first times the prob. of the third given the first two...etc. P(EFG )=P( E) P(F E) P(G EF) S S E EF F = F x EF F

7 Review: Law of total probability You can compute an overall probability by summing over mutually exclusive and exhaustive sub-cases. P(F )= P(E i F ) i P(F )= P(E i ) P(F E i ) S E1 E1F E2F E4F E3F E4 i E2 E3 F

8 Review: Bayes' theorem You can flip a conditional probability if you multiply by the probability of the hypothesis and divide by the probability of the observation. P(F E) P (E) P(E F )= P(F )

9 Independence Two events are independent if you can multiply their probabilities to get the probability of both happening. P(EF )=P (E) P(F ) E F ( independent of ) E S EF F

10 Rolling two dice 1 P( D 1=1, D 2=1)= 36 E D1 D2 P(EF) = 1/6 1/6 F P(E) = 1/6 S = {(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), S = {(2, 1), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6), S = {(3, 1), (3, 2), (3, 3), (3, 4), (3, 5), (3, 6), P(F) = 1/6 S = {(4, 1), (4, 2), (4, 3), (4, 4), (4, 5), (4, 6), S = {(5, 1), (5, 2), (5, 3), (5, 4), (5, 5), (5, 6), S = {(6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6)}

11 Rolling two dice E G P( D 1=1, D 1 + D 2=4)=? D1 D2 P(EG) = 1/36 1/6 3/36 P(E) = 1/6 S = {(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), S = {(2, 1), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6), S = {(3, 1), (3, 2), (3, 3), (3, 4), (3, 5), (3, 6), P(G) = 3/36 S = {(4, 1), (4, 2), (4, 3), (4, 4), (4, 5), (4, 6), S = {(5, 1), (5, 2), (5, 3), (5, 4), (5, 5), (5, 6), S = {(6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6)}

12 Independence Two events are independent if you can multiply their probabilities to get the probability of both happening. P(EF )=P (E) P(F ) E F ( independent of ) E S EF F

13 Independence as conditional P( E F)=P( E) (if and only if E, F are independent)

14 Conditioning on the complement If E, F are independent: C P( E F)=P( E F )

15 Three events E, F, G are independent if: P( EFG)=P ( E) P (F) P(G) and P (EF)=P( E) P (F ) and P (EG)=P( E) P (G) and P (FG)=P( F ) P(G)

16 Rolling two dice again E: event that D1 = 1 D1 F: event that D2 = 6 D2 G: event that D1 + D2 = 7 P(E) = 1/6 P(F) = 1/6 P(EF) = 1/36 P(EF) = 1/6 1/6 Are E and F independent? A) Yes Room: CS109SUMMER17

17 Independence and causation If two events don't affect each other, and also have no unknown factors in common that affect both, then they're likely to be independent. However: If two events are independent, it doesn't necessarily mean they don't affect each other! What it means is that knowing one doesn't give you information about the other.

18 Rolling two dice again E: event that D1 = 1 D1 F: event that D2 = 6 D2 P(E) = 1/6 P(F) = 1/6 P(EF) = 1/36 P(EF) = 1/6 1/6 G: event that D1 + D2 = 7 P(G) = 6/36 = 1/6 P(EG) = 1/36 P(EG) = 1/6 1/6 Are E and G independent? A) Yes Room: CS109SUMMER17

19 Rolling two dice again E: event that D1 = 1 D1 F: event that D2 = 6 D2 P(E) = 1/6 P(F) = 1/6 P(EF) = 1/36 P(EF) = 1/6 1/6 G: event that D1 + D2 = 7 P(G) = 6/36 = 1/6 P(EG) = 1/36 P(EG) = 1/6 1/6 P(FG) = 1/36 P(FG) = 1/6 1/6 Are F and G independent? A) Yes Room: CS109SUMMER17

20 Rolling two dice again E: event that D1 = 1 D1 F: event that D2 = 6 D2 P(E) = 1/6 P(F) = 1/6 P(EF) = 1/36 P(EF) = 1/6 1/6 G: event that D1 + D2 = 7 P(G) = 6/36 = 1/6 P(EG) = 1/36 P(EG) = 1/6 1/6 P(FG) = 1/36 P(FG) = 1/6 1/6 P(EFG) = 1/36 1/6 1/6 1/6 Are E, F and G independent? B) No (!) Room: CS109SUMMER17

21 Many events E 1, E 2,, E n are independent if for every subset E i, E i,, E i : 1 2 r P (E i E i E i )=P( E i ) P (Ei ) P ( E i ) 1 2 r 1 2 r

22 Generating random bits (1 p) p p p n P(first n are 1's) = p p... = pn Each bit is a 1 with probability p, 0 with probability (1 p). E: generate n 1's, followed by a single 0 P(E) = pn (1 - p)

23 (Biased) coin flipping n flips, each flip heads with probability p, tails with probability (1 p) E: n heads P(E) = pn F: n tails P(F) = (1 p)n G: k heads, then n k tails P(G) = pk(1 p)n-k H: exactly k heads n pk (1 p)n k P(H) = k ()

24 Break time!

25 String hashing m strings Roosevelt Adams Nixon n buckets Taft Harrison Washington All buckets equally likely, all independent E: at least 1 hashed to first bucket Fi: string i hashed to first bucket P( E)=P (F 1 F 2 F m )

26 Review: Getting rid of ORs Finding the probability of an OR of events can be nasty. Try using De Morgan's laws to turn it into an AND! c c c P( A B Z )=1 P( A B Z ) S E F

27 String hashing m strings Roosevelt Adams All buckets equally likely, all independent Nixon E: at least 1 hashed to first bucket n buckets Fi: string i hashed to first bucket P( E)=P (F 1 F 2 F m ) Taft C C C =1 P(F 1 F 2 F m ) C C C Harrison =1 P(F 1 ) P (F 2 ) P(F m ) Washington n 1 =1 n m ( )

28 String hashing n buckets m strings Roosevelt Adams All independent, not equally likely. (Each string bucket i with prob. pi) Nixon E: at least 1 string hashed to any of the first k buckets Fi: bucket i gets at least one string Taft P (E)=P ( F 1 F 2 F k ) C C C Harrison =1 P(F 1 F 2 F k ) Washington m =1 ( 1 p1 p2 p k )

29 String hashing n buckets m strings Roosevelt Adams All independent, not equally likely. (Each string bucket i with prob. pi) Nixon E: at least 1 string hashed to each of the first k buckets Fi: bucket i gets at least one string Taft P ( E)=P (F 1 F 2 F k ) s] n o ti p m u s =P( F 1 ) Pyo(F Harrison ur a2s) P( F k ) Washington k c e h [c

30 String hashing n buckets m strings Roosevelt Adams All independent, not equally likely. (Each string bucket i with prob. pi) Nixon E: at least 1 string hashed to each of the first k buckets Fi: bucket i gets at least one string Taft P ( E)=P (F 1 F 2 F k ) C C C Harrison =1 P( F 1 F 2 F k ) k Washington (r+ 1) =1 ( 1) r=1 k (r+1) =1 ( 1) r=1 r ( ) Fi C P (1 p i p i p i ) i 1< < i r i1 < <i r j=1 j m 1 2 r

31 Network reliability A p1 B p2 p3 p4 n independent routers, each works with prob. pi E: path exists from A to B P(E) =? n P ( E)=1 P (all routers fail) =1 (1 p1 )(1 p2 ) (1 pn )=1 (1 pi ) i=1

32 Simplified craps $

33 Simplified craps 9 7

34 Simplified craps 9 4 $ 5 E: roll 5 before rolling 7 Fn: n 1 rolls without a 5 or 7, then a 5 P (E)=P ( F 1 F 2 ) To Infinity! (and beyond?) = P (F n ) n=1 n = (1 ) ( ) n=1 n =( ) ( ) 36 n=1 36 P(5)=4 /36 P (7)=6/36

35 Geometric series n n x + x + x + + x = x i=0 i n+1 1 x = 1 x If x < 1, then as n : n 1 x 1 x i=0 i See Calculation Reference for more super-useful sum and product identities!

36 Simplified craps 9 4 $ 5 E: roll 5 before rolling 7 Fn: n 1 rolls without a 5 or 7, then a 5 P (E)=P ( F 1 F 2 ) To Infinity! (and beyond?) = P (F n ) n=1 P(5)=4 /36 P (7)=6/36 n = (1 ) ( ) n=1 n 4 26 =( ) ( ) 36 n= =( ) = 26 5 (1 ) 36

37 Conditional independence Two events are conditionally independent if you can multiply their conditional probabilities to get the conditional probability of both happening. P(EF G)=P(E G) P(F G) (E F ) G E G EF F

38 Conditional independence In general, (E F ) does not imply (E F ) G or vice versa!

39 Rolling two dice again E: event that D1 = 1 D1 D2 P(E) = 1/6 P(F) = 1/6 P(EF) = 1/36 P(EF) = 1/6 1/6 F: event that D2 = 6 G: event that D1 + D2 = 7 P(E G) = 1/6 P(F G) = 1/6 P(EF G) = 1/6 P(EF) 1/6 1/6

40 Faculty night At faculty night: 44 students 30 straight A's P(A F) CS majors 6 CS w/ straight A's P(A CS, F) = 0.30 Survey the whole dorm: 100 students 30 straight A's P(A) = CS majors 6 CS w/ straight A's P(A CS) = 0.30 Independent! What gives?

41 Faculty night At faculty night: 44 students 30 straight A's P(A F) CS majors 6 CS w/ straight A's P(A CS, F) = 0.30 All the A students came to faculty night. So did all the CS majors. A, CS conditionally dependent, conditioned on faculty night. Survey the whole dorm: 100 students 30 straight A's P(A) = CS majors 6 CS w/ straight A's P(A CS) = 0.30

42 Watering the lawn E: event that it rained today F: event that the sprinkler was on Say E and F are independent. G: event that the grass is wet You observe the grass is wet. Probability of both rain and sprinkler goes up! P(E G) > P(E) P(F G) > P(F) Now you find out the sprinklers were on. Does your belief that it rained change? P(E FG) < P(E G)

43 A graphical representation A, B independent! A A, B not independent? B C C is unknown? C A A B C B Condition on C C A, B not conditionally independent A B A, B conditionally independent!

44 For more on this: the book Daphne Koller Designed & taught earlier versions, wrote the book (literally & figuratively) a12 X1 Stefano Ermon Taught Winter 2017 X3 X2 a21 b12 b11 a23 b22 b31 b21 b32 b33 b14 b24 b13 y1 y2 b34 y3 y4 CS228: Probabilistic Graphical Models Tdunning/Razorbliss

45 Independence Two events are independent if you can multiply their probabilities to get the probability of both happening. P(EF )=P (E) P(F ) E F ( independent of ) E S EF F

46 Conditional independence Two events are conditionally independent if you can multiply their conditional probabilities to get the conditional probability of both happening. P(EF G)=P(E G) P(F G) (E F ) G E G EF F

47 Reminder: Python tutorial Right now! Follow Yuling to Gates B03

Independence. CS 109 Lecture 5 April 6th, 2016

Independence. CS 109 Lecture 5 April 6th, 2016 Independence CS 109 Lecture 5 April 6th, 2016 Today s Topics 2 Last time: Conditional Probability Bayes Theorem Today: Independence Conditional Independence Next time: Random Variables The Tragedy of Conditional

More information

CSE 312, 2017 Winter, W.L.Ruzzo. 5. independence [ ]

CSE 312, 2017 Winter, W.L.Ruzzo. 5. independence [ ] CSE 312, 2017 Winter, W.L.Ruzzo 5. independence [ ] independence Defn: Two events E and F are independent if P(EF) = P(E) P(F) If P(F)>0, this is equivalent to: P(E F) = P(E) (proof below) Otherwise, they

More information

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

2. Probability. Chris Piech and Mehran Sahami. Oct 2017 2. Probability Chris Piech and Mehran Sahami Oct 2017 1 Introduction It is that time in the quarter (it is still week one) when we get to talk about probability. Again we are going to build up from first

More information

More discrete distributions

More discrete distributions Will Monroe July 14, 217 with materials by Mehran Sahami and Chris Piech More discrete distributions Announcements: Problem Set 3 Posted yesterday on the course website. Due next Wednesday, 7/19, at 12:3pm

More information

Lecture 04: Conditional Probability. Lisa Yan July 2, 2018

Lecture 04: Conditional Probability. Lisa Yan July 2, 2018 Lecture 04: Conditional Probability Lisa Yan July 2, 2018 Announcements Problem Set #1 due on Friday Gradescope submission portal up Use Piazza No class or OH on Wednesday July 4 th 2 Summary from last

More information

Bernoulli and Binomial

Bernoulli and Binomial Bernoulli and Binomial Will Monroe July 1, 217 image: Antoine Taveneaux with materials by Mehran Sahami and Chris Piech Announcements: Problem Set 2 Due this Wednesday, 7/12, at 12:3pm (before class).

More information

Independent random variables

Independent random variables Will Monroe July 4, 017 with materials by Mehran Sahami and Chris Piech Independent random variables Announcements: Midterm Tomorrow! Tuesday, July 5, 7:00-9:00pm Building 30-105 (main quad, Geology Corner)

More information

Axioms of Probability

Axioms of Probability Sample Space (denoted by S) The set of all possible outcomes of a random experiment is called the Sample Space of the experiment, and is denoted by S. Example 1.10 If the experiment consists of tossing

More information

4. Conditional Probability P( ) CSE 312 Autumn 2012 W.L. Ruzzo

4. Conditional Probability P( ) CSE 312 Autumn 2012 W.L. Ruzzo 4. Conditional Probability P( ) CSE 312 Autumn 2012 W.L. Ruzzo 1 conditional probability Conditional probability of E given F: probability that E occurs given that F has occurred. Conditioning on F S Written

More information

Independence. Conditional Probability. Conditional Probability. Independence. SCONE Lab. Definition: Two events E and F are independent iff

Independence. Conditional Probability. Conditional Probability. Independence. SCONE Lab. Definition: Two events E and F are independent iff Independence Definition: Two events E and F are independent iff Seoul National University Example Pr(E F) = Pr(E) Pr(F) Flip a coin twice Event E: First trial is heads Event F: Second trial is tails Pr(E)

More information

CS 109: Introduction to Probability for Computer Scientists

CS 109: Introduction to Probability for Computer Scientists CS 109: Introduction to Probability for Computer Scientists Will Monroe Summer 2017 with materials by Mehran Sahami and Chris Piech June 26, 2017 Who am I? Frank Chen Stanford undergrad Who am I? Graphics

More information

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

Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete

More information

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

Compound Events. The event E = E c (the complement of E) is the event consisting of those outcomes which are not in E. Compound Events Because we are using the framework of set theory to analyze probability, we can use unions, intersections and complements to break complex events into compositions of events for which it

More information

Announcements. CS 188: Artificial Intelligence Spring Probability recap. Outline. Bayes Nets: Big Picture. Graphical Model Notation

Announcements. CS 188: Artificial Intelligence Spring Probability recap. Outline. Bayes Nets: Big Picture. Graphical Model Notation CS 188: Artificial Intelligence Spring 2010 Lecture 15: Bayes Nets II Independence 3/9/2010 Pieter Abbeel UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell, Andrew Moore Current

More information

6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Tutorial:A Random Number of Coin Flips

6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Tutorial:A Random Number of Coin Flips 6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Tutorial:A Random Number of Coin Flips Hey, everyone. Welcome back. Today, we're going to do another fun problem that

More information

Statistics for Engineers

Statistics for Engineers Statistics for Engineers Antony Lewis http://cosmologist.info/teaching/stat/ Starter question Have you previously done any statistics? 1. Yes 2. No 54% 46% 1 2 BOOKS Chatfield C, 1989. Statistics for

More information

CS626 Data Analysis and Simulation

CS626 Data Analysis and Simulation CS626 Data Analysis and Simulation Instructor: Peter Kemper R 104A, phone 221-3462, email:kemper@cs.wm.edu Today: Probability Primer Quick Reference: Sheldon Ross: Introduction to Probability Models 9th

More information

Properties of Probability

Properties of Probability Econ 325 Notes on Probability 1 By Hiro Kasahara Properties of Probability In statistics, we consider random experiments, experiments for which the outcome is random, i.e., cannot be predicted with certainty.

More information

Conditional Probability P( )

Conditional Probability P( ) Conditional Probability P( ) 1 conditional probability and the chain rule General defn: where P(F) > 0 Implies: P(EF) = P(E F) P(F) ( the chain rule ) General definition of Chain Rule: 2 Best of 3 tournament

More information

Probability COMP 245 STATISTICS. Dr N A Heard. 1 Sample Spaces and Events Sample Spaces Events Combinations of Events...

Probability COMP 245 STATISTICS. Dr N A Heard. 1 Sample Spaces and Events Sample Spaces Events Combinations of Events... Probability COMP 245 STATISTICS Dr N A Heard Contents Sample Spaces and Events. Sample Spaces........................................2 Events........................................... 2.3 Combinations

More information

CS 188: Artificial Intelligence Fall 2009

CS 188: Artificial Intelligence Fall 2009 CS 188: Artificial Intelligence Fall 2009 Lecture 14: Bayes Nets 10/13/2009 Dan Klein UC Berkeley Announcements Assignments P3 due yesterday W2 due Thursday W1 returned in front (after lecture) Midterm

More information

Dept. of Linguistics, Indiana University Fall 2015

Dept. of Linguistics, Indiana University Fall 2015 L645 Dept. of Linguistics, Indiana University Fall 2015 1 / 34 To start out the course, we need to know something about statistics and This is only an introduction; for a fuller understanding, you would

More information

Topic -2. Probability. Larson & Farber, Elementary Statistics: Picturing the World, 3e 1

Topic -2. Probability. Larson & Farber, Elementary Statistics: Picturing the World, 3e 1 Topic -2 Probability Larson & Farber, Elementary Statistics: Picturing the World, 3e 1 Probability Experiments Experiment : An experiment is an act that can be repeated under given condition. Rolling a

More information

Probability Theory and Applications

Probability Theory and Applications Probability Theory and Applications Videos of the topics covered in this manual are available at the following links: Lesson 4 Probability I http://faculty.citadel.edu/silver/ba205/online course/lesson

More information

Introduction to Machine Learning CMU-10701

Introduction to Machine Learning CMU-10701 Introduction to Machine Learning CMU-10701 2. MLE, MAP, Bayes classification Barnabás Póczos & Aarti Singh 2014 Spring Administration http://www.cs.cmu.edu/~aarti/class/10701_spring14/index.html Blackboard

More information

Basic Probability and Statistics

Basic Probability and Statistics Basic Probability and Statistics Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [based on slides from Jerry Zhu, Mark Craven] slide 1 Reasoning with Uncertainty

More information

PERMUTATIONS, COMBINATIONS AND DISCRETE PROBABILITY

PERMUTATIONS, COMBINATIONS AND DISCRETE PROBABILITY Friends, we continue the discussion with fundamentals of discrete probability in the second session of third chapter of our course in Discrete Mathematics. The conditional probability and Baye s theorem

More information

Conditional Probability P( )

Conditional Probability P( ) Conditional Probability P( ) 1 conditional probability where P(F) > 0 Conditional probability of E given F: probability that E occurs given that F has occurred. Conditioning on F Written as P(E F) Means

More information

Discrete Probability and State Estimation

Discrete Probability and State Estimation 6.01, Spring Semester, 2008 Week 12 Course Notes 1 MASSACHVSETTS INSTITVTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.01 Introduction to EECS I Spring Semester, 2008 Week

More information

Lecture 10: Introduction to reasoning under uncertainty. Uncertainty

Lecture 10: Introduction to reasoning under uncertainty. Uncertainty Lecture 10: Introduction to reasoning under uncertainty Introduction to reasoning under uncertainty Review of probability Axioms and inference Conditional probability Probability distributions COMP-424,

More information

Chapter 3 : Conditional Probability and Independence

Chapter 3 : Conditional Probability and Independence STAT/MATH 394 A - PROBABILITY I UW Autumn Quarter 2016 Néhémy Lim Chapter 3 : Conditional Probability and Independence 1 Conditional Probabilities How should we modify the probability of an event when

More information

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

CS 441 Discrete Mathematics for CS Lecture 19. Probabilities. CS 441 Discrete mathematics for CS. Probabilities CS 441 Discrete Mathematics for CS Lecture 19 Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Experiment: a procedure that yields one of the possible outcomes Sample space: a set of possible outcomes

More information

Mean, Median and Mode. Lecture 3 - Axioms of Probability. Where do they come from? Graphically. We start with a set of 21 numbers, Sta102 / BME102

Mean, Median and Mode. Lecture 3 - Axioms of Probability. Where do they come from? Graphically. We start with a set of 21 numbers, Sta102 / BME102 Mean, Median and Mode Lecture 3 - Axioms of Probability Sta102 / BME102 Colin Rundel September 1, 2014 We start with a set of 21 numbers, ## [1] -2.2-1.6-1.0-0.5-0.4-0.3-0.2 0.1 0.1 0.2 0.4 ## [12] 0.4

More information

Conditional Probability. CS231 Dianna Xu

Conditional Probability. CS231 Dianna Xu Conditional Probability CS231 Dianna Xu 1 Boy or Girl? A couple has two children, one of them is a girl. What is the probability that the other one is also a girl? Assuming 50/50 chances of conceiving

More information

(6, 1), (5, 2), (4, 3), (3, 4), (2, 5), (1, 6)

(6, 1), (5, 2), (4, 3), (3, 4), (2, 5), (1, 6) Section 7.3: Compound Events Because we are using the framework of set theory to analyze probability, we can use unions, intersections and complements to break complex events into compositions of events

More information

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

Presentation on Theo e ry r y o f P r P o r bab a il i i l t i y Presentation on Theory of Probability Meaning of Probability: Chance of occurrence of any event In practical life we come across situation where the result are uncertain Theory of probability was originated

More information

Random Variables Chris Piech CS109, Stanford University. Piech, CS106A, Stanford University

Random Variables Chris Piech CS109, Stanford University. Piech, CS106A, Stanford University Random Variables Chris Piech CS109, Stanford University Piech, CS106A, Stanford University Piech, CS106A, Stanford University Let s Play a Game Game set-up We have a fair coin (come up heads with p = 0.5)

More information

Probability Review Lecturer: Ji Liu Thank Jerry Zhu for sharing his slides

Probability Review Lecturer: Ji Liu Thank Jerry Zhu for sharing his slides Probability Review Lecturer: Ji Liu Thank Jerry Zhu for sharing his slides slide 1 Inference with Bayes rule: Example In a bag there are two envelopes one has a red ball (worth $100) and a black ball one

More information

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

Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr( ) Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr Pr = Pr Pr Pr() Pr Pr. We are given three coins and are told that two of the coins are fair and the

More information

Probability the chance that an uncertain event will occur (always between 0 and 1)

Probability the chance that an uncertain event will occur (always between 0 and 1) Quantitative Methods 2013 1 Probability as a Numerical Measure of the Likelihood of Occurrence Probability the chance that an uncertain event will occur (always between 0 and 1) Increasing Likelihood of

More information

Notes slides from before lecture. CSE 21, Winter 2017, Section A00. Lecture 16 Notes. Class URL:

Notes slides from before lecture. CSE 21, Winter 2017, Section A00. Lecture 16 Notes. Class URL: Notes slides from before lecture CSE 21, Winter 2017, Section A00 Lecture 16 Notes Class URL: http://vlsicad.ucsd.edu/courses/cse21-w17/ Notes slides from before lecture Notes March 8 (1) This week: Days

More information

CS 188: Artificial Intelligence Spring Announcements

CS 188: Artificial Intelligence Spring Announcements CS 188: Artificial Intelligence Spring 2011 Lecture 14: Bayes Nets II Independence 3/9/2011 Pieter Abbeel UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell, Andrew Moore Announcements

More information

Conditional Probability & Independence. Conditional Probabilities

Conditional Probability & Independence. Conditional Probabilities Conditional Probability & Independence Conditional Probabilities Question: How should we modify P(E) if we learn that event F has occurred? Definition: the conditional probability of E given F is P(E F

More information

Chapter 7 Wednesday, May 26th

Chapter 7 Wednesday, May 26th Chapter 7 Wednesday, May 26 th Random event A random event is an event that the outcome is unpredictable. Example: There are 45 students in this class. What is the probability that if I select one student,

More information

Discrete Structures for Computer Science

Discrete Structures for Computer Science Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #24: Probability Theory Based on materials developed by Dr. Adam Lee Not all events are equally likely

More information

STAT:5100 (22S:193) Statistical Inference I

STAT:5100 (22S:193) Statistical Inference I STAT:5100 (22S:193) Statistical Inference I Week 3 Luke Tierney University of Iowa Fall 2015 Luke Tierney (U Iowa) STAT:5100 (22S:193) Statistical Inference I Fall 2015 1 Recap Matching problem Generalized

More information

Topics. Probability Theory. Perfect Secrecy. Information Theory

Topics. Probability Theory. Perfect Secrecy. Information Theory Topics Probability Theory Perfect Secrecy Information Theory Some Terms (P,C,K,E,D) Computational Security Computational effort required to break cryptosystem Provable Security Relative to another, difficult

More information

Conditional Probability

Conditional Probability Conditional Probability When we obtain additional information about a probability experiment, we want to use the additional information to reassess the probabilities of events given the new information.

More information

Example. What is the sample space for flipping a fair coin? Rolling a 6-sided die? Find the event E where E = {x x has exactly one head}

Example. What is the sample space for flipping a fair coin? Rolling a 6-sided die? Find the event E where E = {x x has exactly one head} Chapter 7 Notes 1 (c) Epstein, 2013 CHAPTER 7: PROBABILITY 7.1: Experiments, Sample Spaces and Events Chapter 7 Notes 2 (c) Epstein, 2013 What is the sample space for flipping a fair coin three times?

More information

TOPIC 12 PROBABILITY SCHEMATIC DIAGRAM

TOPIC 12 PROBABILITY SCHEMATIC DIAGRAM TOPIC 12 PROBABILITY SCHEMATIC DIAGRAM Topic Concepts Degree of Importance References NCERT Book Vol. II Probability (i) Conditional Probability *** Article 1.2 and 1.2.1 Solved Examples 1 to 6 Q. Nos

More information

Mutually Exclusive Events

Mutually Exclusive Events 172 CHAPTER 3 PROBABILITY TOPICS c. QS, 7D, 6D, KS Mutually Exclusive Events A and B are mutually exclusive events if they cannot occur at the same time. This means that A and B do not share any outcomes

More information

Conditional Probability & Independence. Conditional Probabilities

Conditional Probability & Independence. Conditional Probabilities Conditional Probability & Independence Conditional Probabilities Question: How should we modify P(E) if we learn that event F has occurred? Definition: the conditional probability of E given F is P(E F

More information

CS 5522: Artificial Intelligence II

CS 5522: Artificial Intelligence II CS 5522: Artificial Intelligence II Bayes Nets Instructor: Alan Ritter Ohio State University [These slides were adapted from CS188 Intro to AI at UC Berkeley. All materials available at http://ai.berkeley.edu.]

More information

Conditional distributions

Conditional distributions Conditional distributions Will Monroe July 6, 017 with materials by Mehran Sahami and Chris Piech Independence of discrete random variables Two random variables are independent if knowing the value of

More information

Statistics Primer. A Brief Overview of Basic Statistical and Probability Principles. Essential Statistics for Data Analysts Using Excel

Statistics Primer. A Brief Overview of Basic Statistical and Probability Principles. Essential Statistics for Data Analysts Using Excel Statistics Primer A Brief Overview of Basic Statistical and Probability Principles Liberty J. Munson, PhD 9/19/16 Essential Statistics for Data Analysts Using Excel Table of Contents What is a Variable?...

More information

1 Probability Review. CS 124 Section #8 Hashing, Skip Lists 3/20/17. Expectation (weighted average): the expectation of a random quantity X is:

1 Probability Review. CS 124 Section #8 Hashing, Skip Lists 3/20/17. Expectation (weighted average): the expectation of a random quantity X is: CS 24 Section #8 Hashing, Skip Lists 3/20/7 Probability Review Expectation (weighted average): the expectation of a random quantity X is: x= x P (X = x) For each value x that X can take on, we look at

More information

Problem Set #2 Due: 1:00pm on Monday, Oct 15th

Problem Set #2 Due: 1:00pm on Monday, Oct 15th Chris Piech PSet #2 CS109 October 5, 2018 Problem Set #2 Due: 1:00pm on Monday, Oct 15th For each problem, briefly explain/justify how you obtained your answer in order to obtain full credit. Your explanations

More information

Dynamic Programming Lecture #4

Dynamic Programming Lecture #4 Dynamic Programming Lecture #4 Outline: Probability Review Probability space Conditional probability Total probability Bayes rule Independent events Conditional independence Mutual independence Probability

More information

TA Qinru Shi: Based on poll result, the first Programming Boot Camp will be: this Sunday 5 Feb, 7-8pm Gates 114.

TA Qinru Shi: Based on poll result, the first Programming Boot Camp will be: this Sunday 5 Feb, 7-8pm Gates 114. TA Qinru Shi: Based on poll result, the first Programming Boot Camp will be: this Sunday 5 Feb, 7-8pm Gates 114. Prob Set 1: to be posted tomorrow. due in roughly a week Finite probability space S 1) a

More information

CSE 312 Final Review: Section AA

CSE 312 Final Review: Section AA CSE 312 TAs December 8, 2011 General Information General Information Comprehensive Midterm General Information Comprehensive Midterm Heavily weighted toward material after the midterm Pre-Midterm Material

More information

Randomized Algorithms

Randomized Algorithms Randomized Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A new 4 credit unit course Part of Theoretical Computer Science courses at the Department of Mathematics There will be 4 hours

More information

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

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14 CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14 Introduction One of the key properties of coin flips is independence: if you flip a fair coin ten times and get ten

More information

Origins of Probability Theory

Origins of Probability Theory 1 16.584: INTRODUCTION Theory and Tools of Probability required to analyze and design systems subject to uncertain outcomes/unpredictability/randomness. Such systems more generally referred to as Experiments.

More information

Counting. 1 Sum Rule. Example 1. Lecture Notes #1 Sept 24, Chris Piech CS 109

Counting. 1 Sum Rule. Example 1. Lecture Notes #1 Sept 24, Chris Piech CS 109 1 Chris Piech CS 109 Counting Lecture Notes #1 Sept 24, 2018 Based on a handout by Mehran Sahami with examples by Peter Norvig Although you may have thought you had a pretty good grasp on the notion of

More information

STAT 285 Fall Assignment 1 Solutions

STAT 285 Fall Assignment 1 Solutions STAT 285 Fall 2014 Assignment 1 Solutions 1. An environmental agency sets a standard of 200 ppb for the concentration of cadmium in a lake. The concentration of cadmium in one lake is measured 17 times.

More information

Lecture 16. Lectures 1-15 Review

Lecture 16. Lectures 1-15 Review 18.440: Lecture 16 Lectures 1-15 Review Scott Sheffield MIT 1 Outline Counting tricks and basic principles of probability Discrete random variables 2 Outline Counting tricks and basic principles of probability

More information

CS 343: Artificial Intelligence

CS 343: Artificial Intelligence CS 343: Artificial Intelligence Bayes Nets Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188

More information

Uncertain Knowledge and Bayes Rule. George Konidaris

Uncertain Knowledge and Bayes Rule. George Konidaris Uncertain Knowledge and Bayes Rule George Konidaris gdk@cs.brown.edu Fall 2018 Knowledge Logic Logical representations are based on: Facts about the world. Either true or false. We may not know which.

More information

Debugging Intuition. How to calculate the probability of at least k successes in n trials?

Debugging Intuition. How to calculate the probability of at least k successes in n trials? How to calculate the probability of at least k successes in n trials? X is number of successes in n trials each with probability p # ways to choose slots for success Correct: Debugging Intuition P (X k)

More information

Probability and Independence Terri Bittner, Ph.D.

Probability and Independence Terri Bittner, Ph.D. Probability and Independence Terri Bittner, Ph.D. The concept of independence is often confusing for students. This brief paper will cover the basics, and will explain the difference between independent

More information

DEFINITION: IF AN OUTCOME OF A RANDOM EXPERIMENT IS CONVERTED TO A SINGLE (RANDOM) NUMBER (E.G. THE TOTAL

DEFINITION: IF AN OUTCOME OF A RANDOM EXPERIMENT IS CONVERTED TO A SINGLE (RANDOM) NUMBER (E.G. THE TOTAL CHAPTER 5: RANDOM VARIABLES, BINOMIAL AND POISSON DISTRIBUTIONS DEFINITION: IF AN OUTCOME OF A RANDOM EXPERIMENT IS CONVERTED TO A SINGLE (RANDOM) NUMBER (E.G. THE TOTAL NUMBER OF DOTS WHEN ROLLING TWO

More information

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

Monty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch Monty Hall Puzzle Example: You are asked to select one of the three doors to open. There is a large prize behind one of the doors and if you select that door, you win the prize. After you select a door,

More information

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas Bayesian Networks Vibhav Gogate The University of Texas at Dallas Intro to AI (CS 6364) Many slides over the course adapted from either Dan Klein, Luke Zettlemoyer, Stuart Russell or Andrew Moore 1 Outline

More information

Midterm 2 review. Day 15: Review

Midterm 2 review. Day 15: Review Midterm 2 review Physics 1010: Dr. Eleanor Hodby Day 15: Review Reminders: No new HW this week MIDTERM 2 ON THURSDAY Todays review Qs on website in full after class Reading quiz a week today: see website

More information

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

6.041/6.431 Spring 2009 Quiz 1 Wednesday, March 11, 7:30-9:30 PM. SOLUTIONS 6.0/6.3 Spring 009 Quiz Wednesday, March, 7:30-9:30 PM. SOLUTIONS Name: Recitation Instructor: Question Part Score Out of 0 all 0 a 5 b c 5 d 5 e 5 f 5 3 a b c d 5 e 5 f 5 g 5 h 5 Total 00 Write your solutions

More information

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

The enumeration of all possible outcomes of an experiment is called the sample space, denoted S. E.g.: S={head, tail} Random Experiment In random experiments, the result is unpredictable, unknown prior to its conduct, and can be one of several choices. Examples: The Experiment of tossing a coin (head, tail) The Experiment

More information

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

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability Lecture Notes 1 Basic Probability Set Theory Elements of Probability Conditional probability Sequential Calculation of Probability Total Probability and Bayes Rule Independence Counting EE 178/278A: Basic

More information

Chapter Summary. 7.1 Discrete Probability 7.2 Probability Theory 7.3 Bayes Theorem 7.4 Expected value and Variance

Chapter Summary. 7.1 Discrete Probability 7.2 Probability Theory 7.3 Bayes Theorem 7.4 Expected value and Variance Chapter 7 Chapter Summary 7.1 Discrete Probability 7.2 Probability Theory 7.3 Bayes Theorem 7.4 Expected value and Variance Section 7.1 Introduction Probability theory dates back to 1526 when the Italian

More information

Lecture 10: Bayes' Theorem, Expected Value and Variance Lecturer: Lale Özkahya

Lecture 10: Bayes' Theorem, Expected Value and Variance Lecturer: Lale Özkahya BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 10: Bayes' Theorem, Expected Value and Variance Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete

More information

CS 188: Artificial Intelligence Fall 2008

CS 188: Artificial Intelligence Fall 2008 CS 188: Artificial Intelligence Fall 2008 Lecture 14: Bayes Nets 10/14/2008 Dan Klein UC Berkeley 1 1 Announcements Midterm 10/21! One page note sheet Review sessions Friday and Sunday (similar) OHs on

More information

Math Tech IIII, Jan 21

Math Tech IIII, Jan 21 Math Tech IIII, Jan 21 Probability III The Complement of an Event, Theoretical and Experimental Probability Book Sections: 3.1 Essential Questions: How can I compute the probability of any event? What

More information

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

I - Probability. What is Probability? the chance of an event occuring. 1classical probability. 2empirical probability. 3subjective probability What is Probability? the chance of an event occuring eg 1classical probability 2empirical probability 3subjective probability Section 2 - Probability (1) Probability - Terminology random (probability)

More information

Human-Oriented Robotics. Probability Refresher. Kai Arras Social Robotics Lab, University of Freiburg Winter term 2014/2015

Human-Oriented Robotics. Probability Refresher. Kai Arras Social Robotics Lab, University of Freiburg Winter term 2014/2015 Probability Refresher Kai Arras, University of Freiburg Winter term 2014/2015 Probability Refresher Introduction to Probability Random variables Joint distribution Marginalization Conditional probability

More information

OCR Statistics 1 Probability. Section 1: Introducing probability

OCR Statistics 1 Probability. Section 1: Introducing probability OCR Statistics Probability Section : Introducing probability Notes and Examples These notes contain subsections on Notation Sample space diagrams The complement of an event Mutually exclusive events Probability

More information

Vibhav Gogate University of Texas, Dallas

Vibhav Gogate University of Texas, Dallas Review of Probability and Statistics 101 Elements of Probability Theory Events, Sample Space and Random Variables Axioms of Probability Independent Events Conditional Probability Bayes Theorem Joint Probability

More information

the time it takes until a radioactive substance undergoes a decay

the time it takes until a radioactive substance undergoes a decay 1 Probabilities 1.1 Experiments with randomness Wewillusethetermexperimentinaverygeneralwaytorefertosomeprocess that produces a random outcome. Examples: (Ask class for some first) Here are some discrete

More information

Bayesian Networks Basic and simple graphs

Bayesian Networks Basic and simple graphs Bayesian Networks Basic and simple graphs Ullrika Sahlin, Centre of Environmental and Climate Research Lund University, Sweden Ullrika.Sahlin@cec.lu.se http://www.cec.lu.se/ullrika-sahlin Bayesian [Belief]

More information

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

Probabilistic Models. Models describe how (a portion of) the world works Probabilistic Models Models describe how (a portion of) the world works Models are always simplifications May not account for every variable May not account for all interactions between variables All models

More information

Chapter Six. Approaches to Assigning Probabilities

Chapter Six. Approaches to Assigning Probabilities Chapter Six Probability 6.1 Approaches to Assigning Probabilities There are three ways to assign a probability, P(O i ), to an outcome, O i, namely: Classical approach: based on equally likely events.

More information

Chapter 6: Probability The Study of Randomness

Chapter 6: Probability The Study of Randomness Chapter 6: Probability The Study of Randomness 6.1 The Idea of Probability 6.2 Probability Models 6.3 General Probability Rules 1 Simple Question: If tossing a coin, what is the probability of the coin

More information

Recitation 2: Probability

Recitation 2: Probability Recitation 2: Probability Colin White, Kenny Marino January 23, 2018 Outline Facts about sets Definitions and facts about probability Random Variables and Joint Distributions Characteristics of distributions

More information

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas

Bayesian Networks. Vibhav Gogate The University of Texas at Dallas Bayesian Networks Vibhav Gogate The University of Texas at Dallas Intro to AI (CS 4365) Many slides over the course adapted from either Dan Klein, Luke Zettlemoyer, Stuart Russell or Andrew Moore 1 Outline

More information

Today. Statistical Learning. Coin Flip. Coin Flip. Experiment 1: Heads. Experiment 1: Heads. Which coin will I use? Which coin will I use?

Today. Statistical Learning. Coin Flip. Coin Flip. Experiment 1: Heads. Experiment 1: Heads. Which coin will I use? Which coin will I use? Today Statistical Learning Parameter Estimation: Maximum Likelihood (ML) Maximum A Posteriori (MAP) Bayesian Continuous case Learning Parameters for a Bayesian Network Naive Bayes Maximum Likelihood estimates

More information

BASICS OF PROBABILITY CHAPTER-1 CS6015-LINEAR ALGEBRA AND RANDOM PROCESSES

BASICS OF PROBABILITY CHAPTER-1 CS6015-LINEAR ALGEBRA AND RANDOM PROCESSES BASICS OF PROBABILITY CHAPTER-1 CS6015-LINEAR ALGEBRA AND RANDOM PROCESSES COMMON TERMS RELATED TO PROBABILITY Probability is the measure of the likelihood that an event will occur Probability values are

More information

Basic Concepts of Probability

Basic Concepts of Probability Probability Probability theory is the branch of math that deals with random events Probability is used to describe how likely a particular outcome is in a random event the probability of obtaining heads

More information

Brief Review of Probability

Brief Review of Probability Brief Review of Probability Nuno Vasconcelos (Ken Kreutz-Delgado) ECE Department, UCSD Probability Probability theory is a mathematical language to deal with processes or experiments that are non-deterministic

More information

Set/deck of playing cards. Spades Hearts Diamonds Clubs

Set/deck of playing cards. Spades Hearts Diamonds Clubs TC Mathematics S2 Coins Die dice Tale Head Set/deck of playing cards Spades Hearts Diamonds Clubs TC Mathematics S2 PROBABILITIES : intuitive? Experiment tossing a coin Event it s a head Probability 1/2

More information

Probabilistic Models

Probabilistic Models Bayes Nets 1 Probabilistic Models Models describe how (a portion of) the world works Models are always simplifications May not account for every variable May not account for all interactions between variables

More information

Econ 325: Introduction to Empirical Economics

Econ 325: Introduction to Empirical Economics Econ 325: Introduction to Empirical Economics Lecture 2 Probability Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall Ch. 3-1 3.1 Definition Random Experiment a process leading to an uncertain

More information

Fault-Tolerant Computer System Design ECE 60872/CS 590. Topic 2: Discrete Distributions

Fault-Tolerant Computer System Design ECE 60872/CS 590. Topic 2: Discrete Distributions Fault-Tolerant Computer System Design ECE 60872/CS 590 Topic 2: Discrete Distributions Saurabh Bagchi ECE/CS Purdue University Outline Basic probability Conditional probability Independence of events Series-parallel

More information