Lecture 13: Covariance. Lisa Yan July 25, 2018

Size: px
Start display at page:

Download "Lecture 13: Covariance. Lisa Yan July 25, 2018"

Transcription

1 Lecture 13: Covariance Lisa Yan July 25, 2018

2 Announcements Hooray midterm Grades (hopefully) by Monday Problem Set #3 Should be graded by Monday as well (instead of Friday) Quick note about Piazza 2

3 Goals for today As engineers, why are we doing all of this? Wrap-up of joint/independent RVs Covariance Definition, intuition, and properties Properties of independent RVs Correlation Bringing back the Poisson Paradigm 3

4 Where are we going with all of this? As engineers, we want to: 1. Model things that can be random. 2. Find average values of situations that let us make good decisions. So far we have learned: If possibilities are finite, we can count equally likely outcomes If we are dealing with a 1-D domain, we can use 1-D RVs with parameters But the real world is more complex: Multi-dimensional (e.g., 3-D world) We don t know parameters, much less what RV to use We perform multiple experiments to help us with engineering. (RVs) (expectation) 4

5 Where are we going with all of this? As engineers, we want to: 1. Model things that can be random. 2. Find average values of situations that let us make good decisions. We perform multiple experiments to help us with engineering. i.i.d.: We often want to aggregate the results of repeated experiments: Throwing darts or flipping coins Counts of successes or arrivals Clinical trials Or we just want to model more complex functions: Receiving a signal that had some added noise Receiving web server requests from different sources (RVs) (expectation) Averages/ Counts = sums Sums of things distributed similarly 5

6 Where are we going with all of this? As engineers, we want to: 1. Model things that can be random. 2. Find average values of situations that let us make good decisions. We perform multiple experiments to help us with engineering. Counts and averages are both sums of RVs. (RVs) (expectation) This week + last week: Defining joint PMF/PDF How to model sums of 2 RVs How to deal with uncertainty of model (coin flips only) Next week (week 6): Finding expectation of complex situations Defining sampling and using existing data Mathematical bounds w.r.t modeling the average Week 7: bringing it all together Sampling + average = Central Limit Theorem Samples + modeling = finding the best model parameters given data 6

7 Summary of last time Z = X + Y, where X and Y are independent RVs: $ % & = ( $ * (,)$. (&,) ) 0 % & = *, 0. &, 4, (discrete X and Y) (continuous X and Y) Convenient sums of independent RVs: Binomial: if same p of trial success, sum up trial counts n i Poisson: sum up rates " we proved that if X ~ Poi(lp) and Y ~ Poi(l(1-p)), X + Y ~ Poi(p). (Web Servers) Normal: sum up means, sum up variances On homework, you will find distribution of ax + by (linear comb. of normal) 7

8 Sum of independent uniform RVs Let X and Y be independent RVs, where X ~ Unif(0,1) and Y ~ Unif(0,1). What is the distribution of Z = X + Y? Solution: * " #$% & = ( " # &, " %, -, = ( " # &, " %, -, = ( )*.. Note: for different a, need bounds on y and a such that " # &, = 1 = ( / ( )/ 1 -, = & 0 & 1 1 -, = 2 & 1 & 2 0 otherwise / f X + Y (a) 1 1 / " # &, -, 2 a 8

9 Defects on a hard drive A single point defect is uniformly distributed over a disk of radius R. Are X and Y independent? Solution: ' " # = % ",) #, * +* = 1 -. &' / % +* 0: = & / % +* & 6 3 &2 3 " # = 2./ # / -. / If 0 #. If 0 #. ) * = 2./ y / -. / If 0 *., by symmetry 1 ",) #, * = 9-. / if # / + * /. / 0 otherwise " # > * ",) #, * No. X and Y are dependent 9

10 Defects on a hard drive A single point defect is uniformly distributed over a disk of radius R. Calculate the expected distance of the defect from the center, i.e., ", where D = % & + ( & ) Solution: = 7& 2 & : " = 8 ;(" > 7)?7 = = 8 9 : 1 7& 2 &?7 1 ) *,, -,. = / 12 & if - & +. & 2 & 0 otherwise : ( )?7 = 7 7A : 32 & CD9 =

11 Expectation as a summary For a single variable, we have a few summary values: Mean, " Variance (a measure of spread), Var " For two variables: In both distributions: " = $, Var " = Var $ Difference: how the two variables vary with each other. 11

12 Covariance The covariance of two variables X and Y is: Cov, # = % % # % # = % # % % # Proof of second part: Cov, # = % % # % # = % # % # % # + % % # = % # % % # % % # + % % % # = % # % # % % % # + % % # = % # % % # 12

13 Covariance of a die roll Roll our favorite 6-sided die. Define two indicator variables: X = 1 if roll in {1,2,3,4} Y = 1 if roll in {3,4,5,6} What is Cov(X,Y)? Solution: " = 2/3, ) = 2/3 Cov ", ) = ") " [)] ") = +, -./ 0,1 (-,.) = = 7 8 Cov ", ) = ") " ) = 7 8 ; < = 7 < What does negative covariance mean? Consider:? " = 1 = 2/3, whereas? " = 1 ) = 1 = 1/2 Observing Y = 1 (positive) makes X = 1 (positive) less likely 13

14 Covariance of humans Cov 0, 1 = [1] Weight Height W H = # = # = What is the covariance of weight (W) and height (H)? Solution: Cov, # = = What does positive covariance mean? Observing high W makes high H more likely 14

15 Covariance Q: Is the covariance positive, negative, or zero? A: positive 15

16 Properties of Covariance Let X and Y be arbitrary random variables Cov, # = % % # % # = % # % % # Symmetry: Cov, # = Cov #, Variance, redefined: Cov, = % % % = Var Non-linear: Cov ' + ), # = 'Cov, # Covariance and sums of X 1, X 2,, X n and Y 1, Y 2,, Y m : Cov + +,, #, = +, Cov +, #, (covariance of all pairs) 16

17 Variance of Sums of Variables Proof: % Var "#$ % & " = "#$ % Var & " + 2 "#$ % *#+,$ Cov & ", & * For 2 variables: Var & +. = Var & + Var. + 2Cov &,. Var % "#$ & " = Cov % "#$ & ", % "#$ & " (Cov &, & = Var & ) = % % "#$ *#$ Cov & ", & * = % "#$ Var & " + % % "#$ *#$,*0" = % "#$ Var & " + 2 % % "#$ *#+,$ Cov & ", & * Cov & ", & * (covariance of all pairs) (symmetry) 17

18 Break Attendance: tinyurl.com/cs109summer

19 Independent RVs Definition: Two random variables X and Y are independent if: ",$ %, & = " % $ & ( ",$ %, & = ( " % ( $ & ) ",$ %, & = ) " % ) $ & (discrete) (continuous) (any X and Y) By definition these are bidirectional Properties of independence (next 2 slides) Not bidirectional If X and Y are independent, then these properties hold. If these properties hold, X and Y are not necessarily independent. 19

20 Product of independent RVs If X and Y are independent, then: "# = " # % " h # = % " h # Proof: % " h # = () ) () ) % * h +,-,/ *, + 0* 0+ ) ) = () () % * h +,- *, / + 0* 0+ ) ) = () h +,/ + 0+ () % *,- * 0* ) ) = () % *,- * 0* () h +,/ + 0+ = % " h # 20

21 Independent RVs Definition: Two random variables X and Y are independent if: ) *,+,, - = ) *, ) + -. *,+,, - =. *,. + - / *,+,, - = / *, / + - (discrete) (continuous) (any X and Y) By definition these are bidirectional Properties of independence: "# = " # Cov ", # = 0 Var " + # = Var " + Var # + 2Cov ", # = Var " + Var # Not bidirectional 21

22 Covariance does not imply independence Let take on values 1,0,1 with equal probability (1/3). 1 if X=0 Define & = ( 0 otherwise Y X p Y (y) 0 1/3 0 1/3 2/ /3 0 1/3 1. What are )[] and )[&]? p X (x) 1/3 1/3 1/3 1 ) = 1, - + 0, - + 1, - = 0 ) & = 0 / - + 1, - =, - 2. What is the covariance of X and Y? & = 0 for all X and Y Cov, & = ) & ) ) & = 0 0, = 0-3. Are X and Y independent? 0 & = 0 = 1 = 0 2/3 = 0(& = 0) No Even though X and Y are clearly dependent 22

23 Statistics of functions of 2 RVs Sum: always can be separated, regardless of independence " + $ = " + $ Product: can only be separated if X, Y independent "$ = " $ Variance for any X and Y: Var " + $ = Var " + Var $ + 2Cov ", $ Variance for X, Y independent: Var " + $ = Var " + Var $ If all X 1, X 2,, X n are independent:, Var ( " ) = ( Var " ) )*+, )*+ 23

24 Variance of Binomial For a binomial RV X~Bin(n,p), " # = %& (expectation of sum = sum of expectation) Proof of variance: Var # = %&(1 &) Define: # + as an indicator variable for success on trial,. - # + = 1 = & 1 Var # = Var. +/0 # + 1 =. +/0 Variance of sum of independent RVs = sum of variance 1 Var # + =. +/0 &(1 &) Variance of Bernoulli = %&(1 &) 24

25 Correlation The correlation of two random variables X and Y is Cov ", $ ", $ = Var " Var $ Note: 1 ", $ 1 Measures the linearity of the relationship between X and Y: If $ = )" + +, then Cov ", $ = Cov ", )" + + = )Cov ", " = )Var " = sgn()) ) 1 (Var " ) 1 = sgn()) () 1 Var " )Var " = sgn()) Var $ Var " ", $ = sgn()) (sgn()): sign of )) 25

26 Correlation quantifies linearity ", $ = Cov ", $ Var " Var $ ", $ = 1 $ = )" + + ) =, - /, / ", $ = 0 ", $ = 1 uncorrelated $ = )" + + ) =, - /, / Var $ = Var )" + + =, -, / 0 Var " =, - 0 $ = " 0 No linear relationship == Cov(X,Y) = 0, but X and Y could be nonlinearly related 26

27 Spurious Correlations ", $ is used a lot in statistics to quantify the relationship b/t X and Y. Correlation: Correlation does not imply causation 27

28 Do indicator variables correlate? Define indicator variables " and # for events A and B. 1 if + occurs " = 2 0 otherwise What is Cov ", #? Solution: %[ " ] = )(+), %[ # ] = )(-), % " # = ) +- = ) + - )(-) Cov ", # = % " # % " % # = ) + - ) - ) + )(-) à Sign of Cov ", # determined by ) + - ) + = ) - ) + - ) + 1 if - occurs # = 2 0 otherwise (in terms of P(A), P(B), P(A B) ) + - > ) + Þ / ", # > 0 / 0, 1 = ) + - = ) + Þ / ", # = 0 (independence, Cov( ", # ) = 0 ) + - < ) + Þ / ", # < 0 Cov 0, 1 Var 0 Var 1 28

29 Multinomial Random Variable Consider n independent trials of an experiment. Each trial results in one of m outcomes, with respective probabilities ( ", ( ),, ( % where % 23" ( 2 = 1 2 is number of trials with outcome k for k = 1,..., m. ",, % Mul& ', ( ", ( ),, ( % * " =, ", ) =, ),, % =, % = where % 23", 2 = ' and ', ",, ),,, % ( " -. ( ) - / ( % - 0 ', ",, ),,, % is a multinomial coefficient. We expect that the 2 are negatively correlated. 29

30 Covariance of the multinomial Consider n independent trials of an experiment. Each trial results in one of m outcomes, w.p. ", $,, & where & ()" ( = 1, ( is number of trials with outcome k for k = 1,..., m. What is Cov, -,, (, where. 0? Say, rolls of 3 and rolls of 5 Solution: Define:Indicator 1 ( 2 = 1 if trial 2 has outcome 0, 0 otherwise 3 1 ( 2 = (,, ( = 5 4)" 1 ( = -,, - = 5 4)" 1-2 Cov, -,, ( = 5 6)" 5 =)" Cov 1-7, 1 ( < = 5 6)=)" Cov 1-7, 1 ( < = 5 6)" ( ( 7 = 5 6)" ( 7 = 5 6)" ( - ( ) = ; - ( sum of pairwise covariances a b: trial a and b independent, Cov 1-7, 1 ( < = 0 trial a cannot have outcome i and j, ( 7 =0, -,, ( are negatively correlated. 30

31 The Poisson Paradigm Multinomial distributions: Count of strings hashed to buckets in hash table Number of server requests across machines in cluster Distribution of words/tokens in an Etc. When (# outcomes) is large, " # is small, and for equally likely outcomes, where " # = % & : Cov ' (, ' # = +" ( " # = +, à 0 as m gets large For large, ' (, ' # are very mildly negatively correlated, and the Poisson paradigm is applicable. 31

32 Summary of this time Cov, # = % % # % # = % # % % # Covariance is a linear relationship. Independence: Implies uncorrelated (but uncorrelated does NOT imply independence) For n independent variables: Var + ()* ( = + ()* Var ( Correlation is a normalized version of Covariance: Cov, #,, # = Var Var # 32

Lecture 08: Poisson and More. Lisa Yan July 13, 2018

Lecture 08: Poisson and More. Lisa Yan July 13, 2018 Lecture 08: Poisson and More Lisa Yan July 13, 2018 Announcements PS1: Grades out later today Solutions out after class today PS2 due today PS3 out today (due next Friday 7/20) 2 Midterm announcement Tuesday,

More information

Poisson Chris Piech CS109, Stanford University. Piech, CS106A, Stanford University

Poisson Chris Piech CS109, Stanford University. Piech, CS106A, Stanford University Poisson Chris Piech CS109, Stanford University Piech, CS106A, Stanford University Probability for Extreme Weather? Piech, CS106A, Stanford University Four Prototypical Trajectories Review Binomial Random

More information

Lecture 18: Central Limit Theorem. Lisa Yan August 6, 2018

Lecture 18: Central Limit Theorem. Lisa Yan August 6, 2018 Lecture 18: Central Limit Theorem Lisa Yan August 6, 2018 Announcements PS5 due today Pain poll PS6 out today Due next Monday 8/13 (1:30pm) (will not be accepted after Wed 8/15) Programming part: Java,

More information

Lecture 10: Normal RV. Lisa Yan July 18, 2018

Lecture 10: Normal RV. Lisa Yan July 18, 2018 Lecture 10: Normal RV Lisa Yan July 18, 2018 Announcements Midterm next Tuesday Practice midterm, solutions out on website SCPD students: fill out Google form by today Covers up to and including Friday

More information

Review of Probability. CS1538: Introduction to Simulations

Review of Probability. CS1538: Introduction to Simulations Review of Probability CS1538: Introduction to Simulations Probability and Statistics in Simulation Why do we need probability and statistics in simulation? Needed to validate the simulation model Needed

More information

Lecture 10: Probability distributions TUESDAY, FEBRUARY 19, 2019

Lecture 10: Probability distributions TUESDAY, FEBRUARY 19, 2019 Lecture 10: Probability distributions DANIEL WELLER TUESDAY, FEBRUARY 19, 2019 Agenda What is probability? (again) Describing probabilities (distributions) Understanding probabilities (expectation) Partial

More information

CMPSCI 240: Reasoning Under Uncertainty

CMPSCI 240: Reasoning Under Uncertainty CMPSCI 240: Reasoning Under Uncertainty Lecture 5 Prof. Hanna Wallach wallach@cs.umass.edu February 7, 2012 Reminders Pick up a copy of B&T Check the course website: http://www.cs.umass.edu/ ~wallach/courses/s12/cmpsci240/

More information

Discrete Probability Distributions

Discrete Probability Distributions Discrete Probability Distributions EGR 260 R. Van Til Industrial & Systems Engineering Dept. Copyright 2013. Robert P. Van Til. All rights reserved. 1 What s It All About? The behavior of many random processes

More information

Lecture 2: Repetition of probability theory and statistics

Lecture 2: Repetition of probability theory and statistics Algorithms for Uncertainty Quantification SS8, IN2345 Tobias Neckel Scientific Computing in Computer Science TUM Lecture 2: Repetition of probability theory and statistics Concept of Building Block: Prerequisites:

More information

Probability Theory for Machine Learning. Chris Cremer September 2015

Probability Theory for Machine Learning. Chris Cremer September 2015 Probability Theory for Machine Learning Chris Cremer September 2015 Outline Motivation Probability Definitions and Rules Probability Distributions MLE for Gaussian Parameter Estimation MLE and Least Squares

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

Review of probability

Review of probability Review of probability Computer Sciences 760 Spring 2014 http://pages.cs.wisc.edu/~dpage/cs760/ Goals for the lecture you should understand the following concepts definition of probability random variables

More information

Stat Lecture 20. Last class we introduced the covariance and correlation between two jointly distributed random variables.

Stat Lecture 20. Last class we introduced the covariance and correlation between two jointly distributed random variables. Stat 260 - Lecture 20 Recap of Last Class Last class we introduced the covariance and correlation between two jointly distributed random variables. Today: We will introduce the idea of a statistic and

More information

IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS LECTURE 3-RANDOM VARIABLES

IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS LECTURE 3-RANDOM VARIABLES IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS LECTURE 3-RANDOM VARIABLES VARIABLE Studying the behavior of random variables, and more importantly functions of random variables is essential for both the

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

STAT2201. Analysis of Engineering & Scientific Data. Unit 3

STAT2201. Analysis of Engineering & Scientific Data. Unit 3 STAT2201 Analysis of Engineering & Scientific Data Unit 3 Slava Vaisman The University of Queensland School of Mathematics and Physics What we learned in Unit 2 (1) We defined a sample space of a random

More information

Discrete probability distributions

Discrete probability distributions Discrete probability s BSAD 30 Dave Novak Fall 08 Source: Anderson et al., 05 Quantitative Methods for Business th edition some slides are directly from J. Loucks 03 Cengage Learning Covered so far Chapter

More information

a zoo of (discrete) random variables

a zoo of (discrete) random variables a zoo of (discrete) random variables 42 uniform random variable Takes each possible value, say {1..n} with equal probability. Say random variable uniform on S Recall envelopes problem on homework... Randomization

More information

Intro to Probability. Andrei Barbu

Intro to Probability. Andrei Barbu Intro to Probability Andrei Barbu Some problems Some problems A means to capture uncertainty Some problems A means to capture uncertainty You have data from two sources, are they different? Some problems

More information

Probability Density Functions and the Normal Distribution. Quantitative Understanding in Biology, 1.2

Probability Density Functions and the Normal Distribution. Quantitative Understanding in Biology, 1.2 Probability Density Functions and the Normal Distribution Quantitative Understanding in Biology, 1.2 1. Discrete Probability Distributions 1.1. The Binomial Distribution Question: You ve decided to flip

More information

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

ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Random Variable Discrete Random

More information

Lecture 1: Basics of Probability

Lecture 1: Basics of Probability Lecture 1: Basics of Probability (Luise-Vitetta, Chapter 8) Why probability in data science? Data acquisition is noisy Sampling/quantization external factors: If you record your voice saying machine learning

More information

MLE/MAP + Naïve Bayes

MLE/MAP + Naïve Bayes 10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University MLE/MAP + Naïve Bayes Matt Gormley Lecture 19 March 20, 2018 1 Midterm Exam Reminders

More information

a zoo of (discrete) random variables

a zoo of (discrete) random variables discrete uniform random variables A discrete random variable X equally liely to tae any (integer) value between integers a and b, inclusive, is uniform. Notation: X ~ Unif(a,b) a zoo of (discrete) random

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

Chapter 2: The Random Variable

Chapter 2: The Random Variable Chapter : The Random Variable The outcome of a random eperiment need not be a number, for eample tossing a coin or selecting a color ball from a bo. However we are usually interested not in the outcome

More information

MATH 10 INTRODUCTORY STATISTICS

MATH 10 INTRODUCTORY STATISTICS MATH 10 INTRODUCTORY STATISTICS Ramesh Yapalparvi Week 2 Chapter 4 Bivariate Data Data with two/paired variables, Pearson correlation coefficient and its properties, general variance sum law Chapter 6

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

Lecture Notes 5 Convergence and Limit Theorems. Convergence with Probability 1. Convergence in Mean Square. Convergence in Probability, WLLN

Lecture Notes 5 Convergence and Limit Theorems. Convergence with Probability 1. Convergence in Mean Square. Convergence in Probability, WLLN Lecture Notes 5 Convergence and Limit Theorems Motivation Convergence with Probability Convergence in Mean Square Convergence in Probability, WLLN Convergence in Distribution, CLT EE 278: Convergence and

More information

Why study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables

Why study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables ECE 6010 Lecture 1 Introduction; Review of Random Variables Readings from G&S: Chapter 1. Section 2.1, Section 2.3, Section 2.4, Section 3.1, Section 3.2, Section 3.5, Section 4.1, Section 4.2, Section

More information

Stochastic Models of Manufacturing Systems

Stochastic Models of Manufacturing Systems Stochastic Models of Manufacturing Systems Ivo Adan Organization 2/47 7 lectures (lecture of May 12 is canceled) Studyguide available (with notes, slides, assignments, references), see http://www.win.tue.nl/

More information

Introduction and Overview STAT 421, SP Course Instructor

Introduction and Overview STAT 421, SP Course Instructor Introduction and Overview STAT 421, SP 212 Prof. Prem K. Goel Mon, Wed, Fri 3:3PM 4:48PM Postle Hall 118 Course Instructor Prof. Goel, Prem E mail: goel.1@osu.edu Office: CH 24C (Cockins Hall) Phone: 614

More information

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 10 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 10 Notes Midterm Good job overall! = 81; =

More information

Bivariate distributions

Bivariate distributions Bivariate distributions 3 th October 017 lecture based on Hogg Tanis Zimmerman: Probability and Statistical Inference (9th ed.) Bivariate Distributions of the Discrete Type The Correlation Coefficient

More information

CS 1538: Introduction to Simulation Homework 1

CS 1538: Introduction to Simulation Homework 1 CS 1538: Introduction to Simulation Homework 1 1. A fair six-sided die is rolled three times. Let X be a random variable that represents the number of unique outcomes in the three tosses. For example,

More information

Lecture On Probability Distributions

Lecture On Probability Distributions Lecture On Probability Distributions 1 Random Variables & Probability Distributions Earlier we defined a random variable as a way of associating each outcome in a sample space with a real number. In our

More information

ECE531: Principles of Detection and Estimation Course Introduction

ECE531: Principles of Detection and Estimation Course Introduction ECE531: Principles of Detection and Estimation Course Introduction D. Richard Brown III WPI 15-January-2013 WPI D. Richard Brown III 15-January-2013 1 / 39 First Lecture: Major Topics 1. Administrative

More information

Bandits, Experts, and Games

Bandits, Experts, and Games Bandits, Experts, and Games CMSC 858G Fall 2016 University of Maryland Intro to Probability* Alex Slivkins Microsoft Research NYC * Many of the slides adopted from Ron Jin and Mohammad Hajiaghayi Outline

More information

Algorithms for Uncertainty Quantification

Algorithms for Uncertainty Quantification Algorithms for Uncertainty Quantification Tobias Neckel, Ionuț-Gabriel Farcaș Lehrstuhl Informatik V Summer Semester 2017 Lecture 2: Repetition of probability theory and statistics Example: coin flip Example

More information

Data Mining Techniques. Lecture 3: Probability

Data Mining Techniques. Lecture 3: Probability Data Mining Techniques CS 6220 - Section 3 - Fall 2016 Lecture 3: Probability Jan-Willem van de Meent (credit: Zhao, CS 229, Bishop) Project Vote 1. Freeform: Develop your own project proposals 30% of

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

L2: Review of probability and statistics

L2: Review of probability and statistics Probability L2: Review of probability and statistics Definition of probability Axioms and properties Conditional probability Bayes theorem Random variables Definition of a random variable Cumulative distribution

More information

P (A) = P (B) = P (C) = P (D) =

P (A) = P (B) = P (C) = P (D) = STAT 145 CHAPTER 12 - PROBABILITY - STUDENT VERSION The probability of a random event, is the proportion of times the event will occur in a large number of repititions. For example, when flipping a coin,

More information

Lecture 2 Binomial and Poisson Probability Distributions

Lecture 2 Binomial and Poisson Probability Distributions Binomial Probability Distribution Lecture 2 Binomial and Poisson Probability Distributions Consider a situation where there are only two possible outcomes (a Bernoulli trial) Example: flipping a coin James

More information

Probability. Machine Learning and Pattern Recognition. Chris Williams. School of Informatics, University of Edinburgh. August 2014

Probability. Machine Learning and Pattern Recognition. Chris Williams. School of Informatics, University of Edinburgh. August 2014 Probability Machine Learning and Pattern Recognition Chris Williams School of Informatics, University of Edinburgh August 2014 (All of the slides in this course have been adapted from previous versions

More information

Naïve Bayes Introduction to Machine Learning. Matt Gormley Lecture 18 Oct. 31, 2018

Naïve Bayes Introduction to Machine Learning. Matt Gormley Lecture 18 Oct. 31, 2018 10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University Naïve Bayes Matt Gormley Lecture 18 Oct. 31, 2018 1 Reminders Homework 6: PAC Learning

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

Probability: Why do we care? Lecture 2: Probability and Distributions. Classical Definition. What is Probability?

Probability: Why do we care? Lecture 2: Probability and Distributions. Classical Definition. What is Probability? Probability: Why do we care? Lecture 2: Probability and Distributions Sandy Eckel seckel@jhsph.edu 22 April 2008 Probability helps us by: Allowing us to translate scientific questions into mathematical

More information

Discrete Random Variable

Discrete Random Variable Discrete Random Variable Outcome of a random experiment need not to be a number. We are generally interested in some measurement or numerical attribute of the outcome, rather than the outcome itself. n

More information

Math Review Sheet, Fall 2008

Math Review Sheet, Fall 2008 1 Descriptive Statistics Math 3070-5 Review Sheet, Fall 2008 First we need to know about the relationship among Population Samples Objects The distribution of the population can be given in one of the

More information

CSE 103 Homework 8: Solutions November 30, var(x) = np(1 p) = P r( X ) 0.95 P r( X ) 0.

CSE 103 Homework 8: Solutions November 30, var(x) = np(1 p) = P r( X ) 0.95 P r( X ) 0. () () a. X is a binomial distribution with n = 000, p = /6 b. The expected value, variance, and standard deviation of X is: E(X) = np = 000 = 000 6 var(x) = np( p) = 000 5 6 666 stdev(x) = np( p) = 000

More information

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 8 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 8 Notes Goals for Today Counting Partitions

More information

CSE 312, 2011 Winter, W.L.Ruzzo. 6. random variables

CSE 312, 2011 Winter, W.L.Ruzzo. 6. random variables CSE 312, 2011 Winter, W.L.Ruzzo 6. random variables random variables 23 numbered balls Ross 4.1 ex 1b 24 first head 25 probability mass functions 26 head count Let X be the number of heads observed in

More information

Probability and Statistics

Probability and Statistics Probability and Statistics 1 Contents some stochastic processes Stationary Stochastic Processes 2 4. Some Stochastic Processes 4.1 Bernoulli process 4.2 Binomial process 4.3 Sine wave process 4.4 Random-telegraph

More information

Announcements Monday, September 18

Announcements Monday, September 18 Announcements Monday, September 18 WeBWorK 1.4, 1.5 are due on Wednesday at 11:59pm. The first midterm is on this Friday, September 22. Midterms happen during recitation. The exam covers through 1.5. About

More information

SS257a Midterm Exam Monday Oct 27 th 2008, 6:30-9:30 PM Talbot College 342 and 343. You may use simple, non-programmable scientific calculators.

SS257a Midterm Exam Monday Oct 27 th 2008, 6:30-9:30 PM Talbot College 342 and 343. You may use simple, non-programmable scientific calculators. SS657a Midterm Exam, October 7 th 008 pg. SS57a Midterm Exam Monday Oct 7 th 008, 6:30-9:30 PM Talbot College 34 and 343 You may use simple, non-programmable scientific calculators. This exam has 5 questions

More information

Probability and Statistics for Engineers

Probability and Statistics for Engineers Probability and Statistics for Engineers Chapter 4 Probability Distributions Ruochen Liu Ruochenliu@xidian.edu.cn Institute of Intelligent Information Processing, Xidian University Outline Random variables

More information

ECE 450 Homework #3. 1. Given the joint density function f XY (x,y) = 0.5 1<x<2, 2<y< <x<4, 2<y<3 0 else

ECE 450 Homework #3. 1. Given the joint density function f XY (x,y) = 0.5 1<x<2, 2<y< <x<4, 2<y<3 0 else ECE 450 Homework #3 0. Consider the random variables X and Y, whose values are a function of the number showing when a single die is tossed, as show below: Exp. Outcome 1 3 4 5 6 X 3 3 4 4 Y 0 1 3 4 5

More information

Introduction to Bayesian Learning. Machine Learning Fall 2018

Introduction to Bayesian Learning. Machine Learning Fall 2018 Introduction to Bayesian Learning Machine Learning Fall 2018 1 What we have seen so far What does it mean to learn? Mistake-driven learning Learning by counting (and bounding) number of mistakes PAC learnability

More information

Introduction to discrete probability. The rules Sample space (finite except for one example)

Introduction to discrete probability. The rules Sample space (finite except for one example) Algorithms lecture notes 1 Introduction to discrete probability The rules Sample space (finite except for one example) say Ω. P (Ω) = 1, P ( ) = 0. If the items in the sample space are {x 1,..., x n }

More information

The Binomial distribution. Probability theory 2. Example. The Binomial distribution

The Binomial distribution. Probability theory 2. Example. The Binomial distribution Probability theory Tron Anders Moger September th 7 The Binomial distribution Bernoulli distribution: One experiment X i with two possible outcomes, probability of success P. If the experiment is repeated

More information

Introduction to Stochastic Processes

Introduction to Stochastic Processes Stat251/551 (Spring 2017) Stochastic Processes Lecture: 1 Introduction to Stochastic Processes Lecturer: Sahand Negahban Scribe: Sahand Negahban 1 Organization Issues We will use canvas as the course webpage.

More information

Chapter 5 continued. Chapter 5 sections

Chapter 5 continued. Chapter 5 sections Chapter 5 sections Discrete univariate distributions: 5.2 Bernoulli and Binomial distributions Just skim 5.3 Hypergeometric distributions 5.4 Poisson distributions Just skim 5.5 Negative Binomial distributions

More information

PROBABILITY AND INFORMATION THEORY. Dr. Gjergji Kasneci Introduction to Information Retrieval WS

PROBABILITY AND INFORMATION THEORY. Dr. Gjergji Kasneci Introduction to Information Retrieval WS PROBABILITY AND INFORMATION THEORY Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Probability space Rules of probability

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

MATH 10 INTRODUCTORY STATISTICS

MATH 10 INTRODUCTORY STATISTICS MATH 10 INTRODUCTORY STATISTICS Ramesh Yapalparvi It is Time for Homework! ( ω `) First homework + data will be posted on the website, under the homework tab. And also sent out via email. 30% weekly homework.

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

Introduction to Probability and Statistics (Continued)

Introduction to Probability and Statistics (Continued) Introduction to Probability and Statistics (Continued) Prof. icholas Zabaras Center for Informatics and Computational Science https://cics.nd.edu/ University of otre Dame otre Dame, Indiana, USA Email:

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

3 Multiple Discrete Random Variables

3 Multiple Discrete Random Variables 3 Multiple Discrete Random Variables 3.1 Joint densities Suppose we have a probability space (Ω, F,P) and now we have two discrete random variables X and Y on it. They have probability mass functions f

More information

Discrete Random Variables

Discrete Random Variables Discrete Random Variables An Undergraduate Introduction to Financial Mathematics J. Robert Buchanan Introduction The markets can be thought of as a complex interaction of a large number of random processes,

More information

CS 4649/7649 Robot Intelligence: Planning

CS 4649/7649 Robot Intelligence: Planning CS 4649/7649 Robot Intelligence: Planning Probability Primer Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu) 1 *Slides

More information

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 10 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 10 Notes Midterm Good job overall! = 81; =

More information

UVA CS 6316/4501 Fall 2016 Machine Learning. Lecture 11: Probability Review. Dr. Yanjun Qi. University of Virginia. Department of Computer Science

UVA CS 6316/4501 Fall 2016 Machine Learning. Lecture 11: Probability Review. Dr. Yanjun Qi. University of Virginia. Department of Computer Science UVA CS 6316/4501 Fall 2016 Machine Learning Lecture 11: Probability Review 10/17/16 Dr. Yanjun Qi University of Virginia Department of Computer Science 1 Announcements: Schedule Midterm Nov. 26 Wed / 3:30pm

More information

Review of Probabilities and Basic Statistics

Review of Probabilities and Basic Statistics Alex Smola Barnabas Poczos TA: Ina Fiterau 4 th year PhD student MLD Review of Probabilities and Basic Statistics 10-701 Recitations 1/25/2013 Recitation 1: Statistics Intro 1 Overview Introduction to

More information

CS37300 Class Notes. Jennifer Neville, Sebastian Moreno, Bruno Ribeiro

CS37300 Class Notes. Jennifer Neville, Sebastian Moreno, Bruno Ribeiro CS37300 Class Notes Jennifer Neville, Sebastian Moreno, Bruno Ribeiro 2 Background on Probability and Statistics These are basic definitions, concepts, and equations that should have been covered in your

More information

Topic 3: The Expectation of a Random Variable

Topic 3: The Expectation of a Random Variable Topic 3: The Expectation of a Random Variable Course 003, 2016 Page 0 Expectation of a discrete random variable Definition: The expected value of a discrete random variable exists, and is defined by EX

More information

Monte Carlo Integration. Computer Graphics CMU /15-662, Fall 2016

Monte Carlo Integration. Computer Graphics CMU /15-662, Fall 2016 Monte Carlo Integration Computer Graphics CMU 15-462/15-662, Fall 2016 Talk Announcement Jovan Popovic, Senior Principal Scientist at Adobe Research will be giving a seminar on Character Animator -- Monday

More information

EXPECTED VALUE of a RV. corresponds to the average value one would get for the RV when repeating the experiment, =0.

EXPECTED VALUE of a RV. corresponds to the average value one would get for the RV when repeating the experiment, =0. EXPECTED VALUE of a RV corresponds to the average value one would get for the RV when repeating the experiment, independently, infinitely many times. Sample (RIS) of n values of X (e.g. More accurately,

More information

POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS

POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS 1.1. The Rutherford-Chadwick-Ellis Experiment. About 90 years ago Ernest Rutherford and his collaborators at the Cavendish Laboratory in Cambridge conducted

More information

CMPT 882 Machine Learning

CMPT 882 Machine Learning CMPT 882 Machine Learning Lecture Notes Instructor: Dr. Oliver Schulte Scribe: Qidan Cheng and Yan Long Mar. 9, 2004 and Mar. 11, 2004-1 - Basic Definitions and Facts from Statistics 1. The Binomial Distribution

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

Fundamentals. CS 281A: Statistical Learning Theory. Yangqing Jia. August, Based on tutorial slides by Lester Mackey and Ariel Kleiner

Fundamentals. CS 281A: Statistical Learning Theory. Yangqing Jia. August, Based on tutorial slides by Lester Mackey and Ariel Kleiner Fundamentals CS 281A: Statistical Learning Theory Yangqing Jia Based on tutorial slides by Lester Mackey and Ariel Kleiner August, 2011 Outline 1 Probability 2 Statistics 3 Linear Algebra 4 Optimization

More information

Single Maths B: Introduction to Probability

Single Maths B: Introduction to Probability Single Maths B: Introduction to Probability Overview Lecturer Email Office Homework Webpage Dr Jonathan Cumming j.a.cumming@durham.ac.uk CM233 None! http://maths.dur.ac.uk/stats/people/jac/singleb/ 1 Introduction

More information

An-Najah National University Faculty of Engineering Industrial Engineering Department. Course : Quantitative Methods (65211)

An-Najah National University Faculty of Engineering Industrial Engineering Department. Course : Quantitative Methods (65211) An-Najah National University Faculty of Engineering Industrial Engineering Department Course : Quantitative Methods (65211) Instructor: Eng. Tamer Haddad 2 nd Semester 2009/2010 Chapter 3 Discrete Random

More information

Relationship between probability set function and random variable - 2 -

Relationship between probability set function and random variable - 2 - 2.0 Random Variables A rat is selected at random from a cage and its sex is determined. The set of possible outcomes is female and male. Thus outcome space is S = {female, male} = {F, M}. If we let X be

More information

Lecture 2: Review of Basic Probability Theory

Lecture 2: Review of Basic Probability Theory ECE 830 Fall 2010 Statistical Signal Processing instructor: R. Nowak, scribe: R. Nowak Lecture 2: Review of Basic Probability Theory Probabilistic models will be used throughout the course to represent

More information

Random variables (discrete)

Random variables (discrete) Random variables (discrete) Saad Mneimneh 1 Introducing random variables A random variable is a mapping from the sample space to the real line. We usually denote the random variable by X, and a value that

More information

Joint Distribution of Two or More Random Variables

Joint Distribution of Two or More Random Variables Joint Distribution of Two or More Random Variables Sometimes more than one measurement in the form of random variable is taken on each member of the sample space. In cases like this there will be a few

More information

Lecture 2: Probability and Distributions

Lecture 2: Probability and Distributions Lecture 2: Probability and Distributions Ani Manichaikul amanicha@jhsph.edu 17 April 2007 1 / 65 Probability: Why do we care? Probability helps us by: Allowing us to translate scientific questions info

More information

Bayesian Models in Machine Learning

Bayesian Models in Machine Learning Bayesian Models in Machine Learning Lukáš Burget Escuela de Ciencias Informáticas 2017 Buenos Aires, July 24-29 2017 Frequentist vs. Bayesian Frequentist point of view: Probability is the frequency of

More information

Continuous Variables Chris Piech CS109, Stanford University

Continuous Variables Chris Piech CS109, Stanford University Continuous Variables Chris Piech CS109, Stanford University 1906 Earthquak Magnitude 7.8 Learning Goals 1. Comfort using new discrete random variables 2. Integrate a density function (PDF) to get a probability

More information

Decision Trees. CSC411/2515: Machine Learning and Data Mining, Winter 2018 Luke Zettlemoyer, Carlos Guestrin, and Andrew Moore

Decision Trees. CSC411/2515: Machine Learning and Data Mining, Winter 2018 Luke Zettlemoyer, Carlos Guestrin, and Andrew Moore Decision Trees Claude Monet, The Mulberry Tree Slides from Pedro Domingos, CSC411/2515: Machine Learning and Data Mining, Winter 2018 Luke Zettlemoyer, Carlos Guestrin, and Andrew Moore Michael Guerzhoy

More information

Lecture 02: Combinatorics. Lisa Yan June 27, 2018

Lecture 02: Combinatorics. Lisa Yan June 27, 2018 Lecture 02: Combinatorics Lisa Yan June 27, 2018 Announcements Sign up for Piazza https://piazza.com/stanford/summer2018/cs109 Sign up for Gradescope https://gradescope.com/courses/20179 (MWVBP7) Reference

More information

ECEN 5612, Fall 2007 Noise and Random Processes Prof. Timothy X Brown NAME: CUID:

ECEN 5612, Fall 2007 Noise and Random Processes Prof. Timothy X Brown NAME: CUID: Midterm ECE ECEN 562, Fall 2007 Noise and Random Processes Prof. Timothy X Brown October 23 CU Boulder NAME: CUID: You have 20 minutes to complete this test. Closed books and notes. No calculators. If

More information

DS-GA 1002 Lecture notes 11 Fall Bayesian statistics

DS-GA 1002 Lecture notes 11 Fall Bayesian statistics DS-GA 100 Lecture notes 11 Fall 016 Bayesian statistics In the frequentist paradigm we model the data as realizations from a distribution that depends on deterministic parameters. In contrast, in Bayesian

More information

Data Analysis and Monte Carlo Methods

Data Analysis and Monte Carlo Methods Lecturer: Allen Caldwell, Max Planck Institute for Physics & TUM Recitation Instructor: Oleksander (Alex) Volynets, MPP & TUM General Information: - Lectures will be held in English, Mondays 16-18:00 -

More information

Machine Learning. Instructor: Pranjal Awasthi

Machine Learning. Instructor: Pranjal Awasthi Machine Learning Instructor: Pranjal Awasthi Course Info Requested an SPN and emailed me Wait for Carol Difrancesco to give them out. Not registered and need SPN Email me after class No promises It s a

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

Statistics Introduction to Probability

Statistics Introduction to Probability Statistics 110 - Introduction to Probability Mark E. Irwin Department of Statistics Harvard University Summer Term Monday, June 26, 2006 - Wednesday, August 16, 2006 Copyright 2006 by Mark E. Irwin Personnel

More information