Today s outline: pp

Size: px
Start display at page:

Download "Today s outline: pp"

Transcription

1 Chapter 3 sections We will SKIP a number of sections Random variables and discrete distributions Continuous distributions The cumulative distribution function Bivariate distributions Marginal distributions Conditional distributions SKIP Multivariate distributions (generalization of bivariate) Functions of a random variable Functions of two or more random variables SKIP Markov Chains

2 Today s outline: pp Cumulative distribution function Multiple random variables 1. Joint probabilities 2. Marginal distributions 3. Conditional distributions 4. Independence

3 Definition: Cumulative distribution function (cdf) The cdf of a random variable X, denoted by F (x) is defined by F (x) = P(X x) = x f (y)dy, for all x. In practice, we use the pdf much more frequently than the cdf. However, the cdf has some additional theoretical properties (e.g. uniqueness) that the pdf doesn t have. Relationship between cdf and pdf F (x) = x f (y)dy f (x) = d dx F (x)

4 Example : Tossing 3 coins F (x) = 0 < x < 0 1/8 0 x < 1 1/2 1 x < 2 7/8 2 x < x < For example, F (2.5) = P(X 2) = P(X = 0, 1, 2) = 7/8. Cdf can be discontinuous, but F (x) take values at top of jumps.

5 Theorem The function F (x) is a cdf if and only if the following three conditions hold: a. lim x F (x) = 0 and lim x F (x) = 1. b. F (x) is a nondecreasing function of x. c. F (x) is right-continuous; that is, for every number x 0, lim x x0 F (x) = F (x 0 ).

6 Example: geometric distribution (discrete) Let p be the probability of tossing a head, X the number of tosses until the first head comes up.

7 Example: geometric distribution (discrete) Let p be the probability of tossing a head, X the number of tosses until the first head comes up. which gives Verify that F (x) is a cdf. P(X = x) = (1 p) x 1 p, F (x) = P(X x) = 1 (1 p) x.

8 Definition A random variable is continuous is F (x) is continuous, and discrete if Fx is a step function. Example: continuous cdf Special case of the logistic function: F (x) = e x.

9 Uniqueness Assuming certain non-pathological conditions, cdf completely determines the probability distribution of a random variable. Definition The random variables X and Y are identically distributed if, for every set A, P(X A) = P(X B). Note: X and Y are not necessarily the same, take for example heads and tails of a fair coin. Both have the same distribution, but they are not the same thing. Theorem The following statements are equivalent: a. The random variables X and Y are identically distributed. b. F X (x) = F Y (x) for every x.

10 Discrete bivariate random variables 1. Discrete case X, Y, joint probability function: P(X = x, Y = y), (pmf ). Example Randomly draw from {1, 2, 3, 4, 5} X =1st draw Y =2nd draw without replacement What is P(X = 4, Y = 5)? Definition Let (X, Y ) be a discrete bivariate random vector. Then f (x, y) = P(X = x, Y = y) (or f X,Y (x, y)) is called the joint probability mass function.

11 2. Discrete case X, Y, joint cumulative distribution function: F (x, y) = P(X x, Y y)

12 3. Marginal distribution: Theorem Let (X, Y ) be a discrete bivariate random vector with joint pmf f X,Y (x, y). Then the marginal pmfs of X and Y, f X (x) = P(X = x) and f Y (y) = P(Y = y), are given by f X (x) = y R f X,Y (x, y) and f Y (y) = x R f X,Y (x, y). 4. The conditional distribution of a discrete random variable Y on a r.v. X with joint pmf f X,Y (x, y) and marginals f X (x) and f Y (y) is f Y (y X = x) = P(Y = y X = x) = f X,Y (x, y). f X (x) Similarly, the conditional expectation of Y given X is E (g(x, Y ) X = x) = y R g(x, y)p(y = y X = x).

13 5. Two random variables X and Y with joint pmf f X,Y (x, y) and marginal pmfs f X (x) and f Y (y) are independent if FOR ALL x R and y R: f X,Y (x, y) = f X (x)f Y (y). Compare it with independent events. Example: 2x2 tables

14 Continuous variables 1. A function f (x, y) is a joint probability density function (pdf) of the continuous bivariate r.v. (X, Y ) if FOR ALL A R 2 : P((X, Y ) A) = f (x, y)dxdy. The function f (x, y) is a surface over XY plane, such that: f (x, y) 0 (x, y) R 2. f (x, y)dxdy = Joint cumulative distribution function (cdf) F (x, y) = P(X x, Y y) = Relationship between cdf and pdf 2 F (x, y) x y A x = f (x, y). y f (s, t)dtds.

15 Continuous joint pdf examples f (x, y) = 4xy 0 < x < 1, 0 < y < 1. What is P(X < Y )? What is P(Y > X 2 )? What is P(X + Y 0.5)?

16 Continuous joint pdf examples (ctd) Bivariate normal pdf

17 3. The marginal pdfs are defined as in the discrete case, with integrals instead of sums (as in the discrete case) f X (x) = f Y (y) = f (x, y)dy, < x < f (x, y)dx, < y <

18 Properties F X,Y (x, y) is non-decreasing in x, y. F X,Y (x, y) is right-continuous in x, y. and lim x F X,Y (x, y) = 0, lim F X,Y (x, y) = 0, y lim F X,Y (x, y) = 1. y,x FOR ALL x 1 x 2 and y 1 y 2, F (x 2, y 2 ) F (x 2, y 1 ) F (x 1, y 2 ) + F (x 1, y 1 ) 0. Draw picture!

19 4. The conditional distribution of Y given X = x is given by f Y (y X = x) = f XY (x, y). f X (x) Note that here we are conditioning on something which has probability 0! Check that this is indeed a pdf. Example: joint Gaussian 5. Two continuous random variables X and Y with joint pdf f X,Y (x, y) and marginals f X (x) and f Y (y) are independent if FOR ALL x and y, f X,Y (x, y) = f X (x)f Y (y).

Joint probability distributions

Joint probability distributions Joint probability distributions Let X and Y be two discrete rv s defined on the sample space S. The joint probability mass function p(x, y) is p(x, y) = P(X = x, Y = y). Note p(x, y) and x y p(x, y) =

More information

Lecture 8: Jointly distributed random variables

Lecture 8: Jointly distributed random variables Lecture : Jointly distributed random variables Random Vectors and Joint Probability Distributions Definition: Random Vector. An n-dimensional random vector, denoted as Z = (Z, Z,, Z n ), is a function

More information

Multivariate probability distributions

Multivariate probability distributions Multivariate probability distributions September, 07 STAT 0 Class Slide Outline of Topics Background Discrete bivariate distribution 3 Continuous bivariate distribution STAT 0 Class Slide Multivariate

More information

Pairs of a random variable

Pairs of a random variable Handout 8 Pairs of a random variable "Always be a little improbable." Oscar Wilde in the previous tutorials we analyzed experiments in which an outcome is one number. we'll start to analyze experiments

More information

Page 129 Exercise 5: Suppose that the joint p.d.f. of two random variables X and Y is as follows: { c(x. 0 otherwise. ( 1 = c. = c

Page 129 Exercise 5: Suppose that the joint p.d.f. of two random variables X and Y is as follows: { c(x. 0 otherwise. ( 1 = c. = c Stat Solutions for Homework Set Page 9 Exercise : Suppose that the joint p.d.f. of two random variables X and Y is as follows: { cx fx, y + y for y x, < x < otherwise. Determine a the value of the constant

More information

Probability Model for 2 RV s

Probability Model for 2 RV s Probability Model for 2 RV s The joint probability mass function of X and Y is P X,Y (x, y) = P [X = x, Y= y] Joint PMF is a rule that for any x and y, gives the probability that X = x and Y= y. 3 Example:

More information

Will Monroe July 21, with materials by Mehran Sahami and Chris Piech. Joint Distributions

Will Monroe July 21, with materials by Mehran Sahami and Chris Piech. Joint Distributions Will Monroe July 1, 017 with materials by Mehran Sahami and Chris Piech Joint Distributions Review: Normal random variable An normal (= Gaussian) random variable is a good approximation to many other distributions.

More information

ECE353: Probability and Random Processes. Lecture 11- Two Random Variables (II)

ECE353: Probability and Random Processes. Lecture 11- Two Random Variables (II) ECE353: Probability and Random Processes Lecture 11- Two Random Variables (II) Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu Joint

More information

14.30 Introduction to Statistical Methods in Economics Spring 2009

14.30 Introduction to Statistical Methods in Economics Spring 2009 MIT OpenCourseWare http://ocw.mit.edu 14.30 Introduction to Statistical Methods in Economics Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

More information

This is a good time to refresh your memory on double-integration. We will be using this skill in the upcoming lectures.

This is a good time to refresh your memory on double-integration. We will be using this skill in the upcoming lectures. Chapter 5: JOINT PROBABILITY DISTRIBUTIONS Part 1: Sections 5-1.1 to 5-1.4 For both discrete and continuous random variables we will discuss the following... Joint Distributions (for two or more r.v. s)

More information

This is a good time to refresh your memory on double-integration. We will be using this skill in the upcoming lectures.

This is a good time to refresh your memory on double-integration. We will be using this skill in the upcoming lectures. Chapter 5: JOINT PROBABILITY DISTRIBUTIONS Part 1: Sections 5-1.1 to 5-1.4 For both discrete and continuous random variables we will discuss the following... Joint Distributions for two or more r.v. s)

More information

Topic 5 - Joint distributions and the CLT

Topic 5 - Joint distributions and the CLT Topic 5 - Joint distributions and the CLT Joint distributions Calculation of probabilities, mean and variance Expectations of functions based on joint distributions Central Limit Theorem Sampling distributions

More information

CS 112: Computer System Modeling Fundamentals. Prof. Jenn Wortman Vaughan April 21, 2011 Lecture 8

CS 112: Computer System Modeling Fundamentals. Prof. Jenn Wortman Vaughan April 21, 2011 Lecture 8 CS 112: Computer System Modeling Fundamentals Prof. Jenn Wortman Vaughan April 21, 2011 Lecture 8 Quiz #2 Reminders & Announcements Homework 2 is due in class on Tuesday be sure to check the posted homework

More information

Tangent Planes and Linear Approximations

Tangent Planes and Linear Approximations February 21, 2007 Tangent Planes Tangent Planes Let S be a surface with equation z = f (x, y). Tangent Planes Let S be a surface with equation z = f (x, y). Let P(x 0, y 0, z 0 ) be a point on S. Tangent

More information

Recursive Estimation

Recursive Estimation Recursive Estimation Raffaello D Andrea Spring 28 Problem Set : Probability Review Last updated: March 6, 28 Notes: Notation: Unless otherwise noted, x, y, and z denote random variables, p x denotes the

More information

CDA6530: Performance Models of Computers and Networks. Chapter 8: Statistical Simulation --- Discrete-Time Simulation

CDA6530: Performance Models of Computers and Networks. Chapter 8: Statistical Simulation --- Discrete-Time Simulation CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation --- Discrete-Time Simulation Simulation Studies Models with analytical formulas Calculate the numerical solutions

More information

Exam 2 is Tue Nov 21. Bring a pencil and a calculator. Discuss similarity to exam1. HW3 is due Tue Dec 5.

Exam 2 is Tue Nov 21. Bring a pencil and a calculator. Discuss similarity to exam1. HW3 is due Tue Dec 5. Stat 100a: Introduction to Probability. Outline for the day 1. Bivariate and marginal density. 2. CLT. 3. CIs. 4. Sample size calculations. 5. Review for exam 2. Exam 2 is Tue Nov 21. Bring a pencil and

More information

14.4: Tangent Planes and Linear Approximations

14.4: Tangent Planes and Linear Approximations 14.4: Tangent Planes and Linear Approximations Marius Ionescu October 15, 2012 Marius Ionescu () 14.4: Tangent Planes and Linear Approximations October 15, 2012 1 / 13 Tangent Planes Marius Ionescu ()

More information

What you will learn today

What you will learn today What you will learn today Tangent Planes and Linear Approximation and the Gradient Vector Vector Functions 1/21 Recall in one-variable calculus, as we zoom in toward a point on a curve, the graph becomes

More information

GAMES Webinar: Rendering Tutorial 2. Monte Carlo Methods. Shuang Zhao

GAMES Webinar: Rendering Tutorial 2. Monte Carlo Methods. Shuang Zhao GAMES Webinar: Rendering Tutorial 2 Monte Carlo Methods Shuang Zhao Assistant Professor Computer Science Department University of California, Irvine GAMES Webinar Shuang Zhao 1 Outline 1. Monte Carlo integration

More information

REVIEW I MATH 254 Calculus IV. Exam I (Friday, April 29) will cover sections

REVIEW I MATH 254 Calculus IV. Exam I (Friday, April 29) will cover sections REVIEW I MATH 254 Calculus IV Exam I (Friday, April 29 will cover sections 14.1-8. 1. Functions of multivariables The definition of multivariable functions is similar to that of functions of one variable.

More information

Biostatistics & SAS programming. Kevin Zhang

Biostatistics & SAS programming. Kevin Zhang Biostatistics & SAS programming Kevin Zhang February 27, 2017 Random variables and distributions 1 Data analysis Simulation study Apply existing methodologies to your collected samples, with the hope to

More information

STATISTICAL LABORATORY, April 30th, 2010 BIVARIATE PROBABILITY DISTRIBUTIONS

STATISTICAL LABORATORY, April 30th, 2010 BIVARIATE PROBABILITY DISTRIBUTIONS STATISTICAL LABORATORY, April 3th, 21 BIVARIATE PROBABILITY DISTRIBUTIONS Mario Romanazzi 1 MULTINOMIAL DISTRIBUTION Ex1 Three players play 1 independent rounds of a game, and each player has probability

More information

Continuity and Tangent Lines for functions of two variables

Continuity and Tangent Lines for functions of two variables Continuity and Tangent Lines for functions of two variables James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University April 4, 2014 Outline 1 Continuity

More information

Intro to Probability Instructor: Alexandre Bouchard

Intro to Probability Instructor: Alexandre Bouchard www.stat.ubc.ca/~bouchard/courses/stat302-sp2017-18/ Intro to Probability Instructor: Aleandre Bouchard Announcements New webwork will be release by end of day today, due one week later. Plan for today

More information

Lecture 4. Digital Image Enhancement. 1. Principle of image enhancement 2. Spatial domain transformation. Histogram processing

Lecture 4. Digital Image Enhancement. 1. Principle of image enhancement 2. Spatial domain transformation. Histogram processing Lecture 4 Digital Image Enhancement 1. Principle of image enhancement 2. Spatial domain transformation Basic intensity it tranfomation ti Histogram processing Principle Objective of Enhancement Image enhancement

More information

Testing Continuous Distributions. Artur Czumaj. DIMAP (Centre for Discrete Maths and it Applications) & Department of Computer Science

Testing Continuous Distributions. Artur Czumaj. DIMAP (Centre for Discrete Maths and it Applications) & Department of Computer Science Testing Continuous Distributions Artur Czumaj DIMAP (Centre for Discrete Maths and it Applications) & Department of Computer Science University of Warwick Joint work with A. Adamaszek & C. Sohler Testing

More information

We use non-bold capital letters for all random variables in these notes, whether they are scalar-, vector-, matrix-, or whatever-valued.

We use non-bold capital letters for all random variables in these notes, whether they are scalar-, vector-, matrix-, or whatever-valued. The Bayes Classifier We have been starting to look at the supervised classification problem: we are given data (x i, y i ) for i = 1,..., n, where x i R d, and y i {1,..., K}. In this section, we suppose

More information

Random Number Generators

Random Number Generators 1/17 Random Number Generators Professor Karl Sigman Columbia University Department of IEOR New York City USA 2/17 Introduction Your computer generates" numbers U 1, U 2, U 3,... that are considered independent

More information

Discrete Mathematics Course Review 3

Discrete Mathematics Course Review 3 21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has

More information

We imagine the egg being the three dimensional solid defined by rotating this ellipse around the x-axis:

We imagine the egg being the three dimensional solid defined by rotating this ellipse around the x-axis: CHAPTER 6. INTEGRAL APPLICATIONS 7 Example. Imagine we want to find the volume of hard boiled egg. We could put the egg in a measuring cup and measure how much water it displaces. But we suppose we want

More information

A Class of Symmetric Bivariate Uniform Distributions

A Class of Symmetric Bivariate Uniform Distributions A Class of Symmetric Bivariate Uniform Distributions Thomas S. Ferguson, 7/8/94 A class of symmetric bivariate uniform distributions is proposed for use in statistical modeling. The distributions may be

More information

Chapter 6: Simulation Using Spread-Sheets (Excel)

Chapter 6: Simulation Using Spread-Sheets (Excel) Chapter 6: Simulation Using Spread-Sheets (Excel) Refer to Reading Assignments 1 Simulation Using Spread-Sheets (Excel) OBJECTIVES To be able to Generate random numbers within a spreadsheet environment.

More information

= f (a, b) + (hf x + kf y ) (a,b) +

= f (a, b) + (hf x + kf y ) (a,b) + Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals

More information

Sampling and Monte-Carlo Integration

Sampling and Monte-Carlo Integration Sampling and Monte-Carlo Integration Sampling and Monte-Carlo Integration Last Time Pixels are samples Sampling theorem Convolution & multiplication Aliasing: spectrum replication Ideal filter And its

More information

Integration. Example Find x 3 dx.

Integration. Example Find x 3 dx. Integration A function F is called an antiderivative of the function f if F (x)=f(x). The set of all antiderivatives of f is called the indefinite integral of f with respect to x and is denoted by f(x)dx.

More information

Surfaces and Partial Derivatives

Surfaces and Partial Derivatives Surfaces and Partial Derivatives James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 9, 2016 Outline Partial Derivatives Tangent Planes

More information

Derivatives and Graphs of Functions

Derivatives and Graphs of Functions Derivatives and Graphs of Functions September 8, 2014 2.2 Second Derivatives, Concavity, and Graphs In the previous section, we discussed how our derivatives can be used to obtain useful information about

More information

f (Pijk ) V. may form the Riemann sum: . Definition. The triple integral of f over the rectangular box B is defined to f (x, y, z) dv = lim

f (Pijk ) V. may form the Riemann sum: . Definition. The triple integral of f over the rectangular box B is defined to f (x, y, z) dv = lim Chapter 14 Multiple Integrals..1 Double Integrals, Iterated Integrals, Cross-sections.2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals.3

More information

Computer vision: models, learning and inference. Chapter 10 Graphical Models

Computer vision: models, learning and inference. Chapter 10 Graphical Models Computer vision: models, learning and inference Chapter 10 Graphical Models Independence Two variables x 1 and x 2 are independent if their joint probability distribution factorizes as Pr(x 1, x 2 )=Pr(x

More information

Monte Carlo Simula/on and Copula Func/on. by Gerardo Ferrara

Monte Carlo Simula/on and Copula Func/on. by Gerardo Ferrara Monte Carlo Simula/on and Copula Func/on by Gerardo Ferrara Introduc)on A Monte Carlo method is a computational algorithm that relies on repeated random sampling to compute its results. In a nutshell,

More information

D-Separation. b) the arrows meet head-to-head at the node, and neither the node, nor any of its descendants, are in the set C.

D-Separation. b) the arrows meet head-to-head at the node, and neither the node, nor any of its descendants, are in the set C. D-Separation Say: A, B, and C are non-intersecting subsets of nodes in a directed graph. A path from A to B is blocked by C if it contains a node such that either a) the arrows on the path meet either

More information

Graphical Models. David M. Blei Columbia University. September 17, 2014

Graphical Models. David M. Blei Columbia University. September 17, 2014 Graphical Models David M. Blei Columbia University September 17, 2014 These lecture notes follow the ideas in Chapter 2 of An Introduction to Probabilistic Graphical Models by Michael Jordan. In addition,

More information

Worksheet 2.2: Partial Derivatives

Worksheet 2.2: Partial Derivatives Boise State Math 275 (Ultman) Worksheet 2.2: Partial Derivatives From the Toolbox (what you need from previous classes) Be familiar with the definition of a derivative as the slope of a tangent line (the

More information

Introduction to Machine Learning CMU-10701

Introduction to Machine Learning CMU-10701 Introduction to Machine Learning CMU-10701 Clustering and EM Barnabás Póczos & Aarti Singh Contents Clustering K-means Mixture of Gaussians Expectation Maximization Variational Methods 2 Clustering 3 K-

More information

Numerical Integration

Numerical Integration Lecture 12: Numerical Integration (with a focus on Monte Carlo integration) Computer Graphics CMU 15-462/15-662, Fall 2015 Review: fundamental theorem of calculus Z b f(x)dx = F (b) F (a) a f(x) = d dx

More information

Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives

Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives In general, if f is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant. By the definition of a derivative, we have Then we are really

More information

MULTI-DIMENSIONAL MONTE CARLO INTEGRATION

MULTI-DIMENSIONAL MONTE CARLO INTEGRATION CS580: Computer Graphics KAIST School of Computing Chapter 3 MULTI-DIMENSIONAL MONTE CARLO INTEGRATION 2 1 Monte Carlo Integration This describes a simple technique for the numerical evaluation of integrals

More information

Clustering. Image segmentation, document clustering, protein class discovery, compression

Clustering. Image segmentation, document clustering, protein class discovery, compression Clustering CS 444 Some material on these is slides borrowed from Andrew Moore's machine learning tutorials located at: Clustering The problem of grouping unlabeled data on the basis of similarity. A key

More information

B. Examples Set up the integral(s) needed to find the area of the region bounded by

B. Examples Set up the integral(s) needed to find the area of the region bounded by Math 176 Calculus Sec. 6.1: Area Between Curves I. Area between the Curve and the x Axis A. Let f(x) 0 be continuous on [a,b]. The area of the region between the graph of f and the x-axis is A = f ( x)

More information

Collective classification in network data

Collective classification in network data 1 / 50 Collective classification in network data Seminar on graphs, UCSB 2009 Outline 2 / 50 1 Problem 2 Methods Local methods Global methods 3 Experiments Outline 3 / 50 1 Problem 2 Methods Local methods

More information

Computer Vision Group Prof. Daniel Cremers. 4. Probabilistic Graphical Models Directed Models

Computer Vision Group Prof. Daniel Cremers. 4. Probabilistic Graphical Models Directed Models Prof. Daniel Cremers 4. Probabilistic Graphical Models Directed Models The Bayes Filter (Rep.) (Bayes) (Markov) (Tot. prob.) (Markov) (Markov) 2 Graphical Representation (Rep.) We can describe the overall

More information

Surfaces and Partial Derivatives

Surfaces and Partial Derivatives Surfaces and James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 15, 2017 Outline 1 2 Tangent Planes Let s go back to our simple surface

More information

Probability Models.S4 Simulating Random Variables

Probability Models.S4 Simulating Random Variables Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard Probability Models.S4 Simulating Random Variables In the fashion of the last several sections, we will often create probability

More information

x 6 + λ 2 x 6 = for the curve y = 1 2 x3 gives f(1, 1 2 ) = λ actually has another solution besides λ = 1 2 = However, the equation λ

x 6 + λ 2 x 6 = for the curve y = 1 2 x3 gives f(1, 1 2 ) = λ actually has another solution besides λ = 1 2 = However, the equation λ Math 0 Prelim I Solutions Spring 010 1. Let f(x, y) = x3 y for (x, y) (0, 0). x 6 + y (4 pts) (a) Show that the cubic curves y = x 3 are level curves of the function f. Solution. Substituting y = x 3 in

More information

MSA101/MVE Lecture 5

MSA101/MVE Lecture 5 MSA101/MVE187 2017 Lecture 5 Petter Mostad Chalmers University September 12, 2017 1 / 15 Importance sampling MC integration computes h(x)f (x) dx where f (x) is a probability density function, by simulating

More information

Probability and Statistics for Final Year Engineering Students

Probability and Statistics for Final Year Engineering Students Probability and Statistics for Final Year Engineering Students By Yoni Nazarathy, Last Updated: April 11, 2011. Lecture 1: Introduction and Basic Terms Welcome to the course, time table, assessment, etc..

More information

Solution 2. ((3)(1) (2)(1), (4 3), (4)(2) (3)(3)) = (1, 1, 1) D u (f) = (6x + 2yz, 2y + 2xz, 2xy) (0,1,1) = = 4 14

Solution 2. ((3)(1) (2)(1), (4 3), (4)(2) (3)(3)) = (1, 1, 1) D u (f) = (6x + 2yz, 2y + 2xz, 2xy) (0,1,1) = = 4 14 Vector and Multivariable Calculus L Marizza A Bailey Practice Trimester Final Exam Name: Problem 1. To prepare for true/false and multiple choice: Compute the following (a) (4, 3) ( 3, 2) Solution 1. (4)(

More information

Rectangular Coordinates in Space

Rectangular Coordinates in Space Rectangular Coordinates in Space Philippe B. Laval KSU Today Philippe B. Laval (KSU) Rectangular Coordinates in Space Today 1 / 11 Introduction We quickly review one and two-dimensional spaces and then

More information

OUTLINE. Paper Review First Paper The Zero-Error Side Information Problem and Chromatic Numbers, H. S. Witsenhausen Definitions:

OUTLINE. Paper Review First Paper The Zero-Error Side Information Problem and Chromatic Numbers, H. S. Witsenhausen Definitions: OUTLINE Definitions: - Source Code - Expected Length of a source code - Length of a codeword - Variable/fixed length coding - Example: Huffman coding - Lossless coding - Distortion - Worst case length

More information

Laplace Transform of a Lognormal Random Variable

Laplace Transform of a Lognormal Random Variable Approximations of the Laplace Transform of a Lognormal Random Variable Joint work with Søren Asmussen & Jens Ledet Jensen The University of Queensland School of Mathematics and Physics August 1, 2011 Conference

More information

Algorithms for Markov Random Fields in Computer Vision

Algorithms for Markov Random Fields in Computer Vision Algorithms for Markov Random Fields in Computer Vision Dan Huttenlocher November, 2003 (Joint work with Pedro Felzenszwalb) Random Field Broadly applicable stochastic model Collection of n sites S Hidden

More information

Announcements. Topics: To Do:

Announcements. Topics: To Do: Announcements Topics: In the Functions of Several Variables module: - Section 3: Limits and Continuity - Section 4: Partial Derivatives - Section 5: Tangent Plane, Linearization, and Differentiability

More information

Bayesian Machine Learning - Lecture 6

Bayesian Machine Learning - Lecture 6 Bayesian Machine Learning - Lecture 6 Guido Sanguinetti Institute for Adaptive and Neural Computation School of Informatics University of Edinburgh gsanguin@inf.ed.ac.uk March 2, 2015 Today s lecture 1

More information

Today. Logistic Regression. Decision Trees Redux. Graphical Models. Maximum Entropy Formulation. Now using Information Theory

Today. Logistic Regression. Decision Trees Redux. Graphical Models. Maximum Entropy Formulation. Now using Information Theory Today Logistic Regression Maximum Entropy Formulation Decision Trees Redux Now using Information Theory Graphical Models Representing conditional dependence graphically 1 Logistic Regression Optimization

More information

Introduction to PDEs: Notation, Terminology and Key Concepts

Introduction to PDEs: Notation, Terminology and Key Concepts Chapter 1 Introduction to PDEs: Notation, Terminology and Key Concepts 1.1 Review 1.1.1 Goal The purpose of this section is to briefly review notation as well as basic concepts from calculus. We will also

More information

Lecture 3: Conditional Independence - Undirected

Lecture 3: Conditional Independence - Undirected CS598: Graphical Models, Fall 2016 Lecture 3: Conditional Independence - Undirected Lecturer: Sanmi Koyejo Scribe: Nate Bowman and Erin Carrier, Aug. 30, 2016 1 Review for the Bayes-Ball Algorithm Recall

More information

COMPUTER VISION > OPTICAL FLOW UTRECHT UNIVERSITY RONALD POPPE

COMPUTER VISION > OPTICAL FLOW UTRECHT UNIVERSITY RONALD POPPE COMPUTER VISION 2017-2018 > OPTICAL FLOW UTRECHT UNIVERSITY RONALD POPPE OUTLINE Optical flow Lucas-Kanade Horn-Schunck Applications of optical flow Optical flow tracking Histograms of oriented flow Assignment

More information

Triple Integrals. MATH 311, Calculus III. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Triple Integrals

Triple Integrals. MATH 311, Calculus III. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Triple Integrals Triple Integrals MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Fall 211 Riemann Sum Approach Suppose we wish to integrate w f (x, y, z), a continuous function, on the box-shaped region

More information

Use of Extreme Value Statistics in Modeling Biometric Systems

Use of Extreme Value Statistics in Modeling Biometric Systems Use of Extreme Value Statistics in Modeling Biometric Systems Similarity Scores Two types of matching: Genuine sample Imposter sample Matching scores Enrolled sample 0.95 0.32 Probability Density Decision

More information

MATH 2023 Multivariable Calculus

MATH 2023 Multivariable Calculus MATH 2023 Multivariable Calculus Problem Sets Note: Problems with asterisks represent supplementary informations. You may want to read their solutions if you like, but you don t need to work on them. Set

More information

Inference. Inference: calculating some useful quantity from a joint probability distribution Examples: Posterior probability: Most likely explanation:

Inference. Inference: calculating some useful quantity from a joint probability distribution Examples: Posterior probability: Most likely explanation: Inference Inference: calculating some useful quantity from a joint probability distribution Examples: Posterior probability: B A E J M Most likely explanation: This slide deck courtesy of Dan Klein at

More information

Precomposing Equations

Precomposing Equations Precomposing Equations Let s precompose the function f(x) = x 3 2x + 9 with the function g(x) = 4 x. (Precompose f with g means that we ll look at f g. We would call g f postcomposing f with g.) f g(x)

More information

Chapter 5: Joint Probability Distributions and Random

Chapter 5: Joint Probability Distributions and Random Chapter 5: Joint Probability Distributions and Random Samples Curtis Miller 2018-06-13 Introduction We may naturally inquire about collections of random variables that are related to each other in some

More information

The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus

The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus by Jason Schweinsberg University of California at San Diego Outline of Talk 1. Loop-erased random walk 2.

More information

MATH 116 REVIEW PROBLEMS for the FINAL EXAM

MATH 116 REVIEW PROBLEMS for the FINAL EXAM MATH 116 REVIEW PROBLEMS for the FINAL EXAM The following questions are taken from old final exams of various calculus courses taught in Bilkent University 1. onsider the line integral (2xy 2 z + y)dx

More information

Lecture 6: Chain rule, Mean Value Theorem, Tangent Plane

Lecture 6: Chain rule, Mean Value Theorem, Tangent Plane Lecture 6: Chain rule, Mean Value Theorem, Tangent Plane Rafikul Alam Department of Mathematics IIT Guwahati Chain rule Theorem-A: Let x : R R n be differentiable at t 0 and f : R n R be differentiable

More information

Reinforcement Learning: A brief introduction. Mihaela van der Schaar

Reinforcement Learning: A brief introduction. Mihaela van der Schaar Reinforcement Learning: A brief introduction Mihaela van der Schaar Outline Optimal Decisions & Optimal Forecasts Markov Decision Processes (MDPs) States, actions, rewards and value functions Dynamic Programming

More information

AP Calculus AB Unit 2 Assessment

AP Calculus AB Unit 2 Assessment Class: Date: 203-204 AP Calculus AB Unit 2 Assessment Multiple Choice Identify the choice that best completes the statement or answers the question. A calculator may NOT be used on this part of the exam.

More information

Dr. Allen Back. Nov. 19, 2014

Dr. Allen Back. Nov. 19, 2014 Why of Dr. Allen Back Nov. 19, 2014 Graph Picture of T u, T v for a Lat/Long Param. of the Sphere. Why of Graph Basic Picture Why of Graph Why Φ(u, v) = (x(u, v), y(u, v), z(u, v)) Tangents T u = (x u,

More information

Part II. C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS

Part II. C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS Part II C. M. Bishop PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 8: GRAPHICAL MODELS Converting Directed to Undirected Graphs (1) Converting Directed to Undirected Graphs (2) Add extra links between

More information

Chapter 3. Bootstrap. 3.1 Introduction. 3.2 The general idea

Chapter 3. Bootstrap. 3.1 Introduction. 3.2 The general idea Chapter 3 Bootstrap 3.1 Introduction The estimation of parameters in probability distributions is a basic problem in statistics that one tends to encounter already during the very first course on the subject.

More information

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2017 Abhay Parekh and Jean Walrand September 21, 2017.

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2017 Abhay Parekh and Jean Walrand September 21, 2017. EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2017 Abhay Parekh and Jean Walrand September 21, 2017 Midterm Exam Last Name First Name SID Rules. You have 80 minutes

More information

ECE521 Lecture 18 Graphical Models Hidden Markov Models

ECE521 Lecture 18 Graphical Models Hidden Markov Models ECE521 Lecture 18 Graphical Models Hidden Markov Models Outline Graphical models Conditional independence Conditional independence after marginalization Sequence models hidden Markov models 2 Graphical

More information

Data Handling. Moving from A to A* Calculate the numbers to be surveyed for a stratified sample (A)

Data Handling. Moving from A to A* Calculate the numbers to be surveyed for a stratified sample (A) Moving from A to A* A* median, quartiles and interquartile range from a histogram (A*) Draw histograms from frequency tables with unequal class intervals (A) Calculate the numbers to be surveyed for a

More information

FMA901F: Machine Learning Lecture 6: Graphical Models. Cristian Sminchisescu

FMA901F: Machine Learning Lecture 6: Graphical Models. Cristian Sminchisescu FMA901F: Machine Learning Lecture 6: Graphical Models Cristian Sminchisescu Graphical Models Provide a simple way to visualize the structure of a probabilistic model and can be used to design and motivate

More information

Quantitative Biology II!

Quantitative Biology II! Quantitative Biology II! Lecture 3: Markov Chain Monte Carlo! March 9, 2015! 2! Plan for Today!! Introduction to Sampling!! Introduction to MCMC!! Metropolis Algorithm!! Metropolis-Hastings Algorithm!!

More information

Markov chain Monte Carlo methods

Markov chain Monte Carlo methods Markov chain Monte Carlo methods (supplementary material) see also the applet http://www.lbreyer.com/classic.html February 9 6 Independent Hastings Metropolis Sampler Outline Independent Hastings Metropolis

More information

CSE 21 Math for Algorithms and Systems Analysis. Lecture 14 Review of Random Variables

CSE 21 Math for Algorithms and Systems Analysis. Lecture 14 Review of Random Variables CSE 21 Math for Algorithms and Systems Analysis Lecture 14 Review of Random Variables Outline Probability spaces DefiniFon of a random variable DistribuFon funcfon of a random variable Expected Value of

More information

UNIVERSIDAD CARLOS III DE MADRID MATHEMATICS II EXERCISES (SOLUTIONS ) CHAPTER 3: Partial derivatives and differentiation

UNIVERSIDAD CARLOS III DE MADRID MATHEMATICS II EXERCISES (SOLUTIONS ) CHAPTER 3: Partial derivatives and differentiation UNIVERSIDAD CARLOS III DE MADRID MATHEMATICS II EXERCISES SOLUTIONS ) 3-1. Find, for the following functions: a) fx, y) x cos x sin y. b) fx, y) e xy. c) fx, y) x + y ) lnx + y ). CHAPTER 3: Partial derivatives

More information

Machine Learning

Machine Learning Machine Learning 10-701 Tom M. Mitchell Machine Learning Department Carnegie Mellon University February 15, 2011 Today: Graphical models Inference Conditional independence and D-separation Learning from

More information

13.1. Functions of Several Variables. Introduction to Functions of Several Variables. Functions of Several Variables. Objectives. Example 1 Solution

13.1. Functions of Several Variables. Introduction to Functions of Several Variables. Functions of Several Variables. Objectives. Example 1 Solution 13 Functions of Several Variables 13.1 Introduction to Functions of Several Variables Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Objectives Understand

More information

LECTURE 18 - OPTIMIZATION

LECTURE 18 - OPTIMIZATION LECTURE 18 - OPTIMIZATION CHRIS JOHNSON Abstract. In this lecture we ll describe extend the optimization techniques you learned in your first semester calculus class to optimize functions of multiple variables.

More information

Graphical Models. Pradeep Ravikumar Department of Computer Science The University of Texas at Austin

Graphical Models. Pradeep Ravikumar Department of Computer Science The University of Texas at Austin Graphical Models Pradeep Ravikumar Department of Computer Science The University of Texas at Austin Useful References Graphical models, exponential families, and variational inference. M. J. Wainwright

More information

CS 2316 Individual Homework 5 Joint Probability Out of 100 points

CS 2316 Individual Homework 5 Joint Probability Out of 100 points CS 2316 Individual Homework 5 Joint Probability Out of 100 points Files to submit: 1. HW5.py This is an INDIVIDUAL Assignment: Collaboration at a reasonable level will not result in substantially similar

More information

Math 494: Mathematical Statistics

Math 494: Mathematical Statistics Math 494: Mathematical Statistics Instructor: Jimin Ding jmding@wustl.edu Department of Mathematics Washington University in St. Louis Class materials are available on course website (www.math.wustl.edu/

More information

Direction Fields; Euler s Method

Direction Fields; Euler s Method Direction Fields; Euler s Method It frequently happens that we cannot solve first order systems dy (, ) dx = f xy or corresponding initial value problems in terms of formulas. Remarkably, however, this

More information

Lagrange Multipliers. Lagrange Multipliers. Lagrange Multipliers. Lagrange Multipliers. Lagrange Multipliers. Lagrange Multipliers

Lagrange Multipliers. Lagrange Multipliers. Lagrange Multipliers. Lagrange Multipliers. Lagrange Multipliers. Lagrange Multipliers In this section we present Lagrange s method for maximizing or minimizing a general function f(x, y, z) subject to a constraint (or side condition) of the form g(x, y, z) = k. Figure 1 shows this curve

More information

The Normal Distribution & z-scores

The Normal Distribution & z-scores & z-scores Distributions: Who needs them? Why are we interested in distributions? Important link between distributions and probabilities of events If we know the distribution of a set of events, then we

More information

10 Sum-product on factor tree graphs, MAP elimination

10 Sum-product on factor tree graphs, MAP elimination assachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 10 Sum-product on factor tree graphs, AP elimination algorithm The

More information