CS Homework Week 2 ( 2.25, 3.22, 4.9)
|
|
- Marybeth Lynch
- 5 years ago
- Views:
Transcription
1 CS Homework Week 2 ( 2.25, 3.22, 4.9) Dan Li, Xiaohui Kong, Hammad Ibqal and Ihsan A. Qazi Deparmen of Compuer Science, Universiy of Pisburgh, Pisburgh, PA Inelligen Sysems Program, Universiy of Pisburgh, Pisburgh, PA January 20, 2006 Conens 1 Problem Problem Problem This was wrien by Dan Li 1
2 1 PROBLEM Problem 2.25 A blood es is being performed on n individuals. Each person can be esed separaely, bu his is expensive. Pooling can decrease he cos. The blood sample of k people can be pooled and analyzed ogeher. If he es is negaive, his one es suffices for he group of k in es suffices for he group of k individuals. If he es is posiive, hen each of he k person mus be esed separaely and hus k+1 oal ess are required for he k people. Suppose ha we creae n/k disjoin groups of k people(where k divides n) and use he pooling mehod. Assume ha each person has a posiive resul on he es independenly wih probabiliy p. (a) Wha is he probabiliy ha he es for a pooled sample of k people will be posiive? Answer: The resul of he pooled sample is posiive means ha a leas one of he k esed samples has posiive resul, which probabiliy is: 1 - P(all of he k people have negaive sample). Since we assume ha each person has a posiive resul on he es independenly wih probabiliy p, so ha he probabiliy ha each person has negaive resul is 1 p, and he probabiliy ha all of he k persons have negaive resuls is (1 p) k. Finally we have he probabiliy ha he es for he pooled sample of k people is posiive is: (b) Wha is he expeced number of ess necessary? 1 (1 p) k (1) Answer: A leas one es is needed no maer wha he es resul of he pooled sample is. When he resul is posiive, k exra ess are needed. The probabiliy ha k exra ess are needed is: so ha he expeced number of ess for each group of k people is And here are n/k groups, so he oal number of ess is: 1 (1 p) k (2) 1+k [1 (1 p) k ] = 1+k k (1 p) k (3) N(n,k) = n k [1+k k (1 p)k ] = n (1+ 1 k (1 p)k ) (4) (c) Describe how o find he bes value of k. Answer: In order o find he bes value of k, we need o find such a value of k ha he number from (b) reach is minimum value. This is done by he following: N(n, k) k = k n [1+ 1 k (1 p)k ] = n [ 1 k 2 (1 p)k ln(1 p)] = 0 (5) 2
3 1 PROBLEM 2.25 which gives: k 2 (1 p) k 1 = ln(1 p) The value of k can no be solved in close form. (6) (d) Give an inequaliy ha shows for wha values of p pooling is beer han jus esing every individual. Answer: When he number of ess using pooled sample is less ha he number of ess for esing every individual, he pooling mehod is beer. This is obained by having: n[1+ 1 k (1 p)k ] < n 1+ 1 k (1 p)k < 1 1 < (1 p) k k 1 k > ( 1 p )k k 1 k > 1 1 p 1 p > ( 1 k ) 1 k p < 1 ( 1 k ) 1 k (7) 3
4 2 PROBLEM Problem 3.22 Suppose ha we flip coin n imes o obain n random bis. Consider all m = ( n 2) pairs of hese bis in some order. Le Y i be he exclusive-or of he ih pair of bis, and le Y = m Y i be he number of Y i ha equal 1. (a) Show ha each Y i is 0 wih probabiliy 1/2 and 1 wih probabiliy 1/2. Answer: Each Y i is he exclusive-or of wo bis. Assume Y i = x j x k, hen P(Y i = 1) = P((x j = 0 x k = 1) (x j = 1 x k = 0)) = P(x j = 0 x k = 1)+P(x j = 1 x k = 0) = P(x j = 0) P(x k = 1)+P(x j = 1) P(x k = 0) = = 1 2 (8) and P(Y i = 0) = P((x j = 0 x k = 0) (x j = 1 x k = 1)) = P(x j = 0 x k = 0)+P(x j = 1 x k = 1) = P(x j = 0) P(x k = 0)+P(x j = 1) P(x k = 1) = = 1 2 (9) (b) Show ha he Y i are no muually independen. Answer: Muually independen means for every subse, he probabiliy Pr(Y i Y j Y r ) = Pr(Y i ) P(Y j ) P(Y r ) If we choose such a subse ha hose Y i s have facors in common, for example, we choose Y i = x a x b, Y j = x a x c and Y k = x b x c, hen P(Y i = 1 Y j = 1 Y k = 1) = 0 bu P(Y i = 1)P(Y j = 1)P(Y k = 1) = 1 8 They are no equal. So he Y i s are no muually independen. (c) Show ha he Y i saisfy he propery ha E[Y i Y j ] = E[Y i ]E[Y j ]. 4
5 2 PROBLEM 3.22 Answer: E[Y i Y j ] = Pr(Y i Y j = 1) = Pr(Y i = 1 Y j = 1). If Y i and Y j do no have facor in common, i.e. Y i = x a x b and Y j = x c x d, hen Pr(Y i = 1 Y j = 1) = Pr((x a x b = 1) (x c x d = 1)) = Pr(x a = 0)Pr(x b = 1) P(x c x d = 1) +Pr(x a = 1)Pr(x b = 0) P(x c x d = 1) = 1 4 Pr(x c x d = 1)+ 1 4 Pr(x c x d = 1) = 1 2 Pr(x c x d = 1) = 1 4 (10) If Y i and Y j have one facor in common, i.e. Y i = x a x b and Y j = x b x c, hen Pr(Y i = 1 Y j = 1) = Pr((x a x b = 1) (x b x c = 1)) = Pr(x a = 0)Pr(x b = 1)P(x c = 0) +Pr(x a = 1)Pr(x b = 0)P(x c = 1) = = 1 4 (11) While, for any i, E[Y i ] = Pr(Y i = 1) = Pr(x a = 0 x b = 1)+Pr(x a = 1 x b = 0) = = 1 2 (12) So ha E[Y i ]E[Y j ] = 1 4. In any case, he equaliy E[Y i Y j ] = E[Y i ]E[Y j ] holds. (d) Using Exercise 3.15, find Var[Y]. Answer: Using Exercise 3.15, since he above eualiy holds, and Y = m Y i, Var[Y] = m Var[Y i ] = Y 2 i (Yi) 2 Var[Y i ] = Pr(Y i = 1) (Pr(Y i = 1)) 2 = 1 2 (1 2 )2 = 1 4 (13) 5
6 2 PROBLEM 3.22 So, Var[Y] = m/4. (e) Using Chebyshev s inequaliy, prove a bound on Pr( Y E[Y] n). Answer: Using Chebyshev s inequaliy, Pr( Y E[Y] n) Var[Y] n 2 = m/4 n 2 = n 1 8n = 1 8 (1 1 n ) (14) 6
7 3 PROBLEM Problem 4.9 Suppose ha we can obain independen samples X 1, X 2, of a random variable X and ha we wan o use hese samples o esimae E[X]. Using samples, we use ( X i)/ for esimae of E[X]. We wan he esimae o be wihin εe[x] from he rue value of E[X] wih probabiliy a leas 1-δ. We may no be able o use Chernoff s bound direcly o bound how good our esimae is if X is no a 0-1 random variable, and we do no know is momen generaing funcion. We develop an alernaive approach ha requires only having a bound on he variance of X. Le r = Var[X]/E(X). (a) Show using Chebyshev s inequaliy ha O(r 2 /ε 2 δ) samples are sufficien o solve he problem. Answer: Pr( X i / (1+ε)E[X]) = 1 Pr( = 1 Pr( X i / > (1+ε)E[X]) X i > (1+ε)E[X]) (15) and E( Var( Using Chebyshev s Inequaliy, and wrie Y = X i, Pr( X i ) = E(X i ) = E(X) (16) X i ) = Var(X i ) = Var(X) (17) X i > (1+ε)E[X]) = Pr(Y > E(Y)+εE(Y)) = Pr(Y E(Y) > εe(y)) Pr( Y E(Y) > εe(y)) Var(Y) (εe(y)) 2 = Var( X i) (εe(x)) 2 = Var(X) 2 ε 2 E(X) 2 = r2 ε 2 (18) 7
8 3 PROBLEM 4.9 As long as r 2 /(ε 2 δ), we have Pr( X i / (1+ε)E[X]) = 1 Pr( X i > (1+ε)E[X]) = 1 r2 ε 2 1 δ (19) So he number of esimaes needed is: r 2 /(ε 2 δ) = O(r 2 /ε 2 δ). Bu, if we have O(r 2 /ε 2 δ) samples, i does no guaranee he probabiliy of 1 δ. (b) Suppose ha we need only a weak esimae ha is wihin εe[x] of E[X] wih probabiliy a leas 3/4. Argue ha O(r 2 /ε 2 ) samples are enough for his weak esimae. Answer: Probabiliy of 3/4 means δ = 1/4. By seing δ = 1/4 in O(r 2 /ε 2 δ), we have O(4r 2 /ε 2 ) = O(r 2 /ε 2 ). (c) Show ha, by aking he median of O(log(1/δ)) weak esimaes, we can obain an esimae wihin εe[x] of E[X] wih probabiliy a leas 1-δ. Conclude ha we need only O((r 2 log(1/δ))/ε 2 ) samples. Answer: If he median of he weak esimaes saisfies he condiion, i means less han half of he weak esimaes are no wihin εe[x] of he rue value of E[X]. Le s use a new random variable X i : { 1 if he ih weak esimae fall above εe(x) of E(X) X i = 0 if he ih weak esimae fall below εe(x) of E(X) X i follows binomial disribuion wih probabiliy of 1/4 or more o be 1 and 3/4 or less o be 0. For simpliciy, we use 1/4 in his problem. Lower probabiliy will need lower number of esimaes. If we use X = m X i o represen how many weak esimaes fall above (1+ε)E(X), we will be able o use Chernoff bound o for he value of m so ha Pr(X >= m/2) < δ. Chernoff bound gives: where E(X) = m/4. Use δ = 1, we have Pr(X (1+δ )E(X)) e E(X)δ 2 /3 Pr(X m/2) e m/12 By using m = 12 log(1/δ), we have Pr(X m/2) δ, so ha he probabiliy ha he median of weak esimaes gives resul wihin εe(x) is a leas 1 δ. Each weak esimae uses O(r 2 /ε 2 ) samples, and here are O(log(1/δ)) weak esimaes so ha he oal number of samples is O(r 2 log(1/δ)/ε 2 ). 8
Asymptotic Equipartition Property - Seminar 3, part 1
Asympoic Equipariion Propery - Seminar 3, par 1 Ocober 22, 2013 Problem 1 (Calculaion of ypical se) To clarify he noion of a ypical se A (n) ε and he smalles se of high probabiliy B (n), we will calculae
More informationAnswers to QUIZ
18441 Answers o QUIZ 1 18441 1 Le P be he proporion of voers who will voe Yes Suppose he prior probabiliy disribuion of P is given by Pr(P < p) p for 0 < p < 1 You ake a poll by choosing nine voers a random,
More informationCS Homework Chapter 6 ( 6.14 )
CS50 - Homework Chapter 6 ( 6. Dan Li, Xiaohui Kong, Hammad Ibqal and Ihsan A. Qazi Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 560 Intelligent Systems Program, University
More informationDiscrete Markov Processes. 1. Introduction
Discree Markov Processes 1. Inroducion 1. Probabiliy Spaces and Random Variables Sample space. A model for evens: is a family of subses of such ha c (1) if A, hen A, (2) if A 1, A 2,..., hen A1 A 2...,
More informationAn random variable is a quantity that assumes different values with certain probabilities.
Probabiliy The probabiliy PrA) of an even A is a number in [, ] ha represens how likely A is o occur. The larger he value of PrA), he more likely he even is o occur. PrA) means he even mus occur. PrA)
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
More informationLecture 2 April 04, 2018
Sas 300C: Theory of Saisics Spring 208 Lecure 2 April 04, 208 Prof. Emmanuel Candes Scribe: Paulo Orensein; edied by Sephen Baes, XY Han Ouline Agenda: Global esing. Needle in a Haysack Problem 2. Threshold
More informationGMM - Generalized Method of Moments
GMM - Generalized Mehod of Momens Conens GMM esimaion, shor inroducion 2 GMM inuiion: Maching momens 2 3 General overview of GMM esimaion. 3 3. Weighing marix...........................................
More information20. Applications of the Genetic-Drift Model
0. Applicaions of he Geneic-Drif Model 1) Deermining he probabiliy of forming any paricular combinaion of genoypes in he nex generaion: Example: If he parenal allele frequencies are p 0 = 0.35 and q 0
More informationWhy is Chinese Provincial Output Diverging? Joakim Westerlund, University of Gothenburg David Edgerton, Lund University Sonja Opper, Lund University
Why is Chinese Provincial Oupu Diverging? Joakim Weserlund, Universiy of Gohenburg David Edgeron, Lund Universiy Sonja Opper, Lund Universiy Purpose of his paper. We re-examine he resul of Pedroni and
More informationTransform Techniques. Moment Generating Function
Transform Techniques A convenien way of finding he momens of a random variable is he momen generaing funcion (MGF). Oher ransform echniques are characerisic funcion, z-ransform, and Laplace ransform. Momen
More informationR t. C t P t. + u t. C t = αp t + βr t + v t. + β + w t
Exercise 7 C P = α + β R P + u C = αp + βr + v (a) (b) C R = α P R + β + w (c) Assumpions abou he disurbances u, v, w : Classical assumions on he disurbance of one of he equaions, eg. on (b): E(v v s P,
More informationTHE BERNOULLI NUMBERS. t k. = lim. = lim = 1, d t B 1 = lim. 1+e t te t = lim t 0 (e t 1) 2. = lim = 1 2.
THE BERNOULLI NUMBERS The Bernoulli numbers are defined here by he exponenial generaing funcion ( e The firs one is easy o compue: (2 and (3 B 0 lim 0 e lim, 0 e ( d B lim 0 d e +e e lim 0 (e 2 lim 0 2(e
More informationACE 562 Fall Lecture 5: The Simple Linear Regression Model: Sampling Properties of the Least Squares Estimators. by Professor Scott H.
ACE 56 Fall 005 Lecure 5: he Simple Linear Regression Model: Sampling Properies of he Leas Squares Esimaors by Professor Sco H. Irwin Required Reading: Griffihs, Hill and Judge. "Inference in he Simple
More informationFoundations of Statistical Inference. Sufficient statistics. Definition (Sufficiency) Definition (Sufficiency)
Foundaions of Saisical Inference Julien Beresycki Lecure 2 - Sufficiency, Facorizaion, Minimal sufficiency Deparmen of Saisics Universiy of Oxford MT 2016 Julien Beresycki (Universiy of Oxford BS2a MT
More informationProblem set 2 for the course on. Markov chains and mixing times
J. Seif T. Hirscher Soluions o Proble se for he course on Markov chains and ixing ies February 7, 04 Exercise 7 (Reversible chains). (i) Assue ha we have a Markov chain wih ransiion arix P, such ha here
More informationMath 10B: Mock Mid II. April 13, 2016
Name: Soluions Mah 10B: Mock Mid II April 13, 016 1. ( poins) Sae, wih jusificaion, wheher he following saemens are rue or false. (a) If a 3 3 marix A saisfies A 3 A = 0, hen i canno be inverible. True.
More informationUnit Root Time Series. Univariate random walk
Uni Roo ime Series Univariae random walk Consider he regression y y where ~ iid N 0, he leas squares esimae of is: ˆ yy y y yy Now wha if = If y y hen le y 0 =0 so ha y j j If ~ iid N 0, hen y ~ N 0, he
More informationINTRODUCTION TO MACHINE LEARNING 3RD EDITION
ETHEM ALPAYDIN The MIT Press, 2014 Lecure Slides for INTRODUCTION TO MACHINE LEARNING 3RD EDITION alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/i2ml3e CHAPTER 2: SUPERVISED LEARNING Learning a Class
More informationSolutions to the Exam Digital Communications I given on the 11th of June = 111 and g 2. c 2
Soluions o he Exam Digial Communicaions I given on he 11h of June 2007 Quesion 1 (14p) a) (2p) If X and Y are independen Gaussian variables, hen E [ XY ]=0 always. (Answer wih RUE or FALSE) ANSWER: False.
More informationInnova Junior College H2 Mathematics JC2 Preliminary Examinations Paper 2 Solutions 0 (*)
Soluion 3 x 4x3 x 3 x 0 4x3 x 4x3 x 4x3 x 4x3 x x 3x 3 4x3 x Innova Junior College H Mahemaics JC Preliminary Examinaions Paper Soluions 3x 3 4x 3x 0 4x 3 4x 3 0 (*) 0 0 + + + - 3 3 4 3 3 3 3 Hence x or
More information556: MATHEMATICAL STATISTICS I
556: MATHEMATICAL STATISTICS I INEQUALITIES 5.1 Concenraion and Tail Probabiliy Inequaliies Lemma (CHEBYCHEV S LEMMA) c > 0, If X is a random variable, hen for non-negaive funcion h, and P X [h(x) c] E
More informationON THE NUMBER OF FAMILIES OF BRANCHING PROCESSES WITH IMMIGRATION WITH FAMILY SIZES WITHIN RANDOM INTERVAL
ON THE NUMBER OF FAMILIES OF BRANCHING PROCESSES ITH IMMIGRATION ITH FAMILY SIZES ITHIN RANDOM INTERVAL Husna Hasan School of Mahemaical Sciences Universii Sains Malaysia, 8 Minden, Pulau Pinang, Malaysia
More informationHOMEWORK # 2: MATH 211, SPRING Note: This is the last solution set where I will describe the MATLAB I used to make my pictures.
HOMEWORK # 2: MATH 2, SPRING 25 TJ HITCHMAN Noe: This is he las soluion se where I will describe he MATLAB I used o make my picures.. Exercises from he ex.. Chaper 2.. Problem 6. We are o show ha y() =
More informationIntroduction to Probability and Statistics Slides 4 Chapter 4
Inroducion o Probabiliy and Saisics Slides 4 Chaper 4 Ammar M. Sarhan, asarhan@mahsa.dal.ca Deparmen of Mahemaics and Saisics, Dalhousie Universiy Fall Semeser 8 Dr. Ammar Sarhan Chaper 4 Coninuous Random
More informationLecture 12: Multiple Hypothesis Testing
ECE 830 Fall 00 Saisical Signal Processing insrucor: R. Nowak, scribe: Xinjue Yu Lecure : Muliple Hypohesis Tesing Inroducion In many applicaions we consider muliple hypohesis es a he same ime. Example
More informationGeneralized Least Squares
Generalized Leas Squares Augus 006 1 Modified Model Original assumpions: 1 Specificaion: y = Xβ + ε (1) Eε =0 3 EX 0 ε =0 4 Eεε 0 = σ I In his secion, we consider relaxing assumpion (4) Insead, assume
More informationStat 601 The Design of Experiments
Sa 601 The Design of Experimens Yuqing Xu Deparmen of Saisics Universiy of Wisconsin Madison, WI 53706, USA December 1, 2016 Yuqing Xu (UW-Madison) Sa 601 Week 12 December 1, 2016 1 / 17 Lain Squares Definiion
More informationLecture 2 October ε-approximation of 2-player zero-sum games
Opimizaion II Winer 009/10 Lecurer: Khaled Elbassioni Lecure Ocober 19 1 ε-approximaion of -player zero-sum games In his lecure we give a randomized ficiious play algorihm for obaining an approximae soluion
More informationVehicle Arrival Models : Headway
Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where
More informationApproximation Algorithms for Unique Games via Orthogonal Separators
Approximaion Algorihms for Unique Games via Orhogonal Separaors Lecure noes by Konsanin Makarychev. Lecure noes are based on he papers [CMM06a, CMM06b, LM4]. Unique Games In hese lecure noes, we define
More informationLearning a Class from Examples. Training set X. Class C 1. Class C of a family car. Output: Input representation: x 1 : price, x 2 : engine power
Alpaydin Chaper, Michell Chaper 7 Alpaydin slides are in urquoise. Ehem Alpaydin, copyrigh: The MIT Press, 010. alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/ ehem/imle All oher slides are based on Michell.
More informationComputer Simulates the Effect of Internal Restriction on Residuals in Linear Regression Model with First-order Autoregressive Procedures
MPRA Munich Personal RePEc Archive Compuer Simulaes he Effec of Inernal Resricion on Residuals in Linear Regression Model wih Firs-order Auoregressive Procedures Mei-Yu Lee Deparmen of Applied Finance,
More informationOscillation of an Euler Cauchy Dynamic Equation S. Huff, G. Olumolode, N. Pennington, and A. Peterson
PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON DYNAMICAL SYSTEMS AND DIFFERENTIAL EQUATIONS May 4 7, 00, Wilmingon, NC, USA pp 0 Oscillaion of an Euler Cauchy Dynamic Equaion S Huff, G Olumolode,
More informationMath 106: Review for Final Exam, Part II. (x x 0 ) 2 = !
Mah 6: Review for Final Exam, Par II. Use a second-degree Taylor polynomial o esimae 8. We choose f(x) x and x 7 because 7 is he perfec cube closes o 8. f(x) x / f(7) f (x) x / f (7) x / 7 / 7 f (x) 9
More information5.1 - Logarithms and Their Properties
Chaper 5 Logarihmic Funcions 5.1 - Logarihms and Their Properies Suppose ha a populaion grows according o he formula P 10, where P is he colony size a ime, in hours. When will he populaion be 2500? We
More informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More informationSOLUTIONS TO ECE 3084
SOLUTIONS TO ECE 384 PROBLEM 2.. For each sysem below, specify wheher or no i is: (i) memoryless; (ii) causal; (iii) inverible; (iv) linear; (v) ime invarian; Explain your reasoning. If he propery is no
More informationExpert Advice for Amateurs
Exper Advice for Amaeurs Ernes K. Lai Online Appendix - Exisence of Equilibria The analysis in his secion is performed under more general payoff funcions. Wihou aking an explici form, he payoffs of he
More informationDistribution of Estimates
Disribuion of Esimaes From Economerics (40) Linear Regression Model Assume (y,x ) is iid and E(x e )0 Esimaion Consisency y α + βx + he esimaes approach he rue values as he sample size increases Esimaion
More informationChristos Papadimitriou & Luca Trevisan November 22, 2016
U.C. Bereley CS170: Algorihms Handou LN-11-22 Chrisos Papadimiriou & Luca Trevisan November 22, 2016 Sreaming algorihms In his lecure and he nex one we sudy memory-efficien algorihms ha process a sream
More informationSupplement for Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence
Supplemen for Sochasic Convex Opimizaion: Faser Local Growh Implies Faser Global Convergence Yi Xu Qihang Lin ianbao Yang Proof of heorem heorem Suppose Assumpion holds and F (w) obeys he LGC (6) Given
More informationACE 562 Fall Lecture 8: The Simple Linear Regression Model: R 2, Reporting the Results and Prediction. by Professor Scott H.
ACE 56 Fall 5 Lecure 8: The Simple Linear Regression Model: R, Reporing he Resuls and Predicion by Professor Sco H. Irwin Required Readings: Griffihs, Hill and Judge. "Explaining Variaion in he Dependen
More informationEnsamble methods: Bagging and Boosting
Lecure 21 Ensamble mehods: Bagging and Boosing Milos Hauskrech milos@cs.pi.edu 5329 Senno Square Ensemble mehods Mixure of expers Muliple base models (classifiers, regressors), each covers a differen par
More informationRobust estimation based on the first- and third-moment restrictions of the power transformation model
h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Linear Response Theory: The connecion beween QFT and experimens 3.1. Basic conceps and ideas Q: How do we measure he conduciviy of a meal? A: we firs inroduce a weak elecric field E, and
More informationRandom variables. A random variable X is a function that assigns a real number, X(ζ), to each outcome ζ in the sample space of a random experiment.
Random variables Some random eperimens may yield a sample space whose elemens evens are numbers, bu some do no or mahemaical purposes, i is desirable o have numbers associaed wih he oucomes A random variable
More information5. Stochastic processes (1)
Lec05.pp S-38.45 - Inroducion o Teleraffic Theory Spring 2005 Conens Basic conceps Poisson process 2 Sochasic processes () Consider some quaniy in a eleraffic (or any) sysem I ypically evolves in ime randomly
More informationPredator - Prey Model Trajectories and the nonlinear conservation law
Predaor - Prey Model Trajecories and he nonlinear conservaion law James K. Peerson Deparmen of Biological Sciences and Deparmen of Mahemaical Sciences Clemson Universiy Ocober 28, 213 Ouline Drawing Trajecories
More informationChapter 3 Common Families of Distributions
Chaer 3 Common Families of Disribuions Secion 31 - Inroducion Purose of his Chaer: Caalog many of common saisical disribuions (families of disribuions ha are indeed by one or more arameers) Wha we should
More informationHomework 10 (Stats 620, Winter 2017) Due Tuesday April 18, in class Questions are derived from problems in Stochastic Processes by S. Ross.
Homework (Sas 6, Winer 7 Due Tuesday April 8, in class Quesions are derived from problems in Sochasic Processes by S. Ross.. A sochasic process {X(, } is said o be saionary if X(,..., X( n has he same
More informationThe Effect of Nonzero Autocorrelation Coefficients on the Distributions of Durbin-Watson Test Estimator: Three Autoregressive Models
EJ Exper Journal of Economi c s ( 4 ), 85-9 9 4 Th e Au h or. Publi sh ed by Sp rin In v esify. ISS N 3 5 9-7 7 4 Econ omics.e xp erjou rn a ls.com The Effec of Nonzero Auocorrelaion Coefficiens on he
More informationEnsamble methods: Boosting
Lecure 21 Ensamble mehods: Boosing Milos Hauskrech milos@cs.pi.edu 5329 Senno Square Schedule Final exam: April 18: 1:00-2:15pm, in-class Term projecs April 23 & April 25: a 1:00-2:30pm in CS seminar room
More informationTypes of Exponential Smoothing Methods. Simple Exponential Smoothing. Simple Exponential Smoothing
M Business Forecasing Mehods Exponenial moohing Mehods ecurer : Dr Iris Yeung Room No : P79 Tel No : 788 8 Types of Exponenial moohing Mehods imple Exponenial moohing Double Exponenial moohing Brown s
More informationPENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD
PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD HAN XIAO 1. Penalized Leas Squares Lasso solves he following opimizaion problem, ˆβ lasso = arg max β R p+1 1 N y i β 0 N x ij β j β j (1.1) for some 0.
More informationThe Arcsine Distribution
The Arcsine Disribuion Chris H. Rycrof Ocober 6, 006 A common heme of he class has been ha he saisics of single walker are ofen very differen from hose of an ensemble of walkers. On he firs homework, we
More informationOverview. COMP14112: Artificial Intelligence Fundamentals. Lecture 0 Very Brief Overview. Structure of this course
OMP: Arificial Inelligence Fundamenals Lecure 0 Very Brief Overview Lecurer: Email: Xiao-Jun Zeng x.zeng@mancheser.ac.uk Overview This course will focus mainly on probabilisic mehods in AI We shall presen
More informationt is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...
Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger
More informationOn Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature
On Measuring Pro-Poor Growh 1. On Various Ways of Measuring Pro-Poor Growh: A Shor eview of he Lieraure During he pas en years or so here have been various suggesions concerning he way one should check
More informationCash Flow Valuation Mode Lin Discrete Time
IOSR Journal of Mahemaics (IOSR-JM) e-issn: 2278-5728,p-ISSN: 2319-765X, 6, Issue 6 (May. - Jun. 2013), PP 35-41 Cash Flow Valuaion Mode Lin Discree Time Olayiwola. M. A. and Oni, N. O. Deparmen of Mahemaics
More information6.003 Homework #8 Solutions
6.003 Homework #8 Soluions Problems. Fourier Series Deermine he Fourier series coefficiens a k for x () shown below. x ()= x ( + 0) 0 a 0 = 0 a k = e /0 sin(/0) for k 0 a k = π x()e k d = 0 0 π e 0 k d
More informationBias in Conditional and Unconditional Fixed Effects Logit Estimation: a Correction * Tom Coupé
Bias in Condiional and Uncondiional Fixed Effecs Logi Esimaion: a Correcion * Tom Coupé Economics Educaion and Research Consorium, Naional Universiy of Kyiv Mohyla Academy Address: Vul Voloska 10, 04070
More informationTesting the Random Walk Model. i.i.d. ( ) r
he random walk heory saes: esing he Random Walk Model µ ε () np = + np + Momen Condiions where where ε ~ i.i.d he idea here is o es direcly he resricions imposed by momen condiions. lnp lnp µ ( lnp lnp
More informationYou must fully interpret your results. There is a relationship doesn t cut it. Use the text and, especially, the SPSS Manual for guidance.
POLI 30D SPRING 2015 LAST ASSIGNMENT TRUMPETS PLEASE!!!!! Due Thursday, December 10 (or sooner), by 7PM hrough TurnIIn I had his all se up in my mind. You would use regression analysis o follow up on your
More informationSTA 114: Statistics. Notes 2. Statistical Models and the Likelihood Function
STA 114: Saisics Noes 2. Saisical Models and he Likelihood Funcion Describing Daa & Saisical Models A physicis has a heory ha makes a precise predicion of wha s o be observed in daa. If he daa doesn mach
More informationRandom Processes 1/24
Random Processes 1/24 Random Process Oher Names : Random Signal Sochasic Process A Random Process is an exension of he concep of a Random variable (RV) Simples View : A Random Process is a RV ha is a Funcion
More informationEcon107 Applied Econometrics Topic 7: Multicollinearity (Studenmund, Chapter 8)
I. Definiions and Problems A. Perfec Mulicollineariy Econ7 Applied Economerics Topic 7: Mulicollineariy (Sudenmund, Chaper 8) Definiion: Perfec mulicollineariy exiss in a following K-variable regression
More information13.3 Term structure models
13.3 Term srucure models 13.3.1 Expecaions hypohesis model - Simples "model" a) shor rae b) expecaions o ge oher prices Resul: y () = 1 h +1 δ = φ( δ)+ε +1 f () = E (y +1) (1) =δ + φ( δ) f (3) = E (y +)
More informationOutline. lse-logo. Outline. Outline. 1 Wald Test. 2 The Likelihood Ratio Test. 3 Lagrange Multiplier Tests
Ouline Ouline Hypohesis Tes wihin he Maximum Likelihood Framework There are hree main frequenis approaches o inference wihin he Maximum Likelihood framework: he Wald es, he Likelihood Raio es and he Lagrange
More informationChapter 5. Heterocedastic Models. Introduction to time series (2008) 1
Chaper 5 Heerocedasic Models Inroducion o ime series (2008) 1 Chaper 5. Conens. 5.1. The ARCH model. 5.2. The GARCH model. 5.3. The exponenial GARCH model. 5.4. The CHARMA model. 5.5. Random coefficien
More information1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
More informationAppendix to Creating Work Breaks From Available Idleness
Appendix o Creaing Work Breaks From Available Idleness Xu Sun and Ward Whi Deparmen of Indusrial Engineering and Operaions Research, Columbia Universiy, New York, NY, 127; {xs2235,ww24}@columbia.edu Sepember
More informationI. Return Calculations (20 pts, 4 points each)
Universiy of Washingon Spring 015 Deparmen of Economics Eric Zivo Econ 44 Miderm Exam Soluions This is a closed book and closed noe exam. However, you are allowed one page of noes (8.5 by 11 or A4 double-sided)
More informationSome Ramsey results for the n-cube
Some Ramsey resuls for he n-cube Ron Graham Universiy of California, San Diego Jozsef Solymosi Universiy of Briish Columbia, Vancouver, Canada Absrac In his noe we esablish a Ramsey-ype resul for cerain
More informationTwo Coupled Oscillators / Normal Modes
Lecure 3 Phys 3750 Two Coupled Oscillaors / Normal Modes Overview and Moivaion: Today we ake a small, bu significan, sep owards wave moion. We will no ye observe waves, bu his sep is imporan in is own
More informationLearning a Class from Examples. Training set X. Class C 1. Class C of a family car. Output: Input representation: x 1 : price, x 2 : engine power
Alpaydin Chaper, Michell Chaper 7 Alpaydin slides are in urquoise. Ehem Alpaydin, copyrigh: The MIT Press, 010. alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/ ehem/imle All oher slides are based on Michell.
More informationLinear Quadratic Regulator (LQR) - State Feedback Design
Linear Quadrai Regulaor (LQR) - Sae Feedbak Design A sysem is expressed in sae variable form as x = Ax + Bu n m wih x( ) R, u( ) R and he iniial ondiion x() = x A he sabilizaion problem using sae variable
More informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationRandom Walk with Anti-Correlated Steps
Random Walk wih Ani-Correlaed Seps John Noga Dirk Wagner 2 Absrac We conjecure he expeced value of random walks wih ani-correlaed seps o be exacly. We suppor his conjecure wih 2 plausibiliy argumens and
More informationHamilton- J acobi Equation: Weak S olution We continue the study of the Hamilton-Jacobi equation:
M ah 5 7 Fall 9 L ecure O c. 4, 9 ) Hamilon- J acobi Equaion: Weak S oluion We coninue he sudy of he Hamilon-Jacobi equaion: We have shown ha u + H D u) = R n, ) ; u = g R n { = }. ). In general we canno
More informationZürich. ETH Master Course: L Autonomous Mobile Robots Localization II
Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),
More information(a) Set up the least squares estimation procedure for this problem, which will consist in minimizing the sum of squared residuals. 2 t.
Insrucions: The goal of he problem se is o undersand wha you are doing raher han jus geing he correc resul. Please show your work clearly and nealy. No credi will be given o lae homework, regardless of
More informationStatistical Distributions
Saisical Disribuions 1 Discree Disribuions 1 The uniform disribuion A random variable (rv) X has a uniform disribuion on he n-elemen se A = {x 1,x 2,,x n } if P (X = x) =1/n whenever x is in he se A The
More informationACE 564 Spring Lecture 7. Extensions of The Multiple Regression Model: Dummy Independent Variables. by Professor Scott H.
ACE 564 Spring 2006 Lecure 7 Exensions of The Muliple Regression Model: Dumm Independen Variables b Professor Sco H. Irwin Readings: Griffihs, Hill and Judge. "Dumm Variables and Varing Coefficien Models
More informationLicenciatura de ADE y Licenciatura conjunta Derecho y ADE. Hoja de ejercicios 2 PARTE A
Licenciaura de ADE y Licenciaura conjuna Derecho y ADE Hoja de ejercicios PARTE A 1. Consider he following models Δy = 0.8 + ε (1 + 0.8L) Δ 1 y = ε where ε and ε are independen whie noise processes. In
More informationPhysics 127b: Statistical Mechanics. Fokker-Planck Equation. Time Evolution
Physics 7b: Saisical Mechanics Fokker-Planck Equaion The Langevin equaion approach o he evoluion of he velociy disribuion for he Brownian paricle migh leave you uncomforable. A more formal reamen of his
More informationIntroduction D P. r = constant discount rate, g = Gordon Model (1962): constant dividend growth rate.
Inroducion Gordon Model (1962): D P = r g r = consan discoun rae, g = consan dividend growh rae. If raional expecaions of fuure discoun raes and dividend growh vary over ime, so should he D/P raio. Since
More informationME 391 Mechanical Engineering Analysis
Fall 04 ME 39 Mechanical Engineering Analsis Eam # Soluions Direcions: Open noes (including course web posings). No books, compuers, or phones. An calculaor is fair game. Problem Deermine he posiion of
More information2.3 SCHRÖDINGER AND HEISENBERG REPRESENTATIONS
Andrei Tokmakoff, MIT Deparmen of Chemisry, 2/22/2007 2-17 2.3 SCHRÖDINGER AND HEISENBERG REPRESENTATIONS The mahemaical formulaion of he dynamics of a quanum sysem is no unique. So far we have described
More informationForecasting optimally
I) ile: Forecas Evaluaion II) Conens: Evaluaing forecass, properies of opimal forecass, esing properies of opimal forecass, saisical comparison of forecas accuracy III) Documenaion: - Diebold, Francis
More informationExam 3 Review (Sections Covered: , )
19 Exam Review (Secions Covered: 776 8184) 1 Adieisloadedandihasbeendeerminedhaheprobabiliydisribuionassociaedwih he experimen of rolling he die and observing which number falls uppermos is given by he
More informationComparing Means: t-tests for One Sample & Two Related Samples
Comparing Means: -Tess for One Sample & Two Relaed Samples Using he z-tes: Assumpions -Tess for One Sample & Two Relaed Samples The z-es (of a sample mean agains a populaion mean) is based on he assumpion
More informationStochastic models and their distributions
Sochasic models and heir disribuions Couning cusomers Suppose ha n cusomers arrive a a grocery a imes, say T 1,, T n, each of which akes any real number in he inerval (, ) equally likely The values T 1,,
More informationKEY. Math 334 Midterm III Winter 2008 section 002 Instructor: Scott Glasgow
KEY Mah 334 Miderm III Winer 008 secion 00 Insrucor: Sco Glasgow Please do NOT wrie on his exam. No credi will be given for such work. Raher wrie in a blue book, or on your own paper, preferably engineering
More informationNature Neuroscience: doi: /nn Supplementary Figure 1. Spike-count autocorrelations in time.
Supplemenary Figure 1 Spike-coun auocorrelaions in ime. Normalized auocorrelaion marices are shown for each area in a daase. The marix shows he mean correlaion of he spike coun in each ime bin wih he spike
More informationEmpirical Process Theory
Empirical Process heory 4.384 ime Series Analysis, Fall 27 Reciaion by Paul Schrimpf Supplemenary o lecures given by Anna Mikusheva Ocober 7, 28 Reciaion 7 Empirical Process heory Le x be a real-valued
More informationProblem Set 5. Graduate Macro II, Spring 2017 The University of Notre Dame Professor Sims
Problem Se 5 Graduae Macro II, Spring 2017 The Universiy of Nore Dame Professor Sims Insrucions: You may consul wih oher members of he class, bu please make sure o urn in your own work. Where applicable,
More informationGraphical Event Models and Causal Event Models. Chris Meek Microsoft Research
Graphical Even Models and Causal Even Models Chris Meek Microsof Research Graphical Models Defines a join disribuion P X over a se of variables X = X 1,, X n A graphical model M =< G, Θ > G =< X, E > is
More informationAn Introduction to Malliavin calculus and its applications
An Inroducion o Malliavin calculus and is applicaions Lecure 5: Smoohness of he densiy and Hörmander s heorem David Nualar Deparmen of Mahemaics Kansas Universiy Universiy of Wyoming Summer School 214
More informationSELBERG S CENTRAL LIMIT THEOREM ON THE CRITICAL LINE AND THE LERCH ZETA-FUNCTION. II
SELBERG S CENRAL LIMI HEOREM ON HE CRIICAL LINE AND HE LERCH ZEA-FUNCION. II ANDRIUS GRIGUIS Deparmen of Mahemaics Informaics Vilnius Universiy, Naugarduko 4 035 Vilnius, Lihuania rius.griguis@mif.vu.l
More information