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.     

Optimum covariate designs in partially balanced incomplete block (PBIB) design set-ups

The use of covariates in block designs is necessary when the covariates cannot be controlled like the blocking factor in the experiment. In this paper, we consider the situation where there is some flexibility for selection in the values of the covariates. The choice of values of the covariates for a given block design attaining minimum variance for estimation of each of the parameters has attracted attention in recent times. Optimum covariate designs in simple set-ups such as completely randomised design (CRD), randomised block design (RBD) and some series of balanced incomplete block design (BIBD) have already been considered. In this paper, optimum covariate designs have been considered for the more complex set-ups of different partially balanced incomplete block (PBIB) designs, which are popular among practitioners. The optimum covariate designs depend much on the methods of construction of the basic PBIB designs. Different combinatorial arrangements and tools such as orthogonal arrays, Hadamard matrices and different kinds of products of matrices viz. Khatri–Rao product, Kronecker product have been conveniently used to construct optimum covariate designs with as many covariates as possible.     

Generalizing the information content for stepped wedge designs: A marginal modeling approach

Stepped wedge trials are increasingly adopted because practical constraints necessitate staggered roll-out. While a complete design requires clusters to collect data in all periods, resource and patient-centered considerations may call for an incomplete stepped wedge design to minimize data collection burden. To study incomplete designs, we expand the metric of information content to discrete outcomes. We operate under a marginal model with general link and variance functions, and derive information content expressions when data elements (cells, sequences, periods) are omitted. We show that the centrosymmetric patterns of information content can hold for discrete outcomes with the variance-stabilizing link function. We perform numerical studies under the canonical link function, and find that while the patterns of information content for cells are approximately centrosymmetric for all examined underlying secular trends, the patterns of information content for sequences or periods are more sensitive to the secular trend, and may be far from centrosymmetric.     

A series of single array 2m factorial search designs for even m

By means of a search design one is able to search for and estimate a small set of non‐zero elements from the set of higher order factorial interactions in addition to estimating the lower order factorial effects. One may be interested in estimating the general mean and main effects, in addition to searching for and estimating a non‐negligible effect in the set of 2‐ and 3‐factor interactions, assuming 4‐ and higher‐order interactions are all zero. Such a search design is called a ‘main effect plus one plan’ and is denoted by MEP.1. Construction of such a plan, for 2^m factorial experiments, has been considered and developed by several authors and leads to MEP.1 plans for an odd number m of factors. These designs are generally determined by two arrays, one specifying a main effect plan and the other specifying a follow‐up. In this paper we develop the construction of search designs for an even number of factors m, m≠6. The new series of MEP.1 plans is a set of single array designs with a well structured form. Such a structure allows for flexibility in arriving at an appropriate design with optimum properties for search and estimation.     

Goodness of exact experimental designs with respect to a certain family of criteria

In the paper we assume to be given an approximate optimum exact design with respect to one optimality criterion. We investigate the goodness of this design in the sense of a family of criteria that includes those of A-E-, and .D-optimality.     

Computing A-optimal and E-optimal designs for regression models via semidefinite programming

In semidefinite programming (SDP), we minimize a linear objective function subject to a linear matrix being positive semidefinite. A powerful program, SeDuMi, has been developed in MATLAB to solve SDP problems. In this article, we show in detail how to formulate A-optimal and E-optimal design problems as SDP problems and solve them by SeDuMi. This technique can be used to construct approximate A-optimal and E-optimal designs for all linear and nonlinear regression models with discrete design spaces. In addition, the results on discrete design spaces provide useful guidance for finding optimal designs on any continuous design space, and a convergence result is derived. Moreover, restrictions in the designs can be easily incorporated in the SDP problems and solved by SeDuMi. Several representative examples and one MATLAB program are given.     

Applications and Implementations of Continuous Robust Designs

In the literature concerning the construction of robust optimal designs, many resulting designs turn out to have densities. In practice, an exact design should tell the experimenter what the support points are and how many subjects should be allocated to each of these points. In particular, we consider a practical situation in which the number of support points allowed is constrained. We discuss an intuitive approach, which motivates a new implementation scheme that minimizes the loss function based on the Kolmogorov and Smirnov distance between an exact design and the optimal design having a density. We present three examples to illustrate the application and implementation of a robust design constructed: one for a nonlinear dose-response experiment and the other two for general linear regression. Additionally, we perform some simulation studies to compare the efficiencies of the exact designs obtained by our optimal implementation with those by other commonly used implementation methods.     

A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs

In the optimal experimental design literature, the G-optimality is defined as minimizing the maximum prediction variance over the entire experimental design space. Although the G-optimality is a highly desirable property in many applications, there are few computer algorithms developed for constructing G-optimal designs. Some existing methods employ an exhaustive search over all candidate designs, which is time-consuming and inefficient. In this paper, a new algorithm for constructing G-optimal experimental designs is developed for both linear and generalized linear models. The new algorithm is made based on the clustering of candidate or evaluation points over the design space and it is a combination of point exchange algorithm and coordinate exchange algorithm. In addition, a robust design algorithm is proposed for generalized linear models with modification of an existing method. The proposed algorithm are compared with the methods proposed by Rodriguez et al. [Generating and assessing exact G-optimal designs. J. Qual. Technol. 2010;42(1):3–20] and Borkowski [Using a genetic algorithm to generate small exact response surface designs. J. Prob. Stat. Sci. 2003;1(1):65–88] for linear models and with the simulated annealing method and the genetic algorithm for generalized linear models through several examples in terms of the G-efficiency and computation time. The result shows that the proposed algorithm can obtain a design with higher G-efficiency in a much shorter time. Moreover, the computation time of the proposed algorithm only increases polynomially when the size of model increases.     

Robust sequential designs for approximately linear models

We consider the problem of the sequential choice of design points in an approximately linear model. It is assumed that the fitted linear model is only approximately correct, in that the true response function contains a nonrandom, unknown term orthogonal to the fitted response. We also assume that the parameters are estimated by M-estimation. The goal is to choose the next design point in such a way as to minimize the resulting integrated squared bias of the estimated response, to order n^-1. Explicit applications to analysis of variance and regression are given. In a simulation study the sequential designs compare favourably with some fixed-sample-size designs which are optimal for the true response to which the sequential designs must adapt.     

Non-linear design problem in a chemical kinetic model with non-constant error variance

For a locally optimum non-linear design problem for a chemical kinetic model, we investigate the influence of the dispersion structure of the random observation errors on the design and its efficiency. We find that there are two kinds of design determined by the model parameters and the error variance function: “interior” designs, and “boundary” designs that depend also on the design range. We give an exact criterion for determining which kind of design will arise and we illustrate the qualitative difference between the two kinds of design in terms of the design locus and the equivalence theorem. We tabulate quantitative details of the designs for a range of parameter values.     

Minimal Markov Basis for Tests of Main Effect Models for 2p-1 Fractional Factorial Designs of Resolution p

We consider conditional exact tests of factor effects in design of experiments for discrete response variables. Similarly to the analysis of contingency tables, Markov chain Monte Carlo methods can be used to perform exact tests, especially when large-sample approximations of the null distributions are poor and the enumeration of the conditional sample space is infeasible. In order to construct a connected Markov chain over the appropriate sample space, one approach is to compute a Markov basis. Theoretically, a Markov basis can be characterized as a generator of a well-specified toric ideal in a polynomial ring and is computed by computational algebraic software. However, the computation of a Markov basis sometimes becomes infeasible, even for problems of moderate sizes. In the present article, we obtain the closed-form expression of minimal Markov bases for the main effect models of 2^{p ? 1} fractional factorial designs of resolution p.     

Sequential asymmetric third order rotatable designs (SATORDs)

Rotatable designs that are available for process/ product optimization trials are mostly symmetric in nature. In many practical situations, response surface designs (RSDs) with mixed factor (unequal) levels are more suitable as these designs explore more regions in the design space but it is hard to get rotatable designs with a given level of asymmetry. When experimenting with unequal factor levels via asymmetric second order rotatable design (ASORDs), the lack of fit of the model may become significant which ultimately leads to the estimation of parameters based on a higher (or third) order model. Experimenting with a new third order rotatable design (TORD) in such a situation would be expensive as the responses observed from the first stage runs would be kept underutilized. In this paper, we propose a method of constructing asymmetric TORD by sequentially augmenting some additional points to the ASORDs without discarding the runs in the first stage. The proposed designs will be more economical to obtain the optimum response as the design in the first stage can be used to fit the second order model and with some additional runs, third order model can be fitted without discarding the initial design.KEYWORDS: Response surface methodology, rotatability, orthogonal transformation, asymmetric, sequential experimentation, third order designs     

The exact risks of some pre-test and stein-type regression estimators umder balanced loss

In regression analysis we are often interested in using an estimator which is “precise” and which simultaneously provides a model with “good fit”, In this paper we consider the risk properties of several estimators of the regression coefficient vector "trader “balanced” loss, This loss function (Zellner, 1994) reflects both of the described attributes. Under a particular form of balanced loss, we derive the predictive risk of the pre-test estimator which results after a test for exact linear restrictions on the coefficient vector. The corresponding risks of Stein-rule and positive-part Stein-rale estimators are also established. The risks based on loss functions which allow only for estimation precision, or only for goodness of fit, are special cases of our results, and we draw appropriate comparisons, In particular, we show that some of the well-known results under (quadratic) precision-only loss are not robust to our generalization of the loss function     

A-optimal design measures for one-way layouts with additive regression

For linear models with one discrete factor and additive general regression term the problem of characterizing A-optimal design measures for inference on (i) treatment effects, (ii) the regression parameters and (iii) all parameters will be considered. In any of these problems product designs can be found which are optimal among all designs, and equal weigth 1/J may be given to each of the J levels of the discrete factor. For problem (i) and (ii) the allocation of the continuous factors for the regression term should follow a suitable optimal design for the corresponding pure regression model, whereas for problem (iii) this would not give an A-optimal product design. For this problem an equivalence theorem for A-optimal product designs will be given. An example will illustrate these results. Finally, by analyzing a model with two discrete factors it will be shown that for enlarged models the best product designs may not be A-optimal.     

Outliers and Patterns of Outliers in Contingency Tables with Algebraic Statistics

Abstract. In this paper, we provide a definition of pattern of outliers in contingency tables within a model‐based framework. In particular, we make use of log‐linear models and exact goodness‐of‐fit tests to specify the notions of outlier and pattern of outliers. The language and some techniques from Algebraic Statistics are essential tools to make the definition clear and easily applicable. We also analyse several numerical examples to show how to use our definitions.     

Classification of an observation into linear manifolds,their closed subsets and closed convex subsets

In this paper, we generalize the notion of classification of an observation (sample), into one of the given n populations to the case where some or all of the populations into which the new observation is to be classified may be new but related in a simple way to the given n populations. The discussion is in the frame-work of the given set of observations obeying the usual multivariate general linear hypothesis model. The set ofpopulations into which the new observation may be classified could be linear manifolds of the parameter space or their closed subsets or closed convex subsets or a combination of them or simply t subsets of the parameter space each of which has a finite number of elements. In the last case alikelihood ratio procedure can be obtained easily. Classification procedures given here are based on Mahalanobis distance. Bonferroni lower bound estimate of the probability of correctly classifying an observation is given for the case when the covariance matrix is known or is estimated from a large sample. A numerical example relating to the classification procedures suggested her is given.     

Comparing search and estimation performances of designs based on a compound criterion

Since the introduction of the search design by Srivastava [Designs for searching non-negligible effects. In: Srivastava, editor. A survey of statistical design and linear models. Amsterdam: North-Holland, Elsevier; 1975. p. 507–519], construction of such designs has been considered by many researchers. The efficient performances of constructed search designs in terms of parameter estimation and search ability of parameters have also been investigated by several authors. They have proposed suitable optimality measures such as DD- and AD-optimality for estimation in the early stage of search design construction. Moreover, since 1990s, some criteria have been developed to evaluate search performance of a design. Although these criteria are useful none of them is able to evaluate both estimation and search efficiency of a design simultaneously. In this paper, we propose dual-task criteria to deal with searching and estimating performances of search designs. These compound criteria are weighted multiplication of estimation and search suitable criteria. They will be used for design comparison and the results will be presented.     

Balanced 2m factorial designs of resolution v which allow search and estimation of one extra unknown effect, 4 ≤ m ≤ 8

In this paper, we obtain balanced resolution V plans for 2^m factorial experiments (4 ≤ m ≤ 8), which have an additional feature. Instead of assuming that the three factor and higher order effects are all zero, we assume that there is at most one nonnegligible effect among them; however, we do not know which particular effect is nonnegligible. The problem is to search which effect is non-negligible and to estimate it, along with estimating the main effects and two factor interactions etc., as in an ordinary resolution V design. For every value of N (the number of treatments) within a certain practical range, we present a design using which the search and estimation can be carried out. (Of course, as in all statistical problems, the probability of correct search will depend upon the size of “error” or “noise” present in the observations. However, the designs obtained are such that, at least in the noiseless case, this probability equals 1.) It is found that many of these designs are identical with optimal balanced resolution V designs obtained earlier in the work of Srivastava and Chopra.     

The plan of enrichment designs for dealing with high placebo response

To deal with high placebo response in clinical trials for psychiatric and other diseases, different enrichment designs, such as the sequential parallel design, two‐way enriched design, and sequential enriched design, have been proposed and implemented recently. Depending on the historical trial information and the trial sponsors' resources, detailed design elements are needed for determining which design to adopt. To assist in making more suitable decisions, we perform evaluations for selecting required design elements in terms of power optimization and sample size planning. We also discuss the implementation of the interim analysis related to its applicability.     

Constructing optimal projection designs

ABSTRACT

The early stages of many real-life experiments involve a large number of factors among which only a few factors are active. Unfortunately, the optimal full-dimensional designs of those early stages may have bad low-dimensional projections and the experimenters do not know which factors turn out to be important before conducting the experiment. Therefore, designs with good projections are desirable for factor screening. In this regard, significant questions are arising such as whether the optimal full-dimensional designs have good projections onto low dimensions? How experimenters can measure the goodness of a full-dimensional design by focusing on all of its projections?, and are there linkages between the optimality of a full-dimensional design and the optimality of its projections? Through theoretical justifications, this paper tries to provide answers to these interesting questions by investigating the construction of optimal (average) projection designs for screening either nominal or quantitative factors. The main results show that: based on the aberration and orthogonality criteria the full-dimensional design is optimal if and only if it is optimal projection design; the full-dimensional design is optimal via the aberration and orthogonality if and only if it is uniform projection design; there is no guarantee that a uniform full-dimensional design is optimal projection design via any criterion; the projection design is optimal via the aberration, orthogonality and uniformity criteria if it is optimal via any criterion of them; and the saturated orthogonal designs have the same average projection performance.