Vapnik Chervonenkis classes

Size: px
Start display at page:

Download "Vapnik Chervonenkis classes"

Transcription

1 Vapk Chervoeks classes Maxm Ragsky September 23, 2014 A key result o the ERM algorthm, proved the prevous lecture, was that P( f ) L (F ) + 4ER (F (Z )) + 2log(1/δ) wth probablty at least 1 δ. The quatty R (F (Z )) appearg o the rght-had sde of the above boud s the Rademacher average of the radom set F (Z ) = ( f (Z 1 ),..., f (Z ) ) : f F }, ofte referred to as the projecto of F oto the sample Z. From ths we see that a suffcet codto for the ERM algorthm to produce ear-optmal hypotheses wth hgh probablty s that the expected Rademacher average ER (F (Z )) = Õ(1/ ), where the Õ( ) otato dcates that the boud holds up to polylogarthmc factors,.e., there exsts some postve polyomal fucto p( ) such that ER (F (Z )) O p(log ). Hece, a lot of effort statstcal learg theory s devoted to obtag tght bouds o ER (F (Z )). Oe way to guaratee a Õ(1/ ) boud o ER s f the effectve sze of the radom set F (Z ) s fte ad grows polyomally wth. The the Fte Class Lemma wll tell us that R (F (Z )) = O log. I geeral, a reasoable oto of effectve sze s captured by varous coverg umbers (see, e.g., the lecture otes by Medelso [Me03] or the recet moograph by Talagrad [Tal05] for detaled expostos of the relevat theory). I ths lecture, we wll look at a smple combatoral oto of effectve sze for classes of bary-valued fuctos. Ths partcular oto has orgated wth the work of Vapk ad Chervoeks [VC71], ad was hstorcally the frst such oto to be troduced to statstcal learg theory. It s ow kow as the Vapk Chervoeks (or VC) dmeso. 1 Vapk Chervoeks dmeso: defto Defto 1. Let C be a class of (measurable) subsets of some space Z. We say that a fte set S = z 1,..., z } Z s shattered by C f for every subset S S there exsts some C C such that S = S C. 1

2 I other words, S = z 1,..., z } s shattered by C f for ay bary -tuple b = (b 1,...,b ) 0,1} there exsts some C C such that 1z1 C },...,1 z C } = b or, equvaletly, f } 1z1 C },...,1 z C } : C C = 0,1}, where we cosder ay two C 1,C 2 C as equvalet f 1 z C 1 } = 1 z C 2 } for all 1. Defto 2. The Vapk Chervoeks dmeso (or the VC dmeso) of C s V (C ) max N : S Z such that S = ad S s shattered by C }. If V (C ) <, we say that C s a VC class (of sets). We ca express the VC dmeso terms of shatter coeffcets of C : Let S (C ) sup S Z, S = S C : C C } deote the th shatter coeffcet of C, where for each fxed S we cosder ay two C 1,C 2 C as equvalet f S C 1 = S C 2. The V (C ) = max N : S (C ) = 2 }. The VC dmeso V (C ) may be fte, but t s always well-defed. Ths follows from the followg lemma: Lemma 1. If S (C ) < 2, the S m (C ) < 2 m for all m >. Proof. Suppose S (C ) < 2. Cosder ay m >. We wll suppose that S m (C ) = 2 m ad derve a cotradcto. By our assumpto that S m (F ) = 2 m, there exsts S = z 1,..., z m } Z m, such that for every bary -tuple b = (b 1,...,b ) we ca fd some C C satsfyg 1z1 C },...,1 z C }, 1 z+1 C },...,1 zm C } = (b1,...,b,0,...,0). (1) From (1) t mmedately follows that 1z1 C },...,1 z C } = (b1,...,b ). (2) Sce b = (b 1,...,b ) was arbtrary, we see from (2) that S (C ) = 2. Ths cotradcts our assumpto that S (C ) < 2, so we coclude that S m (C ) < 2 m wheever m > ad S (F ) < 2. There s a oe-to-oe correspodece betwee bary-valued fuctos f : Z 0,1} ad subsets of Z: f : Z 0,1} let C f z : f (z) = 1} C Z let f C 1 C }. Thus, we ca exted the cocept of shatterg, as well as the defto of the VC dmeso, to ay class F of fuctos f : Z 0,1}: 2

3 Defto 3. Let F be a class of fuctos f : Z 0,1}. We say that a fte set S = z 1,..., z } Z s shattered by F f t s shattered by the class C F 1 f =1} : f F }, where 1 f =1} s the dcator fucto of the set C f z Z : f (z) = 1}. The th shatter coeffcet of F s S (F ) = S (C F ), ad the VC dmeso of F s defed as V (F ) = V (C F ). I lght of these deftos, we ca equvaletly speak of the VC dmeso of a class of sets or a class of bary-valued fuctos. 2 Examples of Vapk Chervoeks classes 2.1 Sem-fte tervals Let Z = R ad take C to be the class of all tervals of the form (, t] as t vares over R. We wll prove that V (C ) = 1. I vew of Lemma 1, t suffces to show that (1) ay oe-pot set S = a} s shattered by C, ad (2) o two-pot set S = a,b} s shattered by C. Gve S = a}, choose ay t 1 < a ad t 2 > a. The (, t 1 ] S = ad (, t 2 ] S = S. Thus, S s shattered by C. Ths holds for every oe-pot set S, ad therefore we have proved (1). To prove (2), let S = a,b} ad suppose, wthout loss of geeralty, that a < b. The there exsts o t R such that (, t] S = b}. Ths follows from the fact that f b (, t] S, the t b. Sce b > a, we must have t > a, so that a (, t] S as well. Sce a ad b are arbtrary, we see that o two-pot subset of R ca be shattered by C. 2.2 Closed tervals Aga, let Z = R ad take C to be the class of all tervals of the form [s, t] for all s, t R. The V (C ) = 2. To see ths, we wll show that (1) ay two pot set S = a,b} ca be shattered by C ad that (2) o threepot set S = a,b,c} ca be shattered by C. For (1), let S = a,b} ad suppose, wthout loss of geeralty, that a < b. Choose four pots t 1, t 2, t 3, t 4 R such that t 1 < t 2 < a < t 3 < b < t 4. There are four subsets of S:, a}, b}, ad a,b} = S. The [t 1, t 2 ] S =, [t 2, t 3 ] S = a}, [t 3, t 4 ] S = b}, [t 1, t 4 ] S = S. Hece, S s shattered by C. Ths holds for every two-pot set R, whch proves (1). To prove (2), let S = a,b,c} be a arbtrary three-pot set wth a < b < c. The the tersecto of ay [t 1, t 2 ] C wth S cotag a ad c must ecessarly cota b as well. Ths shows that o three-pot set ca be shattered by C, so by Lemma 1 we coclude that V (C ) = Closed halfspaces Let Z = R 2, ad let C cosst of all closed halfspaces,.e., sets of the form z = (z 1, z 2 ) R 2 : w 1 z 1 + w 2 z 2 b} for all choces of w 1, w 2,b R such that (w 1, w 2 ) (0,0). The V (C ) = 3. 3

4 Fgure 1: Impossblty of shatterg a affely depedet four-pot set R 2 by closed halfspaces. To see that S 3 (C ) = 2 3 = 8, t suffces to cosder ay set S = z 1, z 2, z 3 } of three o-collear pots. The t s ot hard to see that for ay S S t s possble to choose a closed halfspace C C that would cota S, but ot S. To see that S 4 (C ) < 2 4, we must look at all four-pot sets S = z 1, z 2, z 3, z 4 }. There are two cases to cosder: 1. Oe pot S les the covex hull of the other three. Wthout loss of geeralty, let s suppose that z 1 cov(s ) wth S = z 2, z 3, z 4 }. The there s o C C such that C S = S. The reaso for ths s that every C C s a covex set. Hece, f S C, the ay pot cov(s ) s cotaed C as well. 2. No pot S s the covex hull of the remag pots. Ths case, whe S s a affely depedet set, s show Fgure 1. Let us partto S to two dsjot subsets, S 1 ad S 2, each cosstg of opposte pots. I the fgure, S 1 = z 1, z 3 } ad S 2 = z 2, z 4 }. The t s easy to see that there s o halfspace C whose boudary could separate S 1 from ts complemet S 2. Ths s, fact, the ()famous XOR couterexample" of Msky ad Papert [MP69], whch has demostrated the mpossblty of uversal cocept learg by oe-layer perceptros. Sce ay four-pot set R 2 falls uder oe of these two cases, we have show that o such set ca be shattered by C. Hece, V (C ) = 3. More geerally, f Z = R d ad C s the class of all closed halfspaces z R d : } d w j z j b for all w = (w 1,..., w d ) R d such that at least oe of the w j s s ozero ad all b R, the V (C ) = d + 1 [WD81]; we wll see a proof of ths fact shortly. 2.4 Axs-parallel rectagles Let Z = R 2, ad let C cosst of all axs-parallel rectagles,.e., sets of the form C = [a 1,b 1 ] [a 2,b 2 ] for all a 1,b 1, a 2,b 2 R. The V (C ) = 4. 4

5 Fgure 2: Impossblty of shatterg a fve-pot set by axs-parallel rectagles. Frst we exhbt a four-pot set S = z 1, z 2, z 3, z 4 } that s shattered by C. It suffces to take z 1 = ( 2, 1), z 2 = (1, 2), z 3 = (2,1), z 4 = ( 1,2). To show that o fve-pot set s shattered by C, cosder a arbtrary S = z 1, z 2, z 3, z 4, z 5 }. Of these, pck ay oe pot wth the smallest frst coordate ad ay oe pot wth the largest frst coordate, ad lkewse for the secod coordate (refer to Fgure 2), for a total of at most four. Let S deote the set cosstg of these pots; Fgure 2, S = z 1, z 2, z 3, z 4 }. The t s easy to see that ay C C that cotas the pots S must cota all the pots S\S as well. Hece, o fve-pot set R 2 ca be shattered by C, so V (C ) = 5. The same argumet also works for axs-parallel rectagles R d,.e., all sets of the form C = [a 1,b 1 ] [a 2,b 2 ]... [a d,b d ], leadg to the cocluso that the VC dmeso of the set of all axs-parallel rectagles R d s equal to 2d. 2.5 Sets determed by fte-dmesoal fucto spaces The followg result s due to Dudley [Dud78]. Let Z be arbtrary, ad let G be a m-dmesoal lear space of fuctos g : Z R, whch meas that each g G has a uque represetato of the form g = m c j ψ j, where ψ 1,...,ψ m : Z R form a fxed learly depedet set ad c 1,...,c m are real coeffcets. Cosder the class } C = z Z : g (z) 0} : g G. The V (C ) m. To prove ths, we eed to show that o set of m + 1 pots Z ca be shattered by C. To that ed, let us fx m + 1 arbtrary pots z 1,..., z m+1 Z ad cosder the mappg L : G R m+1 defed by L(g ) ( g (z 1 ),..., g (z m+1 ) ). It s easy to see that because G s a lear space, L s a lear mappg,.e., for ay g 1, g 2 G ad ay c 1,c 2 R we have L(c 1 g 1 +c 2 g 2 ) = c 1 L(g 1 )+c 2 L(g 2 ). Sce dmg = m, the mage of G uder L,.e., the set L(G ) = (g (z 1 ),..., g (z m+1 )) R m+1 : g G }, 5

6 s a lear subspace of R m+1 of dmeso at most m. Ths meas that there exsts some ozero vector v = (v 1,..., v m+1 ) R m+1 orthogoal to L(G ),.e., for every g G v 1 g (z 1 ) v m+1 g (z m+1 ) = 0. (3) Wthout loss of geeralty, we may assume that at least oe compoet of v s strctly egatve (otherwse we ca take v stead of v ad stll get (3)). Hece, we ca rearrage the equalty (3) as v g (z ) = v g (z ), g G. (4) :v 0 :v <0 Now let us suppose that S m+1 (C ) = 2 m+1 ad derve a cotradcto. Cosder a bary (m + 1)-tuple b = (b 1,...,b m+1 ) 0,1} m+1, where b j = 1 f ad oly f v j 0, ad 0 otherwse. Sce we assumed that S m+1 (C ) = 2 m+1, there exsts some g G such that 1g (z1 ) 0},...,1 g (zm+1) 0} = b. By our defto of b, ths meas that the left-had sde of (4) s oegatve, whle the rght-had sde s egatve, whch s a cotradcto. Hece, S m+1 (C ) < 2 m+1, so V (C ) m. Ths result ca be used to boud the VC dmeso of may classes of sets: Let C be the class of all closed halfspaces R d. The ay C C ca be represeted the form C = z : g (z) 0} for g (z) = w, z b wth some ozero w R d ad b R. The set G of all such affe fuctos o R d s a lear space of dmeso d +1, so by the above result we have V (C ) d +1. I fact, we kow that ths holds wth equalty [WD81]. Ths ca also be see from the followg result, due to Cover [Cov65]: Let G be the lear space of fuctos spaed by fuctos ψ 1,...,ψ m, ad let z 1,..., z } Z be such that the vectors Ψ(z ) = (ψ 1 (z ),...,ψ m (z )),1, form a learly depedet set. The for the class of sets C = z : g (z) 0} : z Z} we have C z 1,..., z } : C C = m 1 =0 1. The codtos eeded for Cover s result are see to hold for dcators of halfspaces, so lettg = m = d + 1 we see that S d (C ) = d =0 ( d ) = 2 d. Hece, V (C ) = d + 1. Let C be the class of all closed balls R d,.e., sets of the form C = z R d : z x 2 r 2} where x R d s the ceter of C ad r R + s ts radus. The we ca wrte C = z : g (z) 0}, where g (z) = r 2 z x 2 = r 2 Expadg the secod expresso for g (5), we get d z j x j 2. (5) d d d g (z) = r 2 x 2 j + 2 x j z j z 2 j, whch ca be wrtte the form g (z) = d+2 k=1 c kψ k (z), where ψ 1 (z) = 1, ψ k (z) = z k for k = 2,...,d + 1, ad ψ d+2 = d z2 j. It ca be show that the fuctos ψ k} d+2 are learly depedet. Hece, k=1 V (C ) d + 2. Ths boud, however, s ot tght; as show by Dudley [Dud79], the class of closed balls R d has VC dmeso d

7 2.6 VC dmeso vs. umber of parameters Lookg back at all these examples, oe may get the mpresso that the VC dmeso of a set of baryvalued fuctos s just the umber of parameters. Ths s ot the case. Cosder the followg oeparameter famly of fuctos: g θ (z) s(θz), θ R. However, the class of sets } C = z R : g θ (z) 0} : θ R has fte VC dmeso. Ideed, for ay, ay collecto of umbers z 1,..., z R, ad ay bary strg b 0,1}, oe ca always fd some θ R such that sg(s(θz )) = +1, f b = 1 1, f b = 0. 3 Growth of shatter coeffcets: the Sauer Shelah lemma The mportace of VC classes learg theory arses from the fact that, as teds to fty, the fracto of subsets of ay z 1,..., z } Z that are shattered by a gve VC class C teds to zero. We wll prove ths fact ths secto by dervg a sharp boud o the shatter coeffcets S (C ) of a VC class C. Ths boud have bee (re)dscovered at least three tmes, frst a weak form by Vapk ad Chervoeks [VC71] 1971, the depedetly ad dfferet cotexts by Sauer [Sau72] ad Shelah [She72] I strct accordace wth Stgler s law of epoymy 1, t s kow the statstcal learg lterature as the Sauer Shelah lemma. Before we state ad prove ths result, we wll collect some prelmares ad set up some otato. Gve tegers,d 1, let d, f > d φ(,d) =0 2, f d If we adopt the coveto that ( ) = 0 for >, we ca wrte φ(,d) = d for all,d 1. We wll fd the followg recursve relato useful: =0 Lemma 2. φ(,d) = φ( 1,d) + φ( 1,d 1). Proof. We have 1 1 ( 1)! + = 1 ( 1)!( )! + ( 1)!!( 1)!. 1 No scetfc dscovery s amed after ts orgal dscoverer" ( s_law_of_epoymy) 7

8 Multplyg both sdes by!( )!, we obta [ ] 1 1!( )! + = ( 1)! + ( )( 1)! =! 1 Hece, 1 1! + = 1!( )! =. (6) Usg the defto of φ(,d), as well as (6), we get ad the lemma s proved. Now for the actual result: d d d 1 d 1 φ(,d) = = 1 + = =0 =1 =1 =1 1 }}}} =φ( 1,d) =φ( 1,d 1) Theorem 1 (Sauer Shelah lemma). Let C be a class of subsets of some space Z wth V (C ) = d <. The for all, S (C ) φ(,d). (7) Proof. There are several dfferet proofs the lterature; we wll use a ductve argumet followg Blumer et al. [BEHW89]. We ca assume, wthout loss of geeralty, that > d, for otherwse S (C ) = 2 = φ(,d). For a arbtrary fte set S Z, let S(S,C ) S C : C C }, where, as before, we cout oly the dstct sets of the form S C. By defto, S (C ) = sup S: S = S(S,C ). Thus, t suffces the prove the followg: For ay S Z wth S = > d, S(S,C ) φ(,d). For the purpose of computg S(S,C ), ay two C 1,C 2 C such that S C 1 = S C 2 are deemed equvalet. Hece, let A A S : A = S C for some C C }. The we may wrte S(S,C ) = S C : C C } = A S : A = S C for some C C } = A. Moreover, t s easy to see that V (A ) V (C ) = d. Thus, the desred result s equvalet to sayg that f A s a collecto of subsets of a -elemet set S (whch we may, wthout loss of geeralty, take to be [] 1,...,}) wth V (A ) d <, the A φ(,d). We wll prove ths statemet by double ducto o ad d. Frst of all, the statemet (7) holds for all 1 ad d = 0. Ideed, f V (A ) = 0, the A = 1 2. Now assume that (7) holds for all ad all A wth V (A ) d 1, ad for all tegers up to 1 ad all A wth V (A ) d. Now let S = [], ad let A be a collecto of subsets of [] wth V (A ) = d <. We wll show that A φ(, d). 8

9 To prove ths clam, let us choose a arbtrary S ad defe A \ A\ } : A A } A A A : A, A } A } Observe that both A \ ad A are classes of subsets of S\ }. Moreover, sce A ad A } map to the same elemet of A \, whle A s the umber of pars of sets A that map to the same set A \, we have A = A \ + A. (8) Sce A \ A, we have V (A \ ) V (A ) d. Also, every set A \ s a subset of S\ }, whch has cardalty 1. Therefore, by the ductve hypothess A \ φ( 1,d). Next, we show that V (A ) d 1. Suppose, to the cotrary, that V (A ) = d. The there must exst some T S\ } wth T = d that s shattered by A. But the T } s shattered by A. To see ths, gve ay T T choose some A A such that T A = T (ths s possble sce T s shattered by A ). But the A } A (by defto of A ), ad (T }) (A }) = (T A) } = T }. Sce ths s possble for a arbtrary T T, we coclude that T } s shattered by A. Now, sce T S\ }, we must have T, so T } = T +1 = d +1, whch meas that there exsts a (d +1)-elemet subset of S = [] that s shattered by A. But ths cotradcts our assumpto that V (A ) d. Hece, V (A ) d 1. Sce A s a collecto of subsets of S\ }, we must have A φ( 1,d 1) by the ductve hypothess. Hece, from (8) ad from Lemma 2 we have A = A \ + A φ( 1,d) + φ( 1,d 1) = φ(,d). Ths completes the ducto argumet ad proves (7). Corollary 1. If C s a collecto of sets wth V (C ) d <, the Moreover, f d, the where e s the base of the atural logarthm. S (C ) ( + 1) d. ( e S (C ) d ) d, Proof. For the frst boud, wrte d d! d φ(,d) = =!( )!! =0 =1 =1 d d! d!(d )! = d = ( + 1) d, =0 =0 where the last step uses the bomal theorem. O the other had, f d/ 1, the d d d d d d d d ( φ(,d) = = 1 + d ) e d, =0 =1 where we aga used the bomal theorem. Dvdg both sdes by (d/) d, we get the secod boud. =1 9

10 Let C be a VC class of subsets of some space Z. From the above corollary we see that S (C ) ( + 1) V (C ) lm sup 2 lm 2 = 0. I other words, as becomes large, the fracto of subsets of a arbtrary -elemet set z 1,..., z } Z that are shattered by C becomes eglgble. Moreover, combg the bouds of the corollary wth the Fte Class Lemma for Rademacher averages, we get the followg: Theorem 2. Let F be a VC class of bary-valued fuctos f : Z 0,1} o some space Z. Let Z be a..d. sample of sze draw accordg to a arbtrary probablty dstrbuto P P (Z). The ER (F (Z V (F )log( + 1) )) 2. A more refed chag techque [Dud78] ca be used to remove the logarthm the above boud: Theorem 3. There exsts a absolute costat C > 0, such that uder the codtos of the precedg theorem ER (F (Z V (F ) )) C. Refereces [BEHW89] A. Blumer, A. Ehrefeucht, D. Haussler, ad M. K. Warmuth. Learablty ad the Vapk Chervoeks dmeso. Joural of the ACM, 36(4): , [Cov65] T. M. Cover. Geometrcal ad statstcal propertes of systems of lear equaltes wth applcatos patter recogto. IEEE Trasactos o Electroc Computers, 14: , [Dud78] R. M. Dudley. Cetral lmt theorems for emprcal measures. Aals of Probablty, 6: , [Dud79] [Me03] R. M. Dudley. Balls R k do ot cut all subsets of k + 2 pots. Advaces Mathematcs, 31(3): , S. Medelso. A few otes o statstcal learg theory. I S. Medelso ad A. J. Smola, edtors, Advaced Lectures Mache Learg, volume 2600 of Lecture Notes Computer Scece, pages [MP69] M. Msky ad S. Papert. Perceptros: A Itroducto to Computatoal Geometry. MIT Press, [Sau72] N. Sauer. O the desty of famles of sets. Joural of Combatoral Theory, Seres A, 13: , [She72] S. Shelah. A combatoral problem: stablty ad order for models ad theores fty laguages. Pacfc Joural of Mathematcs, 41: ,

11 [Tal05] [VC71] [WD81] M. Talagrad. Geerc Chag: Upper ad Lower Bouds of Stochastc Processes. Sprger, V. N. Vapk ad A. Ya. Chervoeks. O the uform covergece of relatve frequeces of evets to ther probabltes. Theory of Probablty ad Its Applcatos, 16: , R. S. Wecour ad R. M. Dudley. Some specal Vapk Chervoeks classes. Dscrete Mathematcs, 33: ,

Chapter 5 Properties of a Random Sample

Chapter 5 Properties of a Random Sample Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample

More information

Introduction to local (nonparametric) density estimation. methods

Introduction to local (nonparametric) density estimation. methods Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest

More information

ρ < 1 be five real numbers. The

ρ < 1 be five real numbers. The Lecture o BST 63: Statstcal Theory I Ku Zhag, /0/006 Revew for the prevous lecture Deftos: covarace, correlato Examples: How to calculate covarace ad correlato Theorems: propertes of correlato ad covarace

More information

The Mathematical Appendix

The Mathematical Appendix The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.

More information

1 Onto functions and bijections Applications to Counting

1 Onto functions and bijections Applications to Counting 1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of

More information

Chapter 4 Multiple Random Variables

Chapter 4 Multiple Random Variables Revew for the prevous lecture: Theorems ad Examples: How to obta the pmf (pdf) of U = g (, Y) ad V = g (, Y) Chapter 4 Multple Radom Varables Chapter 44 Herarchcal Models ad Mxture Dstrbutos Examples:

More information

18.413: Error Correcting Codes Lab March 2, Lecture 8

18.413: Error Correcting Codes Lab March 2, Lecture 8 18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse

More information

Introduction to Probability

Introduction to Probability Itroducto to Probablty Nader H Bshouty Departmet of Computer Scece Techo 32000 Israel e-mal: bshouty@cstechoacl 1 Combatorcs 11 Smple Rules I Combatorcs The rule of sum says that the umber of ways to choose

More information

MATH 247/Winter Notes on the adjoint and on normal operators.

MATH 247/Winter Notes on the adjoint and on normal operators. MATH 47/Wter 00 Notes o the adjot ad o ormal operators I these otes, V s a fte dmesoal er product space over, wth gve er * product uv, T, S, T, are lear operators o V U, W are subspaces of V Whe we say

More information

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture) CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.

More information

Non-uniform Turán-type problems

Non-uniform Turán-type problems Joural of Combatoral Theory, Seres A 111 2005 106 110 wwwelsevercomlocatecta No-uform Turá-type problems DhruvMubay 1, Y Zhao 2 Departmet of Mathematcs, Statstcs, ad Computer Scece, Uversty of Illos at

More information

CHAPTER VI Statistical Analysis of Experimental Data

CHAPTER VI Statistical Analysis of Experimental Data Chapter VI Statstcal Aalyss of Expermetal Data CHAPTER VI Statstcal Aalyss of Expermetal Data Measuremets do ot lead to a uque value. Ths s a result of the multtude of errors (maly radom errors) that ca

More information

MA 524 Homework 6 Solutions

MA 524 Homework 6 Solutions MA 524 Homework 6 Solutos. Sce S(, s the umber of ways to partto [] to k oempty blocks, ad c(, s the umber of ways to partto to k oempty blocks ad also the arrage each block to a cycle, we must have S(,

More information

X ε ) = 0, or equivalently, lim

X ε ) = 0, or equivalently, lim Revew for the prevous lecture Cocepts: order statstcs Theorems: Dstrbutos of order statstcs Examples: How to get the dstrbuto of order statstcs Chapter 5 Propertes of a Radom Sample Secto 55 Covergece

More information

Lecture 3 Probability review (cont d)

Lecture 3 Probability review (cont d) STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto

More information

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Postpoed exam: ECON430 Statstcs Date of exam: Jauary 0, 0 Tme for exam: 09:00 a.m. :00 oo The problem set covers 5 pages Resources allowed: All wrtte ad prted

More information

PTAS for Bin-Packing

PTAS for Bin-Packing CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,

More information

Summary of the lecture in Biostatistics

Summary of the lecture in Biostatistics Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the

More information

Lecture 9: Tolerant Testing

Lecture 9: Tolerant Testing Lecture 9: Tolerat Testg Dael Kae Scrbe: Sakeerth Rao Aprl 4, 07 Abstract I ths lecture we prove a quas lear lower boud o the umber of samples eeded to do tolerat testg for L dstace. Tolerat Testg We have

More information

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights CIS 800/002 The Algorthmc Foudatos of Data Prvacy October 13, 2011 Lecturer: Aaro Roth Lecture 9 Scrbe: Aaro Roth Database Update Algorthms: Multplcatve Weghts We ll recall aga) some deftos from last tme:

More information

Complete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables

Complete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables Joural of Sceces, Islamc Republc of Ira 8(4): -6 (007) Uversty of Tehra, ISSN 06-04 http://sceces.ut.ac.r Complete Covergece ad Some Maxmal Iequaltes for Weghted Sums of Radom Varables M. Am,,* H.R. Nl

More information

Rademacher Complexity. Examples

Rademacher Complexity. Examples Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed

More information

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever. 9.4 Sequeces ad Seres Pre Calculus 9.4 SEQUENCES AND SERIES Learg Targets:. Wrte the terms of a explctly defed sequece.. Wrte the terms of a recursvely defed sequece. 3. Determe whether a sequece s arthmetc,

More information

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model Lecture 7. Cofdece Itervals ad Hypothess Tests the Smple CLR Model I lecture 6 we troduced the Classcal Lear Regresso (CLR) model that s the radom expermet of whch the data Y,,, K, are the outcomes. The

More information

A tighter lower bound on the circuit size of the hardest Boolean functions

A tighter lower bound on the circuit size of the hardest Boolean functions Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the

More information

Q-analogue of a Linear Transformation Preserving Log-concavity

Q-analogue of a Linear Transformation Preserving Log-concavity Iteratoal Joural of Algebra, Vol. 1, 2007, o. 2, 87-94 Q-aalogue of a Lear Trasformato Preservg Log-cocavty Daozhog Luo Departmet of Mathematcs, Huaqao Uversty Quazhou, Fua 362021, P. R. Cha ldzblue@163.com

More information

Dimensionality Reduction and Learning

Dimensionality Reduction and Learning CMSC 35900 (Sprg 009) Large Scale Learg Lecture: 3 Dmesoalty Reducto ad Learg Istructors: Sham Kakade ad Greg Shakharovch L Supervsed Methods ad Dmesoalty Reducto The theme of these two lectures s that

More information

PROJECTION PROBLEM FOR REGULAR POLYGONS

PROJECTION PROBLEM FOR REGULAR POLYGONS Joural of Mathematcal Sceces: Advaces ad Applcatos Volume, Number, 008, Pages 95-50 PROJECTION PROBLEM FOR REGULAR POLYGONS College of Scece Bejg Forestry Uversty Bejg 0008 P. R. Cha e-mal: sl@bjfu.edu.c

More information

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings Hdaw Publshg Corporato Iteratoal Joural of Mathematcs ad Mathematcal Sceces Volume 009, Artcle ID 391839, 9 pages do:10.1155/009/391839 Research Artcle A New Iteratve Method for Commo Fxed Pots of a Fte

More information

LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX

LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 2006, #A12 LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX Hacèe Belbachr 1 USTHB, Departmet of Mathematcs, POBox 32 El Ala, 16111,

More information

Lebesgue Measure of Generalized Cantor Set

Lebesgue Measure of Generalized Cantor Set Aals of Pure ad Appled Mathematcs Vol., No.,, -8 ISSN: -8X P), -888ole) Publshed o 8 May www.researchmathsc.org Aals of Lebesgue Measure of Geeralzed ator Set Md. Jahurul Islam ad Md. Shahdul Islam Departmet

More information

Ideal multigrades with trigonometric coefficients

Ideal multigrades with trigonometric coefficients Ideal multgrades wth trgoometrc coeffcets Zarathustra Brady December 13, 010 1 The problem A (, k) multgrade s defed as a par of dstct sets of tegers such that (a 1,..., a ; b 1,..., b ) a j = =1 for all

More information

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution: Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed

More information

Strong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity

Strong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity BULLETIN of the MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Bull. Malays. Math. Sc. Soc. () 7 (004), 5 35 Strog Covergece of Weghted Averaged Appromats of Asymptotcally Noepasve Mappgs Baach Spaces wthout

More information

Mu Sequences/Series Solutions National Convention 2014

Mu Sequences/Series Solutions National Convention 2014 Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed

More information

Special Instructions / Useful Data

Special Instructions / Useful Data JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth

More information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package

More information

ENGI 4421 Joint Probability Distributions Page Joint Probability Distributions [Navidi sections 2.5 and 2.6; Devore sections

ENGI 4421 Joint Probability Distributions Page Joint Probability Distributions [Navidi sections 2.5 and 2.6; Devore sections ENGI 441 Jot Probablty Dstrbutos Page 7-01 Jot Probablty Dstrbutos [Navd sectos.5 ad.6; Devore sectos 5.1-5.] The jot probablty mass fucto of two dscrete radom quattes, s, P ad p x y x y The margal probablty

More information

Bayes (Naïve or not) Classifiers: Generative Approach

Bayes (Naïve or not) Classifiers: Generative Approach Logstc regresso Bayes (Naïve or ot) Classfers: Geeratve Approach What do we mea by Geeratve approach: Lear p(y), p(x y) ad the apply bayes rule to compute p(y x) for makg predctos Ths s essetally makg

More information

5 Short Proofs of Simplified Stirling s Approximation

5 Short Proofs of Simplified Stirling s Approximation 5 Short Proofs of Smplfed Strlg s Approxmato Ofr Gorodetsky, drtymaths.wordpress.com Jue, 20 0 Itroducto Strlg s approxmato s the followg (somewhat surprsg) approxmato of the factoral,, usg elemetary fuctos:

More information

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled

More information

Extreme Value Theory: An Introduction

Extreme Value Theory: An Introduction (correcto d Extreme Value Theory: A Itroducto by Laures de Haa ad Aa Ferrera Wth ths webpage the authors ted to form the readers of errors or mstakes foud the book after publcato. We also gve extesos for

More information

Algorithms Theory, Solution for Assignment 2

Algorithms Theory, Solution for Assignment 2 Juor-Prof. Dr. Robert Elsässer, Marco Muñz, Phllp Hedegger WS 2009/200 Algorthms Theory, Soluto for Assgmet 2 http://lak.formatk.u-freburg.de/lak_teachg/ws09_0/algo090.php Exercse 2. - Fast Fourer Trasform

More information

Lecture 3. Sampling, sampling distributions, and parameter estimation

Lecture 3. Sampling, sampling distributions, and parameter estimation Lecture 3 Samplg, samplg dstrbutos, ad parameter estmato Samplg Defto Populato s defed as the collecto of all the possble observatos of terest. The collecto of observatos we take from the populato s called

More information

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Exam: ECON430 Statstcs Date of exam: Frday, December 8, 07 Grades are gve: Jauary 4, 08 Tme for exam: 0900 am 00 oo The problem set covers 5 pages Resources allowed:

More information

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall

More information

Unit 9. The Tangent Bundle

Unit 9. The Tangent Bundle Ut 9. The Taget Budle ========================================================================================== ---------- The taget sace of a submafold of R, detfcato of taget vectors wth dervatos at

More information

Point Estimation: definition of estimators

Point Estimation: definition of estimators Pot Estmato: defto of estmators Pot estmator: ay fucto W (X,..., X ) of a data sample. The exercse of pot estmato s to use partcular fuctos of the data order to estmate certa ukow populato parameters.

More information

n -dimensional vectors follow naturally from the one

n -dimensional vectors follow naturally from the one B. Vectors ad sets B. Vectors Ecoomsts study ecoomc pheomea by buldg hghly stylzed models. Uderstadg ad makg use of almost all such models requres a hgh comfort level wth some key mathematcal sklls. I

More information

Lecture 07: Poles and Zeros

Lecture 07: Poles and Zeros Lecture 07: Poles ad Zeros Defto of poles ad zeros The trasfer fucto provdes a bass for determg mportat system respose characterstcs wthout solvg the complete dfferetal equato. As defed, the trasfer fucto

More information

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions Iteratoal Joural of Computatoal Egeerg Research Vol, 0 Issue, Estmato of Stress- Stregth Relablty model usg fte mxture of expoetal dstrbutos K.Sadhya, T.S.Umamaheswar Departmet of Mathematcs, Lal Bhadur

More information

Chapter 9 Jordan Block Matrices

Chapter 9 Jordan Block Matrices Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.

More information

Chapter 4 Multiple Random Variables

Chapter 4 Multiple Random Variables Revew o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for Chapter 4-5 Notes: Although all deftos ad theorems troduced our lectures ad ths ote are mportat ad you should be famlar wth, but I put those

More information

Investigating Cellular Automata

Investigating Cellular Automata Researcher: Taylor Dupuy Advsor: Aaro Wootto Semester: Fall 4 Ivestgatg Cellular Automata A Overvew of Cellular Automata: Cellular Automata are smple computer programs that geerate rows of black ad whte

More information

CHAPTER 4 RADICAL EXPRESSIONS

CHAPTER 4 RADICAL EXPRESSIONS 6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube

More information

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n .. Soluto of Problem. M s obvously cotuous o ], [ ad ], [. Observe that M x,..., x ) M x,..., x ) )..) We ext show that M s odecreasg o ], [. Of course.) mles that M s odecreasg o ], [ as well. To show

More information

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971)) art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the

More information

Lecture 16: Backpropogation Algorithm Neural Networks with smooth activation functions

Lecture 16: Backpropogation Algorithm Neural Networks with smooth activation functions CO-511: Learg Theory prg 2017 Lecturer: Ro Lv Lecture 16: Bacpropogato Algorthm Dsclamer: These otes have ot bee subected to the usual scruty reserved for formal publcatos. They may be dstrbuted outsde

More information

A Remark on the Uniform Convergence of Some Sequences of Functions

A Remark on the Uniform Convergence of Some Sequences of Functions Advaces Pure Mathematcs 05 5 57-533 Publshed Ole July 05 ScRes. http://www.scrp.org/joural/apm http://dx.do.org/0.436/apm.05.59048 A Remark o the Uform Covergece of Some Sequeces of Fuctos Guy Degla Isttut

More information

Median as a Weighted Arithmetic Mean of All Sample Observations

Median as a Weighted Arithmetic Mean of All Sample Observations Meda as a Weghted Arthmetc Mea of All Sample Observatos SK Mshra Dept. of Ecoomcs NEHU, Shllog (Ida). Itroducto: Iumerably may textbooks Statstcs explctly meto that oe of the weakesses (or propertes) of

More information

best estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best

best estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best Error Aalyss Preamble Wheever a measuremet s made, the result followg from that measuremet s always subject to ucertaty The ucertaty ca be reduced by makg several measuremets of the same quatty or by mprovg

More information

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then Secto 5 Vectors of Radom Varables Whe workg wth several radom varables,,..., to arrage them vector form x, t s ofte coveet We ca the make use of matrx algebra to help us orgaze ad mapulate large umbers

More information

Increasing Kolmogorov Complexity

Increasing Kolmogorov Complexity Icreasg Kolmogorov Complexty Harry Buhrma Lace Fortow Ila Newma Nkola Vereshchag September 7, 2004 classfcato: Kolmogorov complexty, computatoal complexty 1 Itroducto How much do we have to chage a strg

More information

Functions of Random Variables

Functions of Random Variables Fuctos of Radom Varables Chapter Fve Fuctos of Radom Varables 5. Itroducto A geeral egeerg aalyss model s show Fg. 5.. The model output (respose) cotas the performaces of a system or product, such as weght,

More information

Lecture 1. (Part II) The number of ways of partitioning n distinct objects into k distinct groups containing n 1,

Lecture 1. (Part II) The number of ways of partitioning n distinct objects into k distinct groups containing n 1, Lecture (Part II) Materals Covered Ths Lecture: Chapter 2 (2.6 --- 2.0) The umber of ways of parttog dstct obects to dstct groups cotag, 2,, obects, respectvely, where each obect appears exactly oe group

More information

( ) = ( ) ( ) Chapter 13 Asymptotic Theory and Stochastic Regressors. Stochastic regressors model

( ) = ( ) ( ) Chapter 13 Asymptotic Theory and Stochastic Regressors. Stochastic regressors model Chapter 3 Asmptotc Theor ad Stochastc Regressors The ature of eplaator varable s assumed to be o-stochastc or fed repeated samples a regresso aalss Such a assumpto s approprate for those epermets whch

More information

α1 α2 Simplex and Rectangle Elements Multi-index Notation of polynomials of degree Definition: The set P k will be the set of all functions:

α1 α2 Simplex and Rectangle Elements Multi-index Notation of polynomials of degree Definition: The set P k will be the set of all functions: Smplex ad Rectagle Elemets Mult-dex Notato = (,..., ), o-egatve tegers = = β = ( β,..., β ) the + β = ( + β,..., + β ) + x = x x x x = x x β β + D = D = D D x x x β β Defto: The set P of polyomals of degree

More information

D KL (P Q) := p i ln p i q i

D KL (P Q) := p i ln p i q i Cheroff-Bouds 1 The Geeral Boud Let P 1,, m ) ad Q q 1,, q m ) be two dstrbutos o m elemets, e,, q 0, for 1,, m, ad m 1 m 1 q 1 The Kullback-Lebler dvergece or relatve etroy of P ad Q s defed as m D KL

More information

Lecture 02: Bounding tail distributions of a random variable

Lecture 02: Bounding tail distributions of a random variable CSCI-B609: A Theorst s Toolkt, Fall 206 Aug 25 Lecture 02: Boudg tal dstrbutos of a radom varable Lecturer: Yua Zhou Scrbe: Yua Xe & Yua Zhou Let us cosder the ubased co flps aga. I.e. let the outcome

More information

Class 13,14 June 17, 19, 2015

Class 13,14 June 17, 19, 2015 Class 3,4 Jue 7, 9, 05 Pla for Class3,4:. Samplg dstrbuto of sample mea. The Cetral Lmt Theorem (CLT). Cofdece terval for ukow mea.. Samplg Dstrbuto for Sample mea. Methods used are based o CLT ( Cetral

More information

Extend the Borel-Cantelli Lemma to Sequences of. Non-Independent Random Variables

Extend the Borel-Cantelli Lemma to Sequences of. Non-Independent Random Variables ppled Mathematcal Sceces, Vol 4, 00, o 3, 637-64 xted the Borel-Catell Lemma to Sequeces of No-Idepedet Radom Varables olah Der Departmet of Statstc, Scece ad Research Campus zad Uversty of Tehra-Ira der53@gmalcom

More information

Aitken delta-squared generalized Juncgk-type iterative procedure

Aitken delta-squared generalized Juncgk-type iterative procedure Atke delta-squared geeralzed Jucgk-type teratve procedure M. De la Se Isttute of Research ad Developmet of Processes. Uversty of Basque Coutry Campus of Leoa (Bzkaa) PO Box. 644- Blbao, 488- Blbao. SPAIN

More information

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015 Fall 05 Homework : Solutos Problem : (Practce wth Asymptotc Notato) A essetal requremet for uderstadg scalg behavor s comfort wth asymptotc (or bg-o ) otato. I ths problem, you wll prove some basc facts

More information

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method

More information

Exercises for Square-Congruence Modulo n ver 11

Exercises for Square-Congruence Modulo n ver 11 Exercses for Square-Cogruece Modulo ver Let ad ab,.. Mark True or False. a. 3S 30 b. 3S 90 c. 3S 3 d. 3S 4 e. 4S f. 5S g. 0S 55 h. 8S 57. 9S 58 j. S 76 k. 6S 304 l. 47S 5347. Fd the equvalece classes duced

More information

Algorithms Design & Analysis. Hash Tables

Algorithms Design & Analysis. Hash Tables Algorthms Desg & Aalyss Hash Tables Recap Lower boud Order statstcs 2 Today s topcs Drect-accessble table Hash tables Hash fuctos Uversal hashg Perfect Hashg Ope addressg 3 Symbol-table problem Symbol

More information

8.1 Hashing Algorithms

8.1 Hashing Algorithms CS787: Advaced Algorthms Scrbe: Mayak Maheshwar, Chrs Hrchs Lecturer: Shuch Chawla Topc: Hashg ad NP-Completeess Date: September 21 2007 Prevously we looked at applcatos of radomzed algorthms, ad bega

More information

The Occupancy and Coupon Collector problems

The Occupancy and Coupon Collector problems Chapter 4 The Occupacy ad Coupo Collector problems By Sarel Har-Peled, Jauary 9, 08 4 Prelmares [ Defto 4 Varace ad Stadard Devato For a radom varable X, let V E [ X [ µ X deote the varace of X, where

More information

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018 Chrs Pech Fal Practce CS09 Dec 5, 08 Practce Fal Examato Solutos. Aswer: 4/5 8/7. There are multle ways to obta ths aswer; here are two: The frst commo method s to sum over all ossbltes for the rak of

More information

Arithmetic Mean and Geometric Mean

Arithmetic Mean and Geometric Mean Acta Mathematca Ntresa Vol, No, p 43 48 ISSN 453-6083 Arthmetc Mea ad Geometrc Mea Mare Varga a * Peter Mchalča b a Departmet of Mathematcs, Faculty of Natural Sceces, Costate the Phlosopher Uversty Ntra,

More information

Qualifying Exam Statistical Theory Problem Solutions August 2005

Qualifying Exam Statistical Theory Problem Solutions August 2005 Qualfyg Exam Statstcal Theory Problem Solutos August 5. Let X, X,..., X be d uform U(,),

More information

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?

More information

F. Inequalities. HKAL Pure Mathematics. 進佳數學團隊 Dr. Herbert Lam 林康榮博士. [Solution] Example Basic properties

F. Inequalities. HKAL Pure Mathematics. 進佳數學團隊 Dr. Herbert Lam 林康榮博士. [Solution] Example Basic properties 進佳數學團隊 Dr. Herbert Lam 林康榮博士 HKAL Pure Mathematcs F. Ieualtes. Basc propertes Theorem Let a, b, c be real umbers. () If a b ad b c, the a c. () If a b ad c 0, the ac bc, but f a b ad c 0, the ac bc. Theorem

More information

Lecture 2 - What are component and system reliability and how it can be improved?

Lecture 2 - What are component and system reliability and how it can be improved? Lecture 2 - What are compoet ad system relablty ad how t ca be mproved? Relablty s a measure of the qualty of the product over the log ru. The cocept of relablty s a exteded tme perod over whch the expected

More information

arxiv:math/ v1 [math.gm] 8 Dec 2005

arxiv:math/ v1 [math.gm] 8 Dec 2005 arxv:math/05272v [math.gm] 8 Dec 2005 A GENERALIZATION OF AN INEQUALITY FROM IMO 2005 NIKOLAI NIKOLOV The preset paper was spred by the thrd problem from the IMO 2005. A specal award was gve to Yure Boreko

More information

Chapter 3 Sampling For Proportions and Percentages

Chapter 3 Sampling For Proportions and Percentages Chapter 3 Samplg For Proportos ad Percetages I may stuatos, the characterstc uder study o whch the observatos are collected are qualtatve ature For example, the resposes of customers may marketg surveys

More information

Packing of graphs with small product of sizes

Packing of graphs with small product of sizes Joural of Combatoral Theory, Seres B 98 (008) 4 45 www.elsever.com/locate/jctb Note Packg of graphs wth small product of szes Alexadr V. Kostochka a,b,,gexyu c, a Departmet of Mathematcs, Uversty of Illos,

More information

Entropy ISSN by MDPI

Entropy ISSN by MDPI Etropy 2003, 5, 233-238 Etropy ISSN 1099-4300 2003 by MDPI www.mdp.org/etropy O the Measure Etropy of Addtve Cellular Automata Hasa Aı Arts ad Sceces Faculty, Departmet of Mathematcs, Harra Uversty; 63100,

More information

Research Article Multidimensional Hilbert-Type Inequalities with a Homogeneous Kernel

Research Article Multidimensional Hilbert-Type Inequalities with a Homogeneous Kernel Hdaw Publshg Corporato Joural of Iequaltes ad Applcatos Volume 29, Artcle ID 3958, 2 pages do:.55/29/3958 Research Artcle Multdmesoal Hlbert-Type Iequaltes wth a Homogeeous Kerel Predrag Vuovć Faculty

More information

MA/CSSE 473 Day 27. Dynamic programming

MA/CSSE 473 Day 27. Dynamic programming MA/CSSE 473 Day 7 Dyamc Programmg Bomal Coeffcets Warshall's algorthm (Optmal BSTs) Studet questos? Dyamc programmg Used for problems wth recursve solutos ad overlappg subproblems Typcally, we save (memoze)

More information

Complete Convergence for Weighted Sums of Arrays of Rowwise Asymptotically Almost Negative Associated Random Variables

Complete Convergence for Weighted Sums of Arrays of Rowwise Asymptotically Almost Negative Associated Random Variables A^VÇÚO 1 32 ò 1 5 Ï 2016 c 10 Chese Joural of Appled Probablty ad Statstcs Oct., 2016, Vol. 32, No. 5, pp. 489-498 do: 10.3969/j.ss.1001-4268.2016.05.005 Complete Covergece for Weghted Sums of Arrays of

More information

3. Basic Concepts: Consequences and Properties

3. Basic Concepts: Consequences and Properties : 3. Basc Cocepts: Cosequeces ad Propertes Markku Jutt Overvew More advaced cosequeces ad propertes of the basc cocepts troduced the prevous lecture are derved. Source The materal s maly based o Sectos.6.8

More information

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA THE ROYAL STATISTICAL SOCIETY 3 EXAMINATIONS SOLUTIONS GRADUATE DIPLOMA PAPER I STATISTICAL THEORY & METHODS The Socety provdes these solutos to assst caddates preparg for the examatos future years ad

More information

Parameter, Statistic and Random Samples

Parameter, Statistic and Random Samples Parameter, Statstc ad Radom Samples A parameter s a umber that descrbes the populato. It s a fxed umber, but practce we do ot kow ts value. A statstc s a fucto of the sample data,.e., t s a quatty whose

More information

THE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5

THE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5 THE ROYAL STATISTICAL SOCIETY 06 EAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5 The Socety s provdg these solutos to assst cadtes preparg for the examatos 07. The solutos are teded as learg ads ad should

More information

Unsupervised Learning and Other Neural Networks

Unsupervised Learning and Other Neural Networks CSE 53 Soft Computg NOT PART OF THE FINAL Usupervsed Learg ad Other Neural Networs Itroducto Mture Destes ad Idetfablty ML Estmates Applcato to Normal Mtures Other Neural Networs Itroducto Prevously, all

More information

TESTS BASED ON MAXIMUM LIKELIHOOD

TESTS BASED ON MAXIMUM LIKELIHOOD ESE 5 Toy E. Smth. The Basc Example. TESTS BASED ON MAXIMUM LIKELIHOOD To llustrate the propertes of maxmum lkelhood estmates ad tests, we cosder the smplest possble case of estmatg the mea of the ormal

More information

An Introduction to. Support Vector Machine

An Introduction to. Support Vector Machine A Itroducto to Support Vector Mache Support Vector Mache (SVM) A classfer derved from statstcal learg theory by Vapk, et al. 99 SVM became famous whe, usg mages as put, t gave accuracy comparable to eural-etwork

More information

LECTURE - 4 SIMPLE RANDOM SAMPLING DR. SHALABH DEPARTMENT OF MATHEMATICS AND STATISTICS INDIAN INSTITUTE OF TECHNOLOGY KANPUR

LECTURE - 4 SIMPLE RANDOM SAMPLING DR. SHALABH DEPARTMENT OF MATHEMATICS AND STATISTICS INDIAN INSTITUTE OF TECHNOLOGY KANPUR amplg Theory MODULE II LECTURE - 4 IMPLE RADOM AMPLIG DR. HALABH DEPARTMET OF MATHEMATIC AD TATITIC IDIA ITITUTE OF TECHOLOGY KAPUR Estmato of populato mea ad populato varace Oe of the ma objectves after

More information

1 Review and Overview

1 Review and Overview CS9T/STATS3: Statstcal Learg Teory Lecturer: Tegyu Ma Lecture #7 Scrbe: Bra Zag October 5, 08 Revew ad Overvew We wll frst gve a bref revew of wat as bee covered so far I te frst few lectures, we stated

More information