Robust Linear Regression: A Review and Comparison

Size: px
Start display at page:

Download "Robust Linear Regression: A Review and Comparison"

Transcription

1 Roust Liner Regression: A Review nd Comprison rxiv: v1 [stt.me] 24 Apr 2014 Chun Yu 1, Weixin Yo 1, nd Xue Bi 1 1 Deprtment of Sttistis, Knss Stte University, Mnhttn, Knss, USA Astrt Ordinry lest-squres (OLS) estimtors for liner model re very sensitive to unusul vlues in the design spe or outliers mong y vlues. Even one single typil vlue my hve lrge effet on the prmeter estimtes. This rtile ims to review nd desrie some ville nd populr roust tehniques, inluding some reent developed ones, nd ompre them in terms of rekdown point nd effiieny. In ddition, we lso use simultion study nd rel dt pplition to ompre the performne of existing roust methods under different senrios. Key words: Brekdown point; Roust estimte; Liner Regression. 1 Introdution Liner regression hs een one of the most importnt sttistil dt nlysis tools. Given the independent nd identilly distriuted (iid) oservtions (x i, y i ), i = 1,..., n, 1

2 in order to understnd how the response y i s re relted to the ovrites x i s, we trditionlly ssume the following liner regression model y i = x T i β + ε i, (1.1) where β is n unknown p 1 vetor, nd the ε i s re i.i.d. nd independent of x i with E(ε i x i ) = 0. The most ommonly used estimte for β is the ordinry lest squre (OLS) estimte whih minimizes the sum of squred residuls n (y i x T i β) 2. (1.2) However, it is well known tht the OLS estimte is extremely sensitive to the outliers. A single outlier n hve lrge effet on the OLS estimte. In this pper, we review nd desrie some ville roust methods. In ddition, simultion study nd rel dt pplition re used to ompre different existing roust methods. The effiieny nd rekdown point (Donoho nd Huer 1983) re two trditionlly used importnt riteri to ompre different roust methods. The effiieny is used to mesure the reltive effiieny of the roust estimte ompred to the OLS estimte when the error distriution is extly norml nd there re no outliers. Brekdown point is to mesure the proportion of outliers n estimte n tolerte efore it goes to infinity. In this pper, finite smple rekdown point (Donoho nd Huer 1983) is used nd defined s follows: Let z i = (x i, y i ). Given ny smple z = (z i,..., z n ), denote T (z) the estimte of the prmeter β. Let z e the orrupted smple where ny m of the originl points of z re repled y ritrry d dt. Then the finite smple rekdown point δ is defined s { } m δ (z, T ) = min 1 m n n : sup T (z ) T (z) =, (1.3) z 2

3 where is Euliden norm. Mny roust methods hve een proposed to hieve high rekdown point or high effiieny or oth. M-estimtes (Huer, 1981) re solutions of the norml eqution with pproprite weight funtions. They re resistnt to unusul y oservtions, ut sensitive to high leverge points on x. Hene the rekdown point of n M-estimte is 1/n. R-estimtes (Jekel 1972) whih minimize the sum of sores of the rnked residuls hve reltively high effiieny ut their rekdown points re s low s those of OLS estimtes. Lest Medin of Squres (LMS) estimtes (Siegel 1982) whih minimize the medin of squred residuls, Lest Trimmed Squres (LTS) estimtes (Rousseeuw 1983) whih minimize the trimmed sum of squred residuls, nd S-estimtes (Rousseeuw nd Yohi 1984) whih minimize the vrine of the residuls ll hve high rekdown point ut with low effiieny. Generlized S-estimtes (GS-estimtes) (Croux et l. 1994) mintin high rekdown point s S-estimtes nd hve slightly higher effiieny. MM-estimtes proposed y Yohi (1987) n simultneously ttin high rekdown point nd effiienies. Mllows Generlized M-estimtes (Mllows 1975) nd Shweppe Generlized M-estimtes (Hndshin et l. 1975) downweight the high leverge points on x ut nnot distinguish good nd d leverge points, thus resulting in loss of effiienies. In ddition, these two estimtors hve low rekdown points when p, the numer of explntory vriles, is lrge. Shweppe one-step (S1S) Generlized M-estimtes (Cokley nd Hettmnsperger 1993) overome the prolems of Shweppe Generlized M-estimtes nd re lulted in one step. They oth hve high rekdown points nd high effiienies. Reently, Gervini nd Yohi (2002) proposed new lss of high rekdown point nd high effiieny roust estimte lled roust nd effiient weighted lest squres estimtor (REWLSE). Lee et l. (2011) nd She nd Owen (2011) proposed new lss of roust methods sed on the regulriztion of sespeifi prmeters for eh response. They further proved tht the M-estimtor with 3

4 Huer s ψ funtion is speil se of their proposed estimtor. The rest of the pper is orgnized s follows. In Setion 2, we review nd desrie some of the ville roust methods. In Setion 3, simultion study nd rel dt pplition re used to ompre different roust methods. Some disussions re given in Setion 4. 2 Roust Regression Methods 2.1 M-Estimtes By repling the lest squres riterion (1.2) with roust riterion, M-estimte (Huer, 1964) of β is ˆβ = rg min β n ( ) yi x T i β ρ, (2.1) ˆσ where ρ( ) is roust loss funtion nd ˆσ is n error sle estimte. The derivtive of ρ, denoted y ψ( ) = ρ ( ), is lled the influene funtion. In prtiulr, if ρ(t) = 1 2 t2, then the solution is the OLS estimte. The OLS estimte is very sensitive to outliers. Rousseeuw nd Yohi (1984) indited tht OLS estimtes hve rekdown point (BP) of BP = 1/n, whih tends to zero when the smple size n is getting lrge. Therefore, one single unusul oservtion n hve lrge impt on the OLS estimte. One of the ommonly used roust loss funtions is Huer s ψ funtion (Huer 1981), where ψ (t) = ρ (t) = mx{, min(, t)}. Huer (1981) reommends using = in prtie. This hoie produes reltive effiieny of pproximtely 95% when the error density is norml. Another possiility for ψ( ) is Tukey s isqure funtion ψ (t) = t{1 (t/) 2 } 2 +. The use of = produes 95% effiieny. If ρ(t) = t, then lest solute devition (LAD, lso lled medin regression) estimtes re hieved y 4

5 minimizing the sum of the solute vlues of the residuls ˆβ = rg min β n yi x T i β. (2.2) The LAD is lso lled L 1 estimte due to the L 1 norm used. Although LAD is more resistent thn OLS to unusul y vlues, it is sensitive to high leverge outliers, nd thus hs rekdown point of BP = 1/n 0 (Rousseeuw nd Yohi 1984). Moreover, LAD estimtes hve low effiieny of 0.64 when the errors re normlly distriuted. Similr to LAD estimtes, the generl monotone M-estimtes, i.e., M-estimtes with monotone ψ funtions, hve BP = 1/n 0 due to lk of immunity to high leverge outliers (Mronn, Mrtin, nd Yohi 2006). 2.2 LMS Estimtes The LMS estimtes (Siegel 1982) re found y minimizing the medin of the squred residuls ˆβ = rg min β Med{( y i x T i β ) 2 }. (2.3) One good property of the LMS estimte is tht it possesses high rekdown point of ner 0.5. However, the LMS estimte hs t est n effiieny of 0.37 when the ssumption of norml errors is met (see Rousseeuw nd Croux 1993). Moreover, LMS estimtes do not hve well-defined influene funtion euse of its onvergene rte of n 1 3 (Rousseeuw 1982). Despite these limittions, the LMS estimte n e used s the initil estimte for some other high rekdown point nd high effiieny roust methods. 5

6 2.3 LTS Estimtes The LTS estimte (Rousseeuw 1983) is defined s ˆβ = rg min β q r (i) (β) 2, (2.4) where r (i) (β) = y (i) x T (i) β, r (1) (β) 2 r (q) (β) 2 re ordered squred residuls, q = [n (1 α) + 1], nd α is the proportion of trimming. Using q = ( n 2 ) +1 ensures tht the estimtor hs rekdown point of BP = 0.5, nd the onvergene rte of n 1 2 (Rousseeuw 1983). Although highly resistent to outliers, LTS suffers dly in terms of very low effiieny, whih is out 0.08, reltive to OLS estimtes (Stromerg, et l. 2000). The reson tht LTS estimtes ll ttentions to us is tht it is trditionlly used s the initil estimte for some other high rekdown point nd high effiieny roust methods. 2.4 S-Estimtes S-estimtes (Rousseeuw nd Yohi 1984) re defined y ˆβ = rg min β ˆσ (r 1 (β),, r n (β)), (2.5) where r i (β) = y i x T i β nd ˆσ (r 1 (β),, r n (β)) is the sle M-estimte whih is defined s the solution of 1 n n ( ) ri (β) ρ = δ, (2.6) ˆσ for ny given β, where δ is tken to e E Φ [ρ (r)]. For the iweight sle, S-estimtes n ttin high rekdown point of BP = 0.5 nd hs n symptoti effiieny of 0.29 under the ssumption of normlly distriuted errors (Mronn, Mrtin, nd Yhi 2006). 6

7 2.5 Generlized S-Estimtes (GS-Estimtes) Croux et l. (1994) proposed generlized S-estimtes in n ttempt to improve the low effiieny of S-estimtors. Generlized S-estimtes re defined s ˆβ = rg min β S n(β), (2.7) where S n (β) is defined s S n (β) = sup { S > 0; ( ) 1 n ( ri r j ρ 2 S i<j ) k n,p }, (2.8) where r i = y i x T i β, p is the numer of regression prmeters, nd k n,p is onstnt whih might depend on n nd p. Prtiulrly, if ρ(x) = I( x 1) nd k n,p = (( n ) ( 2 hp ) ) ( / n ) 2 with hp = n+p+1, generlized S-estimtor yields speil se, the 2 lest qurtile differene (LQD) estimtor, whih is defined s ˆβ = rg min β Q n(r 1,..., r n ), (2.9) where Q n = { r i r j ; i < j} ( hp 2 ) (2.10) is the ( h p 2 ) th order sttisti mong the ( n 2) elements of the set { ri r j ; i < j}. Generlized S-estimtes hve rekdown point s high s S-estimtes ut with higher effiieny. 2.6 MM-Estimtes First proposed y Yohi (1987), MM-estimtes hve eome inresingly populr nd re one of the most ommonly employed roust regression tehniques. The MM-estimtes 7

8 n e found y three-stge proedure. In the first stge, ompute n initil onsistent estimte ˆβ 0 with high rekdown point ut possily low norml effiieny. In the seond stge, ompute roust M-estimte of sle ˆσ of the residuls sed on the initil estimte. In the third stge, find n M-estimte ˆβ strting t ˆβ 0. In prtie, LMS or S-estimte with Huer or isqure funtions is typilly used s the initil estimte ˆβ 0. Let ρ 0 (r) = ρ 1 (r/k 0 ), ρ(r) = ρ 1 (r/k 1 ), nd ssume tht eh of the ρ-funtions is ounded. The sle estimte ˆσ stisfies 1 n n ρ 0 r i (ˆβ) ˆσ = 0.5. (2.11) If the ρ-funtion is iweight, then k 0 = 1.56 ensures tht the estimtor hs the symptoti BP = 0.5. Note tht n M-estimte minimizes L(β) = (ˆβ) n ρ r i. (2.12) ˆσ Let ρ stisfy ρ ρ 0. Yohi (1987) showed tht if ˆβ stisfies L(ˆβ) (ˆβ 0 ), then ˆβ s BP is not less thn tht of ˆβ 0. Furthermore, the rekdown point of the MM-estimte depends only on k 0 nd the symptoti vrine of the MM-estimte depends only on k 1. We n hoose k 1 in order to ttin the desired norml effiieny without ffeting its rekdown point. In order to let ρ ρ 0, we must hve k 1 k 0 ; the lrger the k 1 is, the higher effiieny the MM-estimte n ttin t the norml distriution. Mronn, Mrtin, nd Yhi (2006) provides the vlues of k 1 with the orresponding effiienies of the iweight ρ-funtion. Plese see the following tle for more detil. Effiieny k However, Yohi (1987) indites tht MM-estimtes with lrger vlues of k 1 re more 8

9 sensitive to outliers thn the estimtes orresponding to smller vlues of k 1. In prtie, n MM-estimte with isqure funtion nd effiieny 0.85 (k 1 = 3.44) strting from isqure S-estimte is reommended. 2.7 Generlized M-Estimtes (GM-Estimtes) Mllows GM-estimte In order to mke M-estimte resistent to high leverge outliers, Mllows (1975) proposed Mllows GM-estimte tht is defined y ) n r i (ˆβ w i ψ ˆσ x i = 0, (2.13) where ψ(e) = ρ (e) nd w i = 1 h i with h i eing the leverge of the ith oservtion. The weight w i ensures tht the oservtion with high leverge reeives less weight thn oservtion with smll leverge. However, even good leverge points tht fll in line with the pttern in the ulk of the dt re down-weighted, resulting in loss of effieny Shweppe GM-estimte Shweppe GM-estimte (Hndshin et l. 1975) is defined y the solution of ) n r i (ˆβ w i ψ w iˆσ x i = 0, (2.14) whih djusts the leverge weights ording to the size of the residul r i. Crroll nd Welsh (1988) proved tht the Shweppe estimtor is not onsistent when the errors re symmetri. Furthermore, the rekdown points for oth Mllows nd Shweppe GMestimtes re no more thn 1/(p + 1), where p is the numer of unknown prmeters. 9

10 2.7.3 S1S GM-estimte Cokley nd Hettmnsperger (1993) proposed Shweppe one-step (S1S) estimte, whih extends from the originl Shweppe estimtor. S1S estimtor is defined s ˆβ = ˆβ n 0 + ψ ) (ˆβ0 r i ˆσw i 1 x i x i ) n ˆσw i ψ r i (ˆβ0 x i, (2.15) ˆσw i where the weight w i is defined in the sme wy s Shweppe s GM-estimte. The method for S1S estimte is different from the Mllows nd Shweppe GMestimtes in tht one the initil estimtes of the residuls nd the sle of the residuls re given, finl M-estimtes re lulted in one step rther thn itertively. Cokley nd Hettmnsperger (1993) reommended to use Rousseeuw s LTS for the initil estimtes of the residuls nd LMS for the initil estimtes of the sle nd proved tht the S1S estimte gives rekdown point of BP = 0.5 nd results in 0.95 effiieny ompred to the OLS estimte under the Guss-Mrkov ssumption. 2.8 R-Estimtes The R-estimte (Jekel 1972) minimizes the sum of some sores of the rnked residuls n n (R i ) r i = min, (2.16) where R i represents the rnk of the ith residul r i, nd n ( ) is monotone sore funtion tht stisfies n n (i) = 0. (2.17) R-estimtes re sle equivlent whih is n dvntge ompred to M-estimtes. However, the optiml hoie of the sore funtion is unler. In ddition, most of R-estimtes 10

11 hve rekdown point of BP = 1/n 0. The ounded influene R-estimtor proposed y Nrnjo nd Hettmnsperger (1994) hs firly high effiieny when the errors hve norml distriution. However, it is proved tht their rekdown point is no more thn REWLSE Gervini nd Yohi (2002) proposed new lss of roust regression method lled roust nd effiient weighted lest squres estimtor (REWLSE). REWLSE is muh more ttrtive thn mny other roust estimtors due to its simultneously ttining mximum rekdown point nd full effiieny under norml errors. This new estimtor is type of weighted lest squres estimtor with the weights dptively lulted from n initil roust estimtor. Consider pir of initil roust estimtes of regression prmeters nd sle, ˆβ 0 nd ˆσ respetively, the stndrdized residuls re defined s r i = y i x T ˆβ i 0. ˆσ A lrge vlue of r i would suggest tht (x i, y i ) is n outlier. Define mesure of proportion of outliers in the smple { d n = mx F + ( r i>i (i) ) 0 } + (i 1), (2.18) n where { } + denotes positive prt, F + denotes the distriution of X when X F, r (1)... r (n) re the order sttistis of the stndrdized solute residuls, nd { } i 0 = mx i : r (i) < η, where η is some lrge quntile of F +. Typilly η = 2.5 nd the df of norml distriution is hosen for F. Thus those nd n oservtions with lrgest stndrdized solute residuls re eliminted (here is the lrgest integer less 11

12 thn or equl to ). The dptive ut-off vlue is t n = r (in) with i n = n nd n. With this dptive ut-off vlue, the dptive weights proposed y Gervini nd Yohi (2002) re 1 if r i < t n w i = 0 if r i t n. (2.19) Then, the REWLSE is ˆβ = (X T W X) 1 X T W y, (2.20) where W = dig(w 1,, w n ), X = (x 1,..., x n ) T, nd y = (y 1,, y n ). If the initil regression nd sle estimtes with BP = 0.5 re hosen, the rekdown point of the REWLSE is lso 0.5. Furthermore, when the errors re normlly distriuted, the REWLSE is symptotilly equivlent to the OLS estimtes nd hene symptotilly effiient Roust regression sed on regulriztion of se-speifi prmeters She nd Owen (2011) nd Lee et l. (2011) proposed new lss of roust regression methods using the se-speifi inditors in men shift model with regulriztion method. A men shift model for the liner regression is y = Xβ + γ + ε, ε N(0, σ 2 I) where y = (y 1,, y n ) T, X = (x 1,..., x n ) T, nd the men shift prmeter γ i is nonzero when the ith oservtion is n outlier nd zero, otherwise. Due to the sprsity of γ i s, She nd Owen (2011) nd Lee et l. (2011) proposed to 12

13 estimte β nd γ y minimizing the penlized lest squres using L 1 penlty: L(β, γ) = 1 n 2 {y (Xβ + γ)}t {y (Xβ + γ)} + λ γ i, (2.21) where λ re fixed regulriztion prmeters for γ. Given the estimte ˆγ, ˆβ is the OLS estimte with y repled y y γ. For fixed ˆβ, the minimizer of (2.21) is ˆγ i = sgn(r i )( γ i λ) +, tht is, 0 if r i λ; ˆγ i = y i x T ˆβ i if r i > λ. Therefore, the solution of (2.21) n e found y itertively updting the ove two steps. She nd Owen (2011) nd Lee et l. (2011) proved tht the ove estimte is in ft equivlent to the M-estimte if Huer s ψ funtion is used. However, their proposed roust estimtes re sed on different perspetive nd n e extended to mny other likelihood sed models. Note, however, the monotone M-estimte is not resistent to the high leverge outliers. In order to overome this prolem, She nd Owen (2011) further proposed to reple the L 1 penlty in (2.21) y generl penlty. The ojetive funtion is then defined y L p (β, γ) = 1 2 {y (Xβ + γ)}t {y (Xβ + γ)} + n p λ ( γ i ), (2.22) where p λ ( ) is ny penlty funtion whih depends on the regulriztion prmeter λ. We n find ˆγ y defining thresholding funtion Θ(γ; λ) (She nd Owen 2009). She nd Owen (2009, 2011) proved tht for speifi thresholding funtion, we n lwys find the orresponding penlty funtion. For exmple, the soft, hrd, nd smoothly lipped solute devition (SCAD; Fn nd Li, 2001) thresholding solutions of γ orrespond to 13

14 L 1, Hrd, nd SCAD penlty funtions, respetively. Minimizing the eqution (2.22) yields sprse ˆγ for outlier detetion nd roust estimte of β. She nd Owen (2011) showed tht the proposed estimtes of (2.22) with hrd or SCAD penlties re equivlent to the M-estimtes with ertin redesending ψ funtions nd thus will e resistent to high leverge outliers if high rekdown point roust estimtes re used s the initil vlues. 3 Exmples In this setion, we ompre different roust methods nd report the men squred errors (MSE) of the prmeter estimtes for eh estimtion method. We ompre the OLS estimte with seven other ommonly used roust regression estimtes: the M estimte using Huer s ψ funtion (M H ), the M estimte using Tukey s isqure funtion (M T ), the S estimte, the LTS estimte, the LMS estimte, the MM estimte (using isqure weights nd k 1 = 4.68), nd the REWLSE. Note tht we didn t inlude the se-speifi regulriztion methods proposed y She nd Owen (2011) nd Lee et l. (2011) sine they re essentilly equivlent to M-estimtors (She nd Owen (2011) did show tht their new methods hve etter performne in deteting outliers in their simultion study). Exmple 1. We generte n smples {(x 1, y 1 ),..., (x n, y n )} from the model Y = X + ε, where X N(0, 1). In order to ompre the performne of different methods, we onsider the following six ses for the error density of ε: Cse I: ε N(0, 1)- stndrd norml distriution. Cse II: ε t 3 - t-distriution with degrees of freedom 3. 14

15 Cse III: ε t 1 - t-distriution with degrees of freedom 1 (Cuhy distriution). Cse IV: ε 0.95N(0, 1) N(0, 10 2 ) - ontminted norml mixture. Cse V: ε N (0,1) with 10% identil outliers in y diretion (where we let the first 10% of y s equl to 30). Cse VI: ε N (0,1) with 10% identil high leverge outliers (where we let the first 10% of x s equl to 10 nd their orresponding y s equl to 50). Tles 1 nd 2 report the men squred errors (MSE) of the prmeter estimtes for eh estimtion method with smple size n = 20 nd 100, respetively. The numer of replites is 200. From the tles, we n see tht MM nd REWLSE hve the overll est performne throughout most ses nd they re onsistent for different smple sizes. For Cse I, LSE hs the smllest MSE whih is resonle sine under norml errors LSE is the est estimte; M H, M T, MM, nd REWLSE hve similr MSE to LSE, due to their high effiieny property; LMS, LTS, nd S hve reltive lrger MSE due to their low effiieny. For Cse II, M H, M T, MM, nd REWLSE work etter thn other estimtes. For Cse III, LSE hs muh lrger MSE thn other roust estimtors; M H, M T, MM, nd REWLSE hve similr MSE to S. For Cse IV, M, MM, nd REWLSE hve smller MSE thn others. From Cse V, we n see tht when the dt ontin outliers in the y-diretion, LSE is muh worse thn ny other roust estimtes; MM, REWLSE, nd M T re etter thn other roust estimtors. Finlly for Cse VI, sine there re high leverge outliers, similr to LSE, oth M T nd M H perform poorly; MM nd REWLSE work etter thn other roust estimtes. In order to etter ompre the performne of different methods, Figure 1 shows the plot of their MSE versus eh se for the slope (left side) nd interept (right side) prmeters for model 1 when smple size n = 100. Sine the lines for LTS nd LMS re ove the other lines, S, MM, nd REWLSE of the interept nd slopes outperform 15

16 LTS nd LMS estimtes throughout ll six ses. In ddition, the S estimte hs similr performne to MM nd REWLSE when the error density of ε is Cuhy distriution. However, MM nd REWLSE perform etter thn S-estimtes in other five ses. Furthermore, the lines for MM nd REWLSE lmost overlp for ll six ses. It shows tht MM nd REWLSE re the overll est pprohes in roust regression. Exmple 2. Y = X 1 + X 2 + X 3 + ε, where X i N(0, 1), i = 1, 2, 3 nd X i s re independent. We onsider the following six ses for the error density of ε: Cse I: ε N(0, 1)- stndrd norml distriution. Cse II: ε t 3 - t-distriution with degrees of freedom 3. Cse III: ε t 1 - t-distriution with degrees of freedom 1 (Cuhy distriution). Cse IV: ε 0.95N(0, 1) N(0, 10 2 ) - ontminted norml mixture. Cse V: ε N(0, 1) with 10% identil outliers in y diretion (where we let the first 10% of y s equl to 30). Cse VI: ε N(0, 1) with 10% identil high leverge outliers (where we let the first 10% of x s equl to 10 nd their orresponding y s equl to 50). Tles 3 nd 4 show the men squred errors (MSE) of the prmeter estimtes of eh estimtion method for smple size n = 20 nd n = 100, respetively. Figure 2 shows the plot of their MSE versus eh se for three slopes nd the interept prmeters with smple size n = 100. The results in Exmple 2 tell similr stories to Exmple 1. In summry, MM nd REWLSE hve the overll est performne; LSE only works well when there re no outliers sine it is very sensitive to outliers; M-estimtes (M H nd 16

17 M T ) work well if the outliers re in y diretion ut re lso sensitive to the high leverge outliers. Exmple 3: Next, we use the fmous dt set found in Freedmn et l. (1991) to ompre LSE with MM nd REWLSE. The dt set re shown in Tle 5 whih ontins per pit onsumption of igrettes in vrious ountries in 1930 nd the deth rtes (numer of deths per million people) from lung ner for Here, we re interested in how the deth rtes per million people from lung ner (dependent vrile y) dependent on the onsumption of igrettes per pit (the independent vrile x). Figure 3 is stter plot of the dt. From the plot, we n see tht USA (x = 1300, y = 200) is n outlier with high leverge. We ompre different regression prmeters estimtes y LSE, MM, nd REWLSE. Figure 3 shows the fitted lines y these three estimtes. The LSE line does not fit the ulk of the dt, eing ompromise etween USA oservtion nd the rest of the dt, while the fitted lines for the other two estimtes lmost overlp nd give etter representtion of the mjority of the dt. Tle 6 lso gives the estimted regression prmeters of these three methods for oth the omplete dt nd the dt without the outlier USA. For LSE, the interept estimte hnges from (omplete dt set) to 9.14 (without outlier) nd the slope estimte hnges from 0.23 (omplete dt set) to 0.37 (without outlier). Thus, it is ler tht the outlier USA strongly influenes LSE. For MM-estimte, fter deleting the outlier, the interept estimte hnges slightly ut slope estimte remins lmost the sme. For REWLSE, oth interept nd slope estimtes remin unhnged fter deleting the outlier. In ddition, note tht REWLSE for the whole dt gives lmost the sme result s LSE without the outlier. 17

18 4 Disussion In this rtile, we desrie nd ompre different ville roust methods. Tle 7 summrizes the roustness ttriutes nd symptoti effiieny of most of the estimtors we hve disussed. Bsed on Tle 7, it n e seen tht MM-estimtes nd REWLSE hve oth high rekdown point nd high effiieny. Our simultion study lso demonstrted tht MM-estimtes nd REWLSE hve overll est performne mong ll ompred roust methods. In terms of rekdown point nd effiieny, GM-estimtes (Mllows, Shweppe), Bounded R-estimtes, M-estimtes, nd LAD estimtes re less ttrtive due to their low rekdown points. Although LMS, LTS, S-estimtes, nd GS-estimtes re strongly resistent to outliers, their effiienies re low. However, these high rekdown point roust estimtes suh s S-estimtes nd LTS re trditionlly used s the initil estimtes for some other high rekdown point nd high effiieny roust estimtes. Referenes Crroll, R. J. nd Welsh, A. H. (1988), A Note on Asymmetry nd Roustness in Liner Regression. Journl of Amerin Sttisitl Assoition, 4, Cokley, C. W. nd Hettmnsperger, T. P. (1993), A Bounded Influene, High Brekdown, Effiient Regression Estimtor. Journl of Amerin Sttistil Assoition, 88, Croux, C., Rousseeuw, P. J., nd Hössjer O. (1994), Generlized S-estimtors. Journl of Amerin Sttistil Assoition, 89, Donoho, D. L. nd Huer, P. J. (1983), The Nottion of Brek-down Point, in A Festshrift for E. L. Lehmnn, Wdsworth 18

19 Freedmn, W. L., Wilson, C. D., nd Mdore, B. F. (1991), New Cepheid Distnes to Nery Glxies Bsed on BVRI CCD Photometry. Astrophysil Journl, 372, Fn, J. nd Li, R. (2001). Vrile seletion vi nononve penlized likelihood nd its orle properties. Journl of the Amerin Sttistil Assoition, 96, Gervini, D. nd Yohi, V. J. (2002), A Clss of Roust nd Fully Effiient Regression Estimtors. The Annls of Sttistis, 30, Hndshin, E., Kohls, J., Fiehter, A., nd Shweppe, F. (1975), Bd Dt Anlysis for Power System Stte Estimtion. IEEE Trnstions on Power Apprtus nd Systems, 2, Huer, P.J. (1981), Roust Sttistis. New York: John Wiley nd Sons. Jkel, L.A. (1972), Estimting Regression Coeffiients y Minimizing the Dispersion of the Residuls. Annls of Mthemtil Sttistis, 5, Lee, Y., MEhern, S. N., nd Jung, Y. (2011), Regulriztion of Cse-Speifi Prmeters for Roustness nd Effiieny. Sumitted to the Sttistil Siene. Mllows, C.L. (1975), On Some Topis in Roustness. unpulished memorndum, Bell Tel. Lortories, Murry Hill. Mronn, R. A., Mrtin, R. D. nd Yohi, V. J. (2006), Roust Sttistis. John Wiley. Nrnjo, J.D., Hettmnsperger, T. P. (1994), Bounded Influene Rnk Regression. Journl of the Royl Sttistil Soiety B, 56, Rousseeuw, P.J.(1982), Lest Medin of Squres regression. Reserh Report No. 178, Centre for Sttistis nd Opertions reserh, VUB Brussels. 19

20 Rousseeuw, P.J.(1983), Multivrite Estimtion with High Brekdown Point. Reserh Report No. 192, Center for Sttistis nd Opertions reserh, VUB Brussels. Rousseeuw, P.J. nd Croux, C.(1993), Alterntives to the Medin Asolute Devition. Journl of Amerin Sttistil Assoition, 94, Rousseeuw, P.J. nd Yohi, V. J. (1984). Roust Regression y Mens of S-estimtors. Roust nd Nonliner Time series, J. Frnke, W. Härdle nd R. D. Mrtin (eds.),letures Notes in Sttistis 26, , New York: Springer. She, Y. (2009). Thresholding-Bsed Itertive Seletion Proedures for Model Seletion nd Shrinkge. Eletroni Journl of Sttistis, 3, 384C415. She, Y. nd Owen, A. B. (2011), Outlier Detetion Using Nononvex Penlized regression. Journl of Amerin Sttistil Assoition, 106, Siegel, A.F. (1982), Roust Regression Using Repeted Medins. Biometrik, 69, Stromerg, A. J., Hwkins, D. M., nd Hössjer, O. (2000), The Lest Trimmed Differenes Regression Estimtor nd Alterntives. Journl of Amerin Sttistil Assoition, 95, Yohi, V. J. (1987), High Brekdown-point nd High Effiieny Roust Estimtes for Regression. The Annls of Sttistis, 15,

21 Tle 1: MSE of Point Estimtes for Exmple 1 with n = 20 TRUE OLS M H M T LMS LTS S MM REWLSE Cse I: ε N(0, 1) β 0 : β 1 : Cse II: ε t 3 β 0 : β 1 : Cse III: ε t 1 β 0 : β 1 : Cse IV: ε 0.95N(0, 1) N(0, 10 2 ) β 0 : β 1 : Cse V: ε N(0, 1) with outliers in y diretion β 0 : β 1 : Cse VI: ε N(0, 1) with high leverge outliers β 0 : β 1 : Tle 2: MSE of Point Estimtes for Exmple 1 with n = 100 TRUE OLS M H M T LMS LTS S MM REWLSE Cse I: ε N(0, 1) β 0 : β 1 : Cse II: ε t 3 β 0 : β 1 : Cse III: ε t 1 β 0 : β 1 : Cse IV: ε 0.95N(0, 1) N(0, 10 2 ) β 0 : β 1 : Cse V: ε N(0, 1) with outliers in y diretion β 0 : β 1 : Cse VI: ε N(0, 1) with high leverge outliers β 0 : β 1 :

22 Tle 3: MSE of Point Estimtes for Exmple 2 with n = 20 TRUE OLS M H M T LMS LTS S MM REWLSE Cse I: ε N(0, 1) β 0 : β 1 : β 2 : β 3 : Cse II: ε t 3 β 0 : β 1 : β 2 : β 3 : Cse III: ε t 1 β 0 : β 1 : β 2 : β 3 : Cse IV: ε 0.95N(0, 1) N(0, 10 2 ) β 0 : β 1 : β 2 : β 3 : Cse V: ε N(0, 1) with outliers in y diretion β 0 : β 1 : β 2 : β 3 : Cse VI: ε N(0, 1) with high leverge outliers β 0 : β 1 : β 2 : β 3 :

23 Tle 4: MSE of Point Estimtes for Exmple 2 with n = 100 TRUE OLS M H M T LMS LTS S MM REWLSE Cse I: ε N(0, 1) β 0 : β 1 : β 2 : β 3 : Cse II: ε t 3 β 0 : β 1 : β 2 : β 3 : Cse III: ε t 1 β 0 : β 1 : β 2 : β 3 : Cse IV: ε 0.95N(0, 1) N(0, 10 2 ) β 0 : β 1 : β 2 : β 3 : Cse V: ε N(0, 1) with outliers in y diretion β 0 : β 1 : β 2 : β 3 : Cse VI: ε N(0, 1) with high leverge outliers β 0 : β 1 : β 2 : β 3 :

24 Tle 5: Cigrettes dt Country Per pit onsumption of igrette Deths rtes Austrli Cnd Denmrk Finlnd GretBritin Ielnd Netherlnds Norwy Sweden Switzerlnd USA Tle 6: Regression estimtes for Cigrettes dt Complete dt Dt without USA Estimtors Interept Slope Interept Slope LS MM REWLSE Tle 7: Brekdown Points nd Asymptoti Effiienies of Vrious Regression Estimtors Estimtor Brekdown Point Asymptoti Effiieny High BP LMS LTS S-estimtes GS-estimtes MM-estimtes REWLSE Low BP GM-estimtes(Mllows,Shweppe) 1/(p + 1) 0.95 Bounded R-estimtes < Monotone M-estimtes 1/n 0.95 LAD 1/n 0.64 OLS 1/n

25 MSE vs. Cses for interept MSE vs. Cses for slope MSE de de e d d e LMS LTS S MM REWLSE de de de MSE de de e d d e LMS LTS S MM REWLSE de de de Cse Cse Figure 1: Plot of MSE of interept (left) nd slope (right) estimtes vs. different ses for LMS, LTS, S, MM, nd REWLSE, for model 1 when n =

26 MSE vs. Cses for interept MSE vs. Cses for et1 MSE d e LMS LTS S MM REWLSE de de de de de de MSE de de de d e LMS LTS S MM REWLSE de de de Cse Cse MSE vs. Cses for et2 MSE vs. Cses for et3 MSE d e LMS LTS S MM REWLSE de d de e de de de MSE d e LMS LTS S MM REWLSE de de de de de de Cse Cse Figure 2: Plot of MSE of different regression prmeter estimtes vs. different ses for LMS, LTS, S, MM, nd REWLSE, for model 2 when n =

27 Deth rtes LS line MM line REWLSE line Per pit onsumption of igrettes Figure 3: Fitted lines for Cigrettes dt 27

ANALYSIS AND MODELLING OF RAINFALL EVENTS

ANALYSIS AND MODELLING OF RAINFALL EVENTS Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.

More information

A Non-parametric Approach in Testing Higher Order Interactions

A Non-parametric Approach in Testing Higher Order Interactions A Non-prmetri Approh in Testing igher Order Intertions G. Bkeerthn Deprtment of Mthemtis, Fulty of Siene Estern University, Chenkldy, Sri Lnk nd S. Smit Deprtment of Crop Siene, Fulty of Agriulture University

More information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner

More information

Review Topic 14: Relationships between two numerical variables

Review Topic 14: Relationships between two numerical variables Review Topi 14: Reltionships etween two numeril vriles Multiple hoie 1. Whih of the following stterplots est demonstrtes line of est fit? A B C D E 2. The regression line eqution for the following grph

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

KANSAS STATE UNIVERSITY Manhattan, Kansas

KANSAS STATE UNIVERSITY Manhattan, Kansas ROBUST MIXTURE MODELING by CHUN YU M.S., Kansas State University, 2008 AN ABSTRACT OF A DISSERTATION submitted in partial fulfillment of the requirements for the degree Doctor of Philosophy Department

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

Chapter Gauss Quadrature Rule of Integration

Chapter Gauss Quadrature Rule of Integration Chpter 7. Guss Qudrture Rule o Integrtion Ater reding this hpter, you should e le to:. derive the Guss qudrture method or integrtion nd e le to use it to solve prolems, nd. use Guss qudrture method to

More information

Appendix C Partial discharges. 1. Relationship Between Measured and Actual Discharge Quantities

Appendix C Partial discharges. 1. Relationship Between Measured and Actual Discharge Quantities Appendi Prtil dishrges. Reltionship Between Mesured nd Atul Dishrge Quntities A dishrging smple my e simply represented y the euilent iruit in Figure. The pplied lternting oltge V is inresed until the

More information

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

More information

Hyers-Ulam stability of Pielou logistic difference equation

Hyers-Ulam stability of Pielou logistic difference equation vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

Nondeterministic Automata vs Deterministic Automata

Nondeterministic Automata vs Deterministic Automata Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

More information

Chapter 8 Roots and Radicals

Chapter 8 Roots and Radicals Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi

More information

12.4 Similarity in Right Triangles

12.4 Similarity in Right Triangles Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right

More information

Generalization of 2-Corner Frequency Source Models Used in SMSIM

Generalization of 2-Corner Frequency Source Models Used in SMSIM Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville

More information

Eigenvectors and Eigenvalues

Eigenvectors and Eigenvalues MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.

More information

Line Integrals and Entire Functions

Line Integrals and Entire Functions Line Integrls nd Entire Funtions Defining n Integrl for omplex Vlued Funtions In the following setions, our min gol is to show tht every entire funtion n be represented s n everywhere onvergent power series

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

THE INFLUENCE OF MODEL RESOLUTION ON AN EXPRESSION OF THE ATMOSPHERIC BOUNDARY LAYER IN A SINGLE-COLUMN MODEL

THE INFLUENCE OF MODEL RESOLUTION ON AN EXPRESSION OF THE ATMOSPHERIC BOUNDARY LAYER IN A SINGLE-COLUMN MODEL THE INFLUENCE OF MODEL RESOLUTION ON AN EXPRESSION OF THE ATMOSPHERIC BOUNDARY LAYER IN A SINGLE-COLUMN MODEL P3.1 Kot Iwmur*, Hiroto Kitgw Jpn Meteorologil Ageny 1. INTRODUCTION Jpn Meteorologil Ageny

More information

Learning Partially Observable Markov Models from First Passage Times

Learning Partially Observable Markov Models from First Passage Times Lerning Prtilly Oservle Mrkov s from First Pssge s Jérôme Cllut nd Pierre Dupont Europen Conferene on Mhine Lerning (ECML) 8 Septemer 7 Outline. FPT in models nd sequenes. Prtilly Oservle Mrkov s (POMMs).

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

( ) { } [ ] { } [ ) { } ( ] { }

( ) { } [ ] { } [ ) { } ( ] { } Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or

More information

University of Sioux Falls. MAT204/205 Calculus I/II

University of Sioux Falls. MAT204/205 Calculus I/II University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

More Properties of the Riemann Integral

More Properties of the Riemann Integral More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl

More information

Polynomials. Polynomials. Curriculum Ready ACMNA:

Polynomials. Polynomials. Curriculum Ready ACMNA: Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

arxiv: v1 [math.ca] 21 Aug 2018

arxiv: v1 [math.ca] 21 Aug 2018 rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of

More information

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 ) Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17 CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Electromagnetic-Power-based Modal Classification, Modal Expansion, and Modal Decomposition for Perfect Electric Conductors

Electromagnetic-Power-based Modal Classification, Modal Expansion, and Modal Decomposition for Perfect Electric Conductors LIAN: EM-BASED MODAL CLASSIFICATION EXANSION AND DECOMOSITION FOR EC 1 Eletromgneti-ower-bsed Modl Clssifition Modl Expnsion nd Modl Deomposition for erfet Eletri Condutors Renzun Lin Abstrt Trditionlly

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P. Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time

More information

Electromagnetism Notes, NYU Spring 2018

Electromagnetism Notes, NYU Spring 2018 Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system

More information

Engr354: Digital Logic Circuits

Engr354: Digital Logic Circuits Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost

More information

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting. ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s

More information

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Section 4.4. Green s Theorem

Section 4.4. Green s Theorem The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

Non-Linear & Logistic Regression

Non-Linear & Logistic Regression Non-Liner & Logistic Regression If the sttistics re boring, then you've got the wrong numbers. Edwrd R. Tufte (Sttistics Professor, Yle University) Regression Anlyses When do we use these? PART 1: find

More information

Something found at a salad bar

Something found at a salad bar Nme PP Something found t sld r 4.7 Notes RIGHT TRINGLE hs extly one right ngle. To solve right tringle, you n use things like SOH-H-TO nd the Pythgoren Theorem. n OLIQUE TRINGLE hs no right ngles. To solve

More information

Spacetime and the Quantum World Questions Fall 2010

Spacetime and the Quantum World Questions Fall 2010 Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1

More information

Chapter 4 State-Space Planning

Chapter 4 State-Space Planning Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

More information

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL: PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles

More information

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0) 1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, Games & Hennessy Milner logic Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,

More information

Probability. b a b. a b 32.

Probability. b a b. a b 32. Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,

More information

Proving the Pythagorean Theorem

Proving the Pythagorean Theorem Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

Student Activity 3: Single Factor ANOVA

Student Activity 3: Single Factor ANOVA MATH 40 Student Activity 3: Single Fctor ANOVA Some Bsic Concepts In designed experiment, two or more tretments, or combintions of tretments, is pplied to experimentl units The number of tretments, whether

More information

Linear Systems with Constant Coefficients

Linear Systems with Constant Coefficients Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system

More information

Part I: Study the theorem statement.

Part I: Study the theorem statement. Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for

More information

16z z q. q( B) Max{2 z z z z B} r z r z r z r z B. John Riley 19 October Econ 401A: Microeconomic Theory. Homework 2 Answers

16z z q. q( B) Max{2 z z z z B} r z r z r z r z B. John Riley 19 October Econ 401A: Microeconomic Theory. Homework 2 Answers John Riley 9 Otober 6 Eon 4A: Miroeonomi Theory Homework Answers Constnt returns to sle prodution funtion () If (,, q) S then 6 q () 4 We need to show tht (,, q) S 6( ) ( ) ( q) q [ q ] 4 4 4 4 4 4 Appeling

More information

AP Calculus AB Unit 4 Assessment

AP Calculus AB Unit 4 Assessment Clss: Dte: 0-04 AP Clulus AB Unit 4 Assessment Multiple Choie Identify the hoie tht best ompletes the sttement or nswers the question. A lultor my NOT be used on this prt of the exm. (6 minutes). The slope

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

Continuous Random Variables

Continuous Random Variables CPSC 53 Systems Modeling nd Simultion Continuous Rndom Vriles Dr. Anirn Mhnti Deprtment of Computer Science University of Clgry mhnti@cpsc.uclgry.c Definitions A rndom vrile is sid to e continuous if there

More information

AP CALCULUS Test #6: Unit #6 Basic Integration and Applications

AP CALCULUS Test #6: Unit #6 Basic Integration and Applications AP CALCULUS Test #6: Unit #6 Bsi Integrtion nd Applitions A GRAPHING CALCULATOR IS REQUIRED FOR SOME PROBLEMS OR PARTS OF PROBLEMS IN THIS PART OF THE EXAMINATION. () The ext numeril vlue of the orret

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

Quadratic Forms. Quadratic Forms

Quadratic Forms. Quadratic Forms Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

More information

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1. Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of

More information

Lecture 1 - Introduction and Basic Facts about PDEs

Lecture 1 - Introduction and Basic Facts about PDEs * 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV

More information

Lecture Solution of a System of Linear Equation

Lecture Solution of a System of Linear Equation ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville - D. Keffer, 5/9/98 (updted /) Lecture 8- - Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner

More information

Maintaining Mathematical Proficiency

Maintaining Mathematical Proficiency Nme Dte hpter 9 Mintining Mthemtil Profiieny Simplify the epression. 1. 500. 189 3. 5 4. 4 3 5. 11 5 6. 8 Solve the proportion. 9 3 14 7. = 8. = 9. 1 7 5 4 = 4 10. 0 6 = 11. 7 4 10 = 1. 5 9 15 3 = 5 +

More information

Table of Content. c 1 / 5

Table of Content. c 1 / 5 Tehnil Informtion - t nd t Temperture for Controlger 03-2018 en Tble of Content Introdution....................................................................... 2 Definitions for t nd t..............................................................

More information

Reflection Property of a Hyperbola

Reflection Property of a Hyperbola Refletion Propert of Hperol Prefe The purpose of this pper is to prove nltill nd to illustrte geometrill the propert of hperol wherein r whih emntes outside the onvit of the hperol, tht is, etween the

More information

Part 4. Integration (with Proofs)

Part 4. Integration (with Proofs) Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

More information

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09 Metodologie di progetto HW Tehnology Mpping Lst updte: 19/03/09 Tehnology Mpping 2 Tehnology Mpping Exmple: t 1 = + b; t 2 = d + e; t 3 = b + d; t 4 = t 1 t 2 + fg; t 5 = t 4 h + t 2 t 3 ; F = t 5 ; t

More information

Alpha Algorithm: Limitations

Alpha Algorithm: Limitations Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t

More information