Design Issues for Generalized Linear Models: A Review

Abstract

Generalized linear models (GLMs) have been used quite effectively in the modeling of a mean response under nonstandard conditions, where discrete as well as continuous data distributions can be accommodated. The choice of design for a GLM is a very important task in the development and building of an adequate model. However, one major problem that handicaps the construction of a GLM design is its dependence on the unknown parameters of the fitted model. Several approaches have been proposed in the past 25 years to solve this problem. These approaches, however, have provided only partial solutions that apply in only some special cases, and the problem, in general, remains largely unresolved. The purpose of this article is to focus attention on the aforementioned dependence problem. We provide a survey of various existing techniques dealing with the dependence problem. This survey includes discussions concerning locally optimal designs, sequential designs, Bayesian designs and the quantile dispersion graph approach for comparing designs for GLMs.

Published at http://dx.doi.org/10.1214/088342306000000105 in the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org)

Cited by in corpus (9)

• Support points of locally optimal designs for nonlinear models with two parameters
• A note on the de la Garza phenomenon for locally optimal designs
• Identifying locally optimal designs for nonlinear models: A simple extension with profound consequences
• Designs for generalized linear models with random block effects via information matrix approximations
• Complete classes of designs for nonlinear regression models and principal representations of moment spaces
• Bayesian Active Learning for Discrete Latent Variable Models
• Mixed-integer linear programming for computing optimal experimental designs
• A Randomized Exchange Algorithm for Optimal Design of Multi-Response Experiments
• Removal of Redundant Candidate Points for the Exact D-Optimal Design Problem