36-755, Fall 2017 Homework 5 Solution Due Wed Nov 15 by 5:00pm in Jisu s mailbox

Size: px
Start display at page:

Download "36-755, Fall 2017 Homework 5 Solution Due Wed Nov 15 by 5:00pm in Jisu s mailbox"

Transcription

1 Poits: 00+ pts total for the assigmet , Fall 07 Homework 5 Solutio Due Wed Nov 5 by 5:00pm i Jisu s mailbox We first review some basic relatios with orms ad the sigular value decompositio o matrices Lemma 0 For ay matrix A R m, let A = UΣV be its sigular value decompositio with U U = UU = I m ad V V = V V = I, ad Σ beig m diagoal matrix with oegative diagoal values σ,, σ mim, i Frobeius orm ca be calculated as A F = mim, ii Operator -orm A op ca be calculated as A op = σ i i Proof i Note that Frobeius orm equals A F = m j= A ij = tra A Ad hece from the sigular value decompositio of A, σ i A F = tra A = truσv V Σ U = truσσ U = trσσ U U = mim, σi ii Let r = mim,, ad let colums of U ad V be u,, u m ad v,, v, respectively Expad ay w R usig v,, v as basis, so that w = a iv i with a,, a R The Aw = a i Av i = r a i σ i u i, ad hece Aw = r σi a i i r σ i a i = σ i w, i r ad sufficiet coditio for the equality is whe a = ad a = = a = 0, ie w = v Hece Aw A op = sup w 0 w = i r σ i I this exercise you will fill i some of the details from the proof of the upper boud for sparse PCA uder a spike covariace model

2 a For p the Schatte p-orm of a m matrix A is the l p orm of its sigular values: r /p A p = σ p i, where σ σ σ r 0 are the sigular values of A ad r = mi{m, } Prove the ocommutative Hölder iequality for coformal matrices A ad B: for all p, q such that p + q = tra B A p B q, b Let u ad v be two uit orm vectors i R d Show that uu vv op = uu vv F = u v = si u, v where u, v = cos u v Poits: 5 pts = Solutio a Let A be m matrix ad let B be m matrix, ad let r = mi{, m }, s = mi{, m } Let σ σ r 0 be sigular values of A, the from sigular value decompositio, there exists a orthoormal set of vectors {u,, u r } R ad a orthoormal set of vectors {v,, v r } R m such that A = r σ iu i vi These {u i} s are first r colums of U ad {v i } s are first r colums of V, where A = UΣV is the sigular value decompositio of A Similarly, let λ λ s 0 be sigular values of B, the there exists a orthoormal set of vectors {w,, w s } R ad a orthoormal set of vectors {t,, t s } R s such that s j= λq j B = s j= λ jw j t j Note that A p = r σp i /p ad B q = LHS ca be expaded as tra r s B = tr σ i v i u i λ j w j t j j= r s = σ i λ j tr v i u i w j t j j= r s u tr σ i λ j i w j v i t j j= /q Meawhile, Now, ote that for ay u, w R with u = v =, Cauchy-Schwarz iequality yields u w u w = Also, for ay v R m ad t R m with v = t =, Cauchy-Schwarz iequality yields tr v i t j = mi{m,m } v i t i mi{m,m } v mi{m,m } i t i v t =

3 Hece applyig this ad further applyig Hölder s iequality gives tra B r j= r s σ i λ j σ p i p s j= λ q j q = A p B q Note that above iequality holds for p =, q = or p =, q = as well, where A = i r σ i b The rest of the iequality follows from HW4 Problem 4c, hece we are oly left to show the first iequality uu vv op = uu vv F Note that the rak of uu vv is at most, so ozero eigevalues ca be at most Hece uu vv ca be expressed as uu vv = λ w w + λ w w, where λ, λ R ad w, w R d with w w The from λ = λ, ie there exists λ > 0 such that λ + λ = truu vv = u u v v = 0, uu vv = λw w λw w The sice uu vv is real symmetric, all the sigular values are absolute values of eigevalues Hece sigular values of uu vv are λ, λ, 0,, 0 Hece from Lemma 0, uu vv op = λ ad uu vv F = λ + λ = λ, ad hece uu vv op = uu vv F holds This is a result that I cited whe discussig spectra clusterig for stochastic block models A radom matrix A of dimesio m is sub-gaussia with parameter σ, writte as A SG m, σ, whe y Ax is SGσ for ay y S ad x S m You may assume that E[A] = 0 or otherwise replace A by A E[A] a Suppose that the etries of A are idepedet variables that are SGσ SG m, σ b Let A SG,m σ ad recall that the operator orm of A is Show that A A op = Ax x R m,x 0 x = y S,x S y Ax m Show that, for some C > 0, E [ A op ] C + m c Fid a cocetratio iequality for A op 3

4 Hit: work with a /4 et for S ad a /4 et for S m Poits: 5 pts = Solutio Assume that E[A] = 0 a For all y S, x S m, ad λ R, by usig the etries of A beig idepedet ad SGσ, the mgf of y Ax is bouded as [ ] E exp λy Ax = E exp λ = j= j= j= m y i A ij x j m E [exp λy i x j A ij ] usig idepedece of A ij m exp σ λy i x j = exp m σ λ yi x j j= = exp σ λ, y S, x S m hece A SG m, σ b Let B S ad B m S m be the 4 -et for S ad S m with respect to l distaces The from Lecture ote 5Sep 8, B V ol /4 B0, + B0, V olb0, = V ol 9B0, V olb0, = 9, ad similarly B m 9 m holds Also for all y S ad x S m, there exists y 4 S, x 4 Sm, w B, z B m with y = w + y ad x = z + x Hece y S,x S y Ax m w Az + w Ax + y Az + y Ax w B,z B m w B,x 4 Sm y 4 S,z B m y 4 S,x 4 Sm = w B,z B m w Az + 4 Now, ote that w B,x S m w Ax + 4 w B w Ax,x S m y Az + y S,z B m 6 w Az + w Ax w B,z B m w B,x 4 Sm w Az + w B,z B m 4 w B w Ax,,x S m y S,x S y Ax m 4

5 so Ax 4 w B,x S m w 3 w Az, ad similarly y Az 4 w B,z B m y S 3 w Az,z B m w B,z B m Ad applyig these to yields y S,x S y Ax 6 w Az m 9 w B,z B m Hece these yields the upper boud of E [ A op ] as [ ] E [ A op ] = E y S,x S y Ax m 6 [ ] 9 E w Az usig w B,z B m 6σ log Bm B 9 m + log 9 6σ 9 < 3σ log 3 9 m + c From, the tail probability P A op t ca be bouded as usig m + < m + for m, > 0 P A op t = P y S,x S y Ax t m 6 P w Az t usig 9 w B,z B m w Az 96 t 3 w B,z B m P The for each w B ad z B m, sice w Az SGσ with E [ w Az ] = 0, so by applyig Hoeffdig s iequality, P w Az 96 t exp 8t 5σ Hece applyig this to 3 gives the boud for the tail probability P A op t as P A op t B m B exp 8t 5σ 9 m+ exp 8t 5σ 3 Exercise 84: Show that the orthogoal matrix V R d r imizig the criterio 8 has colums formed by the top r eigevectors of Σ = covx: Poits: 5 pts E V X = r j= [ E v j, X ] 5

6 Solutio E V X ] [ ] [X = E V V X = E tr X V V X [ = E tr V V XX ] = tr V V E [XX ] = tr V V Σ Let eigevalues ad correspodig eigevectors of Σ be λ λ d ad u,, u d The E V X d d = tr V V λ i u i u i = λ i tr V V u i u i = d λ i tr u i V V u i = d V λ i u i Now, ote that V V V = V V V = V I r = V, ad hece for ay w ColV, V V w = w, where ColV is the colum space of V Also, for ay w ColV, V w = 0, which implies V V w = 0 Hece for ay u R d with u =, let u = w + w with w ColV ad w ColV, the hece V u i satisfy V u = w + w V V w + w = w + w w = w u =, 0 V u i 4 Also, V u i = holds if ad oly if u i ColV ie ColV part is 0 ad V u i = 0 if ad oly if u i ColV ie ColV part is 0 Also, ote that d V d d u i = tr V V u i u i = tr V V u i u i = tr V V I d = tr V V = tr I r = r 5 Now, cosider the followig optimizatio problem: d imize λ i x i, subject to i, 0 x i, d x i = r 6 The, the costraits imply that i d, i j= x j mi {i, r} Let λ d+ = 0 for cove- 6

7 iece, ad ote that d λ i x i = = d i λ i λ i+ r λ i λ i+ i + r λ i, j= x j d λ i λ i+ r i=r+ ad the equality holds if ad oly if i j= x j = mi {i, r} wheever λ i > λ i+ Hece x = = x r =, x r+ = = x d = 0 7 imizes the objective fuctio d λ ix i, ad if we further have λ r > λ r+, it is the uique imizer Hece, applyig 4 ad 5 to 6 implies that E V X = d V λ r i u i λ i Ad from 7, the equality holds if V V u = = V u r = ad V u r+ = = u d = 0, 8 ad oly if holds uder λ r > λ r+ The from equality coditios from 4, 8 is equivalet to ColV = u,, u r, where u,, u r R d is the liear subspace spaed by u,, u r I coclusio, E V X r λ i, ad the equality holds if ColV = u,, u r, ad uder λ r > λ r+, it is ecessary as well I particular, whe top r eigevectors {u,, u r } form the colums of V, E V X is imized 4 Suppose we observe a iid sample X,, X from the mixture distributio P + P, where P = N d µ, I d ad P = N d µ, I d, with µ R d a o-zero vector Ours task is to cluster the sample poits ito two groups, where poits i the same group origiated from the same compoet of the mixture ie Either P or P We will use spectral clusterig: compute the leadig eigevector ˆν of the empirical covariace matrix ad cluster the poits depedig o the sig of Xi ˆν, i =,, Use the Davis-Kaha theorem to derive a upper boud o the proportio of misclustered odes Poits: 0 + pts 7

8 Solutio X has the same distributio as W µ + Y, where W Rademacher, Y N d 0, I d E[X] = 0 ad [ Σ := V ar [X] = E XX ] = µµ + I d The Hece by lettig v := µ µ, the v is the leadig eigevector of Σ with eigevalue + µ Hece from Davis-Kaha theorem, ˆΣ Σ op si v, ˆv µ 9 The ote that the umber of misclustered odes is upper bouded by I { } { } Xi ˆv 0, W i = Xi ˆv > 0, W i = Hece the misclusterig proportio R is bouded as R P Xi ˆv 0, W i = + P Xi ˆv > 0, W i = P µ + Y i ˆv 0 + P µ + Y i ˆv > 0 Now, cosider the first evet { µ + Y i ˆv 0 } Note that Hece µ + Y i, ˆv 0 implies µ + Y i, ˆv = µ, ˆv + Y i, ˆv µ, ˆv Y i, Y i µ, ˆv µ + Y i, ˆv µ, ˆv Its geometric iterpretatio is i Figure Ad applyig Y i istead of Y i gives that µ + Y i, ˆv > 0 implies Y i > µ, ˆv as well Sice ˆv is aliged with µ so that µ, ˆv 0, ad hece the misclusterig proportio R is bouded as R P Y i µ, ˆv The applyig the result of Davis-Kaha Theorem i 9 implies µ, ˆv = µ cos v, ˆv = µ si v, ˆv 4 ˆΣ Σ µ op µ 4 Hece the misclusterig proportio R is bouded as 4 ˆΣ Σ R P Y i µ µ 4 op 8

9 µ, ˆv µ ˆv X i, ˆv 0 Figure : Geometrical iterpretatio of µ + Y i, ˆv 0 implyig Y i µ, ˆv µ + Y i, ˆv 0 is equivalet to X i = µ + Y i lyig o the bottom-left regio of the hyperplae which is perpedicular to ˆv The X i lies outside of a sphere cetered at µ ad of radius µ, ˆv Hece X i µ = Y i µ, ˆv Now, ote that for ay v R d with v =, [ ] E exp λv X i = [ ] E exp λv µ + Y i + [ E ] λv µ + Y i exp = exp λv µ + λ + exp λv µ + λ = exp λ cosh λv µ exp λ + v µ cosh x expx / exp λ + µ, Cauchy-Schwarz Hece X i SG + µ Hece from Lecture ote 6 o Sep 0, for all δ 0,, there exists some C > 0 such that { } op d + log/δ P ˆΣ Σ C + µ, d + log/δ δ 0 { } Let E be the evet that ˆΣ Σ C+ µ d+log/δ op, d+log/δ happes The Y i µ 4 ˆΣ Σ op ad E implies µ 4 Y i µ µ := K,d,δ, µ,c, 4C + µ µ 4 8C + µ 4 { } d + log/δ d + log/δ, { } d + log/δ d + log/δ, 9

10 { } where K,d,δ, µ,c = µ 8C + d+log/δ µ 4, d+log/δ Ad hece 4 ˆΣ Σ R P Y i µ µ 4 op 4 ˆΣ Σ + P Y i µ µ 4 P Y i K,d,δ, µ,c + PE c P Y i K,d,δ, µ,c + δ E op Ec Now, sice Y i N d 0, I d, Y i χ d, chi-square distributio with degree d Hece P Y i K,d,δ, µ,c = Fχ d K,d,δ, µ,c, where F χ is the CDF fuctio for χ d d To coclude, the misclusterig proportio R is bouded as { } R if F χ K d,d,δ, µ,c + δ, δ 0, where K,d,δ, µ,c = µ 8C + µ 4 { d+log/δ, } d+log/δ Note that whe gettig the boud 0, matrix Berstei iequality is a bit icoveiet to use sice X i is ot bouded There is bous poit for usig the correct covariace boud for gettig 0 5 Exercise 43: a Recall the re-cetered fuctio class F = {f E[f] f F} Show that E X,ɛ [ R F] E X,ɛ [ R F ] sup f F E[f] b Use cocetratio results to complete the proof of Propositio 4 Poits: 5 pts = Solutio a Note that for ay f F, there exists f F such that fx = fx + E[f] Hece R F = sup f F = sup f F sup f F ɛ i fxi ɛ i fx i ɛ i E[f] ɛ i fx i sup ɛ i E[f] f F 0

11 [ ] Now, ote that by applyig Cauchy Schwarz, E ɛ i ca be bouded as [ E ] ɛ i E = = ɛ i = E ɛ i + ɛ i ɛ j i j By pluggig this to expectatio of, we get E X,ɛ [ R F] E X,ɛ [ R F ] sup f F [ E[f] E E X,ɛ [ R F ] sup f F E[f] ] ɛ i b Note that from a ad Propositio 4 a, we have ] E X [ P P F ] E X,ɛ [ R F E X,ɛ [ R F ] sup f F E[f] Now, for each f F let fx = fx E[f] as i a, ad let Gx,, x = sup fx i f F so that P P F = GX,, X Note that if x, y X satisfies x j = y j for all j i, the for ay f F, fx j j= sup hy j h F j= fx j j= fy j j= fx j fy j j= j= = fxj fy j f b Hece takig supremum over f F yields Gx Gy b Sice the same argumet ca be applied to get Gy Gx b b, so Gx Gy Hece from Bouded differeces iequality, P GX E [GX] δ exp δ b The applyig GX = P P F ad to this gives P P P F E X,ɛ [ R F ] sup f F E[f] P P P F E [ P P F ] δ exp δ b δ

12 Hece P P F E X,ɛ [ R F ] sup f F E[f] + δ with P-probability at least e δ b 6 Massart s fiite class Lemma Let A be a fiite subset of R ad let ɛ = ɛ,, ɛ be a vector of iid Rademacher variables Show that [ ] log A E sup a ɛ D a A where D = a A a Use this result to prove Lemma 4 of Chapter 4 I provig both claims it is OK if you get differet costats; kow however that the costats i Lemma 4 are sub-optimal Poits: 0 pts Solutio Note that E [ e λɛ i] ca be bouded as E [exp λɛ i ] = eλ + e λ = λ k k=0 k! k! k! k=0 k=0 λ k k! λ k k! k = e σ, hece ɛ i SG Sice ɛ i s are idepedet, from HW Problem 6 Details, a ɛ SG a SG D Hece from imum iequality for subgaussia radom variables, [ ] log A E sup a ɛ D, a A ad from HW Problem, we also have a boud for absolute value versio, [ ] E sup a log A ɛ D 3 a A For provig Lemma 4 of Chapter 4, let Fx := {fx,, fx R f F} as i 4 i Waiwright, the a Fx a = Dx Hece by applyig 3, [ ] log Fx + log E sup f F ɛ i fx i Dx The F beig polyomial discrimiatio of order ν implies Fx + ν, hece [ ] ν log + + log E sup ɛ i fx i Dx f F ν log + Dx

5.1 Review of Singular Value Decomposition (SVD)

5.1 Review of Singular Value Decomposition (SVD) MGMT 69000: Topics i High-dimesioal Data Aalysis Falll 06 Lecture 5: Spectral Clusterig: Overview (cotd) ad Aalysis Lecturer: Jiamig Xu Scribe: Adarsh Barik, Taotao He, September 3, 06 Outlie Review of

More information

Lecture 8: October 20, Applications of SVD: least squares approximation

Lecture 8: October 20, Applications of SVD: least squares approximation Mathematical Toolkit Autum 2016 Lecturer: Madhur Tulsiai Lecture 8: October 20, 2016 1 Applicatios of SVD: least squares approximatio We discuss aother applicatio of sigular value decompositio (SVD) of

More information

Lecture 3: August 31

Lecture 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 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

Homework Set #3 - Solutions

Homework Set #3 - Solutions EE 15 - Applicatios of Covex Optimizatio i Sigal Processig ad Commuicatios Dr. Adre Tkaceko JPL Third Term 11-1 Homework Set #3 - Solutios 1. a) Note that x is closer to x tha to x l i the Euclidea orm

More information

Probability 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 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 information

Math Solutions to homework 6

Math Solutions to homework 6 Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there

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

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

Geometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT

Geometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT OCTOBER 7, 2016 LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT Geometry of LS We ca thik of y ad the colums of X as members of the -dimesioal Euclidea space R Oe ca

More information

6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition

6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition 6. Kalma filter implemetatio for liear algebraic equatios. Karhue-Loeve decompositio 6.1. Solvable liear algebraic systems. Probabilistic iterpretatio. Let A be a quadratic matrix (ot obligatory osigular.

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

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)

LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum

More information

18.657: Mathematics of Machine Learning

18.657: Mathematics of Machine Learning 8.657: Mathematics of Machie Learig Lecturer: Philippe Rigollet Lecture 0 Scribe: Ade Forrow Oct. 3, 05 Recall the followig defiitios from last time: Defiitio: A fuctio K : X X R is called a positive symmetric

More information

Math 61CM - Solutions to homework 3

Math 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 information

Symmetric Matrices and Quadratic Forms

Symmetric Matrices and Quadratic Forms 7 Symmetric Matrices ad Quadratic Forms 7.1 DIAGONALIZAION OF SYMMERIC MARICES SYMMERIC MARIX A symmetric matrix is a matrix A such that. A = A Such a matrix is ecessarily square. Its mai diagoal etries

More information

arxiv: v1 [math.pr] 13 Oct 2011

arxiv: v1 [math.pr] 13 Oct 2011 A tail iequality for quadratic forms of subgaussia radom vectors Daiel Hsu, Sham M. Kakade,, ad Tog Zhag 3 arxiv:0.84v math.pr] 3 Oct 0 Microsoft Research New Eglad Departmet of Statistics, Wharto School,

More information

Algebra of Least Squares

Algebra of Least Squares October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal

More information

Solutions to home assignments (sketches)

Solutions to home assignments (sketches) Matematiska Istitutioe Peter Kumli 26th May 2004 TMA401 Fuctioal Aalysis MAN670 Applied Fuctioal Aalysis 4th quarter 2003/2004 All documet cocerig the course ca be foud o the course home page: http://www.math.chalmers.se/math/grudutb/cth/tma401/

More information

Lecture 7: Properties of Random Samples

Lecture 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 information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm

More information

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate

Supplementary 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 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

Maths /2014. CCP Maths 2. Reduction, projector,endomorphism of rank 1... Hadamard s inequality and some applications. Solution.

Maths /2014. CCP Maths 2. Reduction, projector,endomorphism of rank 1... Hadamard s inequality and some applications. Solution. CCP Maths 2 Reductio, projector,edomorphism of rak 1... Hadamard s iequality ad some applicatios Solutio Exercise 1. 1 A is a symmetric matrix so diagoalizable. 2 Diagoalizatio of A : A characteristic

More information

arxiv: v1 [math.pr] 4 Dec 2013

arxiv: v1 [math.pr] 4 Dec 2013 Squared-Norm Empirical Process i Baach Space arxiv:32005v [mathpr] 4 Dec 203 Vicet Q Vu Departmet of Statistics The Ohio State Uiversity Columbus, OH vqv@statosuedu Abstract Jig Lei Departmet of Statistics

More information

Math 510 Assignment 6 Due date: Nov. 26, 2012

Math 510 Assignment 6 Due date: Nov. 26, 2012 1 If A M is Hermitia, show that Math 510 Assigmet 6 Due date: Nov 6, 01 tr A rak (Atr (A with equality if ad oly if A = ap for some a R ad orthogoal projectio P M (ie P = P = P Solutio: Let A = A If A

More information

6. Uniform distribution mod 1

6. Uniform distribution mod 1 6. Uiform distributio mod 1 6.1 Uiform distributio ad Weyl s criterio Let x be a seuece of real umbers. We may decompose x as the sum of its iteger part [x ] = sup{m Z m x } (i.e. the largest iteger which

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

Rademacher Complexity

Rademacher 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 information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO 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 information

Singular Continuous Measures by Michael Pejic 5/14/10

Singular Continuous Measures by Michael Pejic 5/14/10 Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable

More information

Topics in Eigen-analysis

Topics in Eigen-analysis Topics i Eige-aalysis Li Zajiag 28 July 2014 Cotets 1 Termiology... 2 2 Some Basic Properties ad Results... 2 3 Eige-properties of Hermitia Matrices... 5 3.1 Basic Theorems... 5 3.2 Quadratic Forms & Noegative

More information

Math 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix

Math 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),

More information

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices

Random Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio

More information

Problem Set 2 Solutions

Problem 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 information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors 5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture 9: Pricipal Compoet Aalysis The text i black outlies mai ideas to retai from the lecture. The text i blue give a deeper uderstadig of how we derive or get

More information

Learning Theory: Lecture Notes

Learning 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 information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

(VII.A) Review of Orthogonality

(VII.A) Review of Orthogonality VII.A Review of Orthogoality At the begiig of our study of liear trasformatios i we briefly discussed projectios, rotatios ad projectios. I III.A, projectios were treated i the abstract ad without regard

More information

Supplemental Material: Proofs

Supplemental Material: Proofs Proof to Theorem Supplemetal Material: Proofs Proof. Let be the miimal umber of traiig items to esure a uique solutio θ. First cosider the case. It happes if ad oly if θ ad Rak(A) d, which is a special

More information

1 Review and Overview

1 Review and Overview CS9T/STATS3: Statistical Learig Theory Lecturer: Tegyu Ma Lecture #6 Scribe: Jay Whag ad Patrick Cho October 0, 08 Review ad Overview Recall i the last lecture that for ay family of scalar fuctios F, we

More information

Math 210A Homework 1

Math 210A Homework 1 Math 0A Homework Edward Burkard Exercise. a) State the defiitio of a aalytic fuctio. b) What are the relatioships betwee aalytic fuctios ad the Cauchy-Riema equatios? Solutio. a) A fuctio f : G C is called

More information

HOMEWORK I: PREREQUISITES FROM MATH 727

HOMEWORK I: PREREQUISITES FROM MATH 727 HOMEWORK I: PREREQUISITES FROM MATH 727 Questio. Let X, X 2,... be idepedet expoetial radom variables with mea µ. (a) Show that for Z +, we have EX µ!. (b) Show that almost surely, X + + X (c) Fid the

More information

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0. 40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig

More information

Homework 2. Show that if h is a bounded sesquilinear form on the Hilbert spaces X and Y, then h has the representation

Homework 2. Show that if h is a bounded sesquilinear form on the Hilbert spaces X and Y, then h has the representation omework 2 1 Let X ad Y be ilbert spaces over C The a sesquiliear form h o X Y is a mappig h : X Y C such that for all x 1, x 2, x X, y 1, y 2, y Y ad all scalars α, β C we have (a) h(x 1 + x 2, y) h(x

More information

Real Numbers R ) - LUB(B) may or may not belong to B. (Ex; B= { y: y = 1 x, - Note that A B LUB( A) LUB( B)

Real Numbers R ) - LUB(B) may or may not belong to B. (Ex; B= { y: y = 1 x, - Note that A B LUB( A) LUB( B) Real Numbers The least upper boud - Let B be ay subset of R B is bouded above if there is a k R such that x k for all x B - A real umber, k R is a uique least upper boud of B, ie k = LUB(B), if () k is

More information

Statistical and Mathematical Methods DS-GA 1002 December 8, Sample Final Problems Solutions

Statistical and Mathematical Methods DS-GA 1002 December 8, Sample Final Problems Solutions Statistical ad Mathematical Methods DS-GA 00 December 8, 05. Short questios Sample Fial Problems Solutios a. Ax b has a solutio if b is i the rage of A. The dimesio of the rage of A is because A has liearly-idepedet

More information

18.S096: Homework Problem Set 1 (revised)

18.S096: Homework Problem Set 1 (revised) 8.S096: Homework Problem Set (revised) Topics i Mathematics of Data Sciece (Fall 05) Afoso S. Badeira Due o October 6, 05 Exteded to: October 8, 05 This homework problem set is due o October 6, at the

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

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

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

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

More information

Stochastic Matrices in a Finite Field

Stochastic Matrices in a Finite Field Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices

More information

Brief Review of Functions of Several Variables

Brief Review of Functions of Several Variables Brief Review of Fuctios of Several Variables Differetiatio Differetiatio Recall, a fuctio f : R R is differetiable at x R if ( ) ( ) lim f x f x 0 exists df ( x) Whe this limit exists we call it or f(

More information

Modern Discrete Probability Spectral Techniques

Modern Discrete Probability Spectral Techniques Moder Discrete Probability VI - Spectral Techiques Backgroud Sébastie Roch UW Madiso Mathematics December 1, 2014 1 Review 2 3 4 Mixig time I Theorem (Covergece to statioarity) Cosider a fiite state space

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

Assignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.

Assignment 2 Solutions SOLUTION. ϕ 1  = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ. PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio

More information

A remark on p-summing norms of operators

A remark on p-summing norms of operators A remark o p-summig orms of operators Artem Zvavitch Abstract. I this paper we improve a result of W. B. Johso ad G. Schechtma by provig that the p-summig orm of ay operator with -dimesioal domai ca be

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

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate

Supplementary 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 information

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

Ma 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 information

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

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

More information

Matrix Algebra from a Statistician s Perspective BIOS 524/ Scalar multiple: ka

Matrix Algebra from a Statistician s Perspective BIOS 524/ Scalar multiple: ka Matrix Algebra from a Statisticia s Perspective BIOS 524/546. Matrices... Basic Termiology a a A = ( aij ) deotes a m matrix of values. Whe =, this is a am a m colum vector. Whe m= this is a row vector..2.

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Distributional Similarity Models (cont.)

Distributional Similarity Models (cont.) Distributioal Similarity Models (cot.) Regia Barzilay EECS Departmet MIT October 19, 2004 Sematic Similarity Vector Space Model Similarity Measures cosie Euclidea distace... Clusterig k-meas hierarchical

More information

5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define

5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define 5. Matrix expoetials ad Vo Neuma s theorem 5.1. The matrix expoetial. For a matrix X we defie e X = exp X = I + X + X2 2! +... = 0 X!. We assume that the etries are complex so that exp is well defied o

More information

NBHM QUESTION 2007 Section 1 : Algebra Q1. Let G be a group of order n. Which of the following conditions imply that G is abelian?

NBHM QUESTION 2007 Section 1 : Algebra Q1. Let G be a group of order n. Which of the following conditions imply that G is abelian? NBHM QUESTION 7 NBHM QUESTION 7 NBHM QUESTION 7 Sectio : Algebra Q Let G be a group of order Which of the followig coditios imply that G is abelia? 5 36 Q Which of the followig subgroups are ecesarily

More information

Asymptotic Results for the Linear Regression Model

Asymptotic Results for the Linear Regression Model Asymptotic Results for the Liear Regressio Model C. Fli November 29, 2000 1. Asymptotic Results uder Classical Assumptios The followig results apply to the liear regressio model y = Xβ + ε, where X is

More information

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y Questio (a) A square matrix A= A is called positive defiite if the quadratic form waw > 0 for every o-zero vector w [Note: Here (.) deotes the traspose of a matrix or a vector]. Let 0 A = 0 = show that:

More information

Distributional Similarity Models (cont.)

Distributional Similarity Models (cont.) Sematic Similarity Vector Space Model Similarity Measures cosie Euclidea distace... Clusterig k-meas hierarchical Last Time EM Clusterig Soft versio of K-meas clusterig Iput: m dimesioal objects X = {

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

Lecture 12: November 13, 2018

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

More information

MATH 472 / SPRING 2013 ASSIGNMENT 2: DUE FEBRUARY 4 FINALIZED

MATH 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 information

Review 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 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 information

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of

More information

Notes for Lecture 11

Notes for Lecture 11 U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with

More information

ECE534, Spring 2018: Final Exam

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 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

1+x 1 + α+x. x = 2(α x2 ) 1+x

1+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 information

OFF-DIAGONAL MULTILINEAR INTERPOLATION BETWEEN ADJOINT OPERATORS

OFF-DIAGONAL MULTILINEAR INTERPOLATION BETWEEN ADJOINT OPERATORS OFF-DIAGONAL MULTILINEAR INTERPOLATION BETWEEN ADJOINT OPERATORS LOUKAS GRAFAKOS AND RICHARD G. LYNCH 2 Abstract. We exted a theorem by Grafakos ad Tao [5] o multiliear iterpolatio betwee adjoit operators

More information

Where do eigenvalues/eigenvectors/eigenfunctions come from, and why are they important anyway?

Where do eigenvalues/eigenvectors/eigenfunctions come from, and why are they important anyway? Where do eigevalues/eigevectors/eigeuctios come rom, ad why are they importat ayway? I. Bacgroud (rom Ordiary Dieretial Equatios} Cosider the simplest example o a harmoic oscillator (thi o a vibratig strig)

More information

Mathematics 170B Selected HW Solutions.

Mathematics 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 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

This section is optional.

This 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 information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It 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 information

Lecture 8: Convergence of transformations and law of large numbers

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

More information

Glivenko-Cantelli Classes

Glivenko-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 information

17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15

17. 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 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

Notes 27 : Brownian motion: path properties

Notes 27 : Brownian motion: path properties Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X

More information

STAT Homework 1 - Solutions

STAT Homework 1 - Solutions STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better

More information

The central limit theorem for Student s distribution. Problem Karim M. Abadir and Jan R. Magnus. Econometric Theory, 19, 1195 (2003)

The central limit theorem for Student s distribution. Problem Karim M. Abadir and Jan R. Magnus. Econometric Theory, 19, 1195 (2003) The cetral limit theorem for Studet s distributio Problem 03.6.1 Karim M. Abadir ad Ja R. Magus Ecoometric Theory, 19, 1195 (003) Z Ecoometric Theory, 19, 003, 1195 1198+ Prited i the Uited States of America+

More information

CHAPTER 5. Theory and Solution Using Matrix Techniques

CHAPTER 5. Theory and Solution Using Matrix Techniques A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL

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

Lecture 19. sup y 1,..., yn B d n

Lecture 19. sup y 1,..., yn B d n STAT 06A: Polyomials of adom Variables Lecture date: Nov Lecture 19 Grothedieck s Iequality Scribe: Be Hough The scribes are based o a guest lecture by ya O Doell. I this lecture we prove Grothedieck s

More information

Math 220B Final Exam Solutions March 18, 2002

Math 220B Final Exam Solutions March 18, 2002 Math 0B Fial Exam Solutios March 18, 00 1. (1 poits) (a) (6 poits) Fid the Gree s fuctio for the tilted half-plae {(x 1, x ) R : x 1 + x > 0}. For x (x 1, x ), y (y 1, y ), express your Gree s fuctio G(x,

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Lecture 12: September 27

Lecture 12: September 27 36-705: Itermediate Statistics Fall 207 Lecturer: Siva Balakrisha Lecture 2: September 27 Today we will discuss sufficiecy i more detail ad the begi to discuss some geeral strategies for costructig estimators.

More information

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

M17 MAT25-21 HOMEWORK 5 SOLUTIONS M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series

More information