Optimal inference of sameness Supporting information

Size: px
Start display at page:

Download "Optimal inference of sameness Supporting information"

Transcription

1 Optmal nference of amene Supportng nformaton Content Decon rule of the optmal oberver.... Unequal relablte.... Equal relablte... 5 Repone probablte of the optmal oberver Equal relablte Unequal relablte Proof that A non-negatve defnte n the unequal-relablte cae Suboptmal model Repone probablte for the ngle-crteron and blocwe-crteron model Sngle-crteron model for Experment Blocwe-crteron model for Experment Maxmum-abolute-dfference model... 4 Bayean model comparon... 5 Smulaton of anmal cognton experment Method for Experment, color Supplementary Table Supplementary Fgure... 5 Decon rule of the optmal oberver Snce equal relablte (Experment ) are a pecal cae of unequal relablte (Experment ), we treat the latter frt.. Unequal relablte The generatve model of the ta gven n Fgure A. The varable are a follow: C a bnary varable that denote amene (+ for ame, for dfferent), denote the vector of orentaton preented, and x denote the correpondng vector of nternal repreentaton. Each x drawn from a Gauan dtrbuton wth mean and tandard devaton. The Gauan aumpton common, and reflect the preence of many ndependent, unbaed ource of noe (). Although orentaton pace crcular, we can treat t a the real lne, becaue the nternal repreentaton are cloe to the true tmulu and much maller than the

2 crcle crcumference. We refer to / a the relablty of the th obervaton. When the tmul are the ame, each orentaton equal to. When the tmul are dfferent, each drawn ndependently from a Gauan dtrbuton wth mean and tandard devaton. Regardle of amene, the value of drawn from a unform dtrbuton on [L,L) (one could tae L=/ here, but any L wor). Optmal (Bayean) oberver bae ther decon on the poteror probablty dtrbuton over the varable of nteret, here C, gven ngle-tral obervaton, here x=(x,,x ) T. Snce C a bnary random varable, th poteror reduce to a ngle number, whch can be expreed n many way. A partcularly convenent way to expre t a a log poteror rato: p C x p x C p C d log log log. (S) p C x p x C p C Evaluatng the lelhood n th expreon, p(x C) for C=±, requre margnalzaton over the tmulu orentaton, =(,, ) T, and ther mean, :, p x C p x p C p d d. (S) We aume that the tandard devaton,, of the noe aocated wth a tmulu nown to the oberver for each tmulu and each tral, a would be the cae n a Poon-le populaton code (). Therefore, we do not need to margnalze over, but can treat t a a nown parameter. We now evaluate Eq. (S) by ubttutng the nown dtrbuton. If denote the column vector of length wth all entre equal to, and (x) the Drac Delta dtrbuton, then px C p d d L x p d L x x exp L x exp d. L d (S3) In the ret of th document, all um and product run from to unle mentoned otherwe. We rewrte the um n the exponent a

3 x x x x V, (S4) wth V x x. If all relablte are equal, o that =, then V mplfe to Var x V x x. Here, Var x defned a Var x x x. For the general cae, n whch each tem come wth t own relablty, we ubttute Eq. (S4) nto Eq. (S3) to fnd V exp p x C exp d L x V exp L where n the econd equalty, we aumed that the doman of large compared to, and o the ntegral can be evaluated over the entre real lne. Th aumpton jutfed here, becaue n our ta the maxmum-lelhood etmate of a tmulu dtrbuted around the true value of the tmulu n a range that much narrower than the entre crcular pace. Startng from Eq. (S), we repeat th calculaton for the hypothe that the tmul are dfferent, that C = :, 3

4 x L px C exp exp d d L L x L exp exp d d L L L x exp L d L V exp L x exp d L L V exp L, where V x x. The log lelhood rato, the frt term on the rght-hand de of Eq. (S), now become p x C V V log log log p x C wx wx w w w wx log log w w w w ww jxx j ww jxx j j j w wx w w w w log log, w w 4

5 where w and w are column vector wth entre w, w. Therefore, the log poteror rato, d, a quadratc form n x. In matrx notaton, we can wrte d w w p w w p T ame xaσ x log log log, ame (S5) where p(c=)=p ame and A() a ymmetrc, relablty-dependent matrx wth entre ww j ww j Aj w w j w w. (S6) Maxmum-a-poteror etmaton amount to repondng ame whenever d potve. Th lead to Eq. () n the man text.. Equal relablte When all relablte are equal, = and therefore w =w and entre of A reduce to A w w j w w, a n Experment, the j, and the quadratc form x T Ax become w w Var x. The decon rule, whch decrbe when the optmal oberver repond C=, tae the form w p Var x log log ww w p ame ame. (S7) Thu, the decon rule amount to comparng the varance to a crteron that depend n a pecfc way on the common relablty of the tem (hdden n w and w ) and on et ze,. 5

6 Repone probablte of the optmal oberver In the prevou ecton, we derved the decon rule of the optmal oberver for both experment. However, thee decon rule cannot be teted drectly, nce a expermenter we do not have acce to the nternal obervaton x. We only now the preented tmul,, and the ubject repone on each tral. To obtan tetable model predcton, we compute the theoretcal probablty of a ame repone gven by the optmal oberver, when the obervaton x are drawn from the generatve model for gven. In the reultng model predcton, x no longer preent. The complete model thu cont of two part merged together : the generatve model, producng a theoretcal (or mulated) et of obervaton, and the nference model, whch decrbe the decon made by the optmal oberver baed on thoe obervaton. Formally, we denote the oberver etmate of C by Ĉ ; for the optmal oberver, t equal the gn of d. The optmal oberver repond accordng to th etmate. Eq. (S5) determne the optmal decon rule on a ngle tral. We denote the probablty of the optmal oberver repondng Ĉ when the expermenter preent a pecfc tmulu et by ˆ obtaned by averagng over the hypothetcal obervaton x generated by : ˆ ˆ C d x ˆ,gn pc. It p C p C x p x d x p x, σ d x, (S8) where the Kronecer delta. In word, the probablty of repondng C ˆ equal to the proporton of obervaton drawn from p(x ) for whch d(x) potve. For many pychophycal ta, an ntegral le that gven n Eq. (S8) analytcally ntractable, and need to be approxmated, for example, by Monte Carlo mulaton. In the preent ta, an analytcal treatment poble.. Equal relablte We frt conder the cae of Experment, wth the decon rule gven by Eq. (S7). We are ntereted n the probablty that th nequalty atfed for x drawn from a multvarate normal dtrbuton wth mean and covarance matrx I, denoted x~(, I), wth I the dentty matrx. We wrte Var x=x T A'x, where the component of A' are A' j = j //. Th matrx ha egenvalue equal to, and one egenvalue equal to. Therefore, for an orthogonal matrx M and dagonal matrx D=dag(,,,,), we can wrte M T A'M=D. Let Y be Y=M T x. Snce M orthogonal, y~(, I), wth =M T. Snce y T T T T YDY xmdmx xax, ' (S9) t follow that x T A'x/ follow a non-central ch-quared dtrbuton wth degree of 6

7 freedom. Th varable equal to wvar x. The noncentralty parameter of the um on the left of Eq. (S9), whch can be rewrtten a T T T T μ Dμ MDM A ' w Var. Therefore, we have w Var x~ w Var. (S) From Eq. (S7), the probablty of repondng ame equal the probablty that w w p ame w Var x le than log log. Ung Eq. (S), th probablty ww w pame obtaned from a cumulatve ch-quared dtrbuton: ˆ w w p p C Pr wvar log log ww w p ame ame. (S). Unequal relablte We next conder the cae of Experment, where relablty can dffer between tmul. Then x follow a multvarate normal dtrbuton wth mean and covarance matrx =dag(, ). We defne a random varable Q(x)=x T Bx, where B a non-negatve defnte and ymmetrc matrx. We denote mean and tandard devaton of Q by Q and Q, repectvely. Lu, Tang, and Zhang (3) have found the followng approxmaton to the dtrbuton of Q: T Pr xbx Pr l t (S) where the varable l,, t,, and are defned a follow: 7

8 Q t l 3a ra ra 3 3 a 3 a ra a, f r r r r a, f r r c r 3 3/ c r c 4 c j c Tr Q j T j r r j BΣ BΣ B umercal mulaton how that for our purpoe, th a very good approxmaton. In order to apply th approxmaton to x T Ax from Eq.(S5), A ha to be both ymmetrc and non-negatve defnte. Snce A obvouly ymmetrc, what reman to be hown that n our cae, A nonnegatve defnte..3 Proof that A non negatve defnte n the unequal relablte cae The matrx A pecfed by Eq. (S6) can be wrtten a T ww ww Adag ww T w T T w. To how that A non-negatve defnte (potve emdefnte), we prove that t egenvalue are non-negatve. In Experment, m of the are equal to low, and m are equal to hgh. Wthout lo of generalty, we arrange them a =( low,, low, hgh,, hgh ),.e., the frt m correpond to low-relablty tmul, and the lat m to hgh-relablty one. Conequently, w = =w m =w low =/ low and w m+ = =w =w hgh =/ hgh. The (,j) th term of A gven by Eq. (S6). ote that 8

9 A ww j ww j Aj w w j j w w, (S3) we ee that =(,,) T an egenvector wth egenvalue. We now defne a et of m vector v, wth =,,m, a follow: v. For example, v 3 =(,,,, ) T. Thee vector are egenvector of A wth egenvalue w w, nce low low Av Av j j Aj j j j j ww ww j j j w w j j j w w ww ww j www www w w w w j j w w j j j j j w w w low wlow wlow wlow v. Smlarly, the m vector v wth =m+,,, whoe th entre are v, m are egenvector wth egenvalue w hgh w hgh. That leave one egenvalue to fnd. Conder the vector v=(m,, m,m,,m) T. We wll how that th vector an egenvector. We frt calculate the product of any of the frt m row of A wth v, mang ue of Eq. (S3) 9

10 Av m m A m A j j jm j wlow w wlow whgh w low lowwhgh mwlow wlow m m m m w w w w w w w w w w w w m m m m w w w w w w w w m w w low hgh low hgh low hgh low hgh low hgh low hgh m m m m m m low hgh low hgh low hgh low hgh m m m m Smlarly, for any of the lat m row of A, we get. Av m. m low m hgh m low m hgh Thu, m m m m low hgh low hgh the fnal egenvalue of A. Snce all egenvalue are non-negatve, A non-negatve defnte, and therefore we may apply the approxmaton dcued n Secton..

11 3 Suboptmal model 3. Repone probablte for the ngle crteron and blocwe crteron model Calculatng a model predcton for the probablty of repondng ame gven a et of preented orentaton cont of two tep: to determne the decon rule for repondng ame, and to apply th decon rule to the et of nternal repreentaton on each ndvdual tral. In non-optmal oberver model, the frt tep (decon rule) dfferent, but the econd tep (calculatng the probablty wth whch the decon atfed) dentcal. In partcular, a long a the decon rule of the form T xbx, (S4) wth B a non-negatve defnte, ymmetrc matrx, we can tll ue Eq. (S) to approxmate the model repone probablte. The only dfference from the optmal model that dfferent expreon mut be ubttuted for B and/or. In the pecal cae that the decon rule Var x< and the relablte are equal, the model repone probablte are gven by an exact expreon analogou to Eq. (S), ˆ Pr Var p C w w. 3. Sngle crteron model for Experment In Experment, the SC oberver aume n the decon rule that all relablte are equal, = aumed for all. In other word, th oberver doe not weght the obervaton by ther correct repectve relablte. We wll how here that th model equvalent to one n whch the oberver compare the ample varance to a ngle crteron. The decon rule the ame one a n Experment, Eq. (S7), but wth aumed ntead of. Th rule can be rewrtten a p Var x log log aumed aumed ame aumed pame. (S5) Snce aumed a free parameter, the rght-hand de can aume any value on the real lne. To ee th, frt note that th expreon contnuou. Then compute the two lmt

12 aumed aumed p ame lm log log aumed pame aumed aumed p ame lm log log aumed pame lm aumed log a umed aumed aumed aumed Therefore, we can mply replace the entre rght-hand de by a ngle free parameter,.e., Var x<, thereby jutfyng the termnology ngle-crteron model. (ote that n order to obtan model predcton, we tll need to ft the parameter low and hgh.) Thu, the SC model ha only two varant: wth and wthout lape rate. 3.3 Blocwe crteron model for Experment In Experment, the BC model the model n whch aumed may vary by bloc type (LOW, MIXED, or HIGH). Then, the decon rule equvalent to Var x< bloc, where each bloc type ha t own free parameter bloc. Th model analogou to the BC model n Experment, wth relablty condton (LOW, MIXED, or HIGH) tang the place of et ze. A n the SC model, there are only two varant: wth and wthout lape rate. 3.4 Maxmum abolute dfference model For the MAD model, the repone probablte cannot be calculated analytcally. We etmated thee probablte numercally, by mulatng, et of nternal repreentaton for each of the 7 expermental tral, and applyng the model decon rule to each et; the frequency of ame repone wa an etmate of the probablty of repondng ame on the gven tral. 4 Bayean model comparon We denote by p(ĉ,m,) the probablty predcted by model M wth parameter of the ubject actual repone on the th tral, Ĉ, when the preented tmul are. We computed the log probablty of the data gven M by margnalzng over. For the pror over parameter, we aumed a unform dtrbuton, p()=/vol, where Vol the volume of parameter pace. We calculated the parameter lelhood by aumng that the data are condtonally ndependent acro tral: p(data M,)= p(ĉ,m,). For the MAD model, we approxmated the margnalzaton through a Remann um; the parameter range were to 4 for the decon crteron,. to. for, and to.5 for the lape rate, each n 35 tep. For the other model, nce analytcal expreon were avalable, we ued the Laplace approxmaton (4); the ze of the parameter range were for, for the aumed,.4 for p ame, and.4 for the lape rate.

13 5 Smulaton of anmal cognton experment To examne whether the proporton of dfferent repone from the optmal oberver correlate wth the entropy of the tmulu et, we mulated the tmulu et ued by Young et al. (5) (ee Table n ther paper) and ued thee a nput to the optmal-oberver model. Thee et alway contaned 6 tem, wth everal ubet of dentcal tem (e.g., 4 ubet of 4 dentcal tem each). In our mulaton, for each ubet, a random tmulu value wa drawn from a Gauan dtrbuton (wth σ =5) and agned to all tem n that ubet. A total of tral were mulated per tmulu et. On each tral, tmulu obervaton were mulated by addng Gauan noe to the tmulu orentaton (σ=) and a repone wa generated by applyng the decon rule from the optmal-oberver model. Entropy and caled logt of percent dfferent repone were computed a decrbed by Young et al. (5). To examne the effect of et ze on the proporton of dfferent repone n the optmal-oberver model, we mulated tral per et ze, wth σ =8 and σ=8. To examne the effect of tmulu vblty, we vared nternal noe, σ, and mulated tral per noe level (wth σ =5, =8, p ame =.6, and a gueng rate of.5). Whle model parameter were eparately choen for each experment, the oberved trend were robut under a wde range of parameter value. 6 Experment (color) Method The method for Experment, color, were dentcal to the Experment for orentaton, except for the followng dfference. Stmul conted of a et of colored dc wth a radu of.4 deg. The color of the dc were drawn ndependently from 8 color value unformly dtrbuted along a crcle of radu 5 n CIE 976 (L*,a*,b*) color pace. Th crcle had contant lumnance (L*=58) and wa centered at the pont (a*=, b*=3). The tmul were preented on a grey bacground of lumnance cd/m. Set ze wa choen randomly on each tral. In the model, blocwe crteron wa now defned a one crteron per et ze, rather than per bloc. The experment conted of 3 eon wth 6 bloc of 5 tral. Two author and fve pad, nave ubject partcpated n the experment. Reult The SC model can be ruled out but not the BC model (Fg. SA-B; log lelhood dfference between the optmal model and the SC, BC, MAD-SC, and MAD-BC model were 8.7±4.9, 3.9±.5, 7.3±6.3, and.8±.3, repectvely). Even though the BC model jut edge out the optmal model, the decon crtera and noe level from the bet BC model are very cloe to thoe predcted by the bet optmal-model varant (Fg. SC; p>. for all x t-tet). Fnally, the noe level exhbt a wea dependence on et ze (Fg. SC; power law ft yeld a power of.3±.4). 3

14 7 Supplementary Table Table S. Overvew of model parameter. The model have the ame parameter n both experment, except that n Experment, σ=(σ =, σ =4, σ =8 ) and =( =, =4, =8 ), whle n Experment, σ=(σ low, σ hgh ) and =( LOW, MIXED, HIGH ). Model Optmal Optmal Optmal Optmal Optmal Optmal Optmal Optmal Sngle-crteron Sngle-crteron Blocwe-crteron Blocwe-crteron MAD wth ngle crteron MAD wth ngle crteron MAD wth blocwe crteron MAD wth blocwe crteron Free parameter σ σ, λ σ, σ σ, σ, λ σ, p ame σ, p ame, λ σ, p ame, σ σ, p ame, σ, λ σ, σ,, λ σ, σ,, λ σ, σ,, λ σ, σ,, λ Table S. Overvew of maxmum-lelhood parameter value of the bet fttng optmal model n Experment. An empty cell ndcate that the repectve parameter wa not a free parameter n the bet-fttng model varant. p ame σ λ AK DS.4.4 HB MH. ML.4.5 RB.3 RC.6 TR.46. 4

15 Table S3. Overvew of maxmum-lelhood parameter value of the bet-fttng optmal model n Experment. An empty cell ndcate that the repectve parameter wa not a free parameter n the bet-fttng model varant. 8 Supplementary Fgure A Proporton "dfferent" repone B Relatve log lelhood Subject number p ame σ λ B.53.8 DB. DS 9.5. HB.45. KJ.45.7 MH.44. ML MV.46.4 RB RC.55 Optmal SC BC MAD-SC MAD-BC Standard devaton () Standard devaton () Standard devaton () Standard devaton () Standard devaton () SC BC MAD-SC MAD-BC Optmal model better Optmal model wore 4 8 Set ze Fg. S Comparon of model n Experment 3. Crcle and error bar repreent mean and.e.m. of ubject data. Shaded area repreent.e.m. of model ft. (A) Proporton dfferent repone a a functon of ample tandard devaton for optmal and uboptmal model. (B) Bayean model comparon. Each bar repreent the log lelhood of the optmal model mnu that of a uboptmal model. (C) The decon crtera (left) and the nternal noe level (rght) for the betfttng BC model are nearly dentcal to thoe of the bet-fttng optmal-oberver model. Th ugget that the human crtera are cloe to optmal. C Decon crteron ( ) BC Optmal Internal noe, σ () BC Optmal 4 8 Set ze 5

16 A Optmal model B BC model hgh = Probablty.. Same Dfferent 5 5 Probablty hgh = Probablty Probablty hgh =3 Probablty Probablty hgh =4 Probablty Probablty hgh =5 Probablty.. Probablty Decon varable ( ) Decon varable ( ) Fg. S. A comparon of the decon tratege of the optmal and BC model n Experment. (A) Dtrbuton of the decon varable of the optmal model. A the number of hgh-relablty tmul n the dplay, hgh, ncreae, the dtrbuton become more eparable, mang the ta eaer. The optmal oberver et h crteron (dahed lne) n uch a way that performance maxmzed. (B) Dtrbuton of the decon varable of the BC model (Var x). Th model ue the ame crteron regardle of hgh (dahed lne). Hence, t cannot maxmze performance for all value of hgh.the ame hold for the SC, MAD-SC, and MAD-BC model. The dtrbuton dffer between the model becaue the decon varable do.... Green DM & Swet JA (966) Sgnal detecton theory and pychophyc (John Wley & Son, Lo Alto, CA).. Ma WJ, Bec JM, Latham PE, & Pouget A (6) Bayean nference wth probabltc populaton code. at euroc 9(): Lu H, Tang Y, & Zhang HH (9) A new ch-quare approxmaton to the dtrbuton of non-negatve defnte quadratc form n non-central normal varable. Comp Stattc and Data Analy 53: MacKay DJ (3) Informaton theory, nference, and learnng algorthm (Cambrdge Unverty Pre, Cambrdge, UK). 5. Young ME & Waerman EA (997) Entropy detecton by pgeon: repone to mxed vual dplay after ame-dfferent dcrmnaton tranng. J Exp Pychol Anm Behav Proce 3():

17 7

Additional File 1 - Detailed explanation of the expression level CPD

Additional File 1 - Detailed explanation of the expression level CPD Addtonal Fle - Detaled explanaton of the expreon level CPD A mentoned n the man text, the man CPD for the uterng model cont of two ndvdual factor: P( level gen P( level gen P ( level gen 2 (.).. CPD factor

More information

Chapter 11. Supplemental Text Material. The method of steepest ascent can be derived as follows. Suppose that we have fit a firstorder

Chapter 11. Supplemental Text Material. The method of steepest ascent can be derived as follows. Suppose that we have fit a firstorder S-. The Method of Steepet cent Chapter. Supplemental Text Materal The method of teepet acent can be derved a follow. Suppoe that we have ft a frtorder model y = β + β x and we wh to ue th model to determne

More information

The multivariate Gaussian probability density function for random vector X (X 1,,X ) T. diagonal term of, denoted

The multivariate Gaussian probability density function for random vector X (X 1,,X ) T. diagonal term of, denoted Appendx Proof of heorem he multvarate Gauan probablty denty functon for random vector X (X,,X ) px exp / / x x mean and varance equal to the th dagonal term of, denoted he margnal dtrbuton of X Gauan wth

More information

Specification -- Assumptions of the Simple Classical Linear Regression Model (CLRM) 1. Introduction

Specification -- Assumptions of the Simple Classical Linear Regression Model (CLRM) 1. Introduction ECONOMICS 35* -- NOTE ECON 35* -- NOTE Specfcaton -- Aumpton of the Smple Clacal Lnear Regreon Model (CLRM). Introducton CLRM tand for the Clacal Lnear Regreon Model. The CLRM alo known a the tandard lnear

More information

Harmonic oscillator approximation

Harmonic oscillator approximation armonc ocllator approxmaton armonc ocllator approxmaton Euaton to be olved We are fndng a mnmum of the functon under the retrcton where W P, P,..., P, Q, Q,..., Q P, P,..., P, Q, Q,..., Q lnwgner functon

More information

Estimation of Finite Population Total under PPS Sampling in Presence of Extra Auxiliary Information

Estimation of Finite Population Total under PPS Sampling in Presence of Extra Auxiliary Information Internatonal Journal of Stattc and Analy. ISSN 2248-9959 Volume 6, Number 1 (2016), pp. 9-16 Reearch Inda Publcaton http://www.rpublcaton.com Etmaton of Fnte Populaton Total under PPS Samplng n Preence

More information

Statistical Properties of the OLS Coefficient Estimators. 1. Introduction

Statistical Properties of the OLS Coefficient Estimators. 1. Introduction ECOOMICS 35* -- OTE 4 ECO 35* -- OTE 4 Stattcal Properte of the OLS Coeffcent Etmator Introducton We derved n ote the OLS (Ordnary Leat Square etmator ˆβ j (j, of the regreon coeffcent βj (j, n the mple

More information

Scattering of two identical particles in the center-of. of-mass frame. (b)

Scattering of two identical particles in the center-of. of-mass frame. (b) Lecture # November 5 Scatterng of two dentcal partcle Relatvtc Quantum Mechanc: The Klen-Gordon equaton Interpretaton of the Klen-Gordon equaton The Drac equaton Drac repreentaton for the matrce α and

More information

Linear Approximation with Regularization and Moving Least Squares

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 information

MULTIPLE REGRESSION ANALYSIS For the Case of Two Regressors

MULTIPLE REGRESSION ANALYSIS For the Case of Two Regressors MULTIPLE REGRESSION ANALYSIS For the Cae of Two Regreor In the followng note, leat-quare etmaton developed for multple regreon problem wth two eplanator varable, here called regreor (uch a n the Fat Food

More information

Team. Outline. Statistics and Art: Sampling, Response Error, Mixed Models, Missing Data, and Inference

Team. Outline. Statistics and Art: Sampling, Response Error, Mixed Models, Missing Data, and Inference Team Stattc and Art: Samplng, Repone Error, Mxed Model, Mng Data, and nference Ed Stanek Unverty of Maachuett- Amhert, USA 9/5/8 9/5/8 Outlne. Example: Doe-repone Model n Toxcology. ow to Predct Realzed

More information

Improvements on Waring s Problem

Improvements on Waring s Problem Improvement on Warng Problem L An-Png Bejng, PR Chna apl@nacom Abtract By a new recurve algorthm for the auxlary equaton, n th paper, we wll gve ome mprovement for Warng problem Keyword: Warng Problem,

More information

Small signal analysis

Small signal analysis Small gnal analy. ntroducton Let u conder the crcut hown n Fg., where the nonlnear retor decrbed by the equaton g v havng graphcal repreentaton hown n Fg.. ( G (t G v(t v Fg. Fg. a D current ource wherea

More information

Chapter 6 The Effect of the GPS Systematic Errors on Deformation Parameters

Chapter 6 The Effect of the GPS Systematic Errors on Deformation Parameters Chapter 6 The Effect of the GPS Sytematc Error on Deformaton Parameter 6.. General Beutler et al., (988) dd the frt comprehenve tudy on the GPS ytematc error. Baed on a geometrc approach and aumng a unform

More information

Introduction. Modeling Data. Approach. Quality of Fit. Likelihood. Probabilistic Approach

Introduction. Modeling Data. Approach. Quality of Fit. Likelihood. Probabilistic Approach Introducton Modelng Data Gven a et of obervaton, we wh to ft a mathematcal model Model deend on adutable arameter traght lne: m + c n Polnomal: a + a + a + L+ a n Choce of model deend uon roblem Aroach

More information

Root Locus Techniques

Root Locus Techniques Root Locu Technque ELEC 32 Cloed-Loop Control The control nput u t ynthezed baed on the a pror knowledge of the ytem plant, the reference nput r t, and the error gnal, e t The control ytem meaure the output,

More information

Pythagorean triples. Leen Noordzij.

Pythagorean triples. Leen Noordzij. Pythagorean trple. Leen Noordz Dr.l.noordz@leennoordz.nl www.leennoordz.me Content A Roadmap for generatng Pythagorean Trple.... Pythagorean Trple.... 3 Dcuon Concluon.... 5 A Roadmap for generatng Pythagorean

More information

AP Statistics Ch 3 Examining Relationships

AP Statistics Ch 3 Examining Relationships Introducton To tud relatonhp between varable, we mut meaure the varable on the ame group of ndvdual. If we thnk a varable ma eplan or even caue change n another varable, then the eplanator varable and

More information

2.3 Least-Square regressions

2.3 Least-Square regressions .3 Leat-Square regreon Eample.10 How do chldren grow? The pattern of growth vare from chld to chld, o we can bet undertandng the general pattern b followng the average heght of a number of chldren. Here

More information

Confidence intervals for the difference and the ratio of Lognormal means with bounded parameters

Confidence intervals for the difference and the ratio of Lognormal means with bounded parameters Songklanakarn J. Sc. Technol. 37 () 3-40 Mar.-Apr. 05 http://www.jt.pu.ac.th Orgnal Artcle Confdence nterval for the dfference and the rato of Lognormal mean wth bounded parameter Sa-aat Nwtpong* Department

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Introduction to Interfacial Segregation. Xiaozhe Zhang 10/02/2015

Introduction to Interfacial Segregation. Xiaozhe Zhang 10/02/2015 Introducton to Interfacal Segregaton Xaozhe Zhang 10/02/2015 Interfacal egregaton Segregaton n materal refer to the enrchment of a materal conttuent at a free urface or an nternal nterface of a materal.

More information

Lecture Notes on Linear Regression

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

10.34 Fall 2015 Metropolis Monte Carlo Algorithm

10.34 Fall 2015 Metropolis Monte Carlo Algorithm 10.34 Fall 2015 Metropols Monte Carlo Algorthm The Metropols Monte Carlo method s very useful for calculatng manydmensonal ntegraton. For e.g. n statstcal mechancs n order to calculate the prospertes of

More information

Predictors Using Partially Conditional 2 Stage Response Error Ed Stanek

Predictors Using Partially Conditional 2 Stage Response Error Ed Stanek Predctor ng Partally Condtonal Stage Repone Error Ed Stane TRODCTO We explore the predctor that wll relt n a mple random ample wth repone error when a dfferent model potlated The model we decrbe here cloely

More information

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several

More information

Joint Source Coding and Higher-Dimension Modulation

Joint Source Coding and Higher-Dimension Modulation Jont Codng and Hgher-Dmenon Modulaton Tze C. Wong and Huck M. Kwon Electrcal Engneerng and Computer Scence Wchta State Unvert, Wchta, Kana 676, USA {tcwong; huck.kwon}@wchta.edu Abtract Th paper propoe

More information

Homework Assignment 3 Due in class, Thursday October 15

Homework Assignment 3 Due in class, Thursday October 15 Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.

More information

Improvements on Waring s Problem

Improvements on Waring s Problem Imrovement on Warng Problem L An-Png Bejng 85, PR Chna al@nacom Abtract By a new recurve algorthm for the auxlary equaton, n th aer, we wll gve ome mrovement for Warng roblem Keyword: Warng Problem, Hardy-Lttlewood

More information

Two Approaches to Proving. Goldbach s Conjecture

Two Approaches to Proving. Goldbach s Conjecture Two Approache to Provng Goldbach Conecture By Bernard Farley Adved By Charle Parry May 3 rd 5 A Bref Introducton to Goldbach Conecture In 74 Goldbach made h mot famou contrbuton n mathematc wth the conecture

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

This appendix presents the derivations and proofs omitted from the main text.

This appendix presents the derivations and proofs omitted from the main text. Onlne Appendx A Appendx: Omtted Dervaton and Proof Th appendx preent the dervaton and proof omtted from the man text A Omtted dervaton n Secton Mot of the analy provded n the man text Here, we formally

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Supporting Information. Hydroxyl Radical Production by H 2 O 2 -Mediated. Conditions

Supporting Information. Hydroxyl Radical Production by H 2 O 2 -Mediated. Conditions Supportng Informaton Hydroxyl Radcal Producton by H 2 O 2 -Medated Oxdaton of Fe(II) Complexed by Suwannee Rver Fulvc Acd Under Crcumneutral Frehwater Condton Chrtopher J. Mller, Andrew L. Roe, T. Davd

More information

Information Acquisition in Global Games of Regime Change (Online Appendix)

Information Acquisition in Global Games of Regime Change (Online Appendix) Informaton Acquton n Global Game of Regme Change (Onlne Appendx) Mchal Szkup and Iabel Trevno Augut 4, 05 Introducton Th appendx contan the proof of all the ntermedate reult that have been omtted from

More information

Two-Layered Model of Blood Flow through Composite Stenosed Artery

Two-Layered Model of Blood Flow through Composite Stenosed Artery Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 93-9466 Vol. 4, Iue (December 9), pp. 343 354 (Prevouly, Vol. 4, No.) Applcaton Appled Mathematc: An Internatonal Journal (AAM) Two-ayered Model

More information

Variable Structure Control ~ Basics

Variable Structure Control ~ Basics Varable Structure Control ~ Bac Harry G. Kwatny Department of Mechancal Engneerng & Mechanc Drexel Unverty Outlne A prelmnary example VS ytem, ldng mode, reachng Bac of dcontnuou ytem Example: underea

More information

Week 5: Neural Networks

Week 5: Neural Networks Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

First Year Examination Department of Statistics, University of Florida

First Year Examination Department of Statistics, University of Florida Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve

More information

The Essential Dynamics Algorithm: Essential Results

The Essential Dynamics Algorithm: Essential Results @ MIT maachuett nttute of technology artfcal ntellgence laboratory The Eental Dynamc Algorthm: Eental Reult Martn C. Martn AI Memo 003-014 May 003 003 maachuett nttute of technology, cambrdge, ma 0139

More information

STAT 511 FINAL EXAM NAME Spring 2001

STAT 511 FINAL EXAM NAME Spring 2001 STAT 5 FINAL EXAM NAME Sprng Instructons: Ths s a closed book exam. No notes or books are allowed. ou may use a calculator but you are not allowed to store notes or formulas n the calculator. Please wrte

More information

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980

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

8 Waves in Uniform Magnetized Media

8 Waves in Uniform Magnetized Media 8 Wave n Unform Magnetzed Meda 81 Suceptblte The frt order current can be wrtten j = j = q d 3 p v f 1 ( r, p, t) = ɛ 0 χ E For Maxwellan dtrbuton Y n (λ) = f 0 (v, v ) = 1 πvth exp (v V ) v th 1 πv th

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

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

STAT 3008 Applied Regression Analysis

STAT 3008 Applied Regression Analysis STAT 3008 Appled Regresson Analyss Tutoral : Smple Lnear Regresson LAI Chun He Department of Statstcs, The Chnese Unversty of Hong Kong 1 Model Assumpton To quantfy the relatonshp between two factors,

More information

Linear Regression Analysis: Terminology and Notation

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

Eigenvalues of Random Graphs

Eigenvalues of Random Graphs Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the

More information

Negative Binomial Regression

Negative Binomial Regression STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...

More information

Motion Perception Under Uncertainty. Hongjing Lu Department of Psychology University of Hong Kong

Motion Perception Under Uncertainty. Hongjing Lu Department of Psychology University of Hong Kong Moton Percepton Under Uncertanty Hongjng Lu Department of Psychology Unversty of Hong Kong Outlne Uncertanty n moton stmulus Correspondence problem Qualtatve fttng usng deal observer models Based on sgnal

More information

Comparison of Regression Lines

Comparison of Regression Lines STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence

More information

APPENDIX A Some Linear Algebra

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

ENG 8801/ Special Topics in Computer Engineering: Pattern Recognition. Memorial University of Newfoundland Pattern Recognition

ENG 8801/ Special Topics in Computer Engineering: Pattern Recognition. Memorial University of Newfoundland Pattern Recognition EG 880/988 - Specal opcs n Computer Engneerng: Pattern Recognton Memoral Unversty of ewfoundland Pattern Recognton Lecture 7 May 3, 006 http://wwwengrmunca/~charlesr Offce Hours: uesdays hursdays 8:30-9:30

More information

Markov Chain Monte Carlo Lecture 6

Markov Chain Monte Carlo Lecture 6 where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways

More information

UNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours

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

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Verification of Selected Precision Parameters of the Trimble S8 DR Plus Robotic Total Station

Verification of Selected Precision Parameters of the Trimble S8 DR Plus Robotic Total Station 81 Verfcaton of Selected Precon Parameter of the Trmble S8 DR Plu Robotc Total Staton Sokol, Š., Bajtala, M. and Ježko, J. Slovak Unverty of Technology, Faculty of Cvl Engneerng, Radlnkého 11, 81368 Bratlava,

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

APPROXIMATE FUZZY REASONING BASED ON INTERPOLATION IN THE VAGUE ENVIRONMENT OF THE FUZZY RULEBASE AS A PRACTICAL ALTERNATIVE OF THE CLASSICAL CRI

APPROXIMATE FUZZY REASONING BASED ON INTERPOLATION IN THE VAGUE ENVIRONMENT OF THE FUZZY RULEBASE AS A PRACTICAL ALTERNATIVE OF THE CLASSICAL CRI Kovác, Sz., Kóczy, L.T.: Approxmate Fuzzy Reaonng Baed on Interpolaton n the Vague Envronment of the Fuzzy Rulebae a a Practcal Alternatve of the Clacal CRI, Proceedng of the 7 th Internatonal Fuzzy Sytem

More information

The Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor

The Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor Prncpal Component Transform Multvarate Random Sgnals A real tme sgnal x(t can be consdered as a random process and ts samples x m (m =0; ;N, 1 a random vector: The mean vector of X s X =[x0; ;x N,1] T

More information

Logistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI

Logistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI Logstc Regresson CAP 561: achne Learnng Instructor: Guo-Jun QI Bayes Classfer: A Generatve model odel the posteror dstrbuton P(Y X) Estmate class-condtonal dstrbuton P(X Y) for each Y Estmate pror dstrbuton

More information

Alpha Risk of Taguchi Method with L 18 Array for NTB Type QCH by Simulation

Alpha Risk of Taguchi Method with L 18 Array for NTB Type QCH by Simulation Proceedng of the World Congre on Engneerng 00 Vol II WCE 00, July -, 00, London, U.K. Alpha Rk of Taguch Method wth L Array for NTB Type QCH by Smulaton A. Al-Refae and M.H. L Abtract Taguch method a wdely

More information

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede

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

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models

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

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Lecture 20: Hypothesis testing

Lecture 20: Hypothesis testing Lecture : Hpothess testng Much of statstcs nvolves hpothess testng compare a new nterestng hpothess, H (the Alternatve hpothess to the borng, old, well-known case, H (the Null Hpothess or, decde whether

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics ) Ismor Fscher, 8//008 Stat 54 / -8.3 Summary Statstcs Measures of Center and Spread Dstrbuton of dscrete contnuous POPULATION Random Varable, numercal True center =??? True spread =???? parameters ( populaton

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Experment-I MODULE VIII LECTURE - 34 ANALYSIS OF VARIANCE IN RANDOM-EFFECTS MODEL AND MIXED-EFFECTS EFFECTS MODEL Dr Shalabh Department of Mathematcs and Statstcs Indan

More information

Simulation and Random Number Generation

Simulation and Random Number Generation Smulaton and Random Number Generaton Summary Dscrete Tme vs Dscrete Event Smulaton Random number generaton Generatng a random sequence Generatng random varates from a Unform dstrbuton Testng the qualty

More information

Method Of Fundamental Solutions For Modeling Electromagnetic Wave Scattering Problems

Method Of Fundamental Solutions For Modeling Electromagnetic Wave Scattering Problems Internatonal Workhop on MehFree Method 003 1 Method Of Fundamental Soluton For Modelng lectromagnetc Wave Scatterng Problem Der-Lang Young (1) and Jhh-We Ruan (1) Abtract: In th paper we attempt to contruct

More information

Predictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore

Predictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.

More information

1 GSW Iterative Techniques for y = Ax

1 GSW Iterative Techniques for y = Ax 1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn

More information

Physics 120. Exam #1. April 15, 2011

Physics 120. Exam #1. April 15, 2011 Phyc 120 Exam #1 Aprl 15, 2011 Name Multple Choce /16 Problem #1 /28 Problem #2 /28 Problem #3 /28 Total /100 PartI:Multple Choce:Crclethebetanwertoeachqueton.Anyothermark wllnotbegvencredt.eachmultple

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Statistical pattern recognition

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

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 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 information

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

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

A New Inverse Reliability Analysis Method Using MPP-Based Dimension Reduction Method (DRM)

A New Inverse Reliability Analysis Method Using MPP-Based Dimension Reduction Method (DRM) roceedng of the ASME 007 Internatonal Degn Engneerng Techncal Conference & Computer and Informaton n Engneerng Conference IDETC/CIE 007 September 4-7, 007, La Vega, eada, USA DETC007-35098 A ew Inere Relablty

More information

Predicting Random Effects from a Finite Population of Unequal Size Clusters based on Two Stage Sampling

Predicting Random Effects from a Finite Population of Unequal Size Clusters based on Two Stage Sampling Predctng Random Effect from a Fnte Populaton of Unequal Sze Cluter baed on Two Stage Samplng Edward J. Stanek Department of Publc Health 40 Arnold Houe Unverty of aachuett 75 orth Pleaant Street Amhert,

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

1 Convex Optimization

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

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

More information

CS 2750 Machine Learning. Lecture 5. Density estimation. CS 2750 Machine Learning. Announcements

CS 2750 Machine Learning. Lecture 5. Density estimation. CS 2750 Machine Learning. Announcements CS 750 Machne Learnng Lecture 5 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square CS 750 Machne Learnng Announcements Homework Due on Wednesday before the class Reports: hand n before

More information

Lecture 6 More on Complete Randomized Block Design (RBD)

Lecture 6 More on Complete Randomized Block Design (RBD) Lecture 6 More on Complete Randomzed Block Desgn (RBD) Multple test Multple test The multple comparsons or multple testng problem occurs when one consders a set of statstcal nferences smultaneously. For

More information

ISQS 6348 Final Open notes, no books. Points out of 100 in parentheses. Y 1 ε 2

ISQS 6348 Final Open notes, no books. Points out of 100 in parentheses. Y 1 ε 2 ISQS 6348 Fnal Open notes, no books. Ponts out of 100 n parentheses. 1. The followng path dagram s gven: ε 1 Y 1 ε F Y 1.A. (10) Wrte down the usual model and assumptons that are mpled by ths dagram. Soluton:

More information

π e ax2 dx = x 2 e ax2 dx or x 3 e ax2 dx = 1 x 4 e ax2 dx = 3 π 8a 5/2 (a) We are considering the Maxwell velocity distribution function: 2πτ/m

π e ax2 dx = x 2 e ax2 dx or x 3 e ax2 dx = 1 x 4 e ax2 dx = 3 π 8a 5/2 (a) We are considering the Maxwell velocity distribution function: 2πτ/m Homework Solutons Problem In solvng ths problem, we wll need to calculate some moments of the Gaussan dstrbuton. The brute-force method s to ntegrate by parts but there s a nce trck. The followng ntegrals

More information

Chapter 8 Indicator Variables

Chapter 8 Indicator Variables Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n

More information

Convergence of random processes

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

Linear Feature Engineering 11

Linear Feature Engineering 11 Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19

More information

Error Probability for M Signals

Error Probability for M Signals Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal

More information

[ ] λ λ λ. Multicollinearity. multicollinearity Ragnar Frisch (1934) perfect exact. collinearity. multicollinearity. exact

[ ] λ λ λ. Multicollinearity. multicollinearity Ragnar Frisch (1934) perfect exact. collinearity. multicollinearity. exact Multcollnearty multcollnearty Ragnar Frsch (934 perfect exact collnearty multcollnearty K exact λ λ λ K K x+ x+ + x 0 0.. λ, λ, λk 0 0.. x perfect ntercorrelated λ λ λ x+ x+ + KxK + v 0 0.. v 3 y β + β

More information

Gaussian Mixture Models

Gaussian Mixture Models Lab Gaussan Mxture Models Lab Objectve: Understand the formulaton of Gaussan Mxture Models (GMMs) and how to estmate GMM parameters. You ve already seen GMMs as the observaton dstrbuton n certan contnuous

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

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

Module 5. Cables and Arches. Version 2 CE IIT, Kharagpur

Module 5. Cables and Arches. Version 2 CE IIT, Kharagpur odule 5 Cable and Arche Veron CE IIT, Kharagpur Leon 33 Two-nged Arch Veron CE IIT, Kharagpur Intructonal Objectve: After readng th chapter the tudent wll be able to 1. Compute horzontal reacton n two-hnged

More information

MLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012

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