The effect of small sample on optimal designs for logistic regression models

Asymptotic methods are commonly used in statistical inference for unknown parameters in binary data models. These methods are based on large sample theory, a condition which may be in conflict with small sample size and hence leads to poor results in the optimal designs theory. In this paper, we apply the second order expansions of the maximum likelihood estimator and derive a matrix formula for the mean square error (MSE) to obtain more precise optimal designs based on the MSE. Numerical results indicate the new optimal designs are more efficient than the optimal designs based on the information matrix.     

ROBUST ESTIMATION UNDER TYPE II CENSORING

The properties of robust M-estimators with type II censored failure time data are considered. The optimal members within two classes of ψ-functions are characterized. The first optimality result is the censored data analogue of the optimality result described in Hampel et al. (1986); the estimators corresponding to the optimal members within this class are referred to as the optimal robust estimators. The second result pertains to a restricted class of ψ-functions which is the analogue of the class of ψ-functions considered in James (1986) for randomly censored data; the estimators corresponding to the optimal members within this restricted class are referred to as the optimal James-type estimators. We examine the usefulness of the two classes of ψ-functions and find that the breakdown point and efficiency of the optimal James-type estimators compare favourably with those of the corresponding optimal robust estimators. From the computational point of view, the optimal James-type ψ-functions are readily obtainable from the optimal ψ-functions in the uncensored case. The ψ-functions for the optimal robust estimators require a separate algorithm which is provided. A data set illustrates the optimal robust estimators for the parameters of the extreme value distribution.     

Approximate and exact optimal designs for paired comparisons of partial profiles when there are two groups of factors

For paired comparison experiments involving pairs of multifactor options differing in a specified number of factors the problem of finding optimal designs is considered, when only main effects are to be estimated. It is presumed that the set of factors can be partitioned into two groups such that the number of levels is constant within each group. The optimal designs for this frequently encountered case are also optimal for the corresponding choice experiments under the hypothesis that the parameters in the multinomial logit model are equal to zero.     

Optimal Partitioning of Probability Distributions under General Convex Loss Functions in Selective Assembly

Selective assembly is an effective approach for improving the quality of a product which is composed of two mating components. This article studies optimal partitioning of the dimensional distributions of the components in selective assembly. It extends previous results for squared error loss function to cover general convex loss functions, including asymmetric convex loss functions. Equations for the optimal partition are derived. Assuming that the density function of the dimensional distribution is log-concave, uniqueness of solutions is established and some properties of the optimal partition are shown. Some numerical results compare the optimal partition with some heuristic partitioning schemes.     

On the Optimality of Prediction-based Selection Criteria and the Convergence Rates of Estimators

Several estimators of squared prediction error have been suggested for use in model and bandwidth selection problems. Among these are cross-validation, generalized cross-validation and a number of related techniques based on the residual sum of squares. For many situations with squared error loss, e.g. nonparametric smoothing, these estimators have been shown to be asymptotically optimal in the sense that in large samples the estimator minimizing the selection criterion also minimizes squared error loss. However, cross-validation is known not to be asymptotically optimal for some `easy' location problems. We consider selection criteria based on estimators of squared prediction risk for choosing between location estimators. We show that criteria based on adjusted residual sum of squares are not asymptotically optimal for choosing between asymptotically normal location estimators that converge at rate n ^1/2but are when the rate of convergence is slower. We also show that leave-one-out cross-validation is not asymptotically optimal for choosing between √ n -differentiable statistics but leave- d -out cross-validation is optimal when d ∞ at the appropriate rate.     

Optimal designs for estimating the slope of a regression

In the common linear model with quantitative predictors we consider the problem of designing experiments for estimating the slope of the expected response in a regression. We discuss locally optimal designs, where the experimenter is only interested in the slope at a particular point, and standardized minimax optimal designs, which could be used if precise estimation of the slope over a given region is required. General results on the number of support points of locally optimal designs are derived if the regression functions form a Chebyshev system. For polynomial regression and Fourier regression models of arbitrary degree the optimal designs for estimating the slope of the regression are determined explicitly for many cases of practical interest.     

Optimum treatment allocation for dual-objective clinical trials with binary outcomes

A common problem in randomized controlled clinical trials is the optimal assignment of patients to treatment protocols, The traditional optimal design assumes a single criterion, although in reality, there are usually more than one objective in a clinical trial. In this paper, optimal treatment allocation schemes are found for a dual-objective clinical trial with a binary response. A graphical method for finding the optimal strategy is proposed and illustrative examples are discussed.     

Optimal Weight Functions for Marginal Proportional Hazards Analysis of Clustered Failure Time Data

The choice of weights in estimating equations for multivariate survival data is considered. Specifically, we consider families of weight functions which are constant on fixed time intervals, including the special case of time-constant weights. For a fixed set of time intervals, the optimal weights are identified as the solution to a system of linear equations. The optimal weights are computed for several scenarios. It is found that for the scenarios examined, the gains in efficiency using the optimal weights are quite small relative to simpler approaches except under extreme dependence, and that a simple estimator of an exchangeable approximation to the weights also performs well.     

Construction of optimal designs in random coefficient regression models

We consider the problem of optimal experimental design in random coefficient regression models with respect to a quadratic loss function. By application of WHITTLE'S general equivalence theorem we obtain the structure of optimal designs. An alogrithm is given which allows, under certain assumptions, the construction of the information matrix of an optimal design. Moreover, we give conditions on the equivalence of optimal designs with respect to optimality criteria which are analogous to usual A-D- and _E/-optimality.     

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.     

Optimal Configuration of a Square Array Group Testing Algorithm

We consider the optimal configuration of a square array group testing algorithm (denoted A2) to minimize the expected number of tests per specimen. For prevalence greater than 0.2498, individual testing is shown to be more efficient than A2. For prevalence less than 0.2498, closed form lower and upper bounds on the optimal group sizes for A2 are given. Arrays of dimension 2 × 2, 3 × 3, and 4 × 4 are shown to never be optimal. The results are illustrated by considering the design of a specimen pooling algorithm for detection of recent HIV infections in Malawi.     

Optimal,nearly optimal and robust procedures for the exponential distribution with relative linear exponential loss

In this paper, the problem of sequentially estimating the mean of the exponential distribution with relative linear exponential loss and fixed cost for each observation is considered within the Bayesian framework. An optimal procedure with a deterministic stopping rule is derived. Since the corresponding value of the optimal deterministic stopping rule cannot be obtained directly, an approximate optimal deterministic stopping rule and an asymptotically pointwise optimal rule are proposed. In addition, we propose a robust procedure with a deterministic stopping rule, which does not depend on the parameters of the prior distribution. All of the proposed procedures are shown to be asymptotically optimal. Some numerical studies are conducted to investigate the performances of the proposed procedures. A real data set is provided to illustrate the use of the proposed procedures.     

Asymptotically pointwise optimal and asymptotically optimal stopping times in the Bayesian inference

The paper deals with the problem of determining asymptotically pointwise optimal and asymptotically optimal stopping times in the Bayesian inference. The sufficient conditions are given for a family of stopping times to be asymptotically pointwise optimal and asymptotically optimal with respect to a continuous time process. As an example a sequential estimation of the intensity of the Poisson process is considered. Under a gamma prior distribution, an asymptotically pointwise optimal and asymptotically optimal rule is given using a LINEX loss function and the cost c per unit time.     

D-optimal designs for combined polynomial and trigonometric regression on a partial circle

Consider the D-optimal designs for a combined polynomial and trigonometric regression on a partial circle. It is shown that the optimal design is equally supported and the structure of the optimal design depends only on the length of the design interval and the support points are analytic functions of this parameter. Moreover, the Taylor expansion of the optimal support points can be determined efficiently by a recursive procedure. Examples are presented to illustrate the procedures for computing the optimal designs.     

Optimal repeated measurements designs for comparing test treatments with a control

A-optimal and mv optimal repeated measurments designs for comparing serveral test treatments with a control are considered. the models considered are basically of two types: without preperides and the cirular model. It is shown known that some known strongly balanced uniform repeated measurements designs can be modified to obtain optimal designs for this problem. Some other methods of finding optimal designs are also given.     

Optimal Binning Strategies Under Squared Error Loss in Selective Assembly with a Tolerance Constraint

Selective assembly is an effective approach for improving the quality of a product assembled from two types of components when the quality characteristic is the clearance between the mating components. In this article, optimal binning strategies under squared error loss in selective assembly when the clearance is constrained by a tolerance parameter are discussed. Conditions for a set of constrained optimal partition limits are given, and uniqueness of this set is shown for the case when the dimensional distributions of the two components are identical and strongly unimodal. Some numerical results are reported that compare constrained optimal partitioning, unconstrained optimal partitioning, and equal width partitioning.     

PREDICTION OF THE FINITE POPULATION DISTRIBUTION FUNCTION UNDER GAUSSIAN SUPERPOPULATION MODELS

This article considers optimal prediction of the finite population distribution function under Gaussian superpopulation models, which allows auxiliary prior information to be incorporated into the estimation process. Large sample approximations for the variance of the optimal predictors are derived in some special important cases. A small scale Monte Carlo study illustrates comparisons between the optimal predictor and some others which are proposed in the literature. The conclusion is that the optimal predictor can be considerably more efficient in situations where the normal superpopulation model is adequate.     

Robustness properties of minimally‐supported Bayesian D‐optimal designs for heteroscedastic models

Bayesian D‐optimal designs supported on a fixed number of points were found by Dette & Wong (1998) for estimating parameters in a polynomial model when the error variance depends exponentially on the explanatory variable. The present authors provide optimal designs under a broader class of error variance structures and investigate the robustness properties of these designs to model and prior distribution assumptions. A comparison of the performance of the optimal designs relative to the popular uniform designs is also given. The authors' results suggest that Bayesian D‐optimal designs suported on a fixed number of points are more likely to be globaly optimal among all designs if the prior distribution is symmetric and is concentrated around its mean.     

Optimal designs for exponential regression

This paper is concerned with the optimal design problem for the particular case of non-linear parametrisation:the parameters to be estimated are included in exponents.Some properties of locally optimal designs as functions of estimated parameters are investigated and a table of such designs in given.We consider also designs to be optimal in the sense of minimax approach.     

Robust designs for diallel crosses against the missing of one block

Dey & Midha (1996) showed that some of the complete diallel crosses plans, obtained by using triangular partially balanced designs with two associate classes, are optimal. In this investigation, it is derived that these optimal designs for diallel crosses are robust also against the unavailability of one block.