ECE534, Spring 2018: Solutions for Problem Set #2
|
|
- Randell Horton
- 5 years ago
- Views:
Transcription
1 ECE534, Srig 08: s for roblem Set #. Rademacher Radom Variables ad Symmetrizatio a) Let X be a Rademacher radom variable, i.e., X = ±) = /. Show that E e λx e λ /. E e λx = e λ + e λ = + k= k=0 λ k k k! = + k= λ k k! + k=0 λ /) k k! λ) k = k! = e λ. k=0 λ k k)! b) Let X be a zero mea radom variable suorted o the iterval a, b. i. Assume that X is a ideedet coy of X, i.e., X, X are i.i.d. radom variables. Usig Jese s iequality, show that E e λx E X,X e λx X ), where E X,X deotes exectatio with resect to the joit distributio of X, X. ii. Assume that ε is a Rademacher radom variable, ideedet of X, X. Observe that the radom variables X X ad εx X ) have the same distributio, which is symmetric. Use the tower roerty of coditioal exectatio ad the iequality i a to show that E e λx e λ b a) /. i) E X e λx = E X e λx E X X ) E X,X e λx X ), where EX = 0 ad Jese s iequality have bee used. ii) E X,X e λx X ) = E X,X,ε e λεx X ) = E X,X E ε e λεx X ) E X,X e λ X X ).
2 Sice X a, b, we have that X X b a) ad therefore, E X,X e λ X X ) E X,X e λ b a) = e λ b a). Hece, E e λx e λ b a).. Cocetratio of χ Radom Variables ad Radom rojectios A chi-squared radom variable S with degrees of freedom is a radom variable of the form: S = Zi, Z i N 0, ), i =,,..., ideedet i= ad is deoted by S χ. For this radom variable, ES =, i.e., the mea value coicides with the degrees of freedom. Moreover, the followig iequality holds: ) Zi > t e t /8, t 0, ). ) i= This is a cocetratio iequality for chi-squared radom variables, because it demostrates that as the umber of degrees of freedom icreases, the radom variable S/ caot be very far away from its mea value. This iequality lays a imortat role i aalyzig radom rojectios. Suose that we are give m data oits {x, x,..., x m } i R d. If d is large, it may be too exesive to store these vectors. This motivates the itroductio of a maig F : R d R, which reserves the essetial iformatio i the data oits ad allows for the storage of the rojected vectors {F x ),..., F x m )} istead of the iitial set of vectors. reservig the essetial iformatio of the data oits corresods, e.g., to the requiremet that F satisfies δ) x i x j F x i ) F x j ) + δ) x i x j, i, j {,,..., m} ) for some δ 0, ). Here, corresods to the Euclidea orm either i R d or i R. Such a requiremet ca always be achieved if is large eough, but the goal is to guaratee these iequalities for a small relative to d. Defie F : x Zx/, where Z R d is a matrix cotaiig i.i.d. N 0, ) radom variables. Verify that such a F satisfies ) with high robability by rovig the followig stes: a) Let Z i R d deote the ith row of Z. Argue that Z i = Z i x/ x is a N 0, ) radom variable.
3 For a fixed x 0, we have that Z i = d j= Z ijx j / x Z = Z ij for the matrix Z). Therefore, Zi is a liear combiatio of i.i.d. N 0, ) radom variables ad thus, Zi is also ormal. Moreover, deotig the coefficiets of this liear trasfomratio as a i = x i x, we observe that Var Z i ) = j= E Z i = d x j EZ ij = 0, x j= d x j Var Z ij ) x = d j= x j x =, where i Var Z i ) the ideedece of Z ij has bee used. Thus, Z i N 0, ). b) Coclude that S = i= Z i is a chi-squared radom variable with degrees of freedom. S = Z i= i is clearly a chi-squared radom variable by the relimiary defiitios i this roblem. We oly eed to verify that Z,..., Z are ideedet. This is straightforward due to the fact that i each Z i, a differet set of Z ij articiates. c) Use ) to show that F x) x ) / δ), + δ) e δ /8, for ay 0 x R d. By alyig ), we have ) Z i δ e δ 8, δ 0, ) i= Zx ) or x δ e δ 8, F x) ) or x δ e δ 8, ) F x) or x / δ), + δ) e δ 8, δ 0, ). 3
4 d) Use the uio boud to coclude that all the iequalities i ) are satisfied with robability at least ɛ for ay ɛ 0, ) if > 6 logm) + 8 log ) δ δ ɛ. Note that there are at most m ) differet airs of data oits xi, x j ). Thus, by the uio boud F xi x j ) x i x j ) m e δ 8. Requirig / δ), + δ)) for at least oe air x i, x j ) such that x i x j ) ) m e δ 8 m e δ 8 ɛ yields that > 6 logm)+ 8 log ) δ δ ɛ. I.e., > 6 logm)+ 8 log ) δ δ ɛ is sufficiet for all the iequalities give by ) to hold with robability at least ɛ. 3. Covergece i robability a) Let X, X,... be a sequece of radom variables such that EX µ ad VarX ) 0 as. Show that X µ as i robability. Cosider the determiistic sequece {a = EX }. The, for ay ɛ > 0, there exists N ɛ > 0 such that a µ = EX µ < ɛ, > N ɛ. Therefore, > N ɛ : X µ > ɛ) = X EX + EX µ > ɛ) X EX + EX µ > ɛ) = X EX > ɛ ) VarX ) ɛ 0 as. /4) Here, we use Chebyshev s iequality i the last ste. Hece, ɛ > 0, we have lim X µ > ɛ) = 0, i.e., X µ. b) Suose that we distribute balls ito boxes ideedetly at radom. Let E = I + I + + I be the umber of emty boxes, where I j is the emtiess idicator of the jth box. Usig art 3a show that E /e as. Note that I j Ber ) ) radom variables, because the robability of ot occuyig the jth box i every dro is ). This leads to EIj = ) 4
5 ad EE = ). Moreover, E E = E I j + E I i I j = j= i j EI i I j E I j + j= i j = ) + EI i I j. We ow observe that EI i I j = boxes i ad j are both emty) = ). Combiig, we see that VarE ) = E E E E ) = ) + ) i j ). ) Defie the radom variable S = E. It is easy to see that ES = EE as, while VarS ) = e ) + ) ) ) 0 + e e = 0. Therefore, by the revious art, S = E e. 4. All Tyes of Covergece of Radom Sequeces Cosider a sequece of radom variables X, X,... with its geeric term defied as follows: X Ber/) ad X = X + ) mod. Does this sequece coverge almost surely, i robability, i mea square ad i distributio? Justify your aswer for each tye of covergece searately. The sequece has oly two outcomes or samle aths) deedig o X : X = : The X X... = X = 0 : The X X... = a) {X } does ot coverge almost surely because the robability of every jum is. b) {X } does ot coverge i robability because the frequecy of jums is equal to. 5
6 c) {X } does ot coverge to mea value of X for all ) i mea square sese sice lim E X ) = E X X + 4 = EX EX + 4 = d) As, the value of the X is determied by X ad therefore, X Ber d ), due to X ), hece X Ber ). 5. Etroy Bouds For a ositive radom variable X, the followig defiitio of etroy is itroduced: HX) = EX log X EX log EX. Cosider the radom variable e λx ad the momet geeratig fuctio m X λ) = E e λx. It is the easy to see that H e λx) = λm Xλ) m X λ) log m X λ). Assume that there is a costat σ < such that H e λx) λ σ m Xλ), λ R +. Show that E e λx EX) e λ σ, λ R +. We eed to show that log m X λ) λ σ. Note that H e λx) λ σ m Xλ) is equivalet to λm X λ) m Xλ) log m X λ) λ σ m Xλ) or m X λ) λm X λ) log m λ X λ) σ, where we have divided by λ m X λ). We ow see that Also, 0 d log m X λ) = m X λ) dλ λ λm X λ) log m Xλ) λ. log m X λ) lim = m X 0) λ 0 λ m X 0) = EX. Therefore, for a arbitrary λ > 0, λ d log m X λ) d λ = log m Xλ) d λ λ λ EX λ 0 σ d λ = σ λ. 6
7 Multilyig both sides by λ, we obtai log E e λx EX) = log E e λx e λex = log E e λx λex σ λ. 6. Rademacher Comlexity Let X, X,..., X be ideedet radom variables such that X i a, b for all i {,,..., }. Cosider a fuctio f : R R, which is covex i each of its argumets ad L-Lischitz with resect to the Euclidea orm. The the followig iequality holds: E e λfx,x,...,x ) EfX,X,...,X )) e λ L b a), λ 0. 3) Cosider a set of vectors C R. The, RC) = E su c C ε i c i corresods to the Rademacher comlexity of C. Here, {ε i } are ideedet Rademacher radom variables as these were defied i roblem ad c = c, c,..., c is a vector i C. Let ˆRC) = su c C i= ε ic i deote the emirical versio of RC). Usig 3), argue that where diamc) = su c C c. i= ˆRC) RC) + t) e t 6diamC)), Note: A fuctio f : R R is said to be L Lischitz for some L 0 with resect to the Euclidea orm if fx) fy) L x y, x, y R. Also, the oitwise suremum fx) = su i I f i x) of a arbitrary family of covex fuctios {f i x) i I} is covex. Hit: First, show that L = diamc) is a valid uer boud to the Lischitz costat of fε,..., ε ) = su c C i= ε ic i for ε i {, +}. Combie the 3) with the Cheroff boud to get the desired iequality by choosig λ = t 8diamC)). We ote that the fuctio fε,..., ε ) = su c C i= ε ic i is covex, sice it is the suremum of a family of liear i.e., covex) fuctios. Moreover, fε,..., ε ) is 7
8 Lischitz with L = su c C c beig a valid uer boud to the Lischitz costat. To see this, cosider first the liear form gε; c) = i= c iε i for c C. The, gε; c) gε ; c) = i= c i ε i ε i) }{{} a) c ε ε su c ε ε. c C }{{} L I a), the Cauchy-Schwarz iequality has bee used. Therefore, gε; c) is Lischitz ad L is a valid uer boud to the corresodig Lischitz costat. For arbitrary ε, ε, we ca ow see that gε; c) gε ; c) + L ε ε. Takig the suremum with resect to c C, first to the right had side ad the to the left, we obtai: Moreover, iterchagig ε, ε, we obtai: fε,..., ε ) fε,..., ε ) L ε ε. fε,..., ε ) fε,..., ε ) L ε ε. Combiig, we have: fε,..., ε ) fε,..., ε ) L ε ε. Therefore, L is a uer boud to the Lischitz costat of f. Emloyig ow the Cheroff boud ad 3), we obtai: ˆRC) E e λ ˆRC) E e λ ˆRC) RC)) RC) + t) = e λ ˆRC)+t) e λt e 4λ L λt. Miimizig 4λ L λt with resect to λ yields that λ = t 8 L = t 8diamC)). luggig this value i the last iequality yields the desired result. 7. Covergece i robability Agai rove that X X if ad oly if lim E X X = 0. + X X 8
9 Without loss of geerality, take X = 0. We wat to show that X if lim E = 0. i) X X + X 0 = lim E X + X = 0. 0 if ad oly By X 0, we have that ɛ > 0 : lim X > ɛ) = 0. Note that Therefore, X + X X + X I X > ɛ + ɛi X ɛ I X > ɛ + ɛ. X E EI X > ɛ + ɛ = X > ɛ) + ɛ. + X Takig the limit, we obtai lim E X have that lim E X + X = 0. ii) lim E X + X = 0 = X 0. Observe that the fuctio fx) = x x+ + X ɛ, ad sice ɛ > 0 is arbitrary, we is icreasig. Therefore, ɛ + ɛ I X > ɛ X + X I X > ɛ X + X. Takig exectatios ad the limits to both sides, we obtai: ɛ + ɛ lim X > ɛ) lim E X = 0 X + Sice this holds for ay ɛ > 0, we have that lim X > ɛ) = 0, ɛ > 0. therefore, X Almost Sure Covergece Agai Bous roblem Let X, X,... be a sequece of i.i.d. radom variables with X > x) = e x, x 0. Show that max{x, X,..., X } a.s. as. log Note: Use the Borel-Catelli Lemma. 9
10 Let Y = max{x,..., X }. For ɛ > 0, we have ) ) maxx,..., X ) Y < ɛ = log log < ɛ Usig art a) i the Borel-Catelli lemma, = = Y < ɛ) log ) = i={x i < ɛ) log }) = e ɛ) log ) = ) ɛ = ) ) ɛ ɛ ɛ ) Y log < ɛ = = ) ɛ ɛ ɛ e ) ɛ <. ) Therefore, Y log < ɛ i.o. = 0. Usig similar stes ad focusig o the radom variable X, we have ) X log > + ɛ = e log +ɛ) = +ɛ. Therefore, = ) X log > + ɛ = = = <. +ɛ ) By art a) i the Borel-Catelli lemma, X log > + ɛ i.o. = 0. Also, ) = X log > ɛ = ) = =. By art b) i the Borel-Catelli lemma, X ɛ log > ɛ i.o. =. Combiig the above results, ad therefore, lim su X log = a.s. X log > + ɛ i.o. ) = 0. Hece, Y log = max i X i log a.s.. 0
ECE534, Spring 2018: Final Exam
ECE534, Srig 2018: Fial Exam Problem 1 Let X N (0, 1) ad Y N (0, 1) be ideedet radom variables. variables V = X + Y ad W = X 2Y. Defie the radom (a) Are V, W joitly Gaussia? Justify your aswer. (b) Comute
More informationConvergence 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 information7.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 information7.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 informationMASSACHUSETTS 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 informationIntroduction to Probability. Ariel Yadin
Itroductio to robability Ariel Yadi Lecture 2 *** Ja. 7 ***. Covergece of Radom Variables As i the case of sequeces of umbers, we would like to talk about covergece of radom variables. There are may ways
More informationLearning Theory: Lecture Notes
Learig Theory: Lecture Notes Kamalika Chaudhuri October 4, 0 Cocetratio of Averages Cocetratio of measure is very useful i showig bouds o the errors of machie-learig algorithms. We will begi with a basic
More informationDistribution 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 informationProbability for mathematicians INDEPENDENCE TAU
Probability for mathematicias INDEPENDENCE TAU 2013 28 Cotets 3 Ifiite idepedet sequeces 28 3a Idepedet evets........................ 28 3b Idepedet radom variables.................. 33 3 Ifiite idepedet
More informationThis section is optional.
4 Momet Geeratig Fuctios* This sectio is optioal. The momet geeratig fuctio g : R R of a radom variable X is defied as g(t) = E[e tx ]. Propositio 1. We have g () (0) = E[X ] for = 1, 2,... Proof. Therefore
More information1 Probability Generating Function
Chater 5 Characteristic Fuctio ad Probablity Covergece Theorem Probability Geeratig Fuctio Defiitio. For a discrete radom variable X which ca oly achieve o-egative itegers, we defie the robability geeratig
More informationSequences 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 informationLecture 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 informationLecture 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 informationRademacher Complexity
EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for
More informationECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002
ECE 330:541, Stochastic Sigals ad Systems Lecture Notes o Limit Theorems from robability Fall 00 I practice, there are two ways we ca costruct a ew sequece of radom variables from a old sequece of radom
More informationChapter 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 informationSUPPLEMENT TO GEOMETRIC INFERENCE FOR GENERAL HIGH-DIMENSIONAL LINEAR INVERSE PROBLEMS
Submitted to the Aals of Statistics arxiv: arxiv:0000.0000 SUPPLEMENT TO GEOMETRIC INFERENCE FOR GENERAL HIGH-DIMENSIONAL LINEAR INVERSE PROBLEMS By T. Toy Cai, Tegyua Liag ad Alexader Rakhli The Wharto
More informationLecture Chapter 6: Convergence of Random Sequences
ECE5: Aalysis of Radom Sigals Fall 6 Lecture Chapter 6: Covergece of Radom Sequeces Dr Salim El Rouayheb Scribe: Abhay Ashutosh Doel, Qibo Zhag, Peiwe Tia, Pegzhe Wag, Lu Liu Radom sequece Defiitio A ifiite
More informationThis 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 informationEcon 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 information13.1 Shannon lower bound
ECE598: Iformatio-theoretic methods i high-dimesioal statistics Srig 016 Lecture 13: Shao lower boud, Fao s method Lecturer: Yihog Wu Scribe: Daewo Seo, Mar 8, 016 [Ed Mar 11] I the last class, we leared
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationLecture 3 : Random variables and their distributions
Lecture 3 : Radom variables ad their distributios 3.1 Radom variables Let (Ω, F) ad (S, S) be two measurable spaces. A map X : Ω S is measurable or a radom variable (deoted r.v.) if X 1 (A) {ω : X(ω) A}
More informationLecture 20: Multivariate convergence and the Central Limit Theorem
Lecture 20: Multivariate covergece ad the Cetral Limit Theorem Covergece i distributio for radom vectors Let Z,Z 1,Z 2,... be radom vectors o R k. If the cdf of Z is cotiuous, the we ca defie covergece
More informationFinal Solutions. 1. (25pts) Define the following terms. Be as precise as you can.
Mathematics H104 A. Ogus Fall, 004 Fial Solutios 1. (5ts) Defie the followig terms. Be as recise as you ca. (a) (3ts) A ucoutable set. A ucoutable set is a set which ca ot be ut ito bijectio with a fiite
More informationEntropy 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 informationMathematics 170B Selected HW Solutions.
Mathematics 17B Selected HW Solutios. F 4. Suppose X is B(,p). (a)fidthemometgeeratigfuctiom (s)of(x p)/ p(1 p). Write q = 1 p. The MGF of X is (pe s + q), sice X ca be writte as the sum of idepedet Beroulli
More informationLECTURE 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 informationLecture 01: the Central Limit Theorem. 1 Central Limit Theorem for i.i.d. random variables
CSCI-B609: A Theorist s Toolkit, Fall 06 Aug 3 Lecture 0: the Cetral Limit Theorem Lecturer: Yua Zhou Scribe: Yua Xie & Yua Zhou Cetral Limit Theorem for iid radom variables Let us say that we wat to aalyze
More information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationProbability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)].
Probability 2 - Notes 0 Some Useful Iequalities. Lemma. If X is a radom variable ad g(x 0 for all x i the support of f X, the P(g(X E[g(X]. Proof. (cotiuous case P(g(X Corollaries x:g(x f X (xdx x:g(x
More informationLECTURE SERIES WITH NONNEGATIVE TERMS (II). SERIES WITH ARBITRARY TERMS
LECTURE 4 SERIES WITH NONNEGATIVE TERMS II). SERIES WITH ARBITRARY TERMS Series with oegative terms II) Theorem 4.1 Kummer s Test) Let x be a series with positive terms. 1 If c ) N i 0, + ), r > 0 ad 0
More information2 Banach spaces and Hilbert spaces
2 Baach spaces ad Hilbert spaces Tryig to do aalysis i the ratioal umbers is difficult for example cosider the set {x Q : x 2 2}. This set is o-empty ad bouded above but does ot have a least upper boud
More informationMATH 413 FINAL EXAM. f(x) f(y) M x y. x + 1 n
MATH 43 FINAL EXAM Math 43 fial exam, 3 May 28. The exam starts at 9: am ad you have 5 miutes. No textbooks or calculators may be used durig the exam. This exam is prited o both sides of the paper. Good
More informationSupplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate
Supplemetary Material for Fast Stochastic AUC Maximizatio with O/-Covergece Rate Migrui Liu Xiaoxua Zhag Zaiyi Che Xiaoyu Wag 3 iabao Yag echical Lemmas ized versio of Hoeffdig s iequality, ote that We
More informationGlivenko-Cantelli Classes
CS28B/Stat24B (Sprig 2008 Statistical Learig Theory Lecture: 4 Gliveko-Catelli Classes Lecturer: Peter Bartlett Scribe: Michelle Besi Itroductio This lecture will cover Gliveko-Catelli (GC classes ad itroduce
More informationMAT1026 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 informationANSWERS TO MIDTERM EXAM # 2
MATH 03, FALL 003 ANSWERS TO MIDTERM EXAM # PENN STATE UNIVERSITY Problem 1 (18 pts). State ad prove the Itermediate Value Theorem. Solutio See class otes or Theorem 5.6.1 from our textbook. Problem (18
More informationECONOMETRIC 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 informationProbability and Random Processes
Probability ad Radom Processes Lecture 5 Probability ad radom variables The law of large umbers Mikael Skoglud, Probability ad radom processes 1/21 Why Measure Theoretic Probability? Stroger limit theorems
More informationNotes 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 information2.2. Central limit theorem.
36.. Cetral limit theorem. The most ideal case of the CLT is that the radom variables are iid with fiite variace. Although it is a special case of the more geeral Lideberg-Feller CLT, it is most stadard
More informationLet 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 informationLecture 3: August 31
36-705: Itermediate Statistics Fall 018 Lecturer: Siva Balakrisha Lecture 3: August 31 This lecture will be mostly a summary of other useful expoetial tail bouds We will ot prove ay of these i lecture,
More informationA Central Limit Theorem for Belief Functions
A Cetral Limit Theorem for Belief Fuctios Larry G. Estei Kyougwo Seo November 7, 2. CLT for Belief Fuctios The urose of this Note is to rove a form of CLT (Theorem.4) that is used i Estei ad Seo (2). More
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationIntegrable 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 informationMachine 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 informationLecture 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 informationSOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1.
SOLUTIONS TO EXAM 3 Problem Fid the sum of the followig series 2 + ( ) 5 5 2 5 3 25 2 2 This series diverges Solutio: Note that this defies two coverget geometric series with respective radii r 2/5 < ad
More informationLecture 6: Coupon Collector s problem
Radomized Algorithms Lecture 6: Coupo Collector s problem Sotiris Nikoletseas Professor CEID - ETY Course 2017-2018 Sotiris Nikoletseas, Professor Radomized Algorithms - Lecture 6 1 / 16 Variace: key features
More informationLecture 14: Graph Entropy
15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number
More informationSupplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate
Supplemetary Material for Fast Stochastic AUC Maximizatio with O/-Covergece Rate Migrui Liu Xiaoxua Zhag Zaiyi Che Xiaoyu Wag 3 iabao Yag echical Lemmas ized versio of Hoeffdig s iequality, ote that We
More informationJohn H. J. Einmahl Tilburg University, NL. Juan Juan Cai Tilburg University, NL
Estimatio of the margial exected shortfall Laures de Haa, Poitiers, 202 Estimatio of the margial exected shortfall Jua Jua Cai Tilburg iversity, NL Laures de Haa Erasmus iversity Rotterdam, NL iversity
More informationThe variance of a sum of independent variables is the sum of their variances, since covariances are zero. Therefore. V (xi )= n n 2 σ2 = σ2.
SAMPLE STATISTICS A radom sample x 1,x,,x from a distributio f(x) is a set of idepedetly ad idetically variables with x i f(x) for all i Their joit pdf is f(x 1,x,,x )=f(x 1 )f(x ) f(x )= f(x i ) The sample
More informationTopics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.
MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13
More information1 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 informationProbability and Statistics
ICME Refresher Course: robability ad Statistics Staford Uiversity robability ad Statistics Luyag Che September 20, 2016 1 Basic robability Theory 11 robability Spaces A probability space is a triple (Ω,
More informationHomework 4. x n x X = f(x n x) +
Homework 4 1. Let X ad Y be ormed spaces, T B(X, Y ) ad {x } a sequece i X. If x x weakly, show that T x T x weakly. Solutio: We eed to show that g(t x) g(t x) g Y. It suffices to do this whe g Y = 1.
More informationf n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that
Lecture 15 We have see that a sequece of cotiuous fuctios which is uiformly coverget produces a limit fuctio which is also cotiuous. We shall stregthe this result ow. Theorem 1 Let f : X R or (C) be a
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
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 informationFall 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 informationPutnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)
Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.
More informationSolutions to Problem Sheet 1
Solutios to Problem Sheet ) Use Theorem. to rove that loglog for all real 3. This is a versio of Theorem. with the iteger N relaced by the real. Hit Give 3 let N = [], the largest iteger. The, imortatly,
More informationSolutions to Tutorial 5 (Week 6)
The Uiversity of Sydey School of Mathematics ad Statistics Solutios to Tutorial 5 (Wee 6 MATH2962: Real ad Complex Aalysis (Advaced Semester, 207 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationSolutions to Tutorial 3 (Week 4)
The Uiversity of Sydey School of Mathematics ad Statistics Solutios to Tutorial Week 4 MATH2962: Real ad Complex Aalysis Advaced Semester 1, 2017 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/
More informationST5215: Advanced Statistical Theory
ST525: Advaced Statistical Theory Departmet of Statistics & Applied Probability Tuesday, September 7, 2 ST525: Advaced Statistical Theory Lecture : The law of large umbers The Law of Large Numbers The
More informationMASSACHUSETTS 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 informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationA REFINEMENT OF JENSEN S INEQUALITY WITH APPLICATIONS. S. S. Dragomir 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 1,. 153-164, February 2010 This aer is available olie at htt://www.tjm.sysu.edu.tw/ A REFINEMENT OF JENSEN S INEQUALITY WITH APPLICATIONS FOR f-divergence
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationEstimation 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 information1+x 1 + α+x. x = 2(α x2 ) 1+x
Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem
More information5. INEQUALITIES, LIMIT THEOREMS AND GEOMETRIC PROBABILITY
IA Probability Let Term 5 INEQUALITIES, LIMIT THEOREMS AND GEOMETRIC PROBABILITY 51 Iequalities Suppose that X 0 is a radom variable takig o-egative values ad that c > 0 is a costat The P X c E X, c is
More information62. 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 informationMATH 472 / SPRING 2013 ASSIGNMENT 2: DUE FEBRUARY 4 FINALIZED
MATH 47 / SPRING 013 ASSIGNMENT : DUE FEBRUARY 4 FINALIZED Please iclude a cover sheet that provides a complete setece aswer to each the followig three questios: (a) I your opiio, what were the mai ideas
More informationLecture 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 informationTheorem 3. A subset S of a topological space X is compact if and only if every open cover of S by open sets in X has a finite subcover.
Compactess Defiitio 1. A cover or a coverig of a topological space X is a family C of subsets of X whose uio is X. A subcover of a cover C is a subfamily of C which is a cover of X. A ope cover of X is
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationMATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1
MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The
More information17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15
17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig
More informationMASSACHUSETTS 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 information6.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 informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationUniversity of Manitoba, Mathletics 2009
Uiversity of Maitoba, Mathletics 009 Sessio 5: Iequalities Facts ad defiitios AM-GM iequality: For a, a,, a 0, a + a + + a (a a a ) /, with equality iff all a i s are equal Cauchy s iequality: For reals
More informationA Note on Sums of Independent Random Variables
Cotemorary Mathematics Volume 00 XXXX A Note o Sums of Ideedet Radom Variables Pawe l Hitczeko ad Stehe Motgomery-Smith Abstract I this ote a two sided boud o the tail robability of sums of ideedet ad
More informationMa 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5
Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You
More informationMi-Hwa Ko and Tae-Sung Kim
J. Korea Math. Soc. 42 2005), No. 5, pp. 949 957 ALMOST SURE CONVERGENCE FOR WEIGHTED SUMS OF NEGATIVELY ORTHANT DEPENDENT RANDOM VARIABLES Mi-Hwa Ko ad Tae-Sug Kim Abstract. For weighted sum of a sequece
More informationSeries III. Chapter Alternating Series
Chapter 9 Series III With the exceptio of the Null Sequece Test, all the tests for series covergece ad divergece that we have cosidered so far have dealt oly with series of oegative terms. Series with
More informationAxioms 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 informationTHE INTEGRAL TEST AND ESTIMATES OF SUMS
THE INTEGRAL TEST AND ESTIMATES OF SUMS. Itroductio Determiig the exact sum of a series is i geeral ot a easy task. I the case of the geometric series ad the telescoig series it was ossible to fid a simle
More informationMATH301 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 informationNotes 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 informationLecture 2: Concentration Bounds
CSE 52: Desig ad Aalysis of Algorithms I Sprig 206 Lecture 2: Cocetratio Bouds Lecturer: Shaya Oveis Ghara March 30th Scribe: Syuzaa Sargsya Disclaimer: These otes have ot bee subjected to the usual scrutiy
More informationAn 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