D-optimal designs for multinomial logistic models (Q2196203)

From MaRDI portal
scientific article
Language Label Description Also known as
English
D-optimal designs for multinomial logistic models
scientific article

    Statements

    D-optimal designs for multinomial logistic models (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2020
    0 references
    While there is a sizable and growing literature for optimal designs with binary response, the literature for experiments with more than two categories is limited. In the statistical literature, four kinds of multinomial logit models have been used: baseline-category, cumulative, adjacent-categories and continuation-ratio logit models. Combined with three odd assumptions (proportional, nonproportional, and partial proportional odds), 12 different models for multinomial responses can be generated. The authors work in a general framework which covers all of the 12 models and they present results on (mainly \(D\)-) optimal designs. First they derive the Fisher information matrix and necessary and sufficient conditions for their positive definiteness. Furthermore, they develop efficient algorithms for searching local \(D\)-optimal designs. The authors show that the optimal designs for multinomial responses with three or more categories are remarkably different from the ones for binary responses, in two major aspects: \begin{itemize} \item[(i)] the required minimum number of experimental settings is less than the number of parameters and \item[(ii)] even among minimally supported designs, unlike \(D\)-optimal designs for binary responses, uniform allocation often is not \(D\)-optimal (and can be quite inefficient). \end{itemize} The authors illustrate the results extensively by two real experiments.
    0 references
    approximate design
    0 references
    exact design
    0 references
    Fisher information matrix
    0 references
    multinomial response
    0 references
    minimally supported design
    0 references
    lift-one algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references