on the design of experiments with ordered experimental...

32
On the design of experiments with ordered experimental treatments Satya Prakash Singh (Joint with Ori Davidov) Department of Statistics University of Haifa, Israel Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 1 / 30

Upload: others

Post on 15-May-2020

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

On the design of experiments with ordered experimentaltreatments

Satya Prakash Singh(Joint with Ori Davidov)

Department of StatisticsUniversity of Haifa, Israel

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 1 / 30

Page 2: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Applications

In dose–response studies, responses are increasing with increasingamount of dose (Simple order).

In clinical trials, a placebo or control group is tested against multipletreatment groups (Tree order).

Multiple controls versus multiple treatments comparisons (Bipartiteorder).

Referred to [Barlow et al., 1972] for more applications.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 2 / 30

Page 3: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Case studies: Simple order

In the study by [Spiegelhalter et al., 1999] the height of the ramusbone was measured at three equally spaced time points for 20 boysages 8 to 9. The goal of the study was to identify significant growthspurts, i.e., to test for µ1 ≤ µ2 ≤ µ3, with at least one strict inequlity.

Sample means: µ̂ = (µ̂1, µ̂2, µ̂3) = (48.66, 49.62, 50.57)

Design: n = (n1, n2, n3) = (20, 20, 20), Balanced design ?

Graph:

µ1µ2

µ3

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 3 / 30

Page 4: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Case studies: Tree order

[Igari et al., 2014] investigated the effect of various drugs ondysporic-like state in rats. In particular, different doses of cytisine(drug used for smoking cessation treatment) are given to the rats andassociated intracranial self-stimulation (ICSS) thresholds are observed(response). ICSS measures the potentiation of brain reward function.

Sample means: µ̂ = (µ̂1, . . . , µ̂5) = (97.6, 101.6, 102.2, 103.4, 105.9)

Design: n = (n1, . . . , n5) = (12, . . . , 12), Balanced design ?

Graph:

µ1

µ5

µ4

µ3

µ2

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 4 / 30

Page 5: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Case studies: Bipartite order

The study by [Blake and Boockfor, 1997] designed to study the effectof 4-Tert-Octylphenol (OP) on reproductive hormone secretion in theadult male rats.

The outcome is the ratio of organ (the left kidney) to body weight.

Two control groups (injection of corn oil, no injection) and fourtreatment groups with varied doses of OP and estradiol valerate.

µ1

µ4

µ3

µ2

µ5

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 5 / 30

Page 6: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Case studies: Bipartite order

Sample means: µ̂ = (µ̂1, . . . , µ̂5) = (3.78, 3.60, 3.96, 4.06, 3.68)

Design: n = (n1, . . . , n5) = (6, . . . , 6), Balanced design ?

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 6 / 30

Page 7: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Stress to

“Customize the experiment for the settinginstead of adjusting the setting to fit aclassical design”.

Smucker, B., Krzywinski, M. and Altman, N.: Optimal experimentaldesign. Nature Methods 15, 557–560 (2018)

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 7 / 30

Page 8: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Model

Suppose there are K treatment groups and ni subjects to the ith group.

One-way ANOVA:

Yij = µi + εij , i = 1, . . . ,K and j = 1, . . . , ni

Yij :response of j th subject in i th treatment group

µi : ith treatment effect

εij ∼ N(0, σ2).

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 8 / 30

Page 9: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Order restrictions

In dose response experiments one often expects an increasingresponse with an increasing dose.

Simple Order : µ1 ≤ µ2 ≤ · · · ≤ µKComparing several treatments with a control.

Tree Order : µ1 ≤ [µ2, . . . , µK ]

Investigate and localize the age at which learning ability peaks.

Umbrella Order : µ1 ≤ · · · ≤ µh ≥ · · · ≥ µKIn General,

M1 = {µ ∈ RK : Rµ ≥ 0},

matrix R with elements rij ∈ {−1, 0, 1}, referred to as restriction matrix.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 9 / 30

Page 10: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Objective

The existing methods for designing experiments in the presence of anordering are limited in scope. A broad understanding and formal methods,for constructing optimal designs under order restrictions are still lacking.Our objective is to:

Introducing a new maxi–min optimality criteria tailored for testinghypotheses;

Using this criteria to derive optimal designs for u–LRTs, r–LRTs andIntersection-Union-Tests (IUTs); and

Exploring the relations between the proposed designs and some otherwell known design criteria.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 10 / 30

Page 11: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Graphical Representation

µ1

µ2 µ3µ4

(a) Simple order

µ1

µ5

µ4

µ3

µ2

(b) Simple treeorder

µ1

µ2 µ3 µ4µ5

(c) Umbrella order

µ1

µ8 µ9 µ10

µ13

µ11µ12

µ5

µ7

µ6

µ2 µ3µ4

(d) Complex tree order

µ1

µ4

µ3

µ5

µ2

(e) Bipartiteorder

Figure: Order graphs for various order restrictionsSingh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 11 / 30

Page 12: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Graphical Representation

Let R and L denote, respectively, the set of roots and leafs of anorder graph.

The pair (i , j) where i ∈ R and j ∈ L is called a maximal pair if thereis a path from i to j .

The degree of the vertex i , denoted by di , is the number of directededges connected to it.

Let V denotes the set of maximal pairs with cardinality |V|.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 12 / 30

Page 13: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Graphical Representation

µ1

µ4

µ3

µ5

µ2

(a) Bipartiteorder

L = {1, 2}, R = {3, 4, 5}, d1 = 3, d2 = 2, d3 = 1, d4 = 2, d5 = 2,V = {(1, 3), (1, 4), (1, 5), (2, 4), (2, 5)}, |V| = 5.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 13 / 30

Page 14: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Tests

Hypothesis

H0 : µ ∈M0 versus H1 : µ ∈M1 \M0,

where M0 = {µ ∈ RK : µ1 = µ2 = · · · = µK}.The LRT statistic is:

Tn = 2 log

{maxµ∈M1 L(µ)

maxµ∈M0 L(µ)

}where

L(µ) =K∏i=1

ni∏j=1

(√

2π)−1/2 exp{−1

2(Yij − µi )2}

.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 14 / 30

Page 15: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Tests

u–LRT (standard ANOVA): H1 : µ /∈M0.

u–LRT: Tn follows a chi–square distribution.

r–LRT: H1 : µ ∈M1 \M0.

r–LRT: Tn follows a chi–bar–square distribution([Robertson et al., 1988]).

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 15 / 30

Page 16: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Approximate Design

Exact design: N = {(n1, n2, . . . , nK ) : ni ≥ 0,∑K

i=1 ni = N} denotethe set of all possible ways of arranging N subjects in K groups.

Approximate design: denoted by ξ, whereξ = {(ξ1, ξ2, . . . , ξK )T} ∈ Ξ is a vector of probabilities and the designspace Ξ is the unit simplex i.e., ξi ≥ 0 and

∑Ki=1 ξi = 1. Basically,

ξi = ni/N, for i = 1, . . . ,K .

The power function

π(µ; ξ) = Pµ,ξ(Tn ≥ cα,ξ) =K∑j=0

wjP(χ2j ≥ c)

depends on µ, ξ and wj = wj(Σ,M1) are non-negative weightssumming to unity and Σ = diag(N/n1, . . . ,N/nK ).

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 16 / 30

Page 17: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Motivation: A power maximizing design

Theorem

If |µi − µj | = max{|µs − µt | : 1 ≤ s, t ≤ K} then an optimal design forstandard ANOVA is ξopt = (1/2)(ei + ej), where el is the l th standardbasis of RK .

Prior to the experiment, it is not know that which pair (i , j) of treatmentsis maximally separated.

Example

For µ1 = (1,−1, 0, 0), then ξ1 = (1/2, 1/2, 0, 0) is optimal. Forµ2 = (0, 0,−1, 1), then ξ2 = (0, 0, 1/2, 1/2) is optimal. Thenπξ1,µ1 = πξ2,µ2 = 1 as N →∞ but πξ2,µ1 = πξ1,µ2 = α as N →∞.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 17 / 30

Page 18: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Design Selection Criterion

Define ξMM and µLFC as the the values satisfying:

π(µLFC; ξMM) = maxξ

minµπ(µ; ξ), (1)

where ξ ∈ Ξ and µ ∈Mδ ⊂M1 \M0 where δ measures the distancefrom the null.

Parameter space:

Mδ = {µ ∈ RK : Iµ ≥ 0,Rµ ≥ 0,∑

(i ,j)∈V

(µi − µj) ≥ δ}. (2)

We refer to ξMM as the maxi–min design (MM–design), and µLFC as theleast favorable configuration (LFC).

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 18 / 30

Page 19: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Remark

The constraint in (2) in a 1–norm. More generally a κ–norm would lead toa constraint of the type

∑(i ,j)∈V(µi − µj)κ)1/κ ≥ δ. For example, when

κ = 2 the sum∑

(i ,j)∈V(µi − µj)2 can be rewritten as µTLµ where L isthe Laplacian matrix of the order graph; whereas when κ→∞ we obtainthe constraint max(i ,j)∈V(µi − µj) ≥ δ. A little thought reveals that κplays no role in the minimization of the power function over Mδ andtherefore for simplicity we set κ = 1.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 19 / 30

Page 20: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Results: u–LRT (ANOVA)

Theorem

The balanced design is the maxi-min design in the standard ANOVAsetting.

Theorem

For any order graph the MM–design for the u–LRT is given by:

ξMM = |V|−1∑

(i ,j)∈V

ξij , where ξij = (ei + ej)/2.

Further simplifies to

ξMM = (2|V|)−1(t1, . . . , tK ),

where ti = di if i ∈ L ∪R and 0 otherwise.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 20 / 30

Page 21: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Sketch of the proof:

Non-centrality parameter (NCP) versus Power.

Reduction of general order graph to Bipartite order.

Equivalence Theorem.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 21 / 30

Page 22: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Corollary

The designs: (i) (e1 + eK )/2; (ii) e1/2 +∑K

i=2 ei/(2(K − 1)); and (iii)eh/2 + (e1 + eK )/4 are the MM–designs for the simple, tree and umbrella(with a peak at h) order, respectively.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 22 / 30

Page 23: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

MM–Designs

12

0 012

(b) Simple order

12

18

18

18

18

(c) Simple treeorder

14

012 0

14

(d) Umbrella order

12

0 0 0

110

0110

0

110

110

0 0110

(e) Complex tree order

310

210

110

210

210

(f) Bipartite or-der

Figure: MM–designs for various order restrictions

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 23 / 30

Page 24: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

r–LRT

Theorem

The design (e1 + eK )/2 is the MM–design for the r–LRT under the simpleorder.

Theorem

For any order graph and as N →∞ the MM–design for the r–LRT satisfies

ξRMM = ξU

MM + o(1).

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 24 / 30

Page 25: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Results

80 110 140 170 200 230 260 290 320 3500.3

0.4

0.5

0.6

0.7

0.8

0.9

1

N

Pow

er

MM−design

Balanced design

Dunnett design

Figure: The power of the u–LRT based on balanced and Dunnett designs and thepowers of the r–LRT based on the MM–design for tree order with K = 4

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 25 / 30

Page 26: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Results: Simulated

Table: The required sample sizes (N) necessary to achieve pre-specified powerbased on the r–LRT. The MM, balanced, Dunnett and Singh designs arecompared under the tree order with K = 4 and K = 5. The reduction in samplesize due to the MM design are reported in (%).

N(K = 4) N(K = 5)

Power MM Balanced Dunnett Singh MM Balanced Dunnett

60% 78112 88 86

87149 104

(44%) (13%) (10%) (71%) (19.5%)

80% 130185 145 140

139239 164

(42%) (11.5%) (7.7%) (72%) (18%)

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 26 / 30

Page 27: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Results: Real data examples

Table: Sample size N required to achieve a 80% power based on r–LRT.

Case Study Simple order Tree order (a) Bipartite order

DesignMM 42 99 280

Balanced 66 140 320Dunnett’s – 110 –

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 27 / 30

Page 28: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Further work...

Do not assign observations to the intermediate group.

As a solution, we also proposed designs based on Intersection UnionTests (IUTs).

MM–design are Bayes design with respect to the least favourable priorof µ.

MM–design is Nash design associated with the Game theoriticframework of the usual ANOVA.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 28 / 30

Page 29: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Future work

Designs for experiments with co-variates models.

Correlated observations.

Generalized linear models.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 29 / 30

Page 30: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Thank

You: for your attention.

Questions and Suggestions?

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 30 / 30

Page 31: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Barlow, R. E., Bartholomew, D. J., Bremner, J. M., and Brunk, H. D.(1972).Statistical Inference under Order Restrictions.Wiley, New York.

Blake, C. A. and Boockfor, F. R. (1997).Chronic administration of the environmental pollutant4-tert-octylphenol to adult male rats interferes with the secretion ofluteinizing hormone, follicle-stimulating hormone, prolactin, andtestosterone.Biology of Reproduction, 57:255–266.

Igari, M., Alexander, J. C., Ji, Y., Xiaoli, Q., Papke, R. L., andBruijnzeel, A. W. (2014).Varenicline and cytisine diminish the dysphoric-like state associatedwith spontaneous nicotine withdrawal in rats.Neuropsychopharmacology, 39:445–455.

Robertson, T., Wright, F. T., and Dykstra, R. L. (1988).Order Restricted Statistical Inference.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 30 / 30

Page 32: On the design of experiments with ordered experimental treatmentsdjsym/talk/Day1/Satya_Prakash_Singh.pdf · University of Haifa, Israel Singh, Davidov (University of Haifa, Israel)

Wiley, New York.

Spiegelhalter, D., Thomas, A., Best, N., and Gilks, W. (1999).BUGS 0.5 Examples volume 2, MRC biostatistics Unit.Institute of Public Health. Robinson Way, Cambridge CB2 2SR.

Singh, Davidov (University of Haifa, Israel) Designs for Ordered Experiments 30 / 30