Lecture Oct. 10, 2013
|
|
- Steven Nichols
- 5 years ago
- Views:
Transcription
1 CS 229r: Algorths for Bg Data Fall 203 Prof. Jela Nelso Lecture Oct. 0, 203 Scrbe: To Morga Overvew I ths lecture ad the revous oe, we focused o fdg Johso-Ldestrauss atrces that allow for faster ultlcato. Last lecture, we reseted a costructo that erfored faster whe the vectors to be trasfored are sarse. Ths lecture, we wll reset a JL atrx that erfors faster ultlcato wth dese vectors. 2 Fast Johso-Ldestrauss Trasfor Here we wll reset the Fast Johso-Ldestrauss Trasfor of [AC06]. The tal dea s to use a scaled salg atrx S R. S s all zeros excet for each row havg a / a rado colu. Observe that Sx 2 2 s the scaled ercal or of rado x2 s, whch gves us our desred exectato sce, f we select r [] uforly at rado, E r x 2 r P(r ) x 2 x 2 2. The roble however, s that ths ay have hgh varace. For exale, f ost of x s ass s oe coordate, the eeds to be o the order of to exect to ht t. Our soluto to ths s to recodto x wth soe other atrx, such that the ors are reserved wll sreadg the x s ass across the coordates. [AC06] s srato for ths recodtoer coes fro the Heseberg s ucertaty rcal, whch states that a vector x ad ts Fourer trasfor ˆx caot both be sharly cocetrated. However, we caot just take the Fourer trasfor sce f the tal x s well sread, ˆx ay becoe cocetrated. [AC06] s ultate atrx was Π P HD, where D s a atrx wth rado sgs o the dagoal, H s the Fourer atrx, ad P s a rado suer-sarse atrx. Wth ths they acheved a ultlcato te betwee Π ad x of O ( log + log 2 ( ) ( ɛ 2 δ log )) δ. We wll rove a slghtly weaker verso of ths result by lettg P be a slow JL atrx tes the sale atrx S descrbed earler. 2. Ma Results There are ay ossbltes for the atrx H, other tha just the Fourer atrx. It suffces for H to satsfy the followg roertes:. Hx ca be couted O( log ) te.
2 2., j H,j / 3. H s a orthogoal atrx (HH T H T H I) Istead of the Fourer atrx, we wll use H such that H,j ( ),j, where, j s the dot roduct of the bary reresetatos of ad j. We wll requre that s a ower of 2 (f t s ot, sly ad x wth 0s utl t s). Ths H obvously satsfes roerty 2. To see that t satsfes roerty, observe that f H k s the H atrx whe k, the H k 2 [ Hk/2 H k/2 H k/2 H k/2 Ths follows fro lookg at how the ost sgfcat bt of ad j cotrbute to, j ad thus H,j. Let ad j be the ad j after reovg the ost sgfcat bt. I all but the botto rght quadrat, ether or j have a 0 ther frst bt, so, j, j, whle the botto rght quadrat, ad j both have a frst, so, j +, j. Usg ths recurrece, we ca ultly Hx te O( log ). To see that ths H satsfes roerty 3, we wll verfy that H T H I. Wrte H h h. The ad for j, (H T H) h, h (H T H) j h, h j ]. ( ( ),r ) 2 ( ) j,r 0, where s the XOR oerato. The fal equalty follows fro the fact that sce ad j dffer at least oe sot, j 0 ad so the sae uber of rs ake j, r eve as ake t odd. Now we wll ove o to rovg that Π oerates as desred. Frst, we wll show that HD successfully sreads the ass of x. Let y HDx ad z Sy. ) Lea. P D ( y c < δ 2. l(2/δ) Proof. Let α ± be the th dagoal etry of D. We wll beg by boudg the th oet of y so that we ca aly Markov s equalty to t. We wll do ths oce aga by sertg rado Gaussas g g. 2
3 y α r (h r x r ) π 2 E α r g r (h r x r ) g π α r g r (h r x r ) 2 π g 2 r (h r x r ) π (h r x r ) 2 2 g r 2 x 2 Where the frst equalty follows fro Jese s equalty ad the fal equalty follows fro the 2-stablty of Gaussas. As a asde, the roerty that for rado sgs σ, σ x x 2 s kow as Khtche s equalty. We ca ow aly Markov s equalty geeralzed to the th oet P( y > λ) < λ E y obtag ( ) l(2/δ) P y > c < ( c l(2/δ) ) ( c 2 l(2/δ) ) Whch by settg c 2 l(/δ)/e 2 ad c e s bouded by e e c2 e 2 l(2/δ) δ 2 to whch we ca sly aly a uo boud to rove our cla. Now we kow that HD sreads the ass of x as desred, ad t s easy to see that y 2 x 2. All that reas s to argue that S reserves the ors of ut y vectors. l(2/λ) Lea 2. Codtoed o the good evet that y, P ( Sy 2 ) ɛ δ/2. 3
4 Proof. We wll be usg the followg Cheroff boud. Gve deedet rado varables X,..., X, X X, µ E X, σ 2 E(X E X) 2, ad X K wth robablty, { P( X µ > λ) ax e cλ2 /σ 2, e cλ/k}. We wll wrte S r /δ r where δ r {0, } s our rado sale of the colus for row r. Thus, r, δ r. Recall that z Sy. Let q r zr 2 ( ) 2 δ r y δ r y 2 + δ r δ rj y y j j δ r y 2. We care about z 2 r q r, ad the q r s are deedet, so we ca aly Cheroff f we boud σ 2 ad K. K y 2 l(/δ). ( ) σ 2 E q 2 2 E 2 δ r y 4 y 4 y 2 y l(/δ) y 2 Pluggg ths to the Cheroff boud we get P ( Sy 2 > ɛ ) ( ) P q r > ɛ r { ax e cɛ2 / l(/δ), e cɛ/ l(/δ)}. The frst ter doates, ad so we set /ɛ 2 l(/δ) l(/δ) to get the δ/2 boud that we desre. Note that our here s losg a lttle bt fro the desred JL deso, so after alyg SHD we aly a fal atrx T whch s a oralzed rado sg atrx wth O(ɛ 2 log δ ) rows (the 4
5 sae kd we used to do slow JL) to fx t u. Thus our fal JL atrx s Π T SHD. Now let s look at the te t takes to coute Πx. Multlyg by D takes O() te, H takes O( log ), S takes O() O() te, ad T takes O ( log ( ) ɛ 2 δ log ( ) ( ɛ 2 δ log )) δ O( 3 ) te. So the total te s O( log + 3 ). 2.2 Later Work Later work focused o rovg the addtve O( 3 ) cooet of the te. [AL09] reduced t to O γ ( 2+γ ). [AL3] ad [KW] further reduced t to O(). They acheved ths by usg the sae Π SHD but usg better aalyss. I artcular, rather tha showg that HD sreads ass, they focused o SH whch they showed exhbts the soetry roerty, whch eas that t reserves the ors of k-sarse vectors. These last works however lose a lttle bt the desoalty reducto, that they have O(ɛ 2 log N(log log N) 3 ). [NPW4] ataed the sae rug te, whle rovg the deso to O(ɛ 2 log N(log log N) 2 ). 3 Other Johso-Ldestrauss Work So far we have always looked at usg lear as, but ca we do better wth other as? Defto 3. For the etrc sace (T, l 2 ), defe the doublg costat λ(t ) as the sallest uber λ such that ay l 2 ball of radus r ca be covered by at ost λ balls of radus r/2 cetered T. Defto 4. The doublg deso of T s d(t ) log 2 (λ(t )). Lea 5. Ay ebeddg of T to l 2 wth dstorto at ost C ust have d(t ). Proof. (Sketch) Take a ball the orgal sace, ad a t to l 2 usg the ebeddg. Cover ths ebedded ball wth a few (r/f(k))-balls l 2, the the take the verse ages of these balls the orgal sace. They should cover the orgal ball. Cojecture 6. ([GKL03], [LP0]) For ay T, t ca be ebedded to l 2 that C f(d(t )) f (d(t )). For soe fuctos f ad f. wth dstorto C such Ths cojecture caot be roved wth lear as. For exale, here s a exale oted out to e by Huy Nguy ê (though the exstece of slar exales was kow eve at the te of [GKL03]). Take the set { xj0 A( + j)e T + + e x j A( + j)e + + e j for soe large A. Ths set looks lke a bg le alog e + wth erodc tght clusters of ots devatg very slghtly fro the le. A lear a for ths set requres log N desos, because 5
6 for ay lear a we ust have Πx j0 Πx j Πe Πe j for whch [Alo03] gves us a boud of Ω(log N). However, f we use the olear ag f(x j0 ) (A( + j), 0, ) f(x j ) (A( + j),, 0) the we ca acheve costat deso ad dstorto. Refereces [AC06] [AL09] [AL3] Nr Alo ad Berard Chazelle. Aroxate earest eghbors ad the fast johsoldestrauss trasfor. I Proceedgs of the 38th aual ACM syosu o Theory of coutg (STOC), ages ACM, Nr Alo ad Edo Lberty. Fast Deso Reducto Usg Radeacher Seres o Dual BCH Codes. Dscrete & Coutatoal Geoetry, 42(4): , Nr Alo ad Edo Lberty. A alost otal urestrcted fast johso-ldestrauss trasfor. ACM Trasactos o Algorths (TALG), 9(3):2, 203. [Alo03] Noga Alo. Probles ad results extreal cobatorcs. Dscrete Matheatcs, 273():3 53, [GKL03] Aua Guta, Robert Krauthgaer, ad Jaes R Lee. Bouded geoetres, fractals, ad low-dstorto ebeddgs. I Proceedgs of the 44th Syosu o Foudatos of Couter Scece (FOCS), ages IEEE, [KW] Felx Kraher ad Rachel Ward. New ad roved Johso-Ldestrauss ebeddgs va the restrcted soetry roerty. SIAM Joural o Matheatcal Aalyss, 43(3):269 28, 20. [LP0] Urs Lag ad Corad Plaut. Blschtz ebeddgs of etrc saces to sace fors. Geoetrae Dedcata, 87(-3): , 200. [NPW4] Jela Nelso, Erc Prce, ad Mary Wootters. New costructos of r atrces wth fast ultlcato ad fewer rows. I Proceedgs of the 35th Aual ACM-SIAM Syosu o Dscrete Algorths (SODA),
for each of its columns. A quick calculation will verify that: thus m < dim(v). Then a basis of V with respect to which T has the form: A
Desty of dagoalzable square atrces Studet: Dael Cervoe; Metor: Saravaa Thyagaraa Uversty of Chcago VIGRE REU, Suer 7. For ths etre aer, we wll refer to V as a vector sace over ad L(V) as the set of lear
More informationELEMENTS OF NUMBER THEORY. In the following we will use mainly integers and positive integers. - the set of integers - the set of positive integers
ELEMENTS OF NUMBER THEORY I the followg we wll use aly tegers a ostve tegers Ζ = { ± ± ± K} - the set of tegers Ν = { K} - the set of ostve tegers Oeratos o tegers: Ato Each two tegers (ostve tegers) ay
More informationCIS 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 informationA Family of Non-Self Maps Satisfying i -Contractive Condition and Having Unique Common Fixed Point in Metrically Convex Spaces *
Advaces Pure Matheatcs 0 80-84 htt://dxdoorg/0436/a04036 Publshed Ole July 0 (htt://wwwscrporg/oural/a) A Faly of No-Self Mas Satsfyg -Cotractve Codto ad Havg Uque Coo Fxed Pot Metrcally Covex Saces *
More informationKURODA S METHOD FOR CONSTRUCTING CONSISTENT INPUT-OUTPUT DATA SETS. Peter J. Wilcoxen. Impact Research Centre, University of Melbourne.
KURODA S METHOD FOR CONSTRUCTING CONSISTENT INPUT-OUTPUT DATA SETS by Peter J. Wlcoxe Ipact Research Cetre, Uversty of Melboure Aprl 1989 Ths paper descrbes a ethod that ca be used to resolve cossteces
More informationAlgorithms behind the Correlation Setting Window
Algorths behd the Correlato Settg Wdow Itroducto I ths report detaled forato about the correlato settg pop up wdow s gve. See Fgure. Ths wdow s obtaed b clckg o the rado butto labelled Kow dep the a scree
More informationFeature 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 informationSebastián Martín Ruiz. Applications of Smarandache Function, and Prime and Coprime Functions
Sebastá Martí Ruz Alcatos of Saradache Fucto ad Pre ad Core Fuctos 0 C L f L otherwse are core ubers Aerca Research Press Rehoboth 00 Sebastá Martí Ruz Avda. De Regla 43 Choa 550 Cadz Sa Sarada@telele.es
More informationLecture 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 informationD 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 informationDiscrete 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 informationSome Different Perspectives on Linear Least Squares
Soe Dfferet Perspectves o Lear Least Squares A stadard proble statstcs s to easure a respose or depedet varable, y, at fed values of oe or ore depedet varables. Soetes there ests a deterstc odel y f (,,
More informationThe Number of the Two Dimensional Run Length Constrained Arrays
2009 Iteratoal Coferece o Mache Learg ad Coutg IPCSIT vol.3 (20) (20) IACSIT Press Sgaore The Nuber of the Two Desoal Ru Legth Costraed Arrays Tal Ataa Naohsa Otsua 2 Xuerog Yog 3 School of Scece ad Egeerg
More informationLecture 4 Sep 9, 2015
CS 388R: Radomzed Algorthms Fall 205 Prof. Erc Prce Lecture 4 Sep 9, 205 Scrbe: Xagru Huag & Chad Voegele Overvew I prevous lectures, we troduced some basc probablty, the Cheroff boud, the coupo collector
More informationå 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 informationChain Rules for Entropy
Cha Rules for Etroy The etroy of a collecto of radom varables s the sum of codtoal etroes. Theorem: Let be radom varables havg the mass robablty x x.x. The...... The roof s obtaed by reeatg the alcato
More informationDepartment of Mathematics UNIVERSITY OF OSLO. FORMULAS FOR STK4040 (version 1, September 12th, 2011) A - Vectors and matrices
Deartet of Matheatcs UNIVERSITY OF OSLO FORMULAS FOR STK4040 (verso Seteber th 0) A - Vectors ad atrces A) For a x atrx A ad a x atrx B we have ( AB) BA A) For osgular square atrces A ad B we have ( )
More information= 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 informationNon-degenerate Perturbation Theory
No-degeerate Perturbato Theory Proble : H E ca't solve exactly. But wth H H H' H" L H E Uperturbed egevalue proble. Ca solve exactly. E Therefore, kow ad. H ' H" called perturbatos Copyrght Mchael D. Fayer,
More informationA New Method for Solving Fuzzy Linear. Programming by Solving Linear Programming
ppled Matheatcal Sceces Vol 008 o 50 7-80 New Method for Solvg Fuzzy Lear Prograg by Solvg Lear Prograg S H Nasser a Departet of Matheatcs Faculty of Basc Sceces Mazadara Uversty Babolsar Ira b The Research
More informationAssignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)
Assgmet 5/MATH 7/Wter 00 Due: Frday, February 9 class (!) (aswers wll be posted rght after class) As usual, there are peces of text, before the questos [], [], themselves. Recall: For the quadratc form
More information7.0 Equality Contraints: Lagrange Multipliers
Systes Optzato 7.0 Equalty Cotrats: Lagrage Multplers Cosder the zato of a o-lear fucto subject to equalty costrats: g f() R ( ) 0 ( ) (7.) where the g ( ) are possbly also olear fuctos, ad < otherwse
More informationDUALITY FOR MINIMUM MATRIX NORM PROBLEMS
HE PUBLISHING HOUSE PROCEEDINGS OF HE ROMNIN CDEMY, Seres, OF HE ROMNIN CDEMY Vole 6, Nber /2005,. 000-000 DULIY FOR MINIMUM MRI NORM PROBLEMS Vasle PRED, Crstca FULG Uverst of Bcharest, Faclt of Matheatcs
More informationLecture 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 information18.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 informationDebabrata Dey and Atanu Lahiri
RESEARCH ARTICLE QUALITY COMPETITION AND MARKET SEGMENTATION IN THE SECURITY SOFTWARE MARKET Debabrata Dey ad Atau Lahr Mchael G. Foster School of Busess, Uersty of Washgto, Seattle, Seattle, WA 9895 U.S.A.
More information2/20/2013. Topics. Power Flow Part 1 Text: Power Transmission. Power Transmission. Power Transmission. Power Transmission
/0/0 Topcs Power Flow Part Text: 0-0. Power Trassso Revsted Power Flow Equatos Power Flow Proble Stateet ECEGR 45 Power Systes Power Trassso Power Trassso Recall that for a short trassso le, the power
More informationarxiv: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 informationChapter 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 informationMATH 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 informationRademacher 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 informationFor combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.
Addtoal Decrease ad Coquer Algorthms For combatoral problems we mght eed to geerate all permutatos, combatos, or subsets of a set. Geeratg Permutatos If we have a set f elemets: { a 1, a 2, a 3, a } the
More informationUnique Common Fixed Point of Sequences of Mappings in G-Metric Space M. Akram *, Nosheen
Vol No : Joural of Facult of Egeerg & echolog JFE Pages 9- Uque Coo Fed Pot of Sequeces of Mags -Metrc Sace M. Ara * Noshee * Deartet of Matheatcs C Uverst Lahore Pasta. Eal: ara7@ahoo.co Deartet of Matheatcs
More informationJournal Of Inequalities And Applications, 2008, v. 2008, p
Ttle O verse Hlbert-tye equaltes Authors Chagja, Z; Cheug, WS Ctato Joural Of Iequaltes Ad Alcatos, 2008, v. 2008,. 693248 Issued Date 2008 URL htt://hdl.hadle.et/0722/56208 Rghts Ths work s lcesed uder
More information3D Reconstruction from Image Pairs. Reconstruction from Multiple Views. Computing Scene Point from Two Matching Image Points
D Recostructo fro Iage ars Recostructo fro ultple Ves Dael Deetho Fd terest pots atch terest pots Copute fudaetal atr F Copute caera atrces ad fro F For each atchg age pots ad copute pot scee Coputg Scee
More informationMu 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 informationCoherent Potential Approximation
Coheret Potetal Approxato Noveber 29, 2009 Gree-fucto atrces the TB forals I the tght bdg TB pcture the atrx of a Haltoa H s the for H = { H j}, where H j = δ j ε + γ j. 2 Sgle ad double uderles deote
More informationMA 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 informationMULTIOBJECTIVE NONLINEAR FRACTIONAL PROGRAMMING PROBLEMS INVOLVING GENERALIZED d - TYPE-I n -SET FUNCTIONS
THE PUBLIHING HOUE PROCEEDING OF THE ROMANIAN ACADEMY, eres A OF THE ROMANIAN ACADEMY Volue 8, Nuber /27,.- MULTIOBJECTIVE NONLINEAR FRACTIONAL PROGRAMMING PROBLEM INVOLVING GENERALIZED d - TYPE-I -ET
More information2. Independence and Bernoulli Trials
. Ideedece ad Beroull Trals Ideedece: Evets ad B are deedet f B B. - It s easy to show that, B deedet mles, B;, B are all deedet ars. For examle, ad so that B or B B B B B φ,.e., ad B are deedet evets.,
More informationCS286.2 Lecture 4: Dinur s Proof of the PCP Theorem
CS86. Lecture 4: Dur s Proof of the PCP Theorem Scrbe: Thom Bohdaowcz Prevously, we have prove a weak verso of the PCP theorem: NP PCP 1,1/ (r = poly, q = O(1)). Wth ths result we have the desred costat
More informationLecture 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 informationhp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations
HP 30S Statstcs Averages ad Stadard Devatos Average ad Stadard Devato Practce Fdg Averages ad Stadard Devatos HP 30S Statstcs Averages ad Stadard Devatos Average ad stadard devato The HP 30S provdes several
More informationSolutions to problem set ); (, ) (
Solutos to proble set.. L = ( yp p ); L = ( p p ); y y L, L = yp p, p p = yp p, + p [, p ] y y y = yp + p = L y Here we use for eaple that yp, p = yp p p yp = yp, p = yp : factors that coute ca be treated
More informationRelations to Other Statistical Methods Statistical Data Analysis with Positive Definite Kernels
Relatos to Other Statstcal Methods Statstcal Data Aalyss wth Postve Defte Kerels Kej Fukuzu Isttute of Statstcal Matheatcs, ROIS Departet of Statstcal Scece, Graduate Uversty for Advaced Studes October
More informationBayes (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 informationIdeal 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 information18.657: Mathematics of Machine Learning
8.657: Mathematcs of Mache Learg Lecturer: Phlppe Rgollet Lecture 3 Scrbe: James Hrst Sep. 6, 205.5 Learg wth a fte dctoary Recall from the ed of last lecture our setup: We are workg wth a fte dctoary
More informationUnit 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 information5. Data Compression. Review of Last Lecture. Outline of the Lecture. Course Overview. Basics of Information Theory: Markku Juntti
: Markku Jutt Overvew The deas of lossless data copresso ad source codg are troduced ad copresso lts are derved. Source The ateral s aly based o Sectos 5. 5.5 of the course book []. Teleco. Laboratory
More informationIntroduction 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 informationFactorization of Finite Abelian Groups
Iteratoal Joural of Algebra, Vol 6, 0, o 3, 0-07 Factorzato of Fte Abela Grous Khald Am Uversty of Bahra Deartmet of Mathematcs PO Box 3038 Sakhr, Bahra kamee@uobedubh Abstract If G s a fte abela grou
More informationA 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 informationMATH 371 Homework assignment 1 August 29, 2013
MATH 371 Homework assgmet 1 August 29, 2013 1. Prove that f a subset S Z has a smallest elemet the t s uque ( other words, f x s a smallest elemet of S ad y s also a smallest elemet of S the x y). We kow
More informationThe Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis)
We have covered: Selecto, Iserto, Mergesort, Bubblesort, Heapsort Next: Selecto the Qucksort The Selecto Problem - Varable Sze Decrease/Coquer (Practce wth algorthm aalyss) Cosder the problem of fdg the
More informationChannel Models with Memory. Channel Models with Memory. Channel Models with Memory. Channel Models with Memory
Chael Models wth Memory Chael Models wth Memory Hayder radha Electrcal ad Comuter Egeerg Mchga State Uversty I may ractcal etworkg scearos (cludg the Iteret ad wreless etworks), the uderlyg chaels are
More informationRandom Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois
Radom Varables ECE 313 Probablty wth Egeerg Alcatos Lecture 8 Professor Rav K. Iyer Uversty of Illos Iyer - Lecture 8 ECE 313 Fall 013 Today s Tocs Revew o Radom Varables Cumulatve Dstrbuto Fucto (CDF
More information2SLS Estimates ECON In this case, begin with the assumption that E[ i
SLS Estmates ECON 3033 Bll Evas Fall 05 Two-Stage Least Squares (SLS Cosder a stadard lear bvarate regresso model y 0 x. I ths case, beg wth the assumto that E[ x] 0 whch meas that OLS estmates of wll
More informationare positive, and the pair A, B is controllable. The uncertainty in is introduced to model control failures.
Lectue 4 8. MRAC Desg fo Affe--Cotol MIMO Systes I ths secto, we cosde MRAC desg fo a class of ult-ut-ult-outut (MIMO) olea systes, whose lat dyacs ae lealy aaetezed, the ucetates satsfy the so-called
More informationDATA DOMAIN DATA DOMAIN
3//6 Coprght otce: Most ages these sldes are Gozalez ad oods Pretce-Hall Note: ages are [spatall] ostatoar sgals. e eed tools to aalze the locall at dfferet resolutos e ca do ths the data doa or sutable
More informationLecture 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 information1 Solution to Problem 6.40
1 Soluto to Problem 6.40 (a We wll wrte T τ (X 1,...,X where the X s are..d. wth PDF f(x µ, σ 1 ( x µ σ g, σ where the locato parameter µ s ay real umber ad the scale parameter σ s > 0. Lettg Z X µ σ we
More informationCHAPTER 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 informationInvestigating 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 informationComputational and Statistical Learning theory Assignment 4
Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}
More informationA Conventional Approach for the Solution of the Fifth Order Boundary Value Problems Using Sixth Degree Spline Functions
Appled Matheatcs, 1, 4, 8-88 http://d.do.org/1.4/a.1.448 Publshed Ole Aprl 1 (http://www.scrp.org/joural/a) A Covetoal Approach for the Soluto of the Ffth Order Boudary Value Probles Usg Sth Degree Sple
More informationDimensionality 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 informationMultiple Choice Test. Chapter Adequacy of Models for Regression
Multple Choce Test Chapter 06.0 Adequac of Models for Regresso. For a lear regresso model to be cosdered adequate, the percetage of scaled resduals that eed to be the rage [-,] s greater tha or equal to
More informationIS 709/809: Computational Methods in IS Research. Simple Markovian Queueing Model
IS 79/89: Comutatoal Methods IS Research Smle Marova Queueg Model Nrmalya Roy Deartmet of Iformato Systems Uversty of Marylad Baltmore Couty www.umbc.edu Queueg Theory Software QtsPlus software The software
More informationHomework 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 informationPolyphase Filters. Section 12.4 Porat
Polyphase Flters Secto.4 Porat .4 Polyphase Flters Polyphase s a way of dog saplg-rate coverso that leads to very effcet pleetatos. But ore tha that, t leads to very geeral vewpots that are useful buldg
More informationSingular Value Decomposition. Linear Algebra (3) Singular Value Decomposition. SVD and Eigenvectors. Solving LEs with SVD
Sgular Value Decomosto Lear Algera (3) m Cootes Ay m x matrx wth m ca e decomosed as follows Dagoal matrx A UWV m x x Orthogoal colums U U I w1 0 0 w W M M 0 0 x Orthoormal (Pure rotato) VV V V L 0 L 0
More informationFibonacci Identities as Binomial Sums
It. J. Cotemp. Math. Sceces, Vol. 7, 1, o. 38, 1871-1876 Fboacc Idettes as Bomal Sums Mohammad K. Azara Departmet of Mathematcs, Uversty of Evasvlle 18 Lcol Aveue, Evasvlle, IN 477, USA E-mal: azara@evasvlle.edu
More informationChapter 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{ }{ ( )} (, ) = ( ) ( ) ( ) 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 informationPart 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 informationCOV. Violation of constant variance of ε i s but they are still independent. The error term (ε) is said to be heteroscedastic.
c Pogsa Porchawseskul, Faculty of Ecoomcs, Chulalogkor Uversty olato of costat varace of s but they are stll depedet. C,, he error term s sad to be heteroscedastc. c Pogsa Porchawseskul, Faculty of Ecoomcs,
More information5 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 informationA New Method of Testing Log-normal Mean
World Aled Sceces Joural (: 67-677, SSN 88-495 DOS Publcatos, DO: 589/doswasj5 A New ethod of Testg og-oral ea K Abdollahezhad, F Yaghae ad Babaezhad Deartet of Statstcs, Faculty of Sceces, Golesta versty,
More informationApplication of Generating Functions to the Theory of Success Runs
Aled Mathematcal Sceces, Vol. 10, 2016, o. 50, 2491-2495 HIKARI Ltd, www.m-hkar.com htt://dx.do.org/10.12988/ams.2016.66197 Alcato of Geeratg Fuctos to the Theory of Success Rus B.M. Bekker, O.A. Ivaov
More information8.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 informationBounds 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 informationOrdinary Least Squares Regression. Simple Regression. Algebra and Assumptions.
Ordary Least Squares egresso. Smple egresso. Algebra ad Assumptos. I ths part of the course we are gog to study a techque for aalysg the lear relatoshp betwee two varables Y ad X. We have pars of observatos
More informationANALYSIS ON THE NATURE OF THE BASIC EQUATIONS IN SYNERGETIC INTER-REPRESENTATION NETWORK
Far East Joural of Appled Mathematcs Volume, Number, 2008, Pages Ths paper s avalable ole at http://www.pphm.com 2008 Pushpa Publshg House ANALYSIS ON THE NATURE OF THE ASI EQUATIONS IN SYNERGETI INTER-REPRESENTATION
More informationAlgorithms 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 informationLecture 9. Some Useful Discrete Distributions. Some Useful Discrete Distributions. The observations generated by different experiments have
NM 7 Lecture 9 Some Useful Dscrete Dstrbutos Some Useful Dscrete Dstrbutos The observatos geerated by dfferet eermets have the same geeral tye of behavor. Cosequetly, radom varables assocated wth these
More informationOn the characteristics of partial differential equations
Sur les caractérstques des équatos au dérvées artelles Bull Soc Math Frace 5 (897) 8- O the characterstcs of artal dfferetal equatos By JULES BEUDON Traslated by D H Delhech I a ote that was reseted to
More informationLecture Notes Types of economic variables
Lecture Notes 3 1. Types of ecoomc varables () Cotuous varable takes o a cotuum the sample space, such as all pots o a le or all real umbers Example: GDP, Polluto cocetrato, etc. () Dscrete varables fte
More information. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)
Chapter 7 Fuctos o Bouded Varato. Subject: Real Aalyss Level: M.Sc. Source: Syed Gul Shah (Charma, Departmet o Mathematcs, US Sargodha Collected & Composed by: Atq ur Rehma (atq@mathcty.org, http://www.mathcty.org
More informationEECE 301 Signals & Systems
EECE 01 Sgals & Systems Prof. Mark Fowler Note Set #9 Computg D-T Covoluto Readg Assgmet: Secto. of Kame ad Heck 1/ Course Flow Dagram The arrows here show coceptual flow betwee deas. Note the parallel
More informationThird handout: On the Gini Index
Thrd hadout: O the dex Corrado, a tala statstca, proposed (, 9, 96) to measure absolute equalt va the mea dfferece whch s defed as ( / ) where refers to the total umber of dvduals socet. Assume that. The
More informationChapter 14 Logistic Regression Models
Chapter 4 Logstc Regresso Models I the lear regresso model X β + ε, there are two types of varables explaatory varables X, X,, X k ad study varable y These varables ca be measured o a cotuous scale as
More informationAn Innovative Algorithmic Approach for Solving Profit Maximization Problems
Matheatcs Letters 208; 4(: -5 http://www.scecepublshggroup.co/j/l do: 0.648/j.l.208040. ISSN: 2575-503X (Prt; ISSN: 2575-5056 (Ole A Iovatve Algorthc Approach for Solvg Proft Maxzato Probles Abul Kala
More informationA 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 informationSome results and conjectures about recurrence relations for certain sequences of binomial sums.
Soe results ad coectures about recurrece relatos for certa sequeces of boal sus Joha Cgler Faultät für Matheat Uverstät We A-9 We Nordbergstraße 5 Joha Cgler@uveacat Abstract I a prevous paper [] I have
More informationTest Paper-II. 1. If sin θ + cos θ = m and sec θ + cosec θ = n, then (a) 2n = m (n 2 1) (b) 2m = n (m 2 1) (c) 2n = m (m 2 1) (d) none of these
Test Paer-II. If s θ + cos θ = m ad sec θ + cosec θ =, the = m ( ) m = (m ) = m (m ). If a ABC, cos A = s B, the t s C a osceles tragle a eulateral tragle a rght agled tragle. If cos B = cos ( A+ C), the
More information-Pareto Optimality for Nondifferentiable Multiobjective Programming via Penalty Function
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 198, 248261 1996 ARTICLE NO. 0080 -Pareto Otalty for Nodfferetable Multobectve Prograg va Pealty Fucto J. C. Lu Secto of Matheatcs, Natoal Uersty Prearatory
More informationA Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming
Aerca Joural of Operatos Research, 4, 4, 33-339 Publshed Ole Noveber 4 ScRes http://wwwscrporg/oural/aor http://ddoorg/436/aor4463 A Pealty Fucto Algorth wth Obectve Paraeters ad Costrat Pealty Paraeter
More information( ) 2 2. Multi-Layer Refraction Problem Rafael Espericueta, Bakersfield College, November, 2006
Mult-Layer Refracto Problem Rafael Espercueta, Bakersfeld College, November, 006 Lght travels at dfferet speeds through dfferet meda, but refracts at layer boudares order to traverse the least-tme path.
More informationCS 2750 Machine Learning. Lecture 7. Linear regression. CS 2750 Machine Learning. Linear regression. is a linear combination of input components x
CS 75 Mache Learg Lecture 7 Lear regresso Mlos Hauskrecht los@cs.ptt.edu 59 Seott Square CS 75 Mache Learg Lear regresso Fucto f : X Y s a lear cobato of put copoets f + + + K d d K k - paraeters eghts
More information