IMPROVED STEADY STATE ANALYSIS OF THE RECURSIVE LEAST SQUARES ALGORITHM
|
|
- Justina Barton
- 5 years ago
- Views:
Transcription
1 IMPROVED STEADY STATE ANALYSIS OF THE RECURSIVE LEAST SQUARES ALGORITHM Muhammad Monuddn,2 Tareq Y. Al-Naffour 3 Khaled A. Al-Hujal 4 Electrcal and Computer Engneerng Department, Kng Abdulazz Unversty KAU), Kngdom of Saud Araba KSA), Emal: mmsansar@kau.edu.sa 2 Center of Excellence n Intellgent Engneerng Systems CEIES), KAU, KSA, Emal: mmsansar@kau.edu.sa 3 Electrcal Engneerng Department, Kng Abdullah Unversty of Scence and Technology, Kngdom of Saud Araba, Emal:tareq.alnaffour@kaust.edu.sa 4 Department of Electrcal Engneerng, Tabah Unversty, KSA, Emal:khujal@tabah.edu.sa ABSTRACT Ths paper presents a new approach for studyng the steady state performance of the Recursve Least Square RLS) adaptve flter for a crcularly correlated Gaussan nput. Earler methods have two major drawbacks: ) The energy relaton developed for the RLS s approxmate as we show later) and 2) The evaluaton of the moment of the random varable u 2 P, where u s nput to the RLS flter and P s the estmate of the nverse of nput covarance matrx by assumng that u and P are ndependent whch s not true). These assumptons could result n negatve value of the stead-state Excess Mean Square Error EMSE). To overcome these ssues, we modfy the energy relaton wthout mposng any approxmaton. Based on modfed energy relaton, we derve the steady-state EMSE and two upper bounds on the EMSE. For that, we derve closed from expresson for the aforementoned moment whch s based on fndng the cumulatve dstrbuton functon CDF) of the random varable of the form + u 2 D, where u s correlated crcular Gaussan nput and D s a dagonal matrx. Smulaton results corroborate our analytcal fndngs. Index Terms Adaptve Flters, RLS, Steady-state analyss, Mean square analyss, Excess Mean-Squares-Error. INTRODUCTION The RLS s one of the mportant algorthm from the adaptve flter s famly. Motvaton for the RLS adaptve flters reles on the fact that t provde a soluton to the least square error mnmzaton problem. The RLS algorthms are more costler than the basc famles such as the Leat mean squares famly LMS) but wth much faster convergence speed. Analyzng the performance of the RLS algorthm s not an easy task due to the presence of the nput covarance matrx and ts nverse whch depend on current and past nput regressors. As such, only a few works consdered the performance of the RLS and ts varants, 2, 3, 4, 5, 6, 7, 8, 9, 0,, 2. The smplest approach s based on the energy relaton 9, 3 whch wth the ad of separaton prncple 9) can be used to state that the EMSE s a functon of the moment E u 2 P, where u s the nput regressor and P s the estmate of the nverse of nput covarance matrx. Another separaton prncple s then used to wrte E u 2 P = T reu u P ). But ths approach s not rgorous as u and P are dependent. Other approaches use the dea of random matrx to study the performance of the RLS 0,. In addton to requrng a much more sophstcated machnery, these approaches are vald for flters relatvely larger szes. In ths work, we perform steady-state analyss of the RLS algorthm for correlated crcular Gaussan nputs. The approach s based on evaluatng the CDF and the moments of random varable of the form z = where u s a correlated crcular Gaussan vector and D s a dagonal matrx. To + u 2 D evaluate the CDF, we replace the step functon wth ts equvalent Fourer transform and employ complex ntegraton. Usng ths CDF, we evaluate n closed form the requred moment that appear n the steady-state mean-square analyss of RLS algorthm. 2. THE EXPONENTIALLY WEIGHTED RLS ALGORITHM The exponentally weghted RLS attempts to solve the followng problem mn N+) w Πw + y N H N w) Γ N y N H N w) w ) n a recursve manner. Here y N = d0), d),, dn) T s the measurements vector and H N s the N + M) For any matrx D, the quadratc form u 2 D s defned as u 2 D u Du where the notaton ) denotes conjugate transposton. = /8/$ IEEE 439 ICASSP 208
2 data matrx consstng of N + ) row regressor vectors u k and Γ N = dag{ N, N,...,, } s a dagonal weghtng matrx defned n terms of the forgettng factor 0 ). It can be shown that the soluton of ) s w N = P N H N Γ Ny N. The RLS allows us to obtan the soluton of ) n a recursve manner. Specfcally, we have where w = w + P u d) u w 2) P = P P u u P + u P u whch s ntalzed wth w = 0 and = Π. 3. THE CONVENTIONAL ENERGY RELATION FOR THE RLS In the system dentfcaton model, the measurement d) takes the form d) = u wo + v) where v) s an addtve nose and w o s the system coeffcents. We can thus defne the weght error vector as w = w o w and wrte 2) as 3) w = w P u e) 4) where e) = d) u w whch s called the estmaton error. Two other error measures are the a pror and a posteror estmaton errors defned by respectvely e a ) = u w, e p ) = u w. If we multply both sdes of 4) from the left by u we obtan e p ) = e a ) u 2 P e) 5) Next, by evaluatng the energes of both sdes of 4) wth the ad of 5) wll lead to the well known Energy Conservaton Relaton 9 gven by ea ) 2 ep ) 2 E u 2 = E P u 2 6) P Fnally, by usng 5) and the fact that e) = e a ) + v), we can show that σ 2 ve u 2 P + E u 2 P e a ) 2) = 2E e a ) 2 7) Ths relaton can be used to evaluate the steady-state EMSE whch s defned as ζ = lm E e a ) Approach of 9 and ts Drawbacks The approach of 9 hss followng drawbacks:. In the development of the energy relaton 7), t assumes lm E w 2 = lm E w 2 whch s not true because the norms w 2 and w 2 are not weghted by ther respectve P matrces. 2. It assumes that u and P are ndependent whch s not true as can be seen from 3) whch shows that P s a functon of u and P ). As a result, the moment E u 2 P s approxmated as lm E u 2 P = E u 2 lm EP = T rrp) 8) where T r represents the trace operator, P = lm EP and R = Eu u 3. It assumes that the expectaton of the nverse of P s equal to the nverse of expectaton of P,.e., P lm EP ) = )R 9) whch s also not true n general. By employng 8) and 9), the requred moment s approxmated as E u 2 P TraceRP) )M. Thus, the EMSE proposed by 9 s found to be ζ σ2 v )M 2 )M 0) The problem wth the above result s that t wll gve negatve values of EMSE for the scenaro of )M > 2 and a value of nfnty at )M = 2 whch are not realzable. In order to deal wth the above lmtatons, we propose to modfy the energy relaton whch s presented next. 4. OUR APPROACH: MODIFIED ENERGY RELATION FOR THE RLS In the proposed approach, we modfy the energy relaton by rewrtng w 2 n terms of. Ths s done by expressng the n terms of usng the relaton P = + u u whch modfes the term w 2 to w 2 = w 2 + e a ) 2 ) By usng the above, the modfed energy relaton takes the form w 2 + e a) 2 u 2 P = w 2 + e a ) 2 + e p) 2 u 2 P 2) Now, by replacng e p ) 2 by ts equvalent expresson n 5) and by assumng that lm w 2 = lm w 2 yelds v 2 u 2 P + u 2 P e a ) 2 = e a ) 2 + ) w 2 3) 440
3 Next, we evaluate the term w 2 = + u u whch results n w 2 usng the relaton = w 2 + w 2 u 4) u But w 2 u u s nothng but e p) 2. As a result, the energy relaton n 3) can be rewrtten as v 2 u 2 P + u 2 P e a ) 2 = e a ) 2 + ) w 2 + ) e p ) 2 5) In the ensung secton, we derve the steady-state EMSE and ts upper bounds usng the modfed energy relaton 5). Thus, wth the ad of the above defnton and the relaton gven n 5), the relaton 8) results n the followng expresson for the steady-state EMSE ζ = σ2 v + EZ 2EZ )EZ 2 ) + EZ + )EZ 2 2) where we have employed the separaton prncple for the e terms E a) 2 e + u and E a) 2 2 P + u. It can be seen 2 P ) 2 from 2) that the calculaton of EMSE requres the evaluaton of EZ and EZ 2 whch are provded n Appendx. 6. UPPER BOUNDS ON THE EMSE 5. PROPOSED STEADY-STATE EMSE In ths secton, wth the ad of separaton prncple, we evaluate the expresson for the steady-state EMSE of the RLS by usng the modfed energy relaton derved n 5). We start by takng expectaton on both sdes of 5) to arrve at σ 2 ve u 2 P + E u 2 P e a ) 2 = E e a ) 2 + )E w 2 + )E e p ) 2 6) Snce s a functon of {u j} for all j < and the ndependence assumpton dctates us that w s ndependent of u j for all j <, we conclude that w s ndependent of. Hence, the term E w 2 can be smplfed to E w 2 = E w 2 E = E w 2 R = E e a) 2 ) ) 7) where we have used the facts that E = R ) and E w 2 R = E e a) 2. Thus, the relaton n 6) can be set up as σ 2 ve u 2 P + E u 2 P e a ) 2 = + )E e a ) 2 + )E e p ) 2 8) To proceed further, we replace u 2 P n 8) by ts equvalent representaton 2 u 2 P = u 2 P + u 2 P = + u 2 P 9) At ths stage, we defne the followng random varable Z = + u 2 P 20) 2 Ths equvalent representaton s obtaned by pre and post multplyng 3) by u and u, respectvely. In ths secton, we am to derve upper bounds on the EMSE of the RLS wthout nvokng the separaton prncplefor two extreme scenaros: large values of as ) and small vaues of as 0). 6.. Upper Bound for Large Values of Startng wth 5) and by takng expectaton wth the ad of the result n 7 and the alternate expresson for u 2 P, we can show that σve u 2 2 P = + 2 )ζ + )E w 2 u 2 P + )E e p ) 2 + u 2 P ) 22) To obtan the upper bound on the EMSE, we drop the last two terms on the rght hand sde of the above havng the term ) whch s also a good approxmaton of the EMSE for larger values of as ) approaches to zero as approaches to unty. As a result, we arrve to the followng upper bound on the EMSE σve u 2 2 P ζ + 2 = σ2 vt rrp) 23) + 2 where we have used the fact that lm E u 2 = P T rrp) because P s ndependent of u Upper Bound for Small Values of We agan start wth 5) to develop the upper bound for smaller values of. By droppng the term ) w 2 and approxmatng the term ) as unty whch s true for small values of ), we can have the followng nequalty v 2 u 2 P + u 2 P e a ) 2 e a ) 2 + e p ) 2 24) Now, usng 5) and alternatve representaton of u 2 P gven n 9), the above relaton results n v 2 u 2 P 2 e a ) 2 + e a ) 2 u 2 P 25) 44
4 EMSE of 9 EMSE va Smulatons EMSE va Proposed Approach Proposed Upper Bound For Small EMSE va Smulatons EMSE va Proposed Approach EMSE db) 4 EMSE db) Fg.. EMSE of the RLS versus forgettng factor. Fg. 3. Upper Bound for small. EMSE db) Proposed Upper Bound For Large EMSE va Smulatons EMSE va Proposed Approach Fg. 2. Upper Bound for Large. Next, by takng expectaton on both sdes of the above gves us σ 2 ve u 2 P 2E e a ) 2 + E e a ) 2 u 2 P 26) Fnally, by droppng the second term from the rght hand sde of 26) and usng the fact that P s ndependent of u, we get the followng upper bound on the EMSE ζ σ2 vt rrp) 2 7. SIMULATION RESULTS 27) In smulatons, the steady-state performance of the RLS algorthm s nvestgated for an unknown system dentfcaton wth w o = , , , , T. The nose s zero mean..d wth varance σ 2 v = Input to the adaptve flter and to the unknown system s correlated crcular complex Gaussan havng correlaton R, j) = α j c 0 < α c < ). We frst compare our derved EMSE gven n 2)) wth the one obtaned va smulatons and the one proposed n 9 n Fg. 2. It can be depcted from the fgure that the proposed EMSE result has a good match wth the smulaton for larger values of say > 0.8) but t gves a poor estmate for smaller values of. Ths devaton s because of employng the separaton prncple whch s not vald for smaller values of. On the other hand, the EMSE usng 9 gves postve values only for larger forgettng factor.e., 9. Ths s because of the fact that the EMSE expresson gven n 9 becomes unrealstc negatve or nfnty) for )M 2. In contrast, our approach s vald for all values of and M. Next, n Fg. 2, the upper bound for large gven n 23)) s compared wth the EMSE va smulaton and usng 2). It can be depcted from the result and ts zoomed vew that the proposed upper bound s tght and very close to the smulaton result partcularly for large values of. Fnally, n Fg. 3, the upper bound for small gven n 27)) s plotted whch also shows that ths upper bound s also close to the EMSE va smulatons near small values of. 8. CONCLUSION In ths work, we analyze the RLS algorthm at steady state for correlated complex Gaussan nput and we evaluate ts steady-state EMSE. The novelty of the work resdes n three aspects: frst n the modfcaton of energy relaton, second n the evaluaton of the moment E u 2 P whch s based on the dervaton of a closed form expresson for the CDF and moment of random varable of the form + u 2 D, and thrd n dervaton of upper bounds on the EMSE for both large and small values of. Smulaton results show that, unlke the prevous work, EMSE va our approach s vald for a vde range of. Also, the derved upper bounds are very close to the smulatons n ther respectve ranges. APPENDIX: Moments of the Random Varable Z We evaluate the requred moments of Z by frst evaluatng ts CDF usng the approach of 4, 5 and are found to be and EZ = M EZ 2 = 2 M m= m= E2 )e fm M = f f m m e fm E 2 ) + E 3 ) 2 M = f f m m ) 28) 29) 442
5 9. REFERENCES E. Eleftherou and D. Falconer, Trackng propertes and steady-state performance of RLS adaptve flter algorthms, IEEE Transactons on Acoustcs, Speech and Sgnal Processng, vol. 34, no. 5, pp , L. L. L. Guo and P. Prouret, Performance analyss of the forgettng factor rls algorthm, Int. J. Adaptve Contr. Sgnal Processng, vol. 7, pp , P. S. R. Dnz and M. G. Squera, Analyss of the qrrls algorthm for colored-nput sgnals, Proc. IEEE Int. Conf. Acoust., Speech, Sgnal Process., T. Al-Naffour and B. Hassb, On the dstrbuton of ndefnte quadratc forms n gaussan random varables, n IEEE Internatonal Symposum on Informaton Theory, ISIT 2009, pp , T. Y. Al-Naffour, M. Monuddn, N. Ajeeb, B. Hassb, and A. L. Moustakas, On the Dstrbuton of Indefnte Quadratc Forms n Gaussan Random Varables, IEEE Transactons on Communcatons, vol. 64, no., pp , G. V. Moustakdes, Study of the transent phase of the forgettng factor rls, IEEE Transactons on Sgnal Processng, vol. 45, no. 0, pp , S. S. Haykn, Adaptve flter theory. Upper Saddle Rver, N.J.: Prentce Hall, S. M. Y. Engel and R. Mer, The kernel recursve leastsquares algorthm, IEEE Transactons on Sgnal Processng, vol. 52, no. 8, pp , Aug M. L. Chebolu and S. K. Jayaweera, Energy effcency analyss of an rls-based adaptve sgnal processng algorthm for energy aware sensor networks, Proceedngs of 2005 Internatonal Conference on Intellgent Sensng and Informaton Processng, Jan X.-D. Z. Z-Zhe Dng and Y.-T. Su, Study of the transent phase of the forgettng factor rls, IEEE Sgnal Processng Letters, vol. 4, pp. 4, A. H. Sayed, Adaptve Flters. Wley-IEEE Press, ed., Aprl A. Vakl and B. Hassb, A steltjes transform approach for analyzng the RLS adaptve flter, n th Annual Allerton Conference on Communcaton, Control, and Computng, pp , M. Pajovc and J. C. Presg, Performance analyss of the least squares based lt channel dentfcaton algorthm usng random matrx methods, 49th Annual Allerton Conference on Communcaton, Control, and Computng Allerton), pp , Montcello, G. Mateos and G. B. Gannaks, Dstrbuted recursve least-squares: Stablty and performance analyss, IEEE Transactons on Sgnal Processng, vol. 60, pp , Aprl T. Y. Al-Naffour and A. H. Sayed, Transent analyss of data normalzed adaptve flters, IEEE Transactons on Sgnal Processng, vol. 5, no. 3, pp , Mar
Linear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationChat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980
MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and
More informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
More informationSupplementary material: Margin based PU Learning. Matrix Concentration Inequalities
Supplementary materal: Margn based PU Learnng We gve the complete proofs of Theorem and n Secton We frst ntroduce the well-known concentraton nequalty, so the covarance estmator can be bounded Then we
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationComputation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models
Computaton of Hgher Order Moments from Two Multnomal Overdsperson Lkelhood Models BY J. T. NEWCOMER, N. K. NEERCHAL Department of Mathematcs and Statstcs, Unversty of Maryland, Baltmore County, Baltmore,
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationadaptive filter. However, the transient behavior of the INSAF algorithm has not been studied. In this paper, we focus on studying the
Performance Analyses of Nose-Robust Normalzed Subband Adaptve Flter Algorthm 1 Y Yu a, Haquan Zhao b, Badong Chen c, Wenyuan Wang b, Lu Lu d Abstract: hs paper studes the statstcal models of the nose-robust
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Mamum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models for
More informationComparison of Wiener Filter solution by SVD with decompositions QR and QLP
Proceedngs of the 6th WSEAS Int Conf on Artfcal Intellgence, Knowledge Engneerng and Data Bases, Corfu Island, Greece, February 6-9, 007 7 Comparson of Wener Flter soluton by SVD wth decompostons QR and
More informationDifferentiating Gaussian Processes
Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationGaussian process classification: a message-passing viewpoint
Gaussan process classfcaton: a message-passng vewpont Flpe Rodrgues fmpr@de.uc.pt November 014 Abstract The goal of ths short paper s to provde a message-passng vewpont of the Expectaton Propagaton EP
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationIdentification of Linear Partial Difference Equations with Constant Coefficients
J. Basc. Appl. Sc. Res., 3(1)6-66, 213 213, TextRoad Publcaton ISSN 29-434 Journal of Basc and Appled Scentfc Research www.textroad.com Identfcaton of Lnear Partal Dfference Equatons wth Constant Coeffcents
More informationStatistical pattern recognition
Statstcal pattern recognton Bayes theorem Problem: decdng f a patent has a partcular condton based on a partcular test However, the test s mperfect Someone wth the condton may go undetected (false negatve
More informationEffects of Ignoring Correlations When Computing Sample Chi-Square. John W. Fowler February 26, 2012
Effects of Ignorng Correlatons When Computng Sample Ch-Square John W. Fowler February 6, 0 It can happen that ch-square must be computed for a sample whose elements are correlated to an unknown extent.
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More information1 Convex Optimization
Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,
More informationJoint Statistical Meetings - Biopharmaceutical Section
Iteratve Ch-Square Test for Equvalence of Multple Treatment Groups Te-Hua Ng*, U.S. Food and Drug Admnstraton 1401 Rockvlle Pke, #200S, HFM-217, Rockvlle, MD 20852-1448 Key Words: Equvalence Testng; Actve
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede
Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also
More informationCALCULUS CLASSROOM CAPSULES
CALCULUS CLASSROOM CAPSULES SESSION S86 Dr. Sham Alfred Rartan Valley Communty College salfred@rartanval.edu 38th AMATYC Annual Conference Jacksonvlle, Florda November 8-, 202 2 Calculus Classroom Capsules
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationSTATS 306B: Unsupervised Learning Spring Lecture 10 April 30
STATS 306B: Unsupervsed Learnng Sprng 2014 Lecture 10 Aprl 30 Lecturer: Lester Mackey Scrbe: Joey Arthur, Rakesh Achanta 10.1 Factor Analyss 10.1.1 Recap Recall the factor analyss (FA) model for lnear
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationU-Pb Geochronology Practical: Background
U-Pb Geochronology Practcal: Background Basc Concepts: accuracy: measure of the dfference between an expermental measurement and the true value precson: measure of the reproducblty of the expermental result
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationNon-linear Canonical Correlation Analysis Using a RBF Network
ESANN' proceedngs - European Smposum on Artfcal Neural Networks Bruges (Belgum), 4-6 Aprl, d-sde publ., ISBN -97--, pp. 57-5 Non-lnear Canoncal Correlaton Analss Usng a RBF Network Sukhbnder Kumar, Elane
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationMatrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD
Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationEIGENVALUE DISTRIBUTION OF THE CORRELATION MATRIX IN L`-FILTERS. Constantine Kotropoulos and Ioannis Pitas
EIGEVALUE DISTRIBUTIO OF THE CORRELATIO MATRI I L`-FILTERS Constantne Kotropoulos and Ioanns Ptas Dept of Informatcs, Arstotle Unversty of Thessalonk Box, Thessalonk 0 0, GREECE fcostas, ptas g@zeuscsdauthgr
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationSystems of Equations (SUR, GMM, and 3SLS)
Lecture otes on Advanced Econometrcs Takash Yamano Fall Semester 4 Lecture 4: Sstems of Equatons (SUR, MM, and 3SLS) Seemngl Unrelated Regresson (SUR) Model Consder a set of lnear equatons: $ + ɛ $ + ɛ
More informationDurban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications
Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department
More informationUNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours
UNIVERSITY OF TORONTO Faculty of Arts and Scence December 005 Examnatons STA47HF/STA005HF Duraton - hours AIDS ALLOWED: (to be suppled by the student) Non-programmable calculator One handwrtten 8.5'' x
More informationExercises of Chapter 2
Exercses of Chapter Chuang-Cheh Ln Department of Computer Scence and Informaton Engneerng, Natonal Chung Cheng Unversty, Mng-Hsung, Chay 61, Tawan. Exercse.6. Suppose that we ndependently roll two standard
More informationNatural Images, Gaussian Mixtures and Dead Leaves Supplementary Material
Natural Images, Gaussan Mxtures and Dead Leaves Supplementary Materal Danel Zoran Interdscplnary Center for Neural Computaton Hebrew Unversty of Jerusalem Israel http://www.cs.huj.ac.l/ danez Yar Wess
More informationThe Concept of Beamforming
ELG513 Smart Antennas S.Loyka he Concept of Beamformng Generc representaton of the array output sgnal, 1 where w y N 1 * = 1 = w x = w x (4.1) complex weghts, control the array pattern; y and x - narrowband
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationSpeech and Language Processing
Speech and Language rocessng Lecture 3 ayesan network and ayesan nference Informaton and ommuncatons Engneerng ourse Takahro Shnozak 08//5 Lecture lan (Shnozak s part) I gves the frst 6 lectures about
More informationOn the Correlation between Boolean Functions of Sequences of Random Variables
On the Correlaton between Boolean Functons of Sequences of Random Varables Farhad Shran Chaharsoogh Electrcal Engneerng and Computer Scence Unversty of Mchgan Ann Arbor, Mchgan, 48105 Emal: fshran@umch.edu
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationRadar Trackers. Study Guide. All chapters, problems, examples and page numbers refer to Applied Optimal Estimation, A. Gelb, Ed.
Radar rackers Study Gude All chapters, problems, examples and page numbers refer to Appled Optmal Estmaton, A. Gelb, Ed. Chapter Example.0- Problem Statement wo sensors Each has a sngle nose measurement
More information5 The Laplace Equation in a convex polygon
5 Te Laplace Equaton n a convex polygon Te most mportant ellptc PDEs are te Laplace, te modfed Helmoltz and te Helmoltz equatons. Te Laplace equaton s u xx + u yy =. (5.) Te real and magnary parts of an
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationMulti-dimensional Central Limit Argument
Mult-dmensonal Central Lmt Argument Outlne t as Consder d random proceses t, t,. Defne the sum process t t t t () t (); t () t are d to (), t () t 0 () t tme () t () t t t As, ( t) becomes a Gaussan random
More informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More information8.592J: Solutions for Assignment 7 Spring 2005
8.59J: Solutons for Assgnment 7 Sprng 5 Problem 1 (a) A flament of length l can be created by addton of a monomer to one of length l 1 (at rate a) or removal of a monomer from a flament of length l + 1
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationSupplemental document
Electronc Supplementary Materal (ESI) for Physcal Chemstry Chemcal Physcs. Ths journal s the Owner Socetes 01 Supplemental document Behnam Nkoobakht School of Chemstry, The Unversty of Sydney, Sydney,
More information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More information: 5: ) A
Revew 1 004.11.11 Chapter 1: 1. Elements, Varable, and Observatons:. Type o Data: Qualtatve Data and Quanttatve Data (a) Qualtatve data may be nonnumerc or numerc. (b) Quanttatve data are always numerc.
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationComputing MLE Bias Empirically
Computng MLE Bas Emprcally Kar Wa Lm Australan atonal Unversty January 3, 27 Abstract Ths note studes the bas arses from the MLE estmate of the rate parameter and the mean parameter of an exponental dstrbuton.
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationMulti-dimensional Central Limit Theorem
Mult-dmensonal Central Lmt heorem Outlne ( ( ( t as ( + ( + + ( ( ( Consder a sequence of ndependent random proceses t, t, dentcal to some ( t. Assume t = 0. Defne the sum process t t t t = ( t = (; t
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More information