A Constrained Risk Inequality With Applications to Nonparametric Functional Estimation

Size: px
Start display at page:

Download "A Constrained Risk Inequality With Applications to Nonparametric Functional Estimation"

Transcription

1 Uiversity of Pesylvaia ScholarlyCommos Statistics Papers Wharto Faculty Research 1996 A Costraied Risk Iequality With Applicatios to Noparametric Fuctioal Estimatio Lawrece D. Brow Uiversity of Pesylvaia Mark G. Low Uiversity of Pesylvaia Follow this additioal works at: Part of the Statistics Probability Commos Recommeded Citatio Brow, L. D., & Low, M. G. (1996). A Costraied Risk Iequality With Applicatios to Noparametric Fuctioal Estimatio. The Aals of Statistics, 4 (6), This paper is posted at ScholarlyCommos. For more iformatio, please cotact repository@pobox.upe.edu.

2 A Costraied Risk Iequality With Applicatios to Noparametric Fuctioal Estimatio Abstract A geeral costraied miimum risk iequality is derived. Give two desities f θ f 0 we fid a lower boud for the risk at the poit θ give a upper boud for the risk at the poit 0. The iequality sheds ew light o superefficiet estimators i the ormal locatio problem also o a adaptive estimatio problem arisig i oparametric fuctioal estimatio. Keywords adaptive estimatio, superefficiet estimators, oparametric fuctioal estimatio, miimum risk iequalities, white oise model, desity estimatio, oparametric regressio Disciplies Statistics Probability This joural article is available at ScholarlyCommos:

3 The Aals of Statistics 1996, Vol. 4, No. 6, A CONSTRAINED RISK INEQUALITY WITH APPLICATIONS TO NONPARAMETRIC FUNCTIONAL ESTIMATION BY LAWRENCE D. BROWN 1 AND MARK G. LOW Uiversity of Pesylvaia A geeral costraied miimum risk iequality is derived. Give two desities f f0 we fid a lower boud for the risk at the poit give a upper boud for the risk at the poit 0. The iequality sheds ew light o superefficiet estimators i the ormal locatio problem also o a adaptive estimatio problem arisig i oparametric fuctioal estimatio. 1. Itroductio. The problems of estimatig a fuctio at a poit uder squared error loss the whole fuctio uder itegrated squared error loss have held a cetral positio i the oparametric fuctioal estimatio literature. I particular, each has received a fairly detailed aalysis i desity estimatio, oparametric regressio white oise models. Progress to date ca be cotrasted as follows. I both problems asymptotic rates of covergece are typically slower tha '. For itegrated squared error loss, asymptotically miimax procedures have bee foud whe the parameter space is a Sobolev space. For a give space these procedures may be chose to be liear. For the poitwise estimatio problem, typically there do ot exist liear procedures which are asymptotically miimax. However, uder mild regularity coditios appropriately chose liear procedures have maximum risk withi a small costat multiple of the miimax risk. See, for example, Ibragimov Hasmiskii Ž or Dooho Liu Ž I particular, miimax rates of covergece ca be achieved by liear procedures. Oe of the most importat results for the global estimatio problem was the costructio of adaptive estimators which are simultaeously asymptotically miimax over a large umber of Sobolev spaces; see Efromovich Pisker Ž 1984., Efromovich Ž Golubev Ž Such adaptive procedures have ot bee foud for the poitwise estimatio problem. Received February 199; revised February Work supported i part by NSF Grats DMS DMS Work supported by a NSF Postdoctoral Research Fellowship. AMS 1991 subject classificatios. Primary 6G99; secodary 6F1, 6F35, 6M99. Key words phrases. Adaptive estimatio, superefficiet estimators, oparametric fuctioal estimatio, miimum risk iequalities, white oise model, desity estimatio, oparametric regressio. 54

4 A CONSTRAINED RISK INEQUALITY 55 Recetly Lepskii Ž has show that for a white oise model it is ot possible to fid adaptive estimators for the poitwise problem which preserve miimaxity over a rage of Lipschitz classes. Furthermore Lepskii showed that if a estimator is asymptotically rate miimax over oe Lipschitz class, it must iflate the maximum risk over the other Lipschitz class by at least a logarithmic factor of the sample size. Lepskii eve showed that these bouds ca be attaied. See also Lepskii Ž 1991, 199., see Dooho Johstoe Ž 199, Efromovich Low Ž for some recet, related results. I this paper we develop a two poit iequality which is particularly well suited to providig lower bouds for adaptive estimatio problems. The iequality gives, i a geeral settig, a lower boud for the squared error risk at oe parameter poit subject to havig a small risk at aother parameter poit. The relatioship to adaptatio is spelled out i Sectio 4. Such a iequality is also related to the study of -miimax procedures to the otio of superefficiet estimatio. The otio of -miimax procedures Žalso called almost submiimax procedures. was itroduced by Robbis Ž Frak Kiefer Ž further studied by Hodges Lehma Ž 195. Bickel Ž 1983, A example of superefficiet estimatio was foud i Hodges Ž 195. may further results were obtaied by Le Cam Ž We apply our iequality to this topic i Sectio 3A.. A costraied miimum risk iequality. Let Z have distributio with desity f or f with respect to a measure. For ay estimator 1 based o Z, its risk is defied by.1 R, E Ž x. f x dx. H The followig theorem gives a lower boud for RŽ,. give that RŽ,. 1. I the theorem subsequetly let qž x. f Ž x. f Ž x.. I IŽ 1,. E q 1 Ž Ž X... 1 qž x. for some x is possible, with the obvious iterpretatio qž x. f Ž x. 1 f Ž x.. THEOREM 1. Let assume 0 I RŽ, The Ž '..3 R, I. Hece, also, ' I /.4 R, 1. ž '

5 56 L. D. BROWN AND M. G. LOW PROOF. By traslatio ivariace we eed oly prove the theorem for Ž. 1 0, 0. We eed to fid which miimizes R H x f x dx subject to R0 H x f0 x dx. By Lagrage multipliers the miimizig satisfies Ž Ž x.. f Ž x. Ž x. f 0 Ž x. 0 for some 0. If 0, the x it follows that, which cotradicts the assumptio that ' I sice I 1. Hece 0 f Ž x. qž x. 5. Ž x., f Ž x. f Ž x. 1 qž x. 0 where 1. If q x, the x. Furthermore, this satisfies R, so that 0 qž x. 6. H f0ž x. Ž dx.. 1 qž x. 7. The, by Cauchy-Schwarz, sice q x f x f x. Hece 0 8. qž x. ' I H f0ž x. Ž dx. 1 qž x. 1 ž H q Ž x. f0ž x. Ž dx. / q Ž x H. f Ž x. Ž dx. 1 qž x. 1 f Ž x. Ž dx ž H 1 qž x. /. 1 1 qž x. qž x. ' I 1 f Ž x. Ž dx. 1 qž x. H H f x dx R sice ŽŽ x.. Ž1 qž x.. by 5.. I the secod iequality of 8. we have agai used CauchySchwarz. This proves 3.. Equatio 4. follows because Ž a b. a Ž 1 ba. for a, b 0. It is of iterest to ote that the first boud i the theorem,.3, is sharp. As before, let 0,

6 A CONSTRAINED RISK INEQUALITY 57 PROPOSITION 1. Fix B 1 0 B. Let f0 be the uiform Ž 1 distributio o 0, 1 let f be the uiform distributio o 0, B.. The I B 4.9 mi R, : R 0, I. Hece the boud.3 is attaied. ' ' PROOF. The best estimate of subject to R 0, is ½ ' 0, if B 1 x 1, Ž x. B, if 0 x b shows that the best is costat o the regio 0 x B 0 o 1 the regio B x 1. The, R 0, yields 10.. This estimator Ž '. satisfies R, I verifies 9. i view of Theorem 1. REMARKS. It ca be see that apart from arbitrary measurable trasformatios of the sample space, the example i the precedig proof is the oly oe i which the miimum i 9. is the same as 3.. I other words, the boud i 3. is attaied if oly if the likelihood ratio, qž x., takes oly the two values 0 I. I may applicatios f f will be desities of idepedet ideti- 1 cally distributed rom variables X 1,..., X, each with desity f Ž1. 1. Lettig Ž1. Ž1. Ž1. Ž1. ŽŽ Ž1. q x f x f x I E q Ž X..., we see that the iformatio 1 1 measure I satisfies Ž1..10 I I. Furthermore, the boud i Theorem 1 is still sharp because lettig f Ž 1 uiform o 0, 1 f be uiform o 0, I. yields 1 be ' for I, as i Propositio Applicatios. 4 mi R, : R 0, I ' A. Superefficiecy i the ormal locatio model. As a first simple example, the iequality give i the last sectio ca be used to yield the followig result about superefficiet estimates i the stard ormal locatio model. Let X,..., X be i.i.d. NŽ, 1. with. Write RŽ,. 1 for the risk of a estimator based o Ž X,..., X.. Thus 1 Ž 3.1. RŽ,. EŽ..

7 58 L. D. BROWN AND M. G. LOW THEOREM. Let let Ž l. 1. If Ž 3.. lim sup RŽ 0,., the Ž 3.3. lim sup sup RŽ,. 0. l REMARK. Ž 3.3. with l deleted, Ž 1, 1. the right-h side replaced by is of course implied by Ž 3.3. is well kow. See, for example, pages i Lehma Ž PROOF OF THEOREM. Sice X is sufficiet, we eed oly cosider estimates which are fuctios of X. Now if Ž 3.. holds, the there exists N M such that for all N, M RŽ 0,.. Note that X NŽ, 1. we may apply Theorem 1 with f,, the desity of a ormal distributio with mea variace 1. Take Ž l The 1 f, Ž x. Ž l. Ž 3.4. I H dx exp exp. f 1 0, Now by.4, if N, Ž ž / l l Ž M. R, 1 l 1 l M Ž l. 1 The theorem is proved by takig limits sice M Ž l. 1 0 as. B. Superefficiecy i the white oise model. We ow tur to our mai applicatio of Theorem 1. Cosider the followig white oise model Ž 3.6. dxt f Ž t. dt dw t, t, f F, ' where W is Browia motio o 1, 1 t. This model has bee studied extesively as a prototypical model for may other fuctioal estimatio problems such as oparametric regressio desity estimatio. See, for example, Ibragimov Hasmiskii Ž 1981., Low Ž 199., Dooho Low Ž 199., Brow Low Ž Nussbaum Ž

8 A CONSTRAINED RISK INEQUALITY 59 Ž k We shall focus o the followig class of parameter spaces. Write f. Ž x. for the kth derivative of f let 4 Ž k. Ž 3.7. F Ž k. f L Ž 1, 1. : f Ž x. M x. Miimax rates of covergece, as, for estimatig fž 0. are well kow. For estimators Ž. based o the sigal 3.6, write Ef f 0 for the mea squared error for estimatig fž 0.. The Ž. k Ž k lim sup if sup Ef f 0. ff Ž k. THEOREM 3. Let, l let be estimators based o 3.6. If Ž k. 0 x 3.9 sup f x m M Ž. k Ž k lim sup Ef f0 0, 0 the kž k1. f Ž. l ff Ž k. Ž lim if sup E f Ž As oted i the itroductio, a similar statemet, but with a differet proof, appears i Lepskii Ž PROOF. Let g: R R be a k times differetiable fuctio such that: Ž i. gž 0. 0; Ž ii. g has compact support; Ž k iii for some M m, g. Ž x. M m x; iv H g Ž x. dx 1. Such a fuctio is easy to costruct. Set / / k k1 Ž 3.1. ž, l 1 k1 Ž ž. l The Ž l

9 530 L. D. BROWN AND M. G. LOW k Ž Let f : 1, 1 R be defied by g Ž t. Ž f Ž t. f Ž t.. 0 By 3.11, assumptio iii for g 3.15, f F k. Write Pg for the probability measure associated with the process dxt fž t. dw t, t. ' The a sufficiet statistic for the family of measures P, P 4 0 g is give by dpg Ž T l. dp 0 1 Ž Ž. Set H1 g t dt. The ž / 0 uder P, T N,, uder P g, T N,. Now sice, there exists a N such that for all N, gž t if t 1. The by assumptio Ž iv. for g Ž it follows that for N 1, l. If assumptio Ž of Theorem 3 holds, there exists a R N N1 such that for all N, R Ž Ef Ž f Ž k Ž k1. Sice T is sufficiet for P, P 4 we may apply Theorem 1 with f Ž 0. 0 g 1 0, Ž. f 0 f0 0 g 0, p the desity of T uder P0 p the 1 desity of T uder Pg, where we have used p istead of f for the desities i Theorem 1. By Ž 3.4., p Ž x. IŽ. H dx exp expž. p Ž x. 1 for N. Theorem 1, 4., yields for N, g Ž 0. Ž E f Ž 0. Ž 1., where f 1 R 1 R 1 Ž k Ž k1. 1 kž k1. Ž g Ž 0.. g Ž 0. Ž l.

10 A CONSTRAINED RISK INEQUALITY 531 The 0 as hece by it follows that kž k1. f Ž. lim if E f Ž 0. g Ž 0. 0 l the theorem is proved. REMARK. Oe may also also cosider Sobolev parameter spaces i place of the Lipschitz spaces defied i Ž Thus, suppose the parameter space is F Ž k. fl Ž 1, 1. : f Ž j. Ž 1. f Ž j. Ž 1. 0 j 0,..., k1, S ½ 1 Ž k. H Ž. 5 1 f x dx M. Ž k1. k I this case the optimal rate for estimatig f 0 is i place of the k Ž k1. rate of Theorem 3. See, for example, Dooho Low Ž For this case, Theorem 3 remais valid with the obvious modificatio to Ž 3.9. with this optimal rate substituted ito Ž Ž The proof is very similar to that of Theorem 3. The pricipal differece is the defiitios of, g i Ž i order to establish a suitably ufavorable two poit problem, as is doe above Ž These,, g are give via the hardest liear subproblem algorithm, are explicitly described i Dooho Low Ž Note that here g is really g, that is, its form as well as its scalig deped o. 4. Adaptatio. Theorem 3 of the last sectio sheds ew light o adaptatio i the white oise model. For a sequece of estimates to be adaptive over two classes F Ž k. F Ž k. give by Ž , where k 1, k are itegers with k1 k, we would require Ž. k Ž k lim sup 1 1 sup Ef f 0 ff Ž k 1. Ž. k Ž k lim sup sup Ef f 0. ff Ž k. I particular Ž 4.. must hold Ž with sup deleted. for some fixed f F Ž k. 0. Now sice F Ž k. F Ž k., f F Ž k., it follows that Ž. k Ž k 1. ŽŽ k k..žž k 1.Ž k lim sup Ef f Theorem 3 the yields that k 1 Ž k 1 1. f Ž. l ff Ž k. Ž 4.4. lim sup sup E f Ž 0. 0

11 53 L. D. BROWN AND M. G. LOW it follows that Ž 4.1. caot hold if Ž 4.. holds. Hece, adaptive estimatio over ay two classes F Ž k. F Ž k., k k, is impossible. Ž 1 1 A similar coclusio is also valid for the Sobolev situatio discussed i the precedig remark.. I fact, a similar result ca be proved uder fairly geeral coditios usig Theorem 1 hardest oe-dimesioal subfamily argumets foud i Dooho Liu Ž I particular, suppose that T is a liear fuctioal 1 are covex symmetric subsets of L with optimal rates of covergece give by Ž ˆ. q 0 lim if i if sup E T T Ž., ˆT i where 0 q q 1. 1 The it follows from essetially the same argumets used to prove the above that if Ž ˆ. q lim if sup E T T Ž., the q 1 lim if sup E Tˆ T Ž. 0. l 1 5. Noparametric regressio desity estimatio models. I this sectio we show, with oly mior modificatios i the proofs, that Theorem 3 also holds i the oparametric regressio desity estimatio models. This aturally yields aalogs for the lack of adaptivity statemet i Sectio 4. The oparametric regressio model is give as follows. For each, set 1 t Ž i., i 0,...,, let i Ž 5.1. yi f Ž ti. e i, i 1,..., f F Ž k., ei i.i.d. NŽ 0, 1., where F Ž k. is give by Ž For estimates based o Ž 5.1. the miimax rate of covergece is the same as i the white oise model is give by Ž Moreover Theorem 3 also holds for estimators based o Ž The proof is essetially the same as i Sectio 3. Defie g, c,, as before. Write Pg for the probability Ž measure o geeratig 5.1. The T l dp dp. g 0 is sufficiet for P, P 4. Set 0 g g Ž ti.. Ý i1

12 The Note that for large, A CONSTRAINED RISK INEQUALITY uder P, T N,, uder P g, T N,. 1 g H 1 Ž t. dt the distributios of T are close to those give i Sectio 3. Now defie g by g Ž t. g Ž t i., t, i1 t t, i, i 1,...,. The g H Ž t. dt dt dt 1 g t 1 g t H H H g Ž t. g Ž t. dt 1 t, i Ý H g Ž t. g Ž t. dt. i1 t, i1 Note that sice g k Ž x. M g has compact support, it follows that for some M 1, M, Ž 5.. g Ž x. M1 x, Ž 5.3. gž x. M1 x hece for t t t,, i1 i g t g t M1 M t t, i1 M t t, i1 t, i Ý H 1, i1 Ž, i1. i1 t, i1 M M t t M t t dt M1 M M 3 3 M1 M M 1. 3

13 534 L. D. BROWN AND M. G. LOW Now by , as hece, where 0 as. The rest of the proof follows that give i Sectio 3 except that for large, 3.19 becomes I expž. g Ž 0. Ž 5.4. Ef Ž fž exp, ž / where expž. 1 as. We ow tur to the desity estimatio problem. Let X 1,..., X be i.i.d. each with desity F F Ž k.. The oce agai Theorem 3 holds for estimators based o X 1,..., X. For simplicity we shall give a proof for the case where the poit of superefficiecy is the uiform desity. I other words, f Ž t. 0 1 o 1, 1. Oce agai defie g, c, as i Sectio 3, but with the added restrictio that HgŽ x. dx 0. To apply Theorem 1 we eed to fid upper bouds for f Ž x1. f Ž x. Ž 5.5. I H dx1 dx. f Ž x. f Ž x Now sice f t 1 o 1, 1, 0 Ž g Ž t. I 1 dt H 1 1 ž H / 1 g t l 1 by Ž expž l. sice if x 0 x 1 e x. The as i Sectio 3 for large, g Ž 0. E f Ž 0. Ž 1., f where is defied by Ž Now take limits the theorem follows just as i Sectio 3.

14 A CONSTRAINED RISK INEQUALITY 535 REFERENCES BICKEL, P. J. Ž Miimax estimatio of the mea of a ormal distributio subject to doig well at a poit. I Recet Advaces i Statistics ŽM. H. Rizvi, J. S. Rustagi D. Siegmud, eds Academic Press, New York. BICKEL, P. J. Ž Parametric robustess, small biases ca be worthwhile. A. Statist BROWN, L. D. LOW, M. G. Ž Asymptotic equivalece of oparametric regressio white oise. A. Statist DONOHO, D. L. JOHNSTONE, I. M. Ž Adaptig to ukow smoothess at a poit via wavelet shrikage. Upublished mauscript. DONOHO, D. L. JOHNSTONE, I. M. Ž Neo-classical miimax problems, threshholdig, adaptive fuctio estimatio. Beroulli 396. DONOHO, D. L. LIU, R. G. Ž Geometrizig rates of covergece III. A. Statist DONOHO, D. L. LOW, M. G. Ž Reormalizatio expoets optimal poitwise rates of covergece. A. Statist EFROMOVICH, S. Y. Ž Noparametric estimatio of a desity of ukow smoothess. Theory Probab. Appl EFROMOVICH, S. Y. LOW, M. G. Ž Adaptive estimates of liear fuctioals. Probab. Theory Related Fields EFROMOVICH, S. Y. PINSKER, M. S. Ž Self-learig algorithm of oparametric filtratio. Automat. i Telemeh Ž I Russia.. FRANK, P. KIEFER, J. Ž Almost submiimax biased miimax procedures. A. Math. Statist. 14. GOLUBEV, G. K. Ž Adaptive asymptotically miimax estimates of smooth sigals. Problemi Peredachi Iformatsii Ž I Russia.. HODGES, J. L. LEHMANN, E. L. Ž The use of previous experiece i reachig statistical decisios. A. Math. Statist HODGES, J. L. Ž Commuicated to Le Cam Neyma. IBRAGIMOV, I. A. HASMINSKII, R. Z. Ž Statistical Estimatio: Asymptotic Theory. Spriger, Berli. IBRAGIMOV, I. A. HASMINSKII, R. Z. Ž Noparametric estimatio of the values of a liear fuctioal i Gaussia white oise. Theory Probab. Appl LE CAM, L. Ž O some asymptotic properties of maximum likelihood estimates related Bayes estimates. Uiv. Calif. Publ. Statist LEHMANN, E. L. Ž Theory of Poit Estimatio. Wiley, New York. LEPSKII, O. V. Ž O a problem of adaptive estimatio i Gaussia white oise. Theory Probab. Appl LEPSKII, O. V. Ž Asymptotically miimax adaptive estimatio I: upper bouds. Optimally adaptive estimates. Theory Probab. Appl LEPSKII, O. V. Ž O problems of adaptive estimatio i white Gaussia oise. I Advaces i Soviet Mathematics 1. Amer. Math. Soc., Providece, RI. LOW, M. G. Ž Reormalizatio white oise approximatio for oparametric fuctioal estimatio problems. A. Statist NUSSBAUM, M. Ž Asymptotic equivalece of desity estimatio Gaussia white oise. A. Statist ROBBINS, H. Ž Asymptotically submiimax solutios of compoud statistical decisio problems. Proc. Secod Berkeley Symp. Math. Statist. Probab Uiv. Califoria Press, Berkeley. DEPARTMENT OF STATISTICS 3000 STEINBERG DIETRICH HALL UNIVERSITY OF PENNSYLVANIA PHILADELPHIA, PENNSYLVANIA

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

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

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

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

Regression with an Evaporating Logarithmic Trend

Regression with an Evaporating Logarithmic Trend Regressio with a Evaporatig Logarithmic Tred Peter C. B. Phillips Cowles Foudatio, Yale Uiversity, Uiversity of Aucklad & Uiversity of York ad Yixiao Su Departmet of Ecoomics Yale Uiversity October 5,

More information

Superefficiency in Nonparametric Function Estimation

Superefficiency in Nonparametric Function Estimation Uiversity of Pesylvaia ScholarlyCommos Statistics Papers Wharto Faculty Research 997 Superefficiecy i Noparametric Fuctio Estimatio Lawrece D. Brow Uiversity of Pesylvaia Mar G. Low Uiversity of Pesylvaia

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

Chapter 7 Isoperimetric problem

Chapter 7 Isoperimetric problem Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated

More information

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

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

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

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5 CS434a/54a: Patter Recogitio Prof. Olga Veksler Lecture 5 Today Itroductio to parameter estimatio Two methods for parameter estimatio Maimum Likelihood Estimatio Bayesia Estimatio Itroducto Bayesia Decisio

More information

On the convergence rates of Gladyshev s Hurst index estimator

On the convergence rates of Gladyshev s Hurst index estimator Noliear Aalysis: Modellig ad Cotrol, 2010, Vol 15, No 4, 445 450 O the covergece rates of Gladyshev s Hurst idex estimator K Kubilius 1, D Melichov 2 1 Istitute of Mathematics ad Iformatics, Vilius Uiversity

More information

Accuracy Assessment for High-Dimensional Linear Regression

Accuracy Assessment for High-Dimensional Linear Regression Uiversity of Pesylvaia ScholarlyCommos Statistics Papers Wharto Faculty Research -016 Accuracy Assessmet for High-Dimesioal Liear Regressio Toy Cai Uiversity of Pesylvaia Zijia Guo Uiversity of Pesylvaia

More information

Summary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector

Summary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector Summary ad Discussio o Simultaeous Aalysis of Lasso ad Datzig Selector STAT732, Sprig 28 Duzhe Wag May 4, 28 Abstract This is a discussio o the work i Bickel, Ritov ad Tsybakov (29). We begi with a short

More information

Notes 19 : Martingale CLT

Notes 19 : Martingale CLT Notes 9 : Martigale CLT Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: [Bil95, Chapter 35], [Roc, Chapter 3]. Sice we have ot ecoutered weak covergece i some time, we first recall

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

EFFECTIVE WLLN, SLLN, AND CLT IN STATISTICAL MODELS

EFFECTIVE WLLN, SLLN, AND CLT IN STATISTICAL MODELS EFFECTIVE WLLN, SLLN, AND CLT IN STATISTICAL MODELS Ryszard Zieliński Ist Math Polish Acad Sc POBox 21, 00-956 Warszawa 10, Polad e-mail: rziel@impagovpl ABSTRACT Weak laws of large umbers (W LLN), strog

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

Chapter 6 Principles of Data Reduction

Chapter 6 Principles of Data Reduction Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a

More information

Tradeoffs Between Global And Local Risks In Nonparametric Function Estimation

Tradeoffs Between Global And Local Risks In Nonparametric Function Estimation Tradeoffs Betwee Global Ad Local Risks I Noparametric Fuctio Estimatio T. Toy Cai, Mark G. Low ad Lida H. Zhao Departmet of Statistics The Wharto School Uiversity of Pesylvaia Abstract We ivestigate the

More information

Lecture 10 October Minimaxity and least favorable prior sequences

Lecture 10 October Minimaxity and least favorable prior sequences STATS 300A: Theory of Statistics Fall 205 Lecture 0 October 22 Lecturer: Lester Mackey Scribe: Brya He, Rahul Makhijai Warig: These otes may cotai factual ad/or typographic errors. 0. Miimaxity ad least

More information

Exponential Families and Bayesian Inference

Exponential Families and Bayesian Inference Computer Visio Expoetial Families ad Bayesia Iferece Lecture Expoetial Families A expoetial family of distributios is a d-parameter family f(x; havig the followig form: f(x; = h(xe g(t T (x B(, (. where

More information

Machine Learning Brett Bernstein

Machine Learning Brett Bernstein Machie Learig Brett Berstei Week 2 Lecture: Cocept Check Exercises Starred problems are optioal. Excess Risk Decompositio 1. Let X = Y = {1, 2,..., 10}, A = {1,..., 10, 11} ad suppose the data distributio

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

Lecture 7: Density Estimation: k-nearest Neighbor and Basis Approach

Lecture 7: Density Estimation: k-nearest Neighbor and Basis Approach STAT 425: Itroductio to Noparametric Statistics Witer 28 Lecture 7: Desity Estimatio: k-nearest Neighbor ad Basis Approach Istructor: Ye-Chi Che Referece: Sectio 8.4 of All of Noparametric Statistics.

More information

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y

More information

Maximum Likelihood Estimation

Maximum Likelihood Estimation ECE 645: Estimatio Theory Sprig 2015 Istructor: Prof. Staley H. Cha Maximum Likelihood Estimatio (LaTeX prepared by Shaobo Fag) April 14, 2015 This lecture ote is based o ECE 645(Sprig 2015) by Prof. Staley

More information

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f

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

Rates of Convergence by Moduli of Continuity

Rates of Convergence by Moduli of Continuity Rates of Covergece by Moduli of Cotiuity Joh Duchi: Notes for Statistics 300b March, 017 1 Itroductio I this ote, we give a presetatio showig the importace, ad relatioship betwee, the modulis of cotiuity

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

1 Review and Overview

1 Review and Overview DRAFT a fial versio will be posted shortly CS229T/STATS231: Statistical Learig Theory Lecturer: Tegyu Ma Lecture #3 Scribe: Migda Qiao October 1, 2013 1 Review ad Overview I the first half of this course,

More information

MINIMAX ESTIMATION OF LINEAR FUNCTIONALS OVER NONCONVEX PARAMETER SPACES 1. BY T. TONY CAI AND MARK G. LOW University of Pennsylvania

MINIMAX ESTIMATION OF LINEAR FUNCTIONALS OVER NONCONVEX PARAMETER SPACES 1. BY T. TONY CAI AND MARK G. LOW University of Pennsylvania The Aals of Statistics 004, Vol. 3, No., 55 576 Istitute of Mathematical Statistics, 004 MINIMAX ESTIMATION OF LINEAR FUNCTIONALS OVER NONCONVEX PARAMETER SPACES 1 BY T. TONY CAI AND MARK G. LOW Uiversity

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

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

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator Ecoomics 24B Relatio to Method of Momets ad Maximum Likelihood OLSE as a Maximum Likelihood Estimator Uder Assumptio 5 we have speci ed the distributio of the error, so we ca estimate the model parameters

More information

Berry-Esseen bounds for self-normalized martingales

Berry-Esseen bounds for self-normalized martingales Berry-Essee bouds for self-ormalized martigales Xiequa Fa a, Qi-Ma Shao b a Ceter for Applied Mathematics, Tiaji Uiversity, Tiaji 30007, Chia b Departmet of Statistics, The Chiese Uiversity of Hog Kog,

More information

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n.

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n. Radom Walks ad Browia Motio Tel Aviv Uiversity Sprig 20 Lecture date: Mar 2, 20 Lecture 4 Istructor: Ro Peled Scribe: Lira Rotem This lecture deals primarily with recurrece for geeral radom walks. We preset

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

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

On Weak and Strong Convergence Theorems for a Finite Family of Nonself I-asymptotically Nonexpansive Mappings

On Weak and Strong Convergence Theorems for a Finite Family of Nonself I-asymptotically Nonexpansive Mappings Mathematica Moravica Vol. 19-2 2015, 49 64 O Weak ad Strog Covergece Theorems for a Fiite Family of Noself I-asymptotically Noexpasive Mappigs Birol Güdüz ad Sezgi Akbulut Abstract. We prove the weak ad

More information

ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS

ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX0000-0 ON MEAN ERGODIC CONVERGENCE IN THE CALKIN ALGEBRAS MARCH T. BOEDIHARDJO AND WILLIAM B. JOHNSON 2

More information

BETWEEN QUASICONVEX AND CONVEX SET-VALUED MAPPINGS. 1. Introduction. Throughout the paper we denote by X a linear space and by Y a topological linear

BETWEEN QUASICONVEX AND CONVEX SET-VALUED MAPPINGS. 1. Introduction. Throughout the paper we denote by X a linear space and by Y a topological linear BETWEEN QUASICONVEX AND CONVEX SET-VALUED MAPPINGS Abstract. The aim of this paper is to give sufficiet coditios for a quasicovex setvalued mappig to be covex. I particular, we recover several kow characterizatios

More information

Element sampling: Part 2

Element sampling: Part 2 Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig

More information

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015 ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],

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

Kernel density estimator

Kernel density estimator Jauary, 07 NONPARAMETRIC ERNEL DENSITY ESTIMATION I this lecture, we discuss kerel estimatio of probability desity fuctios PDF Noparametric desity estimatio is oe of the cetral problems i statistics I

More information

Unbiased Estimation. February 7-12, 2008

Unbiased Estimation. February 7-12, 2008 Ubiased Estimatio February 7-2, 2008 We begi with a sample X = (X,..., X ) of radom variables chose accordig to oe of a family of probabilities P θ where θ is elemet from the parameter space Θ. For radom

More information

LECTURE 8: ASYMPTOTICS I

LECTURE 8: ASYMPTOTICS I LECTURE 8: ASYMPTOTICS I We are iterested i the properties of estimators as. Cosider a sequece of radom variables {, X 1}. N. M. Kiefer, Corell Uiversity, Ecoomics 60 1 Defiitio: (Weak covergece) A sequece

More information

Pattern Classification, Ch4 (Part 1)

Pattern Classification, Ch4 (Part 1) Patter Classificatio All materials i these slides were take from Patter Classificatio (2d ed) by R O Duda, P E Hart ad D G Stork, Joh Wiley & Sos, 2000 with the permissio of the authors ad the publisher

More information

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory

More information

Study the bias (due to the nite dimensional approximation) and variance of the estimators

Study the bias (due to the nite dimensional approximation) and variance of the estimators 2 Series Methods 2. Geeral Approach A model has parameters (; ) where is ite-dimesioal ad is oparametric. (Sometimes, there is o :) We will focus o regressio. The fuctio is approximated by a series a ite

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

Weighted Approximation by Videnskii and Lupas Operators

Weighted Approximation by Videnskii and Lupas Operators Weighted Approximatio by Videsii ad Lupas Operators Aif Barbaros Dime İstabul Uiversity Departmet of Egieerig Sciece April 5, 013 Aif Barbaros Dime İstabul Uiversity Departmet Weightedof Approximatio Egieerig

More information

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

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

8.1 Introduction. 8. Nonparametric Inference Using Orthogonal Functions

8.1 Introduction. 8. Nonparametric Inference Using Orthogonal Functions 8. Noparametric Iferece Usig Orthogoal Fuctios 1. Itroductio. Noparametric Regressio 3. Irregular Desigs 4. Desity Estimatio 5. Compariso of Methods 8.1 Itroductio Use a orthogoal basis to covert oparametric

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

A survey on penalized empirical risk minimization Sara A. van de Geer

A survey on penalized empirical risk minimization Sara A. van de Geer A survey o pealized empirical risk miimizatio Sara A. va de Geer We address the questio how to choose the pealty i empirical risk miimizatio. Roughly speakig, this pealty should be a good boud for the

More information

CSE 527, Additional notes on MLE & EM

CSE 527, Additional notes on MLE & EM CSE 57 Lecture Notes: MLE & EM CSE 57, Additioal otes o MLE & EM Based o earlier otes by C. Grat & M. Narasimha Itroductio Last lecture we bega a examiatio of model based clusterig. This lecture will be

More information

Week 10. f2 j=2 2 j k ; j; k 2 Zg is an orthonormal basis for L 2 (R). This function is called mother wavelet, which can be often constructed

Week 10. f2 j=2 2 j k ; j; k 2 Zg is an orthonormal basis for L 2 (R). This function is called mother wavelet, which can be often constructed Wee 0 A Itroductio to Wavelet regressio. De itio: Wavelet is a fuctio such that f j= j ; j; Zg is a orthoormal basis for L (R). This fuctio is called mother wavelet, which ca be ofte costructed from father

More information

5. Likelihood Ratio Tests

5. Likelihood Ratio Tests 1 of 5 7/29/2009 3:16 PM Virtual Laboratories > 9. Hy pothesis Testig > 1 2 3 4 5 6 7 5. Likelihood Ratio Tests Prelimiaries As usual, our startig poit is a radom experimet with a uderlyig sample space,

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

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

Ω ). Then the following inequality takes place:

Ω ). Then the following inequality takes place: Lecture 8 Lemma 5. Let f : R R be a cotiuously differetiable covex fuctio. Choose a costat δ > ad cosider the subset Ωδ = { R f δ } R. Let Ωδ ad assume that f < δ, i.e., is ot o the boudary of f = δ, i.e.,

More information

Diagonal approximations by martingales

Diagonal approximations by martingales Alea 7, 257 276 200 Diagoal approximatios by martigales Jaa Klicarová ad Dalibor Volý Faculty of Ecoomics, Uiversity of South Bohemia, Studetsa 3, 370 05, Cese Budejovice, Czech Republic E-mail address:

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

Solutions: Homework 3

Solutions: Homework 3 Solutios: Homework 3 Suppose that the radom variables Y,...,Y satisfy Y i = x i + " i : i =,..., IID where x,...,x R are fixed values ad ",...," Normal(0, )with R + kow. Fid ˆ = MLE( ). IND Solutio: Observe

More information

Dimension-free PAC-Bayesian bounds for the estimation of the mean of a random vector

Dimension-free PAC-Bayesian bounds for the estimation of the mean of a random vector Dimesio-free PAC-Bayesia bouds for the estimatio of the mea of a radom vector Olivier Catoi CREST CNRS UMR 9194 Uiversité Paris Saclay olivier.catoi@esae.fr Ilaria Giulii Laboratoire de Probabilités et

More information

A Framework For Estimation of Convex Functions

A Framework For Estimation of Convex Functions A Framework For Estimatio of Covex Fuctios T. Toy Cai ad Mark G. Low Departmet of Statistics The Wharto School Uiversity of Pesylvaia Abstract A geeral o-asymptotic framework, which evaluates the performace

More information

Statistical Theory MT 2008 Problems 1: Solution sketches

Statistical Theory MT 2008 Problems 1: Solution sketches Statistical Theory MT 008 Problems : Solutio sketches. Which of the followig desities are withi a expoetial family? Explai your reasoig. a) Let 0 < θ < ad put fx, θ) = θ)θ x ; x = 0,,,... b) c) where α

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

Statistical Pattern Recognition

Statistical Pattern Recognition Statistical Patter Recogitio Classificatio: No-Parametric Modelig Hamid R. Rabiee Jafar Muhammadi Sprig 2014 http://ce.sharif.edu/courses/92-93/2/ce725-2/ Ageda Parametric Modelig No-Parametric Modelig

More information

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

More information

Lecture 2: Monte Carlo Simulation

Lecture 2: Monte Carlo Simulation STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet

More information

Entire Functions That Share One Value with One or Two of Their Derivatives

Entire Functions That Share One Value with One or Two of Their Derivatives JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 223, 88 95 1998 ARTICLE NO. AY985959 Etire Fuctios That Share Oe Value with Oe or Two of Their Derivatives Gary G. Guderse* Departmet of Mathematics, Ui

More information

Lecture 10: Universal coding and prediction

Lecture 10: Universal coding and prediction 0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved

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 Theory MT 2009 Problems 1: Solution sketches

Statistical Theory MT 2009 Problems 1: Solution sketches Statistical Theory MT 009 Problems : Solutio sketches. Which of the followig desities are withi a expoetial family? Explai your reasoig. (a) Let 0 < θ < ad put f(x, θ) = ( θ)θ x ; x = 0,,,... (b) (c) where

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

A FRAMEWORK FOR ESTIMATION OF CONVEX FUNCTIONS

A FRAMEWORK FOR ESTIMATION OF CONVEX FUNCTIONS Statistica Siica 5 (015, 43-456 doi:http://dx.doi.org/10.5705/ss.013.79 A FRAMEWORK FOR ESTIMATION OF CONVEX FUNCTIONS T. Toy Cai ad Mark G. Low Uiversity of Pesylvaia Abstract: A geeral o-asymptotic framework,

More information

Sieve Estimators: Consistency and Rates of Convergence

Sieve Estimators: Consistency and Rates of Convergence EECS 598: Statistical Learig Theory, Witer 2014 Topic 6 Sieve Estimators: Cosistecy ad Rates of Covergece Lecturer: Clayto Scott Scribe: Julia Katz-Samuels, Brado Oselio, Pi-Yu Che Disclaimer: These otes

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

Mathematical Statistics - MS

Mathematical Statistics - MS Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios

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

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

A Risk Comparison of Ordinary Least Squares vs Ridge Regression

A Risk Comparison of Ordinary Least Squares vs Ridge Regression Joural of Machie Learig Research 14 (2013) 1505-1511 Submitted 5/12; Revised 3/13; Published 6/13 A Risk Compariso of Ordiary Least Squares vs Ridge Regressio Paramveer S. Dhillo Departmet of Computer

More information

Council for Innovative Research

Council for Innovative Research ABSTRACT ON ABEL CONVERGENT SERIES OF FUNCTIONS ERDAL GÜL AND MEHMET ALBAYRAK Yildiz Techical Uiversity, Departmet of Mathematics, 34210 Eseler, Istabul egul34@gmail.com mehmetalbayrak12@gmail.com I this

More information

PAPER : IIT-JAM 2010

PAPER : IIT-JAM 2010 MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure

More information

Regression with quadratic loss

Regression with quadratic loss Regressio with quadratic loss Maxim Ragisky October 13, 2015 Regressio with quadratic loss is aother basic problem studied i statistical learig theory. We have a radom couple Z = X,Y, where, as before,

More information

1 Duality revisited. AM 221: Advanced Optimization Spring 2016

1 Duality revisited. AM 221: Advanced Optimization Spring 2016 AM 22: Advaced Optimizatio Sprig 206 Prof. Yaro Siger Sectio 7 Wedesday, Mar. 9th Duality revisited I this sectio, we will give a slightly differet perspective o duality. optimizatio program: f(x) x R

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

Maximum Likelihood Estimation and Complexity Regularization

Maximum Likelihood Estimation and Complexity Regularization ECE90 Sprig 004 Statistical Regularizatio ad Learig Theory Lecture: 4 Maximum Likelihood Estimatio ad Complexity Regularizatio Lecturer: Rob Nowak Scribe: Pam Limpiti Review : Maximum Likelihood Estimatio

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

6.867 Machine learning, lecture 7 (Jaakkola) 1

6.867 Machine learning, lecture 7 (Jaakkola) 1 6.867 Machie learig, lecture 7 (Jaakkola) 1 Lecture topics: Kerel form of liear regressio Kerels, examples, costructio, properties Liear regressio ad kerels Cosider a slightly simpler model where we omit

More information

y X F n (y), To see this, let y Y and apply property (ii) to find a sequence {y n } X such that y n y and lim sup F n (y n ) F (y).

y X F n (y), To see this, let y Y and apply property (ii) to find a sequence {y n } X such that y n y and lim sup F n (y n ) F (y). Modica Mortola Fuctioal 2 Γ-Covergece Let X, d) be a metric space ad cosider a sequece {F } of fuctioals F : X [, ]. We say that {F } Γ-coverges to a fuctioal F : X [, ] if the followig properties hold:

More information

IIT JAM Mathematical Statistics (MS) 2006 SECTION A

IIT JAM Mathematical Statistics (MS) 2006 SECTION A IIT JAM Mathematical Statistics (MS) 6 SECTION A. If a > for ad lim a / L >, the which of the followig series is ot coverget? (a) (b) (c) (d) (d) = = a = a = a a + / a lim a a / + = lim a / a / + = lim

More information