Comparison of Four New General Classes of Search Designs

A factor screening experiment identifies a few important factors from a large list of factors that potentially influence the response. If a list consists of m factors each at three levels, a design is a subset of all possible 3 ^m runs. This paper considers the problem of finding designs with small numbers of runs, using the search linear model introduced in Srivastava (1975). The paper presents four new general classes of these 'search designs', each with 2 m −1 runs, which permit, at most, two important factors out of m factors to be searched for and identified. The paper compares the designs for 4 ≤ m ≤ 10, using arithmetic and geometric means of the determinants, traces and maximum characteristic roots of particular matrices. Two of the designs are found to be superior in all six criteria studied. The four designs are identical for m = 3 and this design is an optimal design in the class of all search designs under the six criteria. The four designs are also identical for m = 4 under some row and column permutations.     

Efficient designs based on orthogonal arrays of type I and type II for experiments using units ordered over time or space

For a wide variety of applications, experiments are based on units ordered over time or space. Models for these experiments generally may include one or more of: correlations, systematic trends, carryover effects and interference effects. Since the standard optimal block designs may not be efficient in these situations, orthogonal arrays of type I and type II, which were introduced in 1961 by C.R. Rao [Combinatorial arrangements analogous to orthogonal arrays, Sankhya A 23 (1961) 283–286], have been recently used to construct optimal and efficient designs for many of these experiments. Results in this area are unified and the salient features are outlined.     

ROBUST METHODS FOR DEPENDENT CELL PEDIGREE DATA

This paper studies a robust approach to the analysis of cell pedigree data, building on the work of Huggins & Marschner (1991) which discussed M-estimation for the so-called bifurcating autoregressive process. The study allows for incomplete observation of the pedigree, and incorporates the possibility of additive effects outliers, as discussed in the time series literature. Some properties of the proposed estimation procedure are studied, including a Monte Carlo investigation of robustness in the presence of contamination.     

TESTING SPHERICITY UNDER A MIXTURE MODEL

The robustness of Mauchly's sphericity test criterion when sampling from a mixture of two multivariate normal distributions is studied. The distribution of the sphericity test criterion when the sample covariance matrix has a non-central Wishart density of rank one is derived in terms of Meijer's G-functions; its distribution under the mixture model is then deduced. The robustness is studied by computing actual significance levels of the test under the mixture model using the critical values under the usual normal model.     

Empirical Bayes estimation in finite population sampling under functional measurement error models

The paper considers simultaneous estimation of finite population means for several strata. A model-based approach is taken, where the covariates in the super-population model are subject to measurement errors. Empirical Bayes (EB) estimators of the strata means are developed and an asymptotic expression for the MSE of the EB estimators is provided. It is shown that the proposed EB estimators are “first order optimal” in the sense of Robbins [1956. An empirical Bayes approach to statistics. In: Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, University of California Press, Berkeley, pp. 157–164], while the regular EB estimators which ignore the measurement error are not.     

Domains of convergence for the EM algorithm: a cautionary tale in a location estimation problem

The EM algorithm is a popular method for maximizing a likelihood in the presence of incomplete data. When the likelihood has multiple local maxima, the parameter space can be partitioned into domains of convergence, one for each local maximum. In this paper we investigate these domains for the location family generated by the t-distribution. We show that, perhaps somewhat surprisingly, these domains need not be connected sets. As an extreme case we give an example of a domain which consists of an infinite union of disjoint open intervals. Thus the convergence behaviour of the EM algorithm can be quite sensitive to the starting point.     

Basic aspects of evolution strategies

Evolution strategies (ESs) are a special class of probabilistic, direct, global optimization methods. They are similar to genetic algorithms but work in continuous spaces and have the additional capability of self-adapting their major strategy parameters. This paper presents the most important features of ESs, namely their self-adaptation, as well as their robustness and potential for parallelization which they share with other evolutionary algorithms.Besides the early (1 + 1)-ES and its underlying theoretical results, the modern ( + )-ES and (, )-ES are presented with special emphasis on the self-adaptation of strategy parameters, a mechanism which enables the algorithm to evolve not only the object variables but also the characteristics of the probability distributions of normally distributed mutations. The self-adaptation property of the algorithm is also illustrated by an experimental example.The robustness of ESs is demonstrated for noisy fitness evaluations and by its application to discrete optimization problems, namely the travelling salesman problem (TSP).Finally, the paper concludes by summarizing existing work and general possibilities regarding the parallelization of evolution strategies and evolutionary algorithms in general.     

A Class of Efficient Non-parametric K-sample Tests for Multivariate Counting Processes with Frailties

A K -sample testing problem is studied for multivariate counting processes with time-dependent frailty. Asymptotic distributions and efficiency of a class of non-parametric test statistics are established for certain local alternatives. The concept of efficiency is to show that for every non-parametric test in this class, there is a parametric submodel for which the optimal test has the same asymptotic power as the non-parametric one. The theory is applied to analyse a diabetic retinopathy study data set. A simulation study is also presented to illustrate the theory     

Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem

In the binary single constraint Knapsack Problem, denoted KP, we are given a knapsack of fixed capacity c and a set of n items. Each item j, j = 1,...,n, has an associated size or weight w_j and a profit p_j. The goal is to determine whether or not item j, j = 1,...,n, should be included in the knapsack. The objective is to maximize the total profit without exceeding the capacity c of the knapsack. In this paper, we study the sensitivity of the optimum of the KP to perturbations of either the profit or the weight of an item. We give approximate and exact interval limits for both cases (profit and weight) and propose several polynomial time algorithms able to reach these interval limits. The performance of the proposed algorithms are evaluated on a large number of problem instances.     

A Hellinger distance approach to MCMC diagnostics

Bayesian analysis often requires the researcher to employ Markov Chain Monte Carlo (MCMC) techniques to draw samples from a posterior distribution which in turn is used to make inferences. Currently, several approaches to determine convergence of the chain as well as sensitivities of the resulting inferences have been developed. This work develops a Hellinger distance approach to MCMC diagnostics. An approximation to the Hellinger distance between two distributions f and g based on sampling is introduced. This approximation is studied via simulation to determine the accuracy. A criterion for using this Hellinger distance for determining chain convergence is proposed as well as a criterion for sensitivity studies. These criteria are illustrated using a dataset concerning the Anguilla australis, an eel native to New Zealand.