On the E-optimality of complete block designs under a mixed interference model

In experiments in which the response to a treatment can be affected by other treatments, the interference model with neighbor effects is usually used. It is known that circular neighbor balanced designs (CNBDs) are universally optimal under such a model if the neighbor effects are fixed (Druilhet, 1999) or random (4 and 7). However, such designs cannot exist for every combination of design parameters. In the class of block designs with the same number of treatments as experimental units per block, a CNBD cannot exist if the number of blocks, b  , is equal to p(t−1)±1$p(t-1)\pm 1$, where p is a positive integer and t is the number of treatments. Filipiak et al. (2008) gave the structure of the left-neighboring matrix of E-optimal complete block designs with p  =1 under the model with fixed neighbor effects. The purpose of this paper is to generalize E-optimality results for designs with p∈N$p\in \mathbb{N}$ assuming random neighbor effects.     

Equivalence theorem for Schur optimality of experimental designs

An experimental design is said to be Schur optimal, if it is optimal with respect to the class of all Schur isotonic criteria, which includes Kiefer's criteria of _Φp${\Phi }_p$-optimality, distance optimality criteria and many others. In the paper we formulate an easily verifiable necessary and sufficient condition for Schur optimality in the set of all approximate designs of a linear regression experiment with uncorrelated errors. We also show that several common models admit a Schur optimal design, for example the trigonometric model, the first-degree model on the Euclidean ball, and the Berman's model.     

Design selection criteria for discrimination/estimation for nested models and a binomial response

The aim of an experiment is often to enable discrimination between competing forms for a response model. We investigate the selection of a continuous design for a non-sequential strategy when there are two competing generalized linear models for a binomial response, with a common link function and the linear predictor of one model nested within that of the other. A new criterion, _TE$T_E$-optimality, is defined, based on the difference in the deviances from the two models, and comparisons are made with T$T$-, _Ds$D_s$- and D$D$-optimality. Issues are raised through the study of two examples in which designs are assessed using simulation studies of the power to reject the null hypothesis of the smaller model being correct, when the data are generated from the larger model. Parameter estimation for discrimination designs is also discussed and a simple method is investigated of combining designs to form a hybrid design in order to achieve both model discrimination and estimation. This method has a computational advantage over the use of a compound criterion and the similar performance of the designs obtained from the two approaches is illustrated in an example.     

Orthogonally blocked three-level second order designs

Using balanced incomplete block designs with two plots per block, new three-level second order designs involving an arbitrary number of factors are obtained. These designs can easily be blocked orthogonally into blocks of reasonable sizes and are seen to have high D$D$-efficiencies. Orthogonally blocked augmented pairs designs with at most six factors are also constructed.     

Analysis of supersaturated designs via the Dantzig selector

A supersaturated design is a design whose run size is not enough for estimating all the main effects. It is commonly used in screening experiments, where the goals are to identify sparse and dominant active factors with low cost. In this paper, we study a variable selection method via the Dantzig selector, proposed by Candes and Tao [2007. The Dantzig selector: statistical estimation when p$p$ is much larger than n$n$. Annals of Statistics 35, 2313–2351], to screen important effects. A graphical procedure and an automated procedure are suggested to accompany with the method. Simulation shows that this method performs well compared to existing methods in the literature and is more efficient at estimating the model size.     

Efficient experimental designs for sigmoidal growth models

For the Weibull- and Richards-regression model robust designs are determined by maximizing a minimum of D  - or _D1$D_1$-efficiencies, taken over a certain range of the non-linear parameters. It is demonstrated that the derived designs yield a satisfactory solution of the optimal design problem for this type of model in the sense that these designs are efficient and robust with respect to misspecification of the unknown parameters. Moreover, the designs can also be used for testing the postulated form of the regression model against a simplified sub-model.     

Optimal mixed-level k-circulant supersaturated designs

Supersaturated designs (SSDs) offer a potentially useful way to investigate many factors with only few experiments in the preliminary stages of experimentation. This paper explores how to construct E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs using k-cyclic generators. The necessary and sufficient conditions for the existence of mixed-level k-circulant SSDs with the equal occurrence property are provided. Properties of the mixed-level k  -circulant SSDs are investigated, in particular, the sufficient condition under which the generator vector produces an E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal SSD is obtained. Moreover, many new E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs are constructed and listed. The method here generalizes the one proposed by Liu and Dean [2004. k$k$-circulant supersaturated designs. Technometrics 46, 32–43] for two-level SSDs and the one due to Georgiou and Koukouvinos [2006. Multi-level k-circulant supersaturated designs. Metrika 64, 209–220] for the multi-level case.     

On optimality properties of simple block designs in the approximate design theory

Optimality properties of approximate block designs are studied under variations of (1) the class of competing designs, (2) the optimality criterion, (3) the parametric function of interest, and (4) the statistical model. The designs which are optimal turn out to be the product of their treatment and block marginals, and uniform designs when the support is specified in advance. Optimality here means uniform, universal, and simultaneous j_p-optimality. The classical balanced incomplete block designs are embedded into this approach, and shown to be simultaneously j_p-optimal for a maximal system of identifiable parameters. A geometric account of universal optimality is given which applies beyond the context of block designs.     

Run orders for efficient two level experimental plans with minimum factor level changes robust to time trends

In this paper we construct run orders of orthogonal arrays with 12≤n≤28$12\le n\le 28$ runs and 4≤q≤6$4\le q\le 6$ factors that minimize the number of level changes of each factor. The corresponding orthogonal arrays can estimate a model with all main effects and their two factor interactions with the highest efficiency and also provide estimates of all main effects that are independent of linear and quadratic time (or position) trends. Some alternative efficient run orders are also presented when the estimation of two factor interactions is of experimental interest.     

Invariance of generalized wordlength patterns

The generalized wordlength pattern (GWLP) introduced by Xu and Wu [2001. Generalized minimum aberration for asymmetrical fractional factorial designs. Ann. Statist. 29, 1066–1077] for an arbitrary fractional factorial design allows one to extend the use of the minimum aberration criterion to such designs. Ai and Zhang [2004. Projection justification of generalized minimum aberration for asymmetrical fractional factorial designs. Metrika 60, 279–285] defined the J$J$-characteristics of a design and showed that they uniquely determine the design. While both the GWLP and the J$J$-characteristics require indexing the levels of each factor by a cyclic group, we see that the definitions carry over with appropriate changes if instead one uses an arbitrary abelian group. This means that the original definitions rest on an arbitrary choice of group structure. We show that the GWLP of a design is independent of this choice, but that the J$J$-characteristics are not. We briefly discuss some implications of these results.     

Minimum projection uniformity for computer experiment with quantitative factors

Computer experiments involving quantitative factors at high levels are becoming more and more important in the study of complex experiments arising in the area of science and engineering. Uniform designs are found to be widely applicable in computer experiments in the form of space-filling designs. In this paper, the projection uniformity for quantitative designs is studied under wrap-around $L_2$-discrepancy. A lower bound of uniformity pattern for general asymmetric designs is provided, which can be used to serve as a benchmark for both comparing different designs and also to determine the optimal design. As a byproduct, a lower bound of wrap-around $L_2$-discrepancy measure for the asymmetric design is also obtained. Some illustrative examples and numerical comparisons are also provided for supporting our theoretical results.     

Families of proper generalized neighbor designs

A generalized neighbor design relaxes the equality condition on the number of times two treatments occur as neighbors in the design. In this article we have constructed a new series of generalized neighbor designs with equal block sizes, a series of neighbor designs of Rees [1967. Some designs of use in serology. Biometrics 23, 779–791] and a series of neighbor designs with two distinct block sizes. Two more new series of GN₂ designs are also constructed for even number of treatments. It has been shown that quasi neighbor designs introduced by Preece [1994. Balanced Ouchterlony neighbor designs. J. Combin. Math. Combin. Comput. 15, 197–219] are special cases of generalized neighbor designs with t=2$t=2$. All the designs given here are binary. A new definition—partially balanced circuit design is introduced which is a special case of generalized neighbor designs with binary blocks.     

Minimum Hellinger distance estimation in a nonparametric mixture model

In this paper, we investigate the estimation problem of the mixture proportion λ$\lambda$ in a nonparametric mixture model of the form λF(x)+(1-λ)G(x)$\lambda F(x)+(1-\lambda )G(x)$ using the minimum Hellinger distance approach, where F and G are two unknown distributions. We assume that data from the distributions F and G   as well as from the mixture distribution λF+(1-λ)G$\lambda F+(1-\lambda )G$ are available. We construct a minimum Hellinger distance estimator of λ$\lambda$ and study its asymptotic properties. The proposed estimator is chosen to minimize the Hellinger distance between a parametric mixture model and a nonparametric density estimator. We also develop a maximum likelihood estimator of λ$\lambda$. Theoretical properties such as the existence, strong consistency, asymptotic normality and asymptotic efficiency of the proposed estimators are investigated. Robustness properties of the proposed estimator are studied using a Monte Carlo study. Two real data examples are also analyzed.     

Collapsibility of regression coefficients and its extensions

Collapsibility with respect to a measure of association implies that the measure of association can be obtained from the marginal model. We first discuss model collapsibility and collapsibility with respect to regression coefficients for linear regression models. For parallel regression models, we give simple and different proofs of some of the known results and obtain also certain new results. For random coefficient regression models, we define (average) A$A$-collapsibility and obtain conditions under which it holds. We consider Poisson regression and logistic regression models also, and derive conditions for collapsibility and A$A$-collapsibility, respectively. These results generalize some of the results available in the literature. Some suitable examples are also discussed.     

Classification rules for triply multivariate data with an AR(1) correlation structure on the repeated measures over time

In this article we study the problem of classification of three-level multivariate data, where multiple q$q$-variate observations are measured on u$u$-sites and over p$p$-time points, under the assumption of multivariate normality. The new classification rules with certain structured and unstructured mean vectors and covariance structures are very efficient in small sample scenario, when the number of observations is not adequate to estimate the unknown variance–covariance matrix. These classification rules successfully model the correlation structure on successive repeated measurements over time. Computation algorithms for maximum likelihood estimates of the unknown population parameters are presented. Simulation results show that the introduction of sites in the classification rules improves their performance over the existing classification rules without the sites.     

Optimal fractional factorial designs and their construction

Optimal symmetrical fractional factorial designs with n$n$ runs and m$m$ factors of s$s$ levels each are constructed. We consider only designs such that no two factors are aliases. The minimum moment aberration criterion proposed by Xu (2003) is used to judge the optimality of the designs. The minimum moment aberration criterion is equivalent to the popular generalized minimum aberration criterion proposed by Xu and Wu (2001), but the minimum moment criterion is simpler to formulate and employ computationally. Some optimal designs are constructed by using generalized Hadamard matrices.     

Nonparametric estimation of conditional expectation

Denote the integer lattice points in the N  -dimensional Euclidean space by Z^N${\mathbb{Z}}^N$ and assume that (_Xi,_Yi)$(X_{\mathbf{i}},Y_{\mathbf{i}})$, i∈Z^N$\mathbf{i}\in {\mathbb{Z}}^N$ is a mixing random field. Estimators of the conditional expectation r(x)=E[_Yi|_Xi=x]$r(\mathbf{x})=\mathrm{E}[Y_{\mathbf{i}}|X_{\mathbf{i}}=\mathbf{x}]$ by nearest neighbor methods are established and investigated. The main analytical result of this study is that, under general mixing assumptions, the estimators considered are asymptotically normal. Many difficulties arise since points in higher dimensional space N?2$N?2$ cannot be linearly ordered. Our result applies to many situations where parametric methods cannot be adopted with confidence.     

Optimality of the quasi-score estimator in a mean–variance model with applications to measurement error models

We consider a regression of y$y$ on x$x$ given by a pair of mean and variance functions with a parameter vector θ$\theta$ to be estimated that also appears in the distribution of the regressor variable x$x$. The estimation of θ$\theta$ is based on an extended quasi-score (QS) function. We show that the QS estimator is optimal within a wide class of estimators based on linear-in-y$y$ unbiased estimating functions. Of special interest is the case where the distribution of x$x$ depends only on a subvector α$\alpha$ of θ$\theta$, which may be considered a nuisance parameter. In general, α$\alpha$ must be estimated simultaneously together with the rest of θ$\theta$, but there are cases where α$\alpha$ can be pre-estimated. A major application of this model is the classical measurement error model, where the corrected score (CS) estimator is an alternative to the QS estimator. We derive conditions under which the QS estimator is strictly more efficient than the CS estimator.     

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.