Lecture 2: Bayesian inference - Discrete probability models

Similar documents
Derivative Securities: Lecture 4 Introduction to option pricing

GUIDE FOR SUPERVISORS 1. This event runs most efficiently with two to four extra volunteers to help proctor students and grade the student

4.1 The Uniform Distribution Def n: A c.r.v. X has a continuous uniform distribution on [a, b] when its pdf is = 1 a x b

How to represent a joint, or a marginal distribution?

European and American options with a single payment of dividends. (About formula Roll, Geske & Whaley) Mark Ioffe. Abstract

1 Lecture: pp

A Simple Method for Determining the Manoeuvring Indices K and T from Zigzag Trial Data

DSP-First, 2/e. This Lecture: LECTURE #3 Complex Exponentials & Complex Numbers. Introduce more tools for manipulating complex numbers

The Black-Scholes Formula

Investment. Net Present Value. Stream of payments A 0, A 1, Consol: same payment forever Common interest rate r

Mathematical Statistics

Representing Knowledge. CS 188: Artificial Intelligence Fall Properties of BNs. Independence? Reachability (the Bayes Ball) Example

Applied Statistics and Probability for Engineers, 6 th edition October 17, 2016

Partial Fraction Expansion

Chapter 3 Common Families of Distributions

Microscopic Flow Characteristics Time Headway - Distribution

Midterm exam 2, April 7, 2009 (solutions)

Estimation of a Random Variable

University of Toledo REU Program Summer 2002

Study of Tyre Damping Ratio and In-Plane Time Domain Simulation with Modal Parameter Tyre Model (MPTM)

3(8 ) (8 x x ) 3x x (8 )

Reinforcement learning

Summary: Solving a Homogeneous System of Two Linear First Order Equations in Two Unknowns

Sections 3.1 and 3.4 Exponential Functions (Growth and Decay)

Discussion 06 Solutions

Homework: Introduction to Motion

Boyce/DiPrima 9 th ed, Ch 2.1: Linear Equations; Method of Integrating Factors

Decline Curves. Exponential decline (constant fractional decline) Harmonic decline, and Hyperbolic decline.

What Ties Return Volatilities to Price Valuations and Fundamentals? On-Line Appendix

An Indian Journal FULL PAPER. Trade Science Inc. A stage-structured model of a single-species with density-dependent and birth pulses ABSTRACT

An random variable is a quantity that assumes different values with certain probabilities.

Double Slits in Space and Time

SOLUTIONS. 1. Consider two continuous random variables X and Y with joint p.d.f. f ( x, y ) = = = 15. Stepanov Dalpiaz

Lecture 1: Numerical Integration The Trapezoidal and Simpson s Rule

Reinforcement learning

Revisiting what you have learned in Advanced Mathematical Analysis

An Automatic Door Sensor Using Image Processing

(, ) which is a positively sloping curve showing (Y,r) for which the money market is in equilibrium. The P = (1.4)

Charging of capacitor through inductor and resistor

EECE 301 Signals & Systems Prof. Mark Fowler

4.5 Constant Acceleration

Elementary Differential Equations and Boundary Value Problems

Consider a system of 2 simultaneous first order linear equations

Combinatorial Approach to M/M/1 Queues. Using Hypergeometric Functions

EXERCISES FOR SECTION 1.5

MEM 355 Performance Enhancement of Dynamical Systems A First Control Problem - Cruise Control

Chapter 2: Random Variables

Mid Year Examination F.4 Mathematics Module 1 (Calculus & Statistics) Suggested Solutions

Relative and Circular Motion

The transition:transversion rate ratio vs. the T-ratio.

Chapter 4 Circular and Curvilinear Motions

5. An object moving along an x-coordinate axis with its scale measured in meters has a velocity of 6t

Chapter 3: Fourier Representation of Signals and LTI Systems. Chih-Wei Liu

Frequency Response. Response of an LTI System to Eigenfunction

Chapter 5 The Laplace Transform. x(t) input y(t) output Dynamic System

Introduction to choice over time

CS 188: Artificial Intelligence Fall Probabilistic Models

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.

Chapter 2 : Fundamental parameters of antennas

Lecture-V Stochastic Processes and the Basic Term-Structure Equation 1 Stochastic Processes Any variable whose value changes over time in an uncertain

RICHARD JOHNSON EDITIONS

The Variance-Covariance Matrix

The Non-Truncated Bulk Arrival Queue M x /M/1 with Reneging, Balking, State-Dependent and an Additional Server for Longer Queues

Chapter 7. Interference

ECE 510 Lecture 4 Reliability Plotting T&T Scott Johnson Glenn Shirley

where: u: input y: output x: state vector A, B, C, D are const matrices

Probabilistic Models. CS 188: Artificial Intelligence Fall Independence. Example: Independence. Example: Independence? Conditional Independence

4.1 - Logarithms and Their Properties

3.4 Repeated Roots; Reduction of Order

Exam 3 Review (Sections Covered: , )

UNIT #5 EXPONENTIAL AND LOGARITHMIC FUNCTIONS

H is equal to the surface current J S

( ) ( ) ( ) 0. dt dt dt ME203 PROBLEM SET #6. 1. Text Section 4.5

dt = C exp (3 ln t 4 ). t 4 W = C exp ( ln(4 t) 3) = C(4 t) 3.

On the Derivatives of Bessel and Modified Bessel Functions with Respect to the Order and the Argument

( r) E (r) Phasor. Function of space only. Fourier series Synthesis equations. Sinusoidal EM Waves. For complex periodic signals

Math 334 Test 1 KEY Spring 2010 Section: 001. Instructor: Scott Glasgow Dates: May 10 and 11.

ECE 510 Lecture 4 Reliability Plotting T&T Scott Johnson Glenn Shirley

3.6 Applied Optimization

Chapter 2. First Order Scalar Equations

DEPARTMENT OF ECONOMICS /11. dy =, for each of the following, use the chain rule to find dt

- The whole joint distribution is independent of the date at which it is measured and depends only on the lag.

= x. I (x,y ) Example: Translation. Operations depend on pixel s Coordinates. Context free. Independent of pixel values. I(x,y) Forward mapping:

Sections 2.2 & 2.3 Limit of a Function and Limit Laws

EXERCISE - 01 CHECK YOUR GRASP

Vehicle Arrival Models : Headway

PROBLEMS FOR MATH 162 If a problem is starred, all subproblems are due. If only subproblems are starred, only those are due. SLOPES OF TANGENT LINES

5.1 - Logarithms and Their Properties

156 There are 9 books stacked on a shelf. The thickness of each book is either 1 inch or 2

Poisson process Markov process

7 Wave Equation in Higher Dimensions

Math 36. Rumbos Spring Solutions to Assignment #6. 1. Suppose the growth of a population is governed by the differential equation.

Physics 111. Lecture 38 (Walker: ) Phase Change Latent Heat. May 6, The Three Basic Phases of Matter. Solid Liquid Gas

CHAPTER CHAPTER14. Expectations: The Basic Tools. Prepared by: Fernando Quijano and Yvonn Quijano

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

Explaining Total Factor Productivity. Ulrich Kohli University of Geneva December 2015

AQUIFER DRAWDOWN AND VARIABLE-STAGE STREAM DEPLETION INDUCED BY A NEARBY PUMPING WELL

5/17/2016. Study of patterns in the distribution of organisms across space and time

Operating Systems Exercise 3

DEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING SIGNALS AND SYSTEMS. Assoc. Prof. Dr. Burak Kelleci. Spring 2018

Transcription:

cu : Baysian infnc - Disc obabiliy modls

Many hings abou Baysian infnc fo disc obabiliy modls a simila o fqunis infnc Disc obabiliy modls: Binomial samling Samling a fix numb of ials fom a Bnoulli ocss A Bnoulli ocss is a sis of ials (y, y, ) o wh in ach ial h wo ossibl oucoms (succss and failu) h obabiliy of succss is consan = o wh h mmbs of h s of ossibl squncs y (),, y (M) all wih s succsss and f failus (s + f = M) a xchangabl Th numb of succsss, in n ials is binomial disibud n n ~ n!! n! n, 0,,, n

Hygomic samling Samling a fix numb n of ims (wihou lacmn) fom a fini s of N ims. Th fini s of ims o conains N = R ims of a scific y ( succss im) Th numb of succss ims, among h n samld ims is hygomic disibud R N R n N n ~, 0,,, min( n, R )

ascal samling Samling a andom numb of ials fom a Bnoulli ocss unil a dmind numb of succsss has bn obaind. Th numb of ials ndd is a andom vaiabl n wih a ascal o Ngaiv binomial disibuion ~ n n n n,, n,, Scial cas, whn = : Fis succss (Fs) disibuion ~ n n n, n,, Rlad o h Gomic disibuion ~ x x x, x 0,,

Th oisson ocss A couning ocss wih so-calld indndn incmns Th vns o b cound aas wih an innsiy () Th numb of vns aaing in h im inval (, ) is oisson disibud wih man d i. ~ d,, d,! 0,, Mos common cas: () (consan) and = 0. = (homognous ocss): ~,,! 0,,

Bays hom alid o disc obabiliy disibuions Wha is obsvd is wha (nomally) has a disc obabiliy disibuion. In Binomial samling w obsv h numb of succsss In Hygomic samling w obsv h numb of succss ims in h saml In ascal samling w obsv how many ims nd o b samld In a couning ximn w coun h numb of vns in a scifid im inval Hnc, h disc obabiliy disibuion alicabl uls h liklihood.

Bays hom on a vy gnic fom: Daa ; Daa wh is h obabiliy masu alicabl o h aam and ( ; Daa) is h liklihood of in ligh of h obsvd Daa. Hnc, fo binomial samling fo hygomic samling fo ascal samling fo couning in a homognous oisson ocss n n n, n N n N N n N,, n n n,!, ooionaliy consan: d d Daa ; ofn ;Daa

Exnding wih hy aams ( ) Daa, ψ ; Daa ψ Whn is coninuous and h obabiliy masu is Rimann- Siljs ingabl (h is a cumulaiv disibuion funcion) f Daa, ψ ; Daa f ψ wh f sands fo a obabiliy dnsiy funcion (is fom may vy wll dnd on h condiions ( and (, Daa) scivly)

Excis 3.4 You fl ha, h obabiliy of hads on a oss of a aicula coin is ih 0.4, 0.5 o 0.6. You io obabiliis a (0.4) = 0., (0.5) = 0.7 and (0.6) = 0.. You oss h coin h ims and obain hads onc and ails wic. Wha a h osio obabiliis? If you hn oss h coin h mo ims and onc again obain hads onc and ails wic, wha a h osio obabiliis? Also, comu h osio obabiliis by ooling h wo samls and vising h oiginal obabiliis jus onc; coma wih you vious answs. iklihoods fom fis saml: 0.4; Fis 0.5; Fis 3 0.4 3 0.5 3 0.6; Fis 0.6 0.4 0. 88 0.6 0.5 0.43 0.375

osio obabiliis: Fis 0.4 Fis ;Fis 0.4; Fis 0.4 0.5; Fis 0.5 0.6; Fis 0.6 0.4; Fis 0.4 0.4; Fis 0.4 0.5; Fis 0.5 0.6; Fis 0.6 0.430. 0.89 0.430. 0.3750.7 0.880. 0.3750.7 0.5 Fis 0.430. 0.3750.7 0.880. 0.880. 0.430. 0.3750.7 0.880. 0.75434 0.6 Fis 0. 585467

iklihoods fom scond saml: 0.4;Scond 0.5;Scond 3 0.4 3 0.5 3 0.6;Scond 0.6 0.4 0. 88 0.6 0.5 0.43 0.375 Ths a h sam valus as wih h fis saml sinc h saml oucoms a idnical.

osio obabiliis af scond saml; Scond,(Fis) ;Scond Fis 0.4;Scond 0.4 Fis 0.5;Scond 0.5 Fis 0.6;Scond 0.6 Fis 0.4;Scond 0.4 Fis 0.4;Scond 0.4 Fis 0.5;Scond 0.5 Fis 0.6;Scond 0.6 Fis 0.4 Scond,(Fis) 0.430.89 0.395959 0.430.89 0.3750.75434 0.880.585467 0.5Scond,(Fis) 0.3750.75435 0.736388 0.430.89 0.3750.75434 0.880.585467 0.6 Scond,(Fis) 0.880.585467 0.40853 0.430.89 0.3750.75434 0.880.585467

iklihoods fom oold samls: 0.4; oold 0.5; oold 6 0.4 6 0.5 6 4 0.6; oold 0.6 0.4 0. 384 0.6 0.5 4 4 0.34 0.34375

osio obabiliis: oold 0.4 oold ;oold 0.4; oold 0.4 0.5; oold 0.5 0.6; oold 0.6 0.4; oold 0.4 0.4; oold 0.4 0.5; oold 0.5 0.6; oold 0.6 0.340. 0.395959 0.340. 0.343750.7 0.3840. 0.5 oold 0.343750.7 0.736388 0.340. 0.343750.7 0.3840. 0.6 oold 0.3840. 0.40853 0.340. 0.343750.7 0.3840.

Comaison: 0.4 Scond,(Fis) 0.395959 0.4 oold 0.395959 0.5Scond,(Fis) 0.736388 0.5 oold 0.736388 0.6 Scond,(Fis) 0. 40853 0.6 oold 0. 40853 Idnical suls! Excd? Scond,(Fis) ;Scond Fis 0.4;Scond 0.4 Fis 0.5;Scond 0.5 Fis 0.6;Scond 0.6 Fis ;Scond Fis ;Scond ;Fis 0.4; Fis 0.4 0.5; Fis 0.5 0.6; Fis 0.6 ;Scond ;Fis 4 3 3

oold 6 ;oold 0.4; oold 0.4 0.5; oold 0.5 0.6; oold 0.6 4 4 Hnc h wo ways of comuing h osio obabiliis using boh samls a always idnical

Excis 3.33 Suos ha you fl ha accidns along a aicula sch of highway occu oughly accoding o a oisson ocss and ha h innsiy of h ocss is ih, 3 o 4 accidns wk. You io obabiliis fo hs h ossibl innsiis a 0.5, 0.45 and 0.30, scivly. If you obsv h highway fo a iod of h wks and accidns occu, wha a you osio obabiliis? iklihoods: ; 3; 4;,,, 3 3 3 3! 33! 43! 33 43! 3 0.8580 0.48373 0.0430309

osio obabiliis:, 3 Faculis and 3 cancl ou ms 3 3! 3 3! 33! 3 33 3 3 33 34 3 3 4 4 3 4! 34 4, 3, 3 3 3 0.5 3 3 0.5 3 4 0.5 3 0.5 0.45 4 0.45 0.45 4 0.30 0.45 4 34 4, 3 0.3305849 3 3 3 3 33 33 33 33 34 34 34 0.85347 0.30 0.5608804 0.30 0.30

diciv disibuions Fo an unknown aam of ins,, w would accoding o h subjciv inaion of obabiliy assign a io disibuion uon obaining daa lad o, comu a osio disibuion Th io and osio disibuions a usd o mak infnc abou h unknown xlanaoy infnc W may also b insd in diciv infnc, i.. dic daa lad o no y obaind Fo coss-scional daa h m dicion is mosly usd, whil fo im sis daa w ah us h m focasing.

y,, y M, b h s (fini o infini) of obsvd valus w may obain und condiions uld by h unknown. Th uncainy associad wih ach obsvaion i.. ha is valu/sa canno b known in advanc is modlld by ling h obsvd valu b h alisaion of a andom vaiabl y wih a obabiliy disibuion dnding on : ~ io-diciv disibuions y y f y k Th io-diciv disibuion of y is h s of maginal obabiliis obaind whn h dndncy on is ingad/summd ou by wighing h obabiliy mass funcion f (y ) wih h io disibuion of : ~ y y k f f ~ y y k k d if if k assums assums a numabl valus on a s of coninuous valus scal

osio-diciv disibuions Th osio-diciv disibuion of y is h s of maginal obabiliis obaind whn h dndncy on is ingad/summd ou by wighing h obabiliy mass funcion f (y ) wih h osio disibuion of givn an alady obaind s of obsvaions (Daa): ~ y y f k f Daa ~ y Daa y Daa k k d if assums a numabl s of valus if assums valus on a coninuous scal