D-optimal designs for Poisson regression models

Most of the current research on optimal experimental designs for generalized linear models focuses on logistic regression models. In this paper, D-optimal designs for Poisson regression models are discussed. For the one-variable first-order Poisson regression model, it has been found that the D-optimal design, in terms of effective dose levels, is independent of the model parameters. However, it is not the case for more complicated models. We investigate how the D-optimal designs depend on the model parameters for the one-variable second-order model and two-variable interaction model. The performance of some “standard” designs that appeal to practitioners is also studied.     

Bayesian D-optimal designs for exponential regression models

We consider the Bayesian D-optimal design problem for exponential growth models with one, two or three parameters. For the one-parameter model conditions on the shape of the density of the prior distribution and on the range of its support are given guaranteeing that a one-point design is also Bayesian D-optimal within the class of all designs. In the case of two parameters the best two-point designs are determined and for special prior distributions it is proved that these designs are Bayesian D-optimal. Finally, the exponential growth model with three parameters is investigated. The best three-point designs are characterized by a nonlinear equation. The global optimality of these designs cannot be proved analytically and it is demonstrated that these designs are also Bayesian D-optimal within the class of all designs if gamma-distributions are used as prior distributions.     

D-optimal designs for beta regression models with single predictor

The problem of construction of D-optimal designs for beta regression models involving one predictor is considered for the mean-precision parameterization suggested by Ferrari and Cribari-Neto [Beta regression for modelling rates and proportions. J Appl Stat. 2004;31:799–815]. Here we use the logit link function for the mean sub-model. These designs are presented and discussed for unrestricted as well as restricted design regions by considering the precision parameter as (1) a known constant and (2) an unknown constant. Efficiency comparison of obtained designs with commonly used equi-weighted, equi-spaced designs is made to recommend designs for practical use. Real-life applications are given to show the usefulness of these designs.     

Some robust designs for polynomial regression models

The author identifies static optimal designs for polynomial regression models with or without intercept. His optimality criterion is an average between the D‐optimality criterion for the estimation of low‐degree terms and the D₈‐optimality criterion for testing the significance of higher degree terms. His work relies on classical results concerning canonical moments and the theory of continued fractions.     

Robust regression designs for approximate polynomial models

In this article, we consider robust designs for approximate polynomial regression models, by applying the theory of canonical moments. The design criterion, first given in Liu and Wiens (J. Statist. Planning Inference 64 (1997) 369), is to maximize the determinant of the information matrix subject to a side condition of bounding the bias arising from model misspecification. We give a new proof of, and extend, the main theorem in Liu and Wiens (op. cit.); in so doing we shed new light on the structure of this problem. New designs, with the further property of minimizing the generalized variance of the additional regression coefficients when an enlarged model is fitted, are derived and assessed. These provide additional robustness against uncertainty regarding the proper degree of the fitted polynomial response.     

D-optimal designs for covariate models

The problem of finding D-optimal or D-efficient designs in the presence of covariates is considered under a completely randomized design set-up with v treatments, k covariates and N experimental units. In contrast to Lopes Troya [Lopes Troya, J., 1982, Optimal designs for covariates models. Journal of Statistical Planning and Inference, 6, 373–419.], who considered this problem in the equireplicate case, we do not assume that N/v is an integer, and this allows us to study situations where no equireplicate design exists. Even when N/v is an integer, it is seen quite counter-intuitively that there are situations where a non-equireplicate design outperforms the best equireplicate design under the D-criterion.     

Sequential D-optimal designs for generalized linear mixed models

We discuss the construction of D-optimal sequential designs for the analysis of longitudinal data or repeated measurements using generalized linear mixed models (GLMMs). We investigate the performance of the design through a simulation study, which indicates that the proposed design can be very successful in improving the efficiency of the ML estimators in GLMMs relative to some common competitors. Our simulations also suggest that the usual normal-theory inference procedures remain valid under the sequential sampling schemes. We also present an example using real data obtained from a clinical study.     

T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method

Statistics and Computing - We consider T-optimal experiment design problems for discriminating multi-factor polynomial regression models where the design space is defined by polynomial inequalities...     

E-optimal designs for polynomial regression without intercept

We give all E-optimal designs for the mean parameter vector in polynomial regression of degree d without intercept in one real variable. The derivation is based on interplays between E-optimal design problems in the present and in certain heteroscedastic polynomial setups with intercept. Thereby the optimal supports are found to be related to the alternation points of the Chebyshev polynomials of the first kind, but the structure of optimal designs essentially depends on the regression degree being odd or even. In the former case the E-optimal designs are precisely the (infinitely many) scalar optimal designs, where the scalar parameter system refers to the Chebyshev coefficients, while for even d there is exactly one optimal design. In both cases explicit formulae for the corresponding optimal weights are obtained. Remarks on extending the results to E-optimality for subparameters of the mean vector (in heteroscdastic setups) are also given.     

D-optimal mixture component-amount designs for quadratic and cubic models

When the total amount of a mixture of ingredients needs to be taken into account (in addition to the composition of its ingredients), an experimental design requires several levels of the amount. Designs for such situations are discussed, and D-optimal choices are made for fitting quadratic and cubic models, for various numbers of experimental units.     

Extensions of D-optimal minimal designs for symmetric mixture models

The purpose of mixture experiments is to explore the optimum blends of mixture components, which will provide the desirable response characteristics in finished products. D-optimal minimal designs have been considered for a variety of mixture models, including Scheffé's linear, quadratic, and cubic models. Usually, these D-optimal designs are minimally supported since they have just as many design points as the number of parameters. Thus, they lack the degrees of freedom to perform the lack-of-fit (LOF) tests. Also, the majority of the design points in D-optimal minimal designs are on the boundary: vertices, edges, or faces of the design simplex. In this article, extensions of the D-optimal minimal designs are developed for a general mixture model to allow additional interior points in the design space to enable prediction of the entire response surface. Also a new strategy for adding multiple interior points for symmetric mixture models is proposed. We compare the proposed designs with Cornell (1986 Cornell, J.A. (1986). A comparison between two ten-point designs for studying three-component mixture systems. J. Qual. Technol. 18(1):1–15.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) two 10-point designs for the LOF test by simulations.     

A note on D-optimal designs for models with and without an intercept

In this paper we give a sufficient condition under which theD-optimal design for a regression model without an intercept can be obtained from theD-optimal design for the corresponding model with an intercept by simply removing the origin from its support points. Examples are given to demonstrate the applications of the results.     

A weighted least-squares approach to clusterwise regression

Clusterwise regression aims to cluster data sets where the clusters are characterized by their specific regression coefficients in a linear regression model. In this paper, we propose a method for determining a partition which uses an idea of robust regression. We start with some random weighting to determine a start partition and continue in the spirit of M-estimators. The residuals for all regressions are used to assign the observations to the different groups. As target function we use the determination coefficient R²_wR^{2}_{w} for the overall model. This coefficient is suitably defined for weighted regression.     

An algorithmic approach to construct D-optimal saturated designs for logistic model

In this paper, locally D-optimal saturated designs for a logistic model with one and two continuous input variables have been constructed by modifying the famous Fedorov exchange algorithm. A saturated design not only ensures the minimum number of runs in the design but also simplifies the row exchange computation. The basic idea is to exchange a design point with a point from the design space. The algorithm performs the best row exchange between design points and points form a candidate set representing the design space. Naturally, the resultant designs depend on the candidate set. For gain in precision, intuitively a candidate set with a larger number of points and the low discrepancy is desirable, but it increases the computational cost. Apart from the modification in row exchange computation, we propose implementing the algorithm in two stages. Initially, construct a design with a candidate set of affordable size and then later generate a new candidate set around the points of design searched in the former stage. In order to validate the optimality of constructed designs, we have used the general equivalence theorem. Algorithms for the construction of optimal designs have been implemented by developing suitable codes in R.     

D-optimal designs for logistic models with three and four parameters

Logistic functions are used in different applications, including biological growth studies and assay data analysis. Locally D-optimal designs for logistic models with three and four parameters are investigated. It is shown that these designs are minimally supported. Efficiencies are computed for equally spaced and uniform designs.     

A weighted polynomial regression method for local fitting of spatial data

Typically, parametric approaches to spatial problems require restrictive assumptions. On the other hand, in a wide variety of practical situations nonparametric bivariate smoothing techniques has been shown to be successfully employable for estimating small or large scale regularity factors, or even the signal content of spatial data taken as a whole.We propose a weighted local polynomial regression smoother suitable for fitting of spatial data. To account for spatial variability, we both insert a spatial contiguity index in the standard formulation, and construct a spatial-adaptive bandwidth selection rule. Our bandwidth selector depends on the Gearys local indicator of spatial association. As illustrative example, we provide a brief Monte Carlo study case on equally spaced data, the performances of our smoother and the standard polynomial regression procedure are compared.This note, though it is the result of a close collaboration, was specifically elaborated as follows: paragraphs 1 and 2 by T. Sclocco and the remainder by M. Di Marzio. The authors are grateful to the referees for constructive comments and suggestions.