Web-based Supplementary Materials for Inference for the Effect of Treatment. on Survival Probability in Randomized Trials with Noncompliance and
|
|
- Hester Andrews
- 5 years ago
- Views:
Transcription
1 Bometrcs 000, DOI: Web-based Supplementary Materals for Inference for the Effect of Treatment on Survval Probablty n Randomzed Trals wth Noncomplance and Admnstratve Censorng by Ne, Cheng and Small Hu Ne,, Jng Cheng 2,, and Dylan S. Small, Department of Statstcs, The Wharton School, Unversty of Pennsylvana, Phladelpha, PA 904, U.S.A. 2 Dvson of Oral Epdemology & Dental Publc Health, UCSF School of Dentstry, San Francsco, CA 9443, U.S.A. emal: nehu@wharton.upenn.edu emal: Jng.Cheng@ucsf.edu emal: dsmall@wharton.upenn.edu
2 Web Appendx. Web Appendx A: Proof of Theorem 7. Proof. We prove ths theorem by showng that t s a convex optmzaton problem. The maxmzaton problem (2) under constrants (3) - (7) n the paper s equvalent to mnmzng subect to log L obs = m +m 2 +N =m +m 2 + log (ˆπ c L + ( ˆπ c )L 2 ) () n 3 p nt V ) = Ŝnt(V ) (2) n (3) + + Here, L and L 2 are the same as before. n (3) Let x = (p c0,, p c0 n 3, p nt,, p nt n 3 ). Then note that p c0 0 (3) p nt 0 (4) p c0 0, =,, n 3 (5) p nt 0, =,, n 3 (6) ˆπ c L + ( ˆπ c )L 2 s a lnear functon of x and hence s a concave functon log(z) s strctly convex and decreasng Summaton preserves convexty Then accordng to Boyd and Vandenberghe (2004, Chapter 3), we have that our obectve functon () s strctly convex. Moreover, for our constrants (2) - (6), we have that The nequalty constrant functons n (3) - (6) are all lnear functons of x and hence are convex functons The equalty constrant functon (2) s a lnear combnaton of x and thus s affne Therefore, our maxmzaton problem s a strctly convex optmzaton problem. Hence, accordng to Boyd and Vandenberghe (2004, Chapter 4), t has a unque global maxmum.
3 2 Bometrcs, Web Appendx B: Proof of Theorem 7.2 Proof. The proof for ths theorem s smlar to that of Lemma n Cheng, Small, Tan and Ten Have (2009b). There are two maor dfferences. One s that our optmzaton problem s gven by () - (6), however, lke Cheng et al. (2009b), our problem s also a convex optmzaton problem. The other s that our constrant parameter space s gven by Θ = {p c0, p nt, =,, n 3 : q = ˆπ c p c0 + ( ˆπ c )p nt, p nt I(T (3) V ) = S ˆ nt (V ), p nt, p c0, p nt 0, p c0 0}. The set Θ, as n Cheng et al. (2009b), s a convex set because the feasble set of a convex optmzaton problem s also convex. Because our optmzaton problem s convex and the constrant parameter space s a convex set, we follow the same steps as n Cheng et al. (2009b) to prove the theorem. 3. Web Appendx C: Proof of Theorem 7.3 Proof. Step From Kaplan and Meer (958), under the condtons r () v and r (2) v that, as m + m 2 + N, By the Law of Large Numbers, as m + m 2 + N, Step 2 Let = dg r G, we know Ŝ c (V ) P S c (V ) (7) Ŝ nt (V ) P S nt (V ) (8) ˆπ c a.s. π c (9) ( dg ), whch s the Kaplan-Meer estmator of the mxture n the r G control group. Consder the condtons (3) - (7) n the paper along wth ˆπ c p c0 + ( ˆπ c )p nt = (0) Here, notce that wth (4) - (7) n the paper and (0), sometmes (3) n the paper cannot
4 Web Appendx 3 be satsfed. Gven (4) - (7) n the paper and (0), we want to fnd the lower bound and upper bound Defne l = sup{ : ˆ S M nt (V ) of n 3 p nt V ). ˆπ c }, then = ˆπ c, =,, l l q KP ˆπ c, = l ˆ S L nt(v ) 0, = l +,, n 3 and Defne m = nf{ : n 3 =+ ˆ S L nt(v ) = ˆπ c p nt,m = n 3 }, then V ) 0, =,, m n 3 q KP =m+ ˆπ c, = m ˆπ c, = m +,, n 3 and ˆ S M nt (V ) = n 3 p nt,m V ) Therefore, n 3 p nt V ) [ S ˆ nt(v L ), SM ˆ nt (V )] Smlarly, defne l = sup{ : = π c }, then π c, =,, l l q KP π c, = l 0, = l +,, n 3 and S L nt(v ) = n 3 V )
5 4 Bometrcs, and Defne m = nf{ : n 3 =+ π c nt, M p = }, then S M nt (V ) = 0, =,, m n 3 q KP = m+ π c, = m π c, = m +,, n 3 n 3 We want to show that, as m + m 2 + N, nt, M p V ) Sˆ nt(v L ) S nt(v L ) a.s. 0 Sˆ nt M (V ) S nt M (V ) a.s. 0 Snce S ˆ nt(v L ) S nt(v L ) n 3 = mn{l, l} + V ) n 3 mn{l, l} V ) =mn{l, l}+ V ) V ) V ) =mn{l, l}+ V ) where c =b a = 0 f b > c. Note that f ˆπ c π c, then l l. We get that mn{l, l} mn{l, l} V ) = ( ) ˆπ c π c +( ˆπ c l l V ) )I(T (3) l V ) V )
6 Web Appendx 5 Smlarly, f ˆπ c < π c, then l l. We also get that mn{l, l} mn{l, l} V ) = ( ) ˆπ c π c ( π c l l V ) q KP )I(T (3) V ) l V ) Therefore, combnng these two stuaton, we get that mn{l, l} mn{l, l} V ) = max{, ˆπ c π c +( max{, ˆπ c ( ˆπ c mn{l, l} ) π c nt, L p V ) mn{l, l} } π c ˆπ c mn{l, l} } π c q KP )I(T (3) V ) mn{l, l} mn{l, l} q KP + V ) max{, ˆπ c π c } From (9), we know that ˆπ c π c a.s. 0. And from the fact that mn{l, l}, ( ˆπ c mn{l, l} ) π c q KP a.s. 0 For the second part, from defntons, t s easy to verfy that Thus, mn{ ˆπ c, π c } max{ ˆπ c, π c } max{, ˆπ c Therefore, mn{l, l} mn{l, l} max{ ˆπ c, π c } mn{l, l} } π c max{, ˆπ c π c } max{, ˆπ c π c } 0
7 6 Bometrcs, max{ ˆπ c, π c } max{, } ˆπ c π c = mn{ ˆπ c, π c } max{ ˆπ c, π c } Agan, from (9) and the condton that 0 < π c <, we know that Hence, mn{l, l} mn{l, l} max{, ˆπ c mn{l, l} V ) Next, f ˆπ c π c, then l l. We also get that =mn{l, l}+ V ) π c } a.s. 0 nt, L p V ) a.s. 0 =mn{l, l}+ V ) = l =l+ V ) l =l+ = l π c From the defntons of l, l and the fact that ˆπ c π c, we get that ˆπ c l π c Therefore, =mn{l, l}+ l π c ˆπ c π c V ) =mn{l, l}+ V )
8 Web Appendx 7 If ˆπ c < π c, then l l. We get that = =mn{l, l}+ l = l+ l = l+ = V ) V ) l ˆπ c =mn{l, l}+ V ) Agan, from the defntons of l, l and the fact that ˆπ c π c, we get that π c l ˆπ c Therefore, =mn{l, l}+ l ˆπ c π c ˆπ c V ) =mn{l, l}+ V ) Combnng these two case, we get that =mn{l, l}+ V ) mn{ π c, ˆπ c } max{ π c, ˆπ c } = max{π c, ˆπ c } mn{π c, ˆπ c } =mn{l, l}+ From (9) and the condton that 0 < π c <, we know that =mn{l, l}+ To sum up, we verfy that V ) =mn{l, l}+ ˆ S L nt(v ) S L nt(v ) a.s. 0 V ) V ) a.s. 0
9 8 Bometrcs, Smlarly, we can also prove that Step 3 Sˆ nt M (V ) S nt M (V ) a.s. 0 In ths step, we would lke to show that, as m + m 2 + N, As m + m 2 + N, Smlarly, Step 4 S L nt(v ) = S L nt(v ) P S G(V ) π c π c I V G ( π c) () S nt M (V ) P + S G(V ) ( π c ) I V G π (π c ) (2) c = n 3 l V ) q KP I(T (3) (3) V ) + π p li(t V ) l c P ( π c) ( S G (V )) I (V G π ( π c )) c = S G(V ) π c π c I (V G ( π c)) S nt M (V ) P + S G(V ) ( π c ) I (V G π (π c )) c From (2) n the paper, whch s gven by S G (V ) π c π c I (V G ( π c)) < S nt < + S G(V ) ( π c ) π c I (V G (π c)) (3), along wth (8), () and (2), we verfy that, as m + m 2 + N, S G (V ) π c π c I (V G ( π c)) n 3 p nt V ) + S G(V ) ( π c ) π c I (V G (π c)) s asymptotcally vald n probablty. Hence, (3) s asymptotcally satsfed n probablty under maxmzaton constrants (4) - (7) n the paper and (0). Therefore, the maxmzaton problem (2) under constrants (3) - (7) n the paper s asymptotcally equvalent to the maxmzaton problem (2) under constrants (4) - (7) n the paper and (0) n probablty.
10 Web Appendx 9 Note that n (0) s actually the Kaplan-Meer estmator of the mxture n the control group. Therefore, from Kaplan and Meer (958), snce r G v, as m + m 2 + N, we have that Ŝ G (V ) P S G (V ) (4) Step 5 From (8), (9), (4) and the fact that ŜG(V ),Ŝnt(V ),ˆπ c are all bounded, we get that Hence, along wth (7), we verfy that Ŝ c0 (V ) = ŜG(V ) ˆπ c Ŝ nt (V ) ˆπ c P S G(V ) π c S nt (V ) π c = S c0 (V ) Ŝ c (V ) Ŝc0(V ) P S c (V ) S c0 (V ) 4. Web Appendx D: Standard Errors Calculaton through Delta Method The dfference of the RMSEs of two estmators δ and δ 2 are defned as: T = E((δ θ) 2 ) E((δ 2 θ) 2 ) Therefore, we can get the varance of T as below: V ar(t ) = σδ 2 ( T ) 2 + σδ 2 δ 2 ( T ) 2 + 2σ δ δ δ 2 ( T )( T ) 2 δ δ 2 = σδ 2 E(δ θ) ( E((δ θ) 2 ) )2 + σδ 2 E(δ 2 θ) E(δ θ) 2 ( E((δ 2 θ) 2 ) )2 + 2σ δ δ 2 ( E((δ θ) 2 ) )( E(δ 2 θ) E((δ 2 θ) 2 ) ) From Delta method, we can estmate the standard error of T as
11 0 Bometrcs, where covarance, V ar(t ) = V ˆ Bas(δ ˆ ) ar(δ )( RMSE(δ ˆ ) )2 + V ˆ Bas(δ ˆ 2 ) ar(δ 2 )( RMSE(δ ˆ 2 ) )2 + 2Cov(δ ˆ Bas(δ ˆ ), δ 2 )( RMSE(δ ˆ ) )( Bas(δ ˆ 2 ) RMSE(δ ˆ 2 ) ) ˆ V ar(δ ) and ˆ Bas(δ ) and ˆ V ar(δ 2 ) are sample varances of δ and δ 2, ˆ Bas(δ 2 ) are sample bases, as well as ˆ Cov(δ, δ 2 ) s the sample ˆ RMSE(δ ) and ˆ RMSE(δ 2 ) are sample RMSEs. All of the above quanttes are avalable through the smulaton studes. 5. Web Appendx E: Parametrc Maxmum Lkelhood Estmaton under Welbull Assumpton The maxmum lkelhood approach s a powerful tool under a parametrc model. We use the EM-algorthm to fnd the maxmum lkelhood estmators of the parameters n our model, and then get the maxmum lkelhood estmator of the dfference between the survval probablty of the complers n the treatment group and the survval probablty of the complers n the control group at a specfc tme V. We llustrate ths method through an example wth assumptons of Webull dstrbutons. However, our method can be easly appled under assumptons of other dstrbutons. Example Assume that the complers n the treatment group, the complers n the control group and the never-takers have Webull dstrbutons wth parameters ρ c, κ c, ρ c0, κ c0 and ρ nt, κ nt, respectvely. The lkelhood functon can be wrtten as: where m L obs = = π c L c m +m 2 =m + ( π c )L nt m +m 2 +N =m +m 2 + (π c L c0 + ( π c )L nt ) L c = (κ c ρ c (ρ c Y ) κ c ) exp ( (ρ c Y ) κ c ), =,, m L c0 = (κ c0 ρ c0 (ρ c0 Y ) κ c0 ) exp ( (ρ c0 Y ) κ c0 ), = m + m 2 +,, m + m 2 + N
12 Web Appendx L nt = (κ nt ρ nt (ρ nt Y ) κnt ) exp ( (ρ nt Y ) κnt ), = m +,, m + m 2 + N Vewng the complance class as mssng data, the complete data lkelhood functon s m L c = = π c L c m +m 2 =m + ( π c )L nt m +m 2 +N =m +m 2 + (π c L c0 ) I (( π c )L nt ) I (5) We drectly fnd the MLEs for ρ c and κ c by solvng the two equatons below m = m + log Y = κ c = ρ c = ( m = m = Y κ c log Y m = Y κ c m = m = Y κ c ) κ c For the other parameters, we use the EM-algorthm to fnd ther MLEs. E-step Let Î denote E(I ˆθ (t) ), where ˆθ (t) s the vector of estmates of π c, ρ c0, κ c0, ρ nt and κ nt at the tth teraton of the EM-algorthm. For = m + m 2 +,, m + m 2 + N, we have where L c0, L nt Î = π c L c0 π c L c0 + ( π c )L nt (6) and π c are evaluated at ˆθ (t). For = m +,, m + m 2, Î = 0. Because the complete data log-lkelhood functon s lnear n I, the expected value of the complete data log-lkelhood gven ˆθ (t) s obtaned by substtutng Î nto (5). M-Step After substtutng (6) nto (5), we get the maxmzers of π c, ρ c0, κ c0, ρ nt and κ nt by settng the frst dervatves as zero and solvng the equatons below. m +m 2 +N =m + m +m 2 +N =m +m 2 + Î κ c0 + ( Î) + κ nt m +m 2 +N =m +m 2 + m +m 2 +N =m + π c = Î log Y = ( Î) log Y = m m + +m 2 +N =m +m 2 + Î m + m 2 + N m +m 2 +N m +m 2 +N =m +m 2 + Î m +m 2 +N =m +m 2 + Î ρ c0 = ( m +m 2 +N ρ nt = ( =m +m 2 + ÎY κ c0 log Y m +m 2 +N =m +m 2 + ÎY κ c0 =m +m 2 + ÎY κ c0 m +m 2 +N =m + ) κ c0 ( Î) m +m 2 +N =m + m +m 2 +N ( =m + Î)Y κ nt m +m 2 +N ( =m + Î) m +m 2 +N ( =m + Î)Y κ nt ) κ nt ( Î)Y κ nt log Y
13 2 Bometrcs, We run ths EM-algorthm untl the parameters converge. We choose the startng values as π c = m /(m + m 2 ), ρ nt and κ nt whch maxmze m +m 2 =m + L nt m +m 2 +N =m +m 2 +(L nt ) πc as well as ρ c0 and κ c0 whch maxmze m +m 2 +N =m +m 2 +(L c0 ) π c. Then the estmated dfference between the survval probablty of the complers n the treatment group and the survval probablty of the complers n the control group at a specfc tme V s gven by Ŵ (V ) = Ŝc(V ) Ŝc0(V ) = exp ( (ˆρ c V )ˆκ c ) exp ( (ˆρ c0 V )ˆκ c0 ) 6. Web Appendx F: Detals of Extenson to Trals under Assumptons - 6 In ths secton, we extend our PNEMLE approach to more general trals under Assumptons - 6 n whch the control group has access to the treatment. For such trals, we have one more complance class, the always-takers, n addton to the complers and the never-takers. If R = and A =, we know that the subect s ether a compler or an always-taker; f R = and A = 0, the subect s a never-taker; f R = 0 and A =, the subect s an always-taker; and f R = 0 and A = 0, the subect s ether a compler or a never-taker. The always-takers are dentfable n the control group and the never-takers are dentfable n the treatment group. Let S at (V ), S nt (V ), S c (V ) and S c0 (V ) be the survval probablty of the always-takers, the never-takers, the complers n the treatment group and the complers n the control group at tme pont V, respectvely. We also use π at, π nt and π c to denote the proporton of the always-takers, the never-takers and the complers. Smlar to the approach n Secton 5 of our paper, we follow fve steps below to estmate the dfference W (V ) = S c (V ) S c0 (V ) for trals under Assumptons - 6. Step I: Estmate S at (V ) and π at from the always-takers (R=0, A=) n the control group (R=0). We estmate S at (V ) by the Kaplan-Meer estmator Ŝat(V ), and we use the observed fracton of complers n the treatment group ˆπ at = Ê(I = R = 0) to estmate π at.
14 Web Appendx 3 Step II: Estmate S nt (V ) and π nt from the never-takers (R=, A=0) n the treatment group (R=). We estmate S nt (V ) by the Kaplan-Meer estmator Ŝnt(V ), and we use the observed fracton of complers n the treatment group ˆπ nt = Ê(I = 0 R = ) to estmate π nt. Step III: Estmate S c (V ) from the mxture of the complers and the always-takers (R=, A=) n the treatment group (R=). We get our estmator Ŝc(V ) by applyng the nonparametrc emprcal lkelhood approach to model the dstrbuton of the mxture of the complers and the always-takers n the control group wth constrants S at (V ) = Ŝat(V ), π at = ˆπ at and π c = ˆπ at ˆπ nt. Step IV: Estmate S c0 (V ) from the mxture of the complers and the never-takers (R=0, A=0) n the control group (R=0). We get our estmator Ŝc0(V ) by applyng the nonparametrc emprcal lkelhood approach to model the dstrbuton of the mxture of the complers and the never-takers n the control group wth constrants S nt (V ) = Ŝnt(V ), π nt = ˆπ nt and π c = ˆπ at ˆπ nt. Step V: Estmate W (V ) = S c (V ) S c0 (V ) by Ŵ (V ) = Ŝc(V ) Ŝc0(V ), where Ŝc(V ) and Ŝc0(V ) are obtaned n Step III and Step IV. 7. Web Appendx G: Detaled Table of Table 2 [Table about here.] 8. Web Appendx H: Detaled Table of Table 3 [Table 2 about here.] 9. Web Appendx I: Test for Parametrc Webull Assumpton We wll gve the detaled dscusson on whether the potental falure tmes of complers and never-takers n our lmted mortalty analyss of the HIP data set follow the Webull
15 4 Bometrcs, dstrbuton. From Cox and Oakes (984), f T follows the Webull dstrbuton wth densty functon ρκ(ρx) κ exp ( (ρx) κ ), t s easy to verfy that log(h(t)) = κ log(ρ) + κ log(t), where H(t) s the cumulatve hazard functon of T. Therefore, log(h(t)) and log(t) should have a lnear relatonshp when T follows a Webull dstrbuton. We estmate log(h(t)) by log(ĥ(t)) through the Kaplan-Meer estmator. Fgure n Web Appendx shows us the result for complers n the treatment arm. The mean squared error (MSE) for the regresson between log(ĥ(t)) and log(t) s We use ths MSE as a test statstc for testng that T follows a Webull dstrbuton and use the parametrc Bootstrap method to perform the test. If we assume that the falure tmes of complers n the treatment arm follow a Webull dstrbuton wth parameters κ c and ρ c, the MLEs for κ c and ρ c are gven by ˆκ c =.939 and ˆρ c = We generate random samples for Webull dstrbuton wth parameters ˆκ c =.939 and ˆρ c = 0.579, calculate log(ĥ(t)) through the Kaplan-Meer method, ft the lnear regresson between log(ĥ(t)) and log(t), and get the MSE for ths regresson. We repeat ths procedure 0,000 tmes. The estmated p-value s gven by Therefore, there s not strong evdence for us to reect the null hypothess that the falure tmes of complers n the treatment group follow the Webull dstrbuton. However, from Fgure 2 n Web Appendx whch shows us the result for never-takers n the treatment arm, t does not reveal a strong lnear pattern between log(ĥ(t)) and log(t). The MSE for the regresson between log(ĥ(t)) and log(t) s If we assume that the falure tmes of complers n the treatment arm follow a Webull dstrbuton wth parameters κ nt and ρ nt, the MLEs for κ nt and ρ nt are gven by ˆκ nt =.202 and ˆρ nt = We follow the same approach as above to conduct the hypothess testng, and the estmated p-value s gven by Thus, there s evdence for us to cast doubts on the valdty of the Webull model for never-takers n the treatment arm.
16 Web Appendx 5 [Fgure about here.] [Fgure 2 about here.] 0. Web Appendx J: Detals of BC a method Besdes Bootstrap percentle method, Efron & Tbshran (994) suggested usng BC a method to obtan the confdence nterval for censored data sets {(Y, )} m +m 2 +N =. We can construct the BC a confdence nterval followng the steps below. Step I: Draw a Bootstrap sample {(Y, )} m +m 2 +N =. For complers n the treatment group {(Y, )} m =, we sample wth replacement by puttng mass m at each pont (Y, ) n order to get Bootstrap sample {(Y, )} m =. For never-takers n the treatment group {(Y, )} m +m 2 =m +, we sample wth replacement by puttng mass m 2 at each pont (Y, ) n order to get Bootstrap sample {(Y, )} m +m 2 =m +. For mxtures n the control group {(Y, )} m +m 2 +N =m +m 2 +, we sample wth replacement by puttng mass N at each pont (Y, ) n order to get Bootstrap sample {(Y, )} m +m 2 +N =m +m 2 +. We on three Bootstrap samples together to get a Bootstrap sample {(Y, )} m +m 2 +N =. Step II: Estmate PNEMLE Ŵ (V ) for ths Bootstrap sample followng the procedures n Secton 5. Step III: Independently repeat steps I and II B tmes and obtan {Ŵ b (V )} B b=. Fnd the lower α percentle Ŵ LOW (V ) and the upper α 2 percentle Ŵ UP (V ), where α and α 2 are gven as α = Φ(ẑ 0 + α 2 = Φ(ẑ 0 + ẑ 0 + z (α) ˆα(ẑ 0 + z (α) ) ) ẑ 0 + z ( α) ˆα(ẑ 0 + z ( α) ) ) The value of ẑ 0 s obtaned drectly from the proporton of Bootstrap replcatons less than
17 6 Bometrcs, the orgnal estmate Ŵ (V ), that s, ẑ 0 = Φ ( No. of {Ŵ b (V ) < Ŵ (V )} ) B Let Ŵ(.)(V ) = B b= Ŵ b (V ) B. The value of ˆα s obtaned from Bb= (Ŵ(.)(V ) ˆα = Ŵb(V )) 3 6( B b= (Ŵ(.)(V ) Ŵb(V )) 2 ) 3 2 Step IV: The ( 2α) confdence nterval s gven by (Ŵ LOW (V ), Ŵ UP (V )).. Web Appendx K: Detaled results from the HIP study [Table 3 about here.]
18 Web Appendx 7 Complers n the Treatment Arm Log(H(t)) Log(t) Fgure. Complers n the Treatment Arm
19 8 Bometrcs, Never takers n the Treatment Arm Log(H(t)) Pont Estmate Regresson Lne Log(t) Fgure 2. Never-takers n the Treatment Arm
20 Web Appendx 9 Table Estmates of the dfference of the survval probabltes between the complers n the treatment group and those n the control group at tme pont V when π c = 0.5 Relatve bas wth RMSE wth Group V C 0 C K True PNEMLE IV Para PNEMLE IV Para E W LN LL G
21 20 Bometrcs, Table 2 Estmates of the dfference of the survval probabltes between the complers n the treatment group and those n the control group at tme pont V when π c = 0.2 Relatve bas wth RMSE wth Group V C 0 C K True PNEMLE IV Para PNEMLE IV Para W LN
22 Web Appendx 2 Table 3 Results from the HIP study: estmates and 95% bootstrap percentle confdence ntervals of the dfference between survval probablty between the survval probablty of the complers n the treatment group and that of the complers n the control group at every half year Tme Pont PNEMLE IV Para Webull ITT (-0.032,0.043) ( ,0.043) ( ,0.0292) ( ,0.002) ( ,0.0884) (0.0036,0.0884) (0.0066,0.076) ( , ) (0.0432,0.74) 0.06 (0.0432,0.74) (0.0256,0.26) (0.0307,0.24) (0.078,0.74) (0.078,0.74) 0.09 (0.044,0.78) (0.026,0.24) (0.0408,0.206) 0.23 (0.0408,0.206) 0.37 (0.0507,0.222) (0.0290,0.46)
Inference for the Effect of Treatment on Survival Probability in Randomized. Trials with Noncompliance and Administrative Censoring
Bometrcs 000, 000 000 DOI: 000 000 0000 Inference for the Effect of Treatment on Survval Probablty n Randomzed Trals wth Noncomplance and Admnstratve Censorng Hu Ne 1,, Jng Cheng 2,, and Dylan S. Small
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationThe EM Algorithm (Dempster, Laird, Rubin 1977) The missing data or incomplete data setting: ODL(φ;Y ) = [Y;φ] = [Y X,φ][X φ] = X
The EM Algorthm (Dempster, Lard, Rubn 1977 The mssng data or ncomplete data settng: An Observed Data Lkelhood (ODL that s a mxture or ntegral of Complete Data Lkelhoods (CDL. (1a ODL(;Y = [Y;] = [Y,][
More informationANSWERS. 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 informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Mamum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models for
More informationSTAT 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 informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationChapter 20 Duration Analysis
Chapter 20 Duraton Analyss Duraton: tme elapsed untl a certan event occurs (weeks unemployed, months spent on welfare). Survval analyss: duraton of nterest s survval tme of a subject, begn n an ntal state
More informationParameters Estimation of the Modified Weibull Distribution Based on Type I Censored Samples
Appled Mathematcal Scences, Vol. 5, 011, no. 59, 899-917 Parameters Estmaton of the Modfed Webull Dstrbuton Based on Type I Censored Samples Soufane Gasm École Supereure des Scences et Technques de Tuns
More informationLecture 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 informationEfficient Nonparametric Estimation of Causal Effects in Randomized Trials With Noncompliance
Unversty of Pennsylvana ScholarlyCommons Statstcs Papers Wharton Faculty Research 3-2009 Effcent Nonparametrc Estmaton of Causal Effects n Randomzed Trals Wth Noncomplance Jng Cheng Dylan Small Unversty
More information3.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 informationDurban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications
Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department
More information1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands
Content. Inference on Regresson Parameters a. Fndng Mean, s.d and covarance amongst estmates.. Confdence Intervals and Workng Hotellng Bands 3. Cochran s Theorem 4. General Lnear Testng 5. Measures of
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationComputing MLE Bias Empirically
Computng MLE Bas Emprcally Kar Wa Lm Australan atonal Unversty January 3, 27 Abstract Ths note studes the bas arses from the MLE estmate of the rate parameter and the mean parameter of an exponental dstrbuton.
More informationLinear 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 informationSee Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)
Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes
More informationPredictive 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 informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationInfluence Diagnostics on Competing Risks Using Cox s Model with Censored Data. Jalan Gombak, 53100, Kuala Lumpur, Malaysia.
Proceedngs of the 8th WSEAS Internatonal Conference on APPLIED MAHEMAICS, enerfe, Span, December 16-18, 5 (pp14-138) Influence Dagnostcs on Competng Rsks Usng Cox s Model wth Censored Data F. A. M. Elfak
More informationSolutions 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 informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationSTAT 3340 Assignment 1 solutions. 1. Find the equation of the line which passes through the points (1,1) and (4,5).
(out of 15 ponts) STAT 3340 Assgnment 1 solutons (10) (10) 1. Fnd the equaton of the lne whch passes through the ponts (1,1) and (4,5). β 1 = (5 1)/(4 1) = 4/3 equaton for the lne s y y 0 = β 1 (x x 0
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationChapter 5 Multilevel Models
Chapter 5 Multlevel Models 5.1 Cross-sectonal multlevel models 5.1.1 Two-level models 5.1.2 Multple level models 5.1.3 Multple level modelng n other felds 5.2 Longtudnal multlevel models 5.2.1 Two-level
More informationSmall Area Interval Estimation
.. Small Area Interval Estmaton Partha Lahr Jont Program n Survey Methodology Unversty of Maryland, College Park (Based on jont work wth Masayo Yoshmor, Former JPSM Vstng PhD Student and Research Fellow
More informationGoodness of fit and Wilks theorem
DRAFT 0.0 Glen Cowan 3 June, 2013 Goodness of ft and Wlks theorem Suppose we model data y wth a lkelhood L(µ) that depends on a set of N parameters µ = (µ 1,...,µ N ). Defne the statstc t µ ln L(µ) L(ˆµ),
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationSTAT 405 BIOSTATISTICS (Fall 2016) Handout 15 Introduction to Logistic Regression
STAT 45 BIOSTATISTICS (Fall 26) Handout 5 Introducton to Logstc Regresson Ths handout covers materal found n Secton 3.7 of your text. You may also want to revew regresson technques n Chapter. In ths handout,
More informationStatistical Hypothesis Testing for Returns to Scale Using Data Envelopment Analysis
Statstcal Hypothess Testng for Returns to Scale Usng Data nvelopment nalyss M. ukushge a and I. Myara b a Graduate School of conomcs, Osaka Unversty, Osaka 560-0043, apan (mfuku@econ.osaka-u.ac.p) b Graduate
More informationMaximum Likelihood Estimation
Maxmum Lkelhood Estmaton INFO-2301: Quanttatve Reasonng 2 Mchael Paul and Jordan Boyd-Graber MARCH 7, 2017 INFO-2301: Quanttatve Reasonng 2 Paul and Boyd-Graber Maxmum Lkelhood Estmaton 1 of 9 Why MLE?
More informationComposite 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 informationEM and Structure Learning
EM and Structure Learnng Le Song Machne Learnng II: Advanced Topcs CSE 8803ML, Sprng 2012 Partally observed graphcal models Mxture Models N(μ 1, Σ 1 ) Z X N N(μ 2, Σ 2 ) 2 Gaussan mxture model Consder
More informationNon-Mixture Cure Model for Interval Censored Data: Simulation Study ABSTRACT
Malaysan Journal of Mathematcal Scences 8(S): 37-44 (2014) Specal Issue: Internatonal Conference on Mathematcal Scences and Statstcs 2013 (ICMSS2013) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES Journal
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationLOGIT ANALYSIS. A.K. VASISHT Indian Agricultural Statistics Research Institute, Library Avenue, New Delhi
LOGIT ANALYSIS A.K. VASISHT Indan Agrcultural Statstcs Research Insttute, Lbrary Avenue, New Delh-0 02 amtvassht@asr.res.n. Introducton In dummy regresson varable models, t s assumed mplctly that the dependent
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationStatistical 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 informationFirst 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 informationHow Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *
How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton
More informationSTK4080/9080 Survival and event history analysis
SK48/98 Survval and event hstory analyss Lecture 7: Regresson modellng Relatve rsk regresson Regresson models Assume that we have a sample of n ndvduals, and let N (t) count the observed occurrences of
More informationCS 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 informationRockefeller College University at Albany
Rockefeller College Unverst at Alban PAD 705 Handout: Maxmum Lkelhood Estmaton Orgnal b Davd A. Wse John F. Kenned School of Government, Harvard Unverst Modfcatons b R. Karl Rethemeer Up to ths pont n
More informationEfficient nonresponse weighting adjustment using estimated response probability
Effcent nonresponse weghtng adjustment usng estmated response probablty Jae Kwang Km Department of Appled Statstcs, Yonse Unversty, Seoul, 120-749, KOREA Key Words: Regresson estmator, Propensty score,
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More informationa. (All your answers should be in the letter!
Econ 301 Blkent Unversty Taskn Econometrcs Department of Economcs Md Term Exam I November 8, 015 Name For each hypothess testng n the exam complete the followng steps: Indcate the test statstc, ts crtcal
More informationRELIABILITY ASSESSMENT
CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationTime to dementia onset: competing risk analysis with Laplace regression
Tme to dementa onset: competng rsk analyss wth Laplace regresson Gola Santon, Debora Rzzuto, Laura Fratglon 4 th Nordc and Baltc STATA Users group meetng, Stockholm, November 20 Agng Research Center (ARC),
More informationDepartment of Quantitative Methods & Information Systems. Time Series and Their Components QMIS 320. Chapter 6
Department of Quanttatve Methods & Informaton Systems Tme Seres and Ther Components QMIS 30 Chapter 6 Fall 00 Dr. Mohammad Zanal These sldes were modfed from ther orgnal source for educatonal purpose only.
More informationENG 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 informationClassification as a Regression Problem
Target varable y C C, C,, ; Classfcaton as a Regresson Problem { }, 3 L C K To treat classfcaton as a regresson problem we should transform the target y nto numercal values; The choce of numercal class
More informationLecture 3 Stat102, Spring 2007
Lecture 3 Stat0, Sprng 007 Chapter 3. 3.: Introducton to regresson analyss Lnear regresson as a descrptve technque The least-squares equatons Chapter 3.3 Samplng dstrbuton of b 0, b. Contnued n net lecture
More informationStat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j
Stat 642, Lecture notes for 01/27/05 18 Rate Standardzaton Contnued: Note that f T n t where T s the cumulatve follow-up tme and n s the number of subjects at rsk at the mdpont or nterval, and d s the
More informationp(z) = 1 a e z/a 1(z 0) yi a i x (1/a) exp y i a i x a i=1 n i=1 (y i a i x) inf 1 (y Ax) inf Ax y (1 ν) y if A (1 ν) = 0 otherwise
Dustn Lennon Math 582 Convex Optmzaton Problems from Boy, Chapter 7 Problem 7.1 Solve the MLE problem when the nose s exponentally strbute wth ensty p(z = 1 a e z/a 1(z 0 The MLE s gven by the followng:
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationHomework 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 informationComputation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models
Computaton of Hgher Order Moments from Two Multnomal Overdsperson Lkelhood Models BY J. T. NEWCOMER, N. K. NEERCHAL Department of Mathematcs and Statstcs, Unversty of Maryland, Baltmore County, Baltmore,
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationSolution Thermodynamics
Soluton hermodynamcs usng Wagner Notaton by Stanley. Howard Department of aterals and etallurgcal Engneerng South Dakota School of nes and echnology Rapd Cty, SD 57701 January 7, 001 Soluton hermodynamcs
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More information8 : Learning in Fully Observed Markov Networks. 1 Why We Need to Learn Undirected Graphical Models. 2 Structural Learning for Completely Observed MRF
10-708: Probablstc Graphcal Models 10-708, Sprng 2014 8 : Learnng n Fully Observed Markov Networks Lecturer: Erc P. Xng Scrbes: Meng Song, L Zhou 1 Why We Need to Learn Undrected Graphcal Models In the
More informationEconomics 130. Lecture 4 Simple Linear Regression Continued
Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do
More informationEstimation of the Mean of Truncated Exponential Distribution
Journal of Mathematcs and Statstcs 4 (4): 84-88, 008 ISSN 549-644 008 Scence Publcatons Estmaton of the Mean of Truncated Exponental Dstrbuton Fars Muslm Al-Athar Department of Mathematcs, Faculty of Scence,
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationHomework 10 Stat 547. Problem ) Z D!
Homework 0 Stat 547 Problem 74 Notaton: h s the hazard rate for the aneulod grou, h s the hazard rate for the dlod grou (a Log-rank test s erformed: H 0 : h (t = h (t Sgnfcance level α = 005 Test statstc
More informationTHE ROYAL STATISTICAL SOCIETY 2006 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE
THE ROYAL STATISTICAL SOCIETY 6 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutons to assst canddates preparng for the eamnatons n future years and for
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Experments- MODULE LECTURE - 6 EXPERMENTAL DESGN MODELS Dr. Shalabh Department of Mathematcs and Statstcs ndan nsttute of Technology Kanpur Two-way classfcaton wth nteractons
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationStatistical analysis using matlab. HY 439 Presented by: George Fortetsanakis
Statstcal analyss usng matlab HY 439 Presented by: George Fortetsanaks Roadmap Probablty dstrbutons Statstcal estmaton Fttng data to probablty dstrbutons Contnuous dstrbutons Contnuous random varable X
More informationParametric fractional imputation for missing data analysis
Secton on Survey Research Methods JSM 2008 Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Wayne Fuller Abstract Under a parametrc model for mssng data, the EM algorthm s a popular tool
More informationManaging Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration
Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
More informationTHE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.
THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall
More informationHydrological statistics. Hydrological statistics and extremes
5--0 Stochastc Hydrology Hydrologcal statstcs and extremes Marc F.P. Berkens Professor of Hydrology Faculty of Geoscences Hydrologcal statstcs Mostly concernes wth the statstcal analyss of hydrologcal
More informationFoundations 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 informationSTATS 306B: Unsupervised Learning Spring Lecture 10 April 30
STATS 306B: Unsupervsed Learnng Sprng 2014 Lecture 10 Aprl 30 Lecturer: Lester Mackey Scrbe: Joey Arthur, Rakesh Achanta 10.1 Factor Analyss 10.1.1 Recap Recall the factor analyss (FA) model for lnear
More information3.1 ML and Empirical Distribution
67577 Intro. to Machne Learnng Fall semester, 2008/9 Lecture 3: Maxmum Lkelhood/ Maxmum Entropy Dualty Lecturer: Amnon Shashua Scrbe: Amnon Shashua 1 In the prevous lecture we defned the prncple of Maxmum
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More information