On Thresholds for Robust Goodness-of-Fit Tests

Size: px
Start display at page:

Download "On Thresholds for Robust Goodness-of-Fit Tests"

Transcription

1 O Thresholds for Robust Goodess-of-Fit Tests Jayakrisha Uikrisha, Sea Mey, ad Veugopal V. Veeravalli Dept. of Electrical ad Computer Egieerig Coordiated Sciece Laboratory Uiversity of Illiois at Urbaa-Champaig Urbaa, IL {juikr2, mey, Abstract Goodess-of-fit tests are statistical procedures used to test the hypothesis H 0 that a set of observatios were draw accordig to some give probability distributio. Decisio thresholds used i goodess-of-fit tests are typically set for guarateeig a target false-alarm probability. I may popular testig procedures results o the weak covergece of the test statistics are used for settig approimate thresholds whe eact computatio is ifeasible. I this work, we study robust procedures for goodess-of-fit where accurate models are ot available for the distributio of the observatios uder hypothesis H 0. We develop procedures for settig thresholds i two specific eamples - a robust versio of the Kolmogorov- Smirov test for cotiuous alphabets ad a robust versio of the Hoeffdig test for fiite alphabets. I. INTRODUCTION Suppose we are give a sequece of observatios Z = {Z i : i = 1,...,} ad we are iterested i determiig whether or ot the observatios were geerated i.i.d. with law π. We refer to this hypothesis as the ull hypothesis ad deote it by H 0 : Z i.i.d.(π). (1) I iformatio theory, this problem is typically referred to as a uiversal hypothesis testig problem [1], [2] while i statistics this problem is called a goodess-offit problem [3]. A uiversal hypothesis testig procedure typically outputs a biary decisio obtaied by computig some fuctio of the observatios ad comparig it to a threshold. The threshold is chose to meet some costrait o the probability of false alarm - i.e. the probability of rejectig hypothesis H 0 whe the hypothesis H 0 is true. A goodess-of-fit procedure, o the other had, computes some fuctio of the observatios ad outputs a p-value [4] which represets the cofidece with which oe ca accept the hypothesis H 0. Both these procedures are i fact similar, with the false alarm costrait used i the uiversal hypothesis test playig the role of the p-value obtaied i the goodess-of-fit approach. I several popular goodess-of-fit procedures icludig the Kolmogorov-Smirov test ad the chi-square test [4], weak covergece results of the test statistic are used for settig thresholds for a target false alarm level. For istace, i the chi-square test it is kow that the test statistic coverges to a chi-square distributio. Hece, for large, this result gives a approimate procedure for settig the threshold for a target false alarm probability. Such procedures are particularly useful, ofte ecessary, whe it is difficult to compute the eact error probabilities for large values of the legth of the observatio sequece Z. A eact computatio for large would typically require comple simulatios. I this paper we study a robust versio of the goodess-of-fit problem i which we do ot kow π eactly but do kow that π lies i some ucertaity class of probability distributios P. We are iterested i testig whether or ot some distributio from P adequately describes the distributio that geerated the observatios. Hece the ew problem of iterest ca be described by the followig composite ull hypothesis: 0 : Z i.i.d.(π) for some π P. (2) We propose robust versios of two stadard goodessof-fit tests, viz., the Kolmogorov-Smirov (KS) test ad the Hoeffdig test. We also obtai weak covergece results for the robust test statistic which ca be used to set thresholds that meet the costrait that the worst-case false alarm probability amog all distributios i P is less tha a give costrait. Such approimate methods for settig thresholds are more importat for robust problems because it is geerally ot possible to obtai thresholds by simulatios, sice there are ifiitely may possibilities for the ukow distributios i P. We first study the robust KS test i Sectio II ad the the robust Hoeffdig test i Sectio III.

2 II. ROBUST KOLMOGOROV-SMIRNOV TEST The stadard versio of the KS test is used to determie whether or ot a give sequece of observatios is draw uder a probability distributio with a cotiuous distributio fuctio F 0 defied over some closed iterval Z R. Here F 0 takes the role of π i (1) ad H 0 represets the hypothesis that the observatios Z were draw i.i.d. from F 0. The test statistic used is D = sup F () F 0 () (3) where F represets the empirical distributio fuctio defied by F () = 1 I{Z i } i=1 where I is the idicator fuctio. I the KS test based o Z, the test statistic D is compared to a threshold τ chose so that the probability of error uder hypothesis H 0 is less tha some desired level. It is geerally difficult to compute the eact distributio of the statistic D for large sequece legths. The typical practice is to use the followig result by Kolmogorov for approimatig the distributio of D for large. Whe the observatios Z are draw i.i.d. from F 0, the followig weak covergece result holds: P F 0{ D > δ} d. P{ sup K(t) > δ} (4) t [0,1] where K is the Browia bridge [5, p. 335]. The subscript of F 0 i (4) idicates that the observatios were draw from distributio F 0. Usig this result thresholds are usually set usig look-up tables cotaiig values of the distributio fuctio of sup t [0,1] K(t). While usig the KS test i practice, oe ofte faces the problem of over-fittig. If the true uderlyig distributio is ot eactly F 0 but some other distributio close to F 0 the the KS-test will evetually reject hypothesis H 0 for large eough. I this work we propose a ew robust versio of the KS test that could potetially address this issue. The idea is to elarge the set of acceptable hypotheses beyod the sigleto {F 0 }. We defie a ew class of distributios as follows: F = {G P(Z) : F () G() F + (), Z} where P(Z) is the space of all probability distributios o Z ad F ad F + are cotiuous probability distributio fuctios such that the omial distributio F 0 F. We are ow iterested i testig the followig composite hypothesis: 0 : Z i.i.d.(g), for some G F. The advatage of usig such a ucertaity class 1, as it will become clear later, is that the resultig robust test is a simple modificatio of the stadard KS test, ad also admits a straightforward cofidece approimatio i the asymptotic settig. The distributios F + ad F ca be chose to cotrol the size of the class F that are acceptable as beig close to F 0. The proposed robust test uses the followig robust test statistic: E = mi sup F F F () F() (5) where F is the empirical distributio fuctio. The robust test for goodess-of-fit compares E to a threshold τ ad accepts hypothesis H0 ROB iff E τ. Thus the biary decisio is give by φ ROB τ, (Z) = I{E > τ} (6) where I is the idicator fuctio ad a decisio φ ROB τ, = 0 represets a decisio acceptig H0 ROB ad φ ROB τ, = 1 represets a decisio rejectig H0 ROB. Let F deote the miimizer i (5) ad let deote the poit at which the supremum i (5) is achieved for F = F. It is clear that if E > 0, the F is either F + or F. By defiitio it is obvious that for ay δ > 0, the evet { E > δ} ca be writte as the uio of two evets as follows: { E > δ} = {sup (F () F + ()) > δ} {sup [ (F () F ())] > δ}. (7) The threshold used i (6) ca be set usig the followig theorem that studies the asymptotic behavior of p (δ) := ma P G{ E > δ}. Theorem II.1. For large eough, p (δ) satisfies the followig iequalities: p(δ) p (δ) 2p(δ) 1 Whether this robust class works for a particular applicatio i mid eeds to be see through eperimets. For eample, if the deviatio is because the observatios are ot completely i.i.d. the the proposed test will ot be robust to such deviatios from omial behavior.

3 with p(δ) defied by p(δ) := P{sup t [0,1] K(t) > δ} where K is the Browia bridge. Proof: We kow from (7) that for ay G F, P G {sup (F () F + ()) > δ} P G { E > δ} P G {sup (F () F + ()) > δ} +P G {sup [ (F () F ())] > δ} Hece, ma P G{sup (F () F + ()) > δ} ma P G{ E > δ} ma P G{sup (F () F + ()) > δ} + ma P G{sup [ (F () F ())] > δ} which simplifies to: P F +{sup (F () F + ()) > δ} ma P G{ E > δ} P F +{sup (F () F + ()) > δ} +P F {sup [ (F () F ())] > δ} It is kow by aother result of Kolmogorov [5, p. 335] that P F +{ sup(f () F + ()) > δ} p(δ). Similarly it also follows that P F { sup(f () F ()) > δ} p(δ). The coclusio of the theorem follows by combiig both results. Theorem II.1 suggests that if δ is chose such that 2p(δ) = α, ad the threshold τ i the robust test (6) is chose such that τ = δ, the for a large eough, the test satisfies a uiform boud o the probability of rejectig H0 ROB over all distributios i F. i.e., for large eough ma P G{φ ROB τ, (Z) = 1} α. (8) Furthermore, for large eough we also have ma P G{φ ROB τ,(z) = 1} 1 2α. (9) which meas that the maimum false alarm probability is withi a factor of 0.5 from the desired level. Thus for a large umber of give observatios, the above result ca be used to set the threshold τ for a target false alarm costrait α by lookig up values of the p-fuctio from a table. A importat questio that we are curretly studyig is how large should be to guaratee that the probability o the left had side of (8) is withi ǫ from α. III. ROBUST HOEFFDING TEST The Hoeffdig test [2] is a stadard goodess-of-fit test for fiite alphabets. The test statistic is give by the divergece D(Γ π) where π is the probability distributio of iterest defied over a fiite alphabet Z, ad Γ is the empirical distributio (type) of the first observatios defied by Γ (z) = 1 I{Z i = z}, z Z. i=1 The followig weak covergece result for the test statistic uder π is well kow [6],[1]: 2D(Γ d. π) χ2 N 1 (10) where N is the size of the support of distributio π ad χ 2 γ deotes a chi-square radom variable with γ degrees of freedom. This result eables us to set approimate thresholds for large usig tables of the chi-square distributio. A robust versio of the Hoeffdig test was defied i [7] that uses the followig robust versio of the divergece as the test statistic: if π P D(Γ π) where P is a ucertaity class of acceptable distributios. This is a uiversal hypothesis test where we are ow testig the composite ull hypothesis give by 0 : Z i.i.d.(π) for some π P. We defie a robust versio of the divergece as follows: D ROB (µ P) := if π P D(µ π). Thus the proposed test is represeted by the biary decisio φ ROB τ,(z) = I{D ROB (Γ P) > τ} (11) where τ is a threshold that must be chose to meet the costrait o the false alarm probability.

4 I the rest of this sectio we address the followig questio: Ca we obtai ay covergece results for the worst case probability of error of the robust Hoeffdig test like those implied by the weak covergece result of (10)? We evaluate the limitig value of P π {D ROB (Γ P) > η} (12) for π P. It is easy to see that whe the ifimum i (12) is achieved, the miimizig distributio is π ML, the maimum likelihood (ML) estimate of the uderlyig distributio from P [1]. Hece, we are really iterested i fidig the asymptotic behavior of P π {D(Γ π ML ) > η}. I Theorem III.1 we aswer this questio for a special choice of P defied below. We study the sceario where P is a ucertaity class defied through the followig momet costraits as cosidered i [7]: P := {π P(Z) : π(ψ i ) = 0, 1 i d}. Here P(Z) deotes the set of probability distributios over Z ad for ay fuctio f : Z R ad for ay distributio π P(Z), we use the followig abusive otatio for the epected value of fuctio f: π(f) := z Zπ(z)f(z). Note that for z Z, π(z) deotes the probability mass at z uder measure π. The meaig will be clear from cotet. Let ψ deote the vector of fuctios (ψ 1,ψ 2,...,ψ d ) T ad Z π deote the support of distributio π. We make the followig assumptios about the fuctios {ψ i : 1 i d}: (A1) There is some distributio π 0 P such that the fuctios {ψ i : 0 i d} are liearly idepedet over Z π 0, where ψ 0 1. (A2) The origi 0 R d is a iterior poit of the set of feasible momet vectors, defied as := { R d : i = µ(ψ i ),i = 1,...,d, for some µ P(Z)}. We kow from the results of [7] that the robust divergece with respect to P ca be epressed as the solutio to the followig optimizatio problem: D ROB (µ P) = sup µ(log(1 + r T ψ)) (13) r R where the supremum is take over R := {r R d : 1 + r T ψ(z) 0 for all z Z} ad r T ψ deotes the fuctio d i=1 r i ψ i. It was also show i [1, Sectio II.E] that the robust divergece ca be epressed as a mismatched divergece defied with respect to a log-liear fuctio class. I the rest of this sectio, we argue that the results o weak covergece of the mismatched divergece statistic from [1, Theorem III.3(i)] ca be used to set thresholds for the robust hypothesis testig procedure. The mai result of this sectio is the followig theorem. For ay π P, let d π deote the umber that is oe lower tha the maimal umber of fuctios i {ψ i : 0 i d} that are liearly idepedet over Z π. I other words, d π + 1 is the dimesio of the spa of the fuctios {ψ i : 0 i d} whe restricted to Z π. Theorem III.1. Suppose assumptios (A1) ad (A2) hold. The, the followig weak covergece result holds uder π: 2D ROB (Γ d. P) χ2 d π. (14) Hece we have sup lim P π{2d ROB (Γ P) > η} = 1 F(d,η) (15) π P where F(d, η) is the cumulative distributio fuctio of a chi-square distributio with d degrees of freedom evaluated at η. The secod coclusio i the theorem above follows directly from the first, usig the fact that chi-square distributios are stochastically ordered accordig to the umber of degrees of freedom. I order to prove the mai result, we eed the followig lemma: Lemma III.2. Suppose the fuctios {ψ i : 0 i d} are liearly idepedet over the support of π. If Z π deotes the support of π P, the there eists a ope eighborhood B P(Z π ) such that for all µ B, the supremum i (13) is achieved at a uique poit r(µ). Proof: We verify that the propositio i the lemma holds for B = {µ P(Z) : µ(z) π(z) < ǫ for all z Z π, µ(y) = 0 for all y Z \ Z π } where ǫ = 1 2 mi z Z π π(z). Clearly, for all µ B, the support of µ is equal to Z π ad hece 0 D ROB (µ P) D(µ π) <. Now sice the fuctios ψ i are liearly idepedet over Z π, ad the value of the the optimizatio problem i (13) is fiite, it follows that we ca restrict the costrait set i (13) to a bouded subset of the closed set R. Thus

5 we ca restrict the optimizatio i (13) to a compact set. Furthermore, the objective fuctio is strictly cocave by the liear idepedece assumptio ad hece the coclusio of the lemma follows. Proof of Theorem III.1: Suppose d π = d. We kow by the discussio i [1, Sectio II.E] that the robust divergece ca be epressed as a mismatched divergece defied with respect to a log-liear fuctio class. I.e., D ROB (µ P) = D MM (µ π) where D MM is a relaatio of the divergece with respect to the log-liear fuctio class defied by F = {log(1 + r T ψ) : r R} D MM (µ π) = sup{µ(f) log(π(e f ))}. f F From the coclusios of Lemma III.2 it follows that the coditios of [1, Theorem III.3(i)] are satisfied ad hece the coclusio of (14) follows whe d π = d. Now, if d π < d it is clear that we ca defie a ew set of d π fuctios ψ = {ψ 1,...,ψ d π } such that the spa of the fuctios i ψ over Z π is idetical to that of the fuctios i ψ over Z π, ad further guarateeig the coditio that {ψ 0,ψ } are liearly idepedet over Z π. Hece for all µ P(Z π ) the formula for the rate fuctio i (13) is uaffected by this trasformatio. Thus the result of (14) holds for a geeral π P, by the same argumets as before. The result of (15) ca be used to set thresholds for the robust Hoeffdig test. For a give, suppose we choose τ i (11) such that τ = δ 2 where δ satisfies IV. CONCLUSIONS AND EXTENSIONS We have show that weak covergece results similar to those used for settig thresholds i goodessof-fit procedures ca also be obtaied i some robust goodess-of-fit problems where eact kowledge of the distributio is ot available uder the ull hypothesis. We are curretly studyig etesios of similar ideas to other goodess-of-fit tests like the chi-square test ad for more geeral ucertaity classes. Aother etesio of iterest is to study the rate of covergece of these weak covergece results which would eable us to evaluate the accuracy of the thresholds set usig the proposed procedures for a give legth of the observatio sequece. ACKNOWLEDGEMENTS We thak Ke Duffy for iitial discussios that motivated the problem studied i this paper. REFERENCES [1] J. Uikrisha, D. Huag, S. Mey, A. Suraa, ad V. V. Veeravalli, Uiversal ad composite hypothesis testig via mismatched divergece, IEEE Trasactios o Iformatio Theory, revised Jue [Olie]. Available: [2] W. Hoeffdig, Asymptotically optimal tests for multiomial distributios, A. Math. Statist., vol. 36, pp , [3] A. W. va der Vaart, Asymptotic Statistics. Cambridge Uiversity Press, [4] E. L. Lehma, Testig Statistical Hypotheses, 2d ed. New York: Joh Wiley & Sos, [5] R. M. Dudley, Uiform Cetral Limit Theorems. Cambridge Uiversity Press, [6] S. S. Wilks, The large-sample distributio of the likelihood ratio for testig composite hypotheses, A. Math. Statistics, vol. 9, pp , [7] C. Padit ad S. P. Mey, Worst-case large-deviatios with applicatio to queueig ad iformatio theory, Stoch. Proc. ad Appls, vol. 116, o. 5, pp , May F(d,δ) = α. By (15) this choice of threshold esures that for large eough, ad for all π P, P π {φ ROB τ, (Z) = 1} α. (16) We ote that this result is weaker tha the covergece result i (8) sice we do ot have a guaratee o the covergece of sup π P P π {2D ROB (Γ P) > η}. I order to guaratee such a result, we would eed to prove (15) with the supremum ad limit sigs iterchaged. We are curretly tryig to establish such a result.

32 estimating the cumulative distribution function

32 estimating the cumulative distribution function 32 estimatig the cumulative distributio fuctio 4.6 types of cofidece itervals/bads Let F be a class of distributio fuctios F ad let θ be some quatity of iterest, such as the mea of F or the whole fuctio

More information

Problem Set 4 Due Oct, 12

Problem Set 4 Due Oct, 12 EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Lecture 27: Optimal Estimators and Functional Delta Method

Lecture 27: Optimal Estimators and Functional Delta Method Stat210B: Theoretical Statistics Lecture Date: April 19, 2007 Lecture 27: Optimal Estimators ad Fuctioal Delta Method Lecturer: Michael I. Jorda Scribe: Guilherme V. Rocha 1 Achievig Optimal Estimators

More information

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

More information

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen) Goodess-of-Fit Tests ad Categorical Data Aalysis (Devore Chapter Fourtee) MATH-252-01: Probability ad Statistics II Sprig 2019 Cotets 1 Chi-Squared Tests with Kow Probabilities 1 1.1 Chi-Squared Testig................

More information

A RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS

A RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS J. Japa Statist. Soc. Vol. 41 No. 1 2011 67 73 A RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS Yoichi Nishiyama* We cosider k-sample ad chage poit problems for idepedet data i a

More information

Lecture 7: October 18, 2017

Lecture 7: October 18, 2017 Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

Resampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n.

Resampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n. Jauary 1, 2019 Resamplig Methods Motivatio We have so may estimators with the property θ θ d N 0, σ 2 We ca also write θ a N θ, σ 2 /, where a meas approximately distributed as Oce we have a cosistet estimator

More information

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10 DS 00: Priciples ad Techiques of Data Sciece Date: April 3, 208 Name: Hypothesis Testig Discussio #0. Defie these terms below as they relate to hypothesis testig. a) Data Geeratio Model: Solutio: A set

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Notes on iteration and Newton s method. Iteration

Notes on iteration and Newton s method. Iteration Notes o iteratio ad Newto s method Iteratio Iteratio meas doig somethig over ad over. I our cotet, a iteratio is a sequece of umbers, vectors, fuctios, etc. geerated by a iteratio rule of the type 1 f

More information

Estimation for Complete Data

Estimation for Complete Data Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece

More information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f. Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

Summary. Recap ... Last Lecture. Summary. Theorem

Summary. Recap ... Last Lecture. Summary. Theorem Last Lecture Biostatistics 602 - Statistical Iferece Lecture 23 Hyu Mi Kag April 11th, 2013 What is p-value? What is the advatage of p-value compared to hypothesis testig procedure with size α? How ca

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said

More information

Lecture 3 The Lebesgue Integral

Lecture 3 The Lebesgue Integral Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

Discrete Mathematics for CS Spring 2008 David Wagner Note 22 CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Lecture 2. The Lovász Local Lemma

Lecture 2. The Lovász Local Lemma Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio

More information

Lecture 6 Simple alternatives and the Neyman-Pearson lemma

Lecture 6 Simple alternatives and the Neyman-Pearson lemma STATS 00: Itroductio to Statistical Iferece Autum 06 Lecture 6 Simple alteratives ad the Neyma-Pearso lemma Last lecture, we discussed a umber of ways to costruct test statistics for testig a simple ull

More information

Ada Boost, Risk Bounds, Concentration Inequalities. 1 AdaBoost and Estimates of Conditional Probabilities

Ada Boost, Risk Bounds, Concentration Inequalities. 1 AdaBoost and Estimates of Conditional Probabilities CS8B/Stat4B Sprig 008) Statistical Learig Theory Lecture: Ada Boost, Risk Bouds, Cocetratio Iequalities Lecturer: Peter Bartlett Scribe: Subhrasu Maji AdaBoost ad Estimates of Coditioal Probabilities We

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

7-1. Chapter 4. Part I. Sampling Distributions and Confidence Intervals

7-1. Chapter 4. Part I. Sampling Distributions and Confidence Intervals 7-1 Chapter 4 Part I. Samplig Distributios ad Cofidece Itervals 1 7- Sectio 1. Samplig Distributio 7-3 Usig Statistics Statistical Iferece: Predict ad forecast values of populatio parameters... Test hypotheses

More information

Lecture 15: Learning Theory: Concentration Inequalities

Lecture 15: Learning Theory: Concentration Inequalities STAT 425: Itroductio to Noparametric Statistics Witer 208 Lecture 5: Learig Theory: Cocetratio Iequalities Istructor: Ye-Chi Che 5. Itroductio Recall that i the lecture o classificatio, we have see that

More information

Statistical Inference Based on Extremum Estimators

Statistical Inference Based on Extremum Estimators T. Rotheberg Fall, 2007 Statistical Iferece Based o Extremum Estimators Itroductio Suppose 0, the true value of a p-dimesioal parameter, is kow to lie i some subset S R p : Ofte we choose to estimate 0

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

1 Convergence in Probability and the Weak Law of Large Numbers

1 Convergence in Probability and the Weak Law of Large Numbers 36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec

More information

Distribution of Random Samples & Limit theorems

Distribution of Random Samples & Limit theorems STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1. Eco 325/327 Notes o Sample Mea, Sample Proportio, Cetral Limit Theorem, Chi-square Distributio, Studet s t distributio 1 Sample Mea By Hiro Kasahara We cosider a radom sample from a populatio. Defiitio

More information

Table 12.1: Contingency table. Feature b. 1 N 11 N 12 N 1b 2 N 21 N 22 N 2b. ... a N a1 N a2 N ab

Table 12.1: Contingency table. Feature b. 1 N 11 N 12 N 1b 2 N 21 N 22 N 2b. ... a N a1 N a2 N ab Sectio 12 Tests of idepedece ad homogeeity I this lecture we will cosider a situatio whe our observatios are classified by two differet features ad we would like to test if these features are idepedet

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals

More information

Expectation and Variance of a random variable

Expectation and Variance of a random variable Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio

More information

Introductory statistics

Introductory statistics CM9S: Machie Learig for Bioiformatics Lecture - 03/3/06 Itroductory statistics Lecturer: Sriram Sakararama Scribe: Sriram Sakararama We will provide a overview of statistical iferece focussig o the key

More information

Asymptotic distribution of products of sums of independent random variables

Asymptotic distribution of products of sums of independent random variables Proc. Idia Acad. Sci. Math. Sci. Vol. 3, No., May 03, pp. 83 9. c Idia Academy of Scieces Asymptotic distributio of products of sums of idepedet radom variables YANLING WANG, SUXIA YAO ad HONGXIA DU ollege

More information

A statistical method to determine sample size to estimate characteristic value of soil parameters

A statistical method to determine sample size to estimate characteristic value of soil parameters A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig

More information

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said

More information

This exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.

This exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam. Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the

More information

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Lecture 12: November 13, 2018

Lecture 12: November 13, 2018 Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 3 9//203 Large deviatios Theory. Cramér s Theorem Cotet.. Cramér s Theorem. 2. Rate fuctio ad properties. 3. Chage of measure techique.

More information

CS321. Numerical Analysis and Computing

CS321. Numerical Analysis and Computing CS Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 September 8 5 What is the Root May physical system ca

More information

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0. THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of

More information

1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable

More information

Chapter 6 Sampling Distributions

Chapter 6 Sampling Distributions Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to

More information

CS537. Numerical Analysis and Computing

CS537. Numerical Analysis and Computing CS57 Numerical Aalysis ad Computig Lecture Locatig Roots o Equatios Proessor Ju Zhag Departmet o Computer Sciece Uiversity o Ketucky Leigto KY 456-6 Jauary 9 9 What is the Root May physical system ca be

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Lecture 8: Convergence of transformations and law of large numbers

Lecture 8: Convergence of transformations and law of large numbers Lecture 8: Covergece of trasformatios ad law of large umbers Trasformatio ad covergece Trasformatio is a importat tool i statistics. If X coverges to X i some sese, we ofte eed to check whether g(x ) coverges

More information

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data Proceedigs 59th ISI World Statistics Cogress, 5-30 August 013, Hog Kog (Sessio STS046) p.09 Kolmogorov-Smirov type Tests for Local Gaussiaity i High-Frequecy Data George Tauche, Duke Uiversity Viktor Todorov,

More information

Taylor Series (BC Only)

Taylor Series (BC Only) Studet Study Sessio Taylor Series (BC Oly) Taylor series provide a way to fid a polyomial look-alike to a o-polyomial fuctio. This is doe by a specific formula show below (which should be memorized): Taylor

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

ECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors

ECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors ECONOMETRIC THEORY MODULE XIII Lecture - 34 Asymptotic Theory ad Stochastic Regressors Dr. Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Asymptotic theory The asymptotic

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

5.1 A mutual information bound based on metric entropy

5.1 A mutual information bound based on metric entropy Chapter 5 Global Fao Method I this chapter, we exted the techiques of Chapter 2.4 o Fao s method the local Fao method) to a more global costructio. I particular, we show that, rather tha costructig a local

More information

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality

More information

Hypothesis Testing. Evaluation of Performance of Learned h. Issues. Trade-off Between Bias and Variance

Hypothesis Testing. Evaluation of Performance of Learned h. Issues. Trade-off Between Bias and Variance Hypothesis Testig Empirically evaluatig accuracy of hypotheses: importat activity i ML. Three questios: Give observed accuracy over a sample set, how well does this estimate apply over additioal samples?

More information

MOST PEOPLE WOULD RATHER LIVE WITH A PROBLEM THEY CAN'T SOLVE, THAN ACCEPT A SOLUTION THEY CAN'T UNDERSTAND.

MOST PEOPLE WOULD RATHER LIVE WITH A PROBLEM THEY CAN'T SOLVE, THAN ACCEPT A SOLUTION THEY CAN'T UNDERSTAND. XI-1 (1074) MOST PEOPLE WOULD RATHER LIVE WITH A PROBLEM THEY CAN'T SOLVE, THAN ACCEPT A SOLUTION THEY CAN'T UNDERSTAND. R. E. D. WOOLSEY AND H. S. SWANSON XI-2 (1075) STATISTICAL DECISION MAKING Advaced

More information

Section 14. Simple linear regression.

Section 14. Simple linear regression. Sectio 14 Simple liear regressio. Let us look at the cigarette dataset from [1] (available to dowload from joural s website) ad []. The cigarette dataset cotais measuremets of tar, icotie, weight ad carbo

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

GG313 GEOLOGICAL DATA ANALYSIS

GG313 GEOLOGICAL DATA ANALYSIS GG313 GEOLOGICAL DATA ANALYSIS 1 Testig Hypothesis GG313 GEOLOGICAL DATA ANALYSIS LECTURE NOTES PAUL WESSEL SECTION TESTING OF HYPOTHESES Much of statistics is cocered with testig hypothesis agaist data

More information

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame Iformatio Theory Tutorial Commuicatio over Chaels with memory Chi Zhag Departmet of Electrical Egieerig Uiversity of Notre Dame Abstract A geeral capacity formula C = sup I(; Y ), which is correct for

More information

The standard deviation of the mean

The standard deviation of the mean Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider

More information

Chapter 2 The Monte Carlo Method

Chapter 2 The Monte Carlo Method Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Entropy Rates and Asymptotic Equipartition

Entropy Rates and Asymptotic Equipartition Chapter 29 Etropy Rates ad Asymptotic Equipartitio Sectio 29. itroduces the etropy rate the asymptotic etropy per time-step of a stochastic process ad shows that it is well-defied; ad similarly for iformatio,

More information

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample.

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample. Statistical Iferece (Chapter 10) Statistical iferece = lear about a populatio based o the iformatio provided by a sample. Populatio: The set of all values of a radom variable X of iterest. Characterized

More information

Empirical Processes: Glivenko Cantelli Theorems

Empirical Processes: Glivenko Cantelli Theorems Empirical Processes: Gliveko Catelli Theorems Mouliath Baerjee Jue 6, 200 Gliveko Catelli classes of fuctios The reader is referred to Chapter.6 of Weller s Torgo otes, Chapter??? of VDVW ad Chapter 8.3

More information

t distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference

t distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference EXST30 Backgroud material Page From the textbook The Statistical Sleuth Mea [0]: I your text the word mea deotes a populatio mea (µ) while the work average deotes a sample average ( ). Variace [0]: The

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

The log-behavior of n p(n) and n p(n)/n

The log-behavior of n p(n) and n p(n)/n Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity

More information

Rank tests and regression rank scores tests in measurement error models

Rank tests and regression rank scores tests in measurement error models Rak tests ad regressio rak scores tests i measuremet error models J. Jurečková ad A.K.Md.E. Saleh Charles Uiversity i Prague ad Carleto Uiversity i Ottawa Abstract The rak ad regressio rak score tests

More information

Topic 5 [434 marks] (i) Find the range of values of n for which. (ii) Write down the value of x dx in terms of n, when it does exist.

Topic 5 [434 marks] (i) Find the range of values of n for which. (ii) Write down the value of x dx in terms of n, when it does exist. Topic 5 [44 marks] 1a (i) Fid the rage of values of for which eists 1 Write dow the value of i terms of 1, whe it does eist Fid the solutio to the differetial equatio 1b give that y = 1 whe = π (cos si

More information

Notes 5 : More on the a.s. convergence of sums

Notes 5 : More on the a.s. convergence of sums Notes 5 : More o the a.s. covergece of sums Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: Dur0, Sectios.5; Wil9, Sectio 4.7, Shi96, Sectio IV.4, Dur0, Sectio.. Radom series. Three-series

More information

Direction: This test is worth 150 points. You are required to complete this test within 55 minutes.

Direction: This test is worth 150 points. You are required to complete this test within 55 minutes. Term Test 3 (Part A) November 1, 004 Name Math 6 Studet Number Directio: This test is worth 10 poits. You are required to complete this test withi miutes. I order to receive full credit, aswer each problem

More information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

More information

Lecture 11 October 27

Lecture 11 October 27 STATS 300A: Theory of Statistics Fall 205 Lecture October 27 Lecturer: Lester Mackey Scribe: Viswajith Veugopal, Vivek Bagaria, Steve Yadlowsky Warig: These otes may cotai factual ad/or typographic errors..

More information

Sample Size Determination (Two or More Samples)

Sample Size Determination (Two or More Samples) Sample Sie Determiatio (Two or More Samples) STATGRAPHICS Rev. 963 Summary... Data Iput... Aalysis Summary... 5 Power Curve... 5 Calculatios... 6 Summary This procedure determies a suitable sample sie

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

Empirical Process Theory and Oracle Inequalities

Empirical Process Theory and Oracle Inequalities Stat 928: Statistical Learig Theory Lecture: 10 Empirical Process Theory ad Oracle Iequalities Istructor: Sham Kakade 1 Risk vs Risk See Lecture 0 for a discussio o termiology. 2 The Uio Boud / Boferoi

More information

REGRESSION WITH QUADRATIC LOSS

REGRESSION WITH QUADRATIC LOSS REGRESSION WITH QUADRATIC LOSS MAXIM RAGINSKY Regressio with quadratic loss is aother basic problem studied i statistical learig theory. We have a radom couple Z = X, Y ), where, as before, X is a R d

More information

Simulation. Two Rule For Inverting A Distribution Function

Simulation. Two Rule For Inverting A Distribution Function Simulatio Two Rule For Ivertig A Distributio Fuctio Rule 1. If F(x) = u is costat o a iterval [x 1, x 2 ), the the uiform value u is mapped oto x 2 through the iversio process. Rule 2. If there is a jump

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

Confidence interval for the two-parameter exponentiated Gumbel distribution based on record values

Confidence interval for the two-parameter exponentiated Gumbel distribution based on record values Iteratioal Joural of Applied Operatioal Research Vol. 4 No. 1 pp. 61-68 Witer 2014 Joural homepage: www.ijorlu.ir Cofidece iterval for the two-parameter expoetiated Gumbel distributio based o record values

More information