(M,S)-optimality in selecting factorial designs

Use of the (M,S) criterion to select and classify factorial designs is proposed and studied. The criterion is easy to deal with computationally and it is independent of the choice of treatment contrasts. It can be applied to two-level designs as well as multi-level symmetrical and asymmetrical designs. An important connection between the (M,S) and minimum aberration criteria is derived for regular fractional factorial designs. Relations between the (M,S) criterion and generalized minimum aberration criteria on nonregular designs are also discussed. The (M,S) criterion is then applied to study the projective properties of some nonregular designs.     

Classification of three-level strength-3 arrays

Generalized aberration (GA) is one of the most frequently used criteria to quantify the suitability of an orthogonal array (OA) to be used as an experimental design. The two main motivations for GA are that it quantifies bias in a main-effects only model and that it is a good surrogate for estimation efficiencies of models with all the main effects and some two-factor interaction components. We demonstrate that these motivations are not appropriate for three-level OAs of strength 3 and we propose a direct classification with other criteria instead. To illustrate, we classified complete series of three-level strength-3 OAs with 27, 54 and 81 runs using the GA criterion, the rank of the matrix with two-factor interaction contrasts, the estimation efficiency of two-factor interactions, the projection estimation capacity, and a new model robustness criterion. For all of the series, we provide a list of admissible designs according to these criteria.     

On minimax designs when there are two candidate models

This work is motivated by the need to find experimental designs which are robust under different model assumptions. We measure robustness by calculating a measure of design efficiency with respect to a design optimality criterion and say that a design is robust if it is reasonably efficient under different model scenarios. We discuss two design criteria and an algorithm which can be used to obtain robust designs. The first criterion employs a Bayesian-type approach by putting a prior or weight on each candidate model and possibly priors on the corresponding model parameters. We define the first criterion as the expected value of the design efficiency over the priors. The second design criterion we study is the minimax design which minimizes the worst value of a design criterion over all candidate models. We establish conditions when these two criteria are equivalent when there are two candidate models. We apply our findings to the area of accelerated life testing and perform sensitivity analysis of designs with respect to priors and misspecification of planning values.     

The Use of Treatment Concurrences to Assess Robustness of Binary Block Designs Against the Loss of Whole Blocks

Criteria are proposed for assessing the robustness of a binary block design against the loss of whole blocks, based on summing entries of selected upper non‐principal sections of the concurrence matrix. These criteria improve on the minimal concurrence concept that has been used previously and provide new conditions for measuring the robustness status of a design. The robustness properties of two‐associate partially balanced designs are considered and it is shown that two categories of group divisible designs are maximally robust. These results expand a classic result in the literature, obtained by Ghosh, which established maximal robustness for the class of balanced block designs.     

On constructing general minimum lower order confounding two-level block designs

In practice, to reduce systematic variation and increase precision of effect estimation, a practical design strategy is then to partition the experimental units into homogeneous groups, known as blocks. It is an important issue to study the optimal way on blocking the experimental units. Blocked general minimum lower order confounding (B¹-GMC) is a new criterion for selecting optimal block designs. The paper considers the construction of optimal two-level block designs with respect to the B¹-GMC criterion. By utilizing doubling theory and MaxC2 design, some optimal block designs with respect to the B¹-GMC criterion are obtained.     

Optimal experimental design criterion for discriminating semiparametric models

This paper studies the optimal experimental design problem to discriminate two regression models. Recently, López-Fidalgo et al. [2007. An optimal experimental design criterion for discriminating between non-normal models. J. Roy. Statist. Soc. B 69, 231–242] extended the conventional T-optimality criterion by Atkinson and Fedorov [1975a. The designs of experiments for discriminating between two rival models. Biometrika 62, 57–70; 1975b. Optimal design: experiments for discriminating between several models. Biometrika 62, 289–303] to deal with non-normal parametric regression models, and proposed a new optimal experimental design criterion based on the Kullback–Leibler information divergence. In this paper, we extend their parametric optimality criterion to a semiparametric setup, where we only need to specify some moment conditions for the null or alternative regression model. Our criteria, called the semiparametric Kullback–Leibler optimality criteria, can be implemented by applying a convex duality result of partially finite convex programming. The proposed method is illustrated by a simple numerical example.     

Designs for two-colour microarray experiments

Summary.  Designs for two-colour microarray experiments can be viewed as block designs with two treatments per block. Explicit formulae for the A- and D-criteria are given for the case that the number of blocks is equal to the number of treatments. These show that the A- and D-optimality criteria conflict badly if there are 10 or more treatments. A similar analysis shows that designs with one or two extra blocks perform very much better, but again there is a conflict between the two optimality criteria for moderately large numbers of treatments. It is shown that this problem can be avoided by slightly increasing the number of blocks. The two colours that are used in each block effectively turn the block design into a row–column design. There is no need to use a design in which every treatment has each colour equally often: rather, an efficient row–column design should be used. For odd replication, it is recommended that the row–column design should be based on a bipartite graph, and it is proved that the optimal such design corresponds to an optimal block design for half the number of treatments. Efficient row–column designs are given for replications 3–6. It is shown how to adapt them for experiments in which some treatments have replication only 2.     

D‐optimal minimax fractional factorial designs

The D‐optimal minimax criterion is proposed to construct fractional factorial designs. The resulting designs are very efficient, and robust against misspecification of the effects in the linear model. The criterion was first proposed by Wilmut & Zhou (2011); their work is limited to two‐level factorial designs, however. In this paper we extend this criterion to designs with factors having any levels (including mixed levels) and explore several important properties of this criterion. Theoretical results are obtained for construction of fractional factorial designs in general. This minimax criterion is not only scale invariant, but also invariant under level permutations. Moreover, it can be applied to any run size. This is an advantage over some other existing criteria. The Canadian Journal of Statistics 41: 325–340; 2013 © 2013 Statistical Society of Canada     

Minimum aberration blocking schemes for 128-run designs

Several criteria have been proposed for ranking blocked fractional factorial designs. For large fractional factorial designs, the most appropriate minimum aberration criterion was one proposed by Cheng and Wu (2002). We justify this assertion and propose a novel construction method to overcome the computational challenge encountered in large fractional factorial designs. Tables of minimum aberration blocked designs are presented for N=128 runs and n=8–64 factors.     

Balanced Treatment incomplete block (BTIB) designs for comparing treatments with a control: minimal complete sets of generator designs for k = 3, p = 3(1)10

Bechhofer and Tamhane (1981) proposed a new class of incomplete block designs called BTIB designs for comparing p ≥ 2 test treatments with a control treatment in blocks of equal size k < p + 1. All BTIB designs for given (p,k) can be constructed by forming unions of replications of a set of elementary BTIB designs called generator designs for that (p,k). In general, there are many generator designs for given (p,k) but only a small subset (called the minimal complete set) of these suffices to obtain all admissible BTIB designs (except possibly any equivalent ones). Determination of the minimal complete set of generator designs for given (p,k) was stated as an open problem in Bechhofer and Tamhane (1981). In this paper we solve this problem for k = 3. More specifically, we give the minimal complete sets of generator designs for k = 3, p = 3(1)10; the relevant proofs are given only for the cases p = 3(1)6. Some additional combinatorial results concerning BTIB designs are also given.     

Some sufficient conditions for the type 1 optimality of block designs

In this paper, we investigate the problem of determining block designs which are optimal under type 1 optimality criteria within various classes of designs having υ treatments arranged in b blocks of size k. The solutions to two optimization problems are given which are related to a general result obtained by Cheng (1978) and which are useful in this investigation. As one application of the solutions obtained, the definition of a regular graph design given in Mitchell and John (1977) is extended to that of a semi-regular graph design and some sufficient conditions are derived for the existence of a semi-regular graph design which is optimal under a given type 1 criterion. A result is also given which shows how the sufficient conditions derived can be used to establish the optimality under a specific type 1 criterion of some particular types of semi- regular graph designs having both equal and unequal numbers of replicates. Finally,some sufficient conditions are obtained for the dual of an A- or D-optimal design to be A- or D-optimal within an appropriate class of dual designs.     

THE ROBUSTNESS OF BINARY AND NON-BINARY BALANCED NESTED ROW-COLUMN DESIGNS UNDER THE UNAVAILABILITY OF BLOCKS: A COMPARISON

In cases where both exist, the balanced, binary nested row-column designs are known to be inferior to a class of balanced non-binary designs. However, if it is possible for blocks of observations to become unavailable after an experiment has commenced, a binary nested row-column design may possibly be better than a non-binary one. This paper investigates the robustness of binary and non-binary variance-balanced nested row-column designs to the unavailability of one or more blocks of observations. Robustness is measured through the C-matrices of the designs resulting from removing blocks, using optimality criteria such as A-, D-, E- and MV-optimality.     

Minimum aberration and model robustness for two-level fractional factorial designs

The performance of minimum aberration two-level fractional factorial designs is studied under two criteria of model robustness. Simple sufficient conditions for a design to dominate another design with respect to each of these two criteria are derived. It is also shown that a minimum aberration design of resolution III or higher maximizes the number of two-factor interactions which are not aliases of main effects and, subject to that condition, minimizes the sum of squares of the sizes of alias sets of two-factor interactions. This roughly says that minimum aberration designs tend to make the sizes of the alias sets very uniform. It follows that minimum aberration is a good surrogate for the two criteria of model robustness that are studied here. Examples are given to show that minimum aberration designs are indeed highly efficient.     

Minimum Aberration Regular Two-Level Designs in the Presence of Dispersion Factors

In practice, the variance of the response variable may change as some specific factors change from one setting to another in a factorial experiment. These factors affecting the variation of the response are called dispersion factors, which can violate the usual assumption of variance homogeneity. In this study, we modify the conventional minimum aberration criterion to take the impact of dispersion factors into account. The situations of one or two dispersion factors are investigated. As a result, we present regular 2^{n ? p} designs with run sizes equal to 16 and 32 using the modified minimum aberration criterion.     

Alternative Foldover Plans for Two-Level Nonregular Designs

Foldover is a classic technique used to select follow-up experimental runs when an initial experiment yields ambiguities. While foldover has been soundly investigated for regular designs, less research has been devoted to this technique for nonregular designs. Previous work focuses on the use of the generalized minimum aberration criterion to obtain optimal foldover plans. In contrast, this article utilizes the concept of minimal dependent sets (MDSs) and associated criteria to rank foldovers of nonregular designs. We propose an integer programming-based solution to aid in the location and enumeration of MDSs. MDS-optimal foldovers for selected nonregular designs are presented and discussed.     

Better experimental design by hybridizing binary matching with imbalance optimization

We present a new experimental design procedure that divides a set of experimental units into two groups in order to minimize error in estimating a treatment effect. One concern is the elimination of large covariate imbalance between the two groups before the experiment begins. Another concern is robustness of the design to misspecification in response models. We address both concerns in our proposed design: we first place subjects into pairs using optimal nonbipartite matching, making our estimator robust to complicated nonlinear response models. Our innovation is to keep the matched pairs extant, take differences of the covariate values within each matched pair, and then use the greedy switching heuristic of Krieger et al. (2019) or rerandomization on these differences. This latter step greatly reduces covariate imbalance. Furthermore, our resultant designs are shown to be nearly as random as matching, which is robust to unobserved covariates. When compared to previous designs, our approach exhibits significant improvement in the mean squared error of the treatment effect estimator when the response model is nonlinear and performs at least as well when the response model is linear. Our design procedure can be found as a method in the open source R package available on CRAN called GreedyExperimentalDesign .     

Uniform Design for Experiments with Mixtures

The goal of uniform mixture design is to scatter the design points in the experimental region uniformly. The commonly used criteria, such as mean square distance, are based on the Euclidean distance. Based on the Lee distance, a new criterion is proposed in this article. And an algorithm, called NTLBG, is also proposed to refine the randomly generated design for the experimental design with mixtures. Some examples show that the design generated by the NTLBG algorithm has a lower criteria value.     

Stopping for efficacy in single-arm phase II clinical trials

Phase II clinical trials investigate whether a new drug or treatment has sufficient evidence of effectiveness against the disease under study. Two-stage designs are popular for phase II since they can stop in the first stage if the drug is ineffective. Investigators often face difficulties in determining the target response rates, and adaptive designs can help to set the target response rate tested in the second stage based on the number of responses observed in the first stage. Popular adaptive designs consider two alternate response rates, and they generally minimise the expected sample size at the maximum uninterested response rate. Moreover, these designs consider only futility as the reason for early stopping and have high expected sample sizes if the provided drug is effective. Motivated by this problem, we propose an adaptive design that enables us to terminate the single-arm trial at the first stage for efficacy and conclude which alternate response rate to choose. Comparing the proposed design with a popular adaptive design from literature reveals that the expected sample size decreases notably if any of the two target response rates are correct. In contrast, the expected sample size remains almost the same under the null hypothesis.     

On Exact K-optimal Designs Minimizing the Condition Number

A new design criterion based on the condition number of an information matrix is proposed to construct optimal designs for linear models, and the resulting designs are called K-optimal designs. The relationship between exact and asymptotic K-optimal designs is derived. Since it is usually hard to find exact optimal designs analytically, we apply a simulated annealing algorithm to compute K-optimal design points on continuous design spaces. Specific issues are addressed to make the algorithm effective. Through exact designs, we can examine some properties of the K-optimal designs such as symmetry and the number of support points. Examples and results are given for polynomial regression models and linear models for fractional factorial experiments. In addition, K-optimal designs are compared with A-optimal and D-optimal designs for polynomial regression models, showing that K-optimal designs are quite similar to A-optimal designs.     

D-optimal minimax design criterion for two-level fractional factorial designs

A D-optimal minimax design criterion is proposed to construct two-level fractional factorial designs, which can be used to estimate a linear model with main effects and some specified interactions. D-optimal minimax designs are robust against model misspecification and have small biases if the linear model contains more interaction terms. When the D-optimal minimax criterion is compared with the D-optimal design criterion, we find that the D-optimal design criterion is quite robust against model misspecification. Lower and upper bounds derived for the loss functions of optimal designs can be used to estimate the efficiencies of any design and evaluate the effectiveness of a search algorithm. Four algorithms to search for optimal designs for any run size are discussed and compared through several examples. An annealing algorithm and a sequential algorithm are particularly effective to search for optimal designs.