Locally D-Optimal Design for a Logit Model in Discrete Choice Experiment

Conjoint analysis is concerned with understanding how people make choice between products or services (alternatives) or a combination of product and service (choice set), so that businesses can design new products or services that better meet customers needs. In this situation, logit model (Multinomial Logit Model) has been used to calculate the probability related to choosing an alternative in a choice set with the highest utility. Then I considered several choice sets instead of one. In this article, I have used the locally D-optimal design for the combination of the level of attributes (two attributes each with two levels) to create alternatives. The optimal combination of alternatives in choice sets which help us to have a suitable choice.     

Urban public transport choice behavior analysis and service improvement policy-making: a case study from the metropolitan city,Chengdu, China

As the metropolitan city in Western China, Chengdu has been suffered from serious traffic congestion. The strategy of urban public transport priority was put into agenda to relieve traffic congestion. But the public transport sharing rate is only 27% in Chengdu which is much lower than the developed country. Consequently, it is of great importance to study the measures to improve the service, and provide technical support to the policy-makers. This paper selected the traffic corridor between Southwest Jiaotong University district and downtown as the experiment subject. The orthogonal design was used to generate stated preference questionnaires in order to achieve the reliable parameter estimates. Some variables were used to define the utility of the three alternatives and construct the Logit model. Then, the relationships between the cost, time variable and the choice probability of the public transport were analyzed. According to the results, we found that the orthogonal design does improve the goodness-of-fit. The workability of Multinomial Logit Model was better than Nest Logit model. We also put forward some effective measures to improve the service level of public transit, including reducing the access time to Metro, limiting parking supply to control the car use.     

Flexible Covariance Structures for Categorical Dependent Variables Through Finite Mixtures of Generalized Extreme Value Models

A new class of finite mixture discrete choice models, denoted FinMix (fīn m?ks), is introduced. These arise from the combination of a finite number of core Generalized Extreme Value (GEV) models to achieve more flexible functional forms, particularly in terms of error covariance structures. Example members of the class include combinations of (1) Multinomial Logit (MNL) models with differing scales, (2) multinomial logit with nested MNL models, (3) tree extreme value models with differing preference trees, and so on. Compatibility of FinMix models with utility maximization is easily determined, which permits empirical investigation of the suitability of specific model forms for economic evaluation exercises.     

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.     

Optimal designs for statistical analysis with Zernike polynomials

The Zernike polynomials arise in several applications such as optical metrology or image analysis on a circular domain. In the present paper, we determine optimal designs for regression models which are represented by expansions in terms of Zernike polynomials. We consider two estimation methods for the coefficients in these models and determine the corresponding optimal designs. The first one is the classical least squares method and Φ _p -optimal designs in the sense of Kiefer [Kiefer, J., 1974, General equivalence theory for optimum designs (approximate theory). Annals of Statistics, 2 849–879.] are derived, which minimize an appropriate functional of the covariance matrix of the least squares estimator. It is demonstrated that optimal designs with respect to Kiefer's Φ _p -criteria (p>?∞) are essentially unique and concentrate observations on certain circles in the experimental domain. E-optimal designs have the same structure but it is shown in several examples that these optimal designs are not necessarily uniquely determined. The second method is based on the direct estimation of the Fourier coefficients in the expansion of the expected response in terms of Zernike polynomials and optimal designs minimizing the trace of the covariance matrix of the corresponding estimator are determined. The designs are also compared with the uniform designs on a grid, which is commonly used in this context.     

Adaptive grid semidefinite programming for finding optimal designs

We find optimal designs for linear models using a novel algorithm that iteratively combines a semidefinite programming (SDP) approach with adaptive grid techniques. The proposed algorithm is also adapted to find locally optimal designs for nonlinear models. The search space is first discretized, and SDP is applied to find the optimal design based on the initial grid. The points in the next grid set are points that maximize the dispersion function of the SDP-generated optimal design using nonlinear programming. The procedure is repeated until a user-specified stopping rule is reached. The proposed algorithm is broadly applicable, and we demonstrate its flexibility using (i) models with one or more variables and (ii) differentiable design criteria, such as A-, D-optimality, and non-differentiable criterion like E-optimality, including the mathematically more challenging case when the minimum eigenvalue of the information matrix of the optimal design has geometric multiplicity larger than 1. Our algorithm is computationally efficient because it is based on mathematical programming tools and so optimality is assured at each stage; it also exploits the convexity of the problems whenever possible. Using several linear and nonlinear models with one or more factors, we show the proposed algorithm can efficiently find optimal designs.     

Some optimal block designs with nested rows and columns for research on alternative methods of limiting slug damage

Some criteria of optimality of a block design with nested rows and columns are considered. The criteria are based on the eigenvalues of the information matrix C or on the eigenvalues of the matrix C with respect to a diagonal matrix R of treatment replications. New constructions of some optimal block designs with nested rows and columns are presented for application to special plant protection experiments.     

On Exact K-optimal Designs Minimizing the Condition Number

A new design criterion based on the condition number of an information matrix is proposed to construct optimal designs for linear models, and the resulting designs are called K-optimal designs. The relationship between exact and asymptotic K-optimal designs is derived. Since it is usually hard to find exact optimal designs analytically, we apply a simulated annealing algorithm to compute K-optimal design points on continuous design spaces. Specific issues are addressed to make the algorithm effective. Through exact designs, we can examine some properties of the K-optimal designs such as symmetry and the number of support points. Examples and results are given for polynomial regression models and linear models for fractional factorial experiments. In addition, K-optimal designs are compared with A-optimal and D-optimal designs for polynomial regression models, showing that K-optimal designs are quite similar to A-optimal designs.     

Generalized Self-Consistency: Multinomial logit model and Poisson likelihood

A generalized self-consistency approach to maximum likelihood estimation (MLE) and model building was developed in Tsodikov [2003. Semiparametric models: a generalized self-consistency approach. J. Roy. Statist. Soc. Ser. B Statist. Methodology 65(3), 759–774] and applied to a survival analysis problem. We extend the framework to obtain second-order results such as information matrix and properties of the variance. Multinomial model motivates the paper and is used throughout as an example. Computational challenges with the multinomial likelihood motivated Baker [1994. The Multinomial–Poisson transformation. The Statist. 43, 495–504] to develop the Multinomial–Poisson (MP) transformation for a large variety of regression models with multinomial likelihood kernel. Multinomial regression is transformed into a Poisson regression at the cost of augmenting model parameters and restricting the problem to discrete covariates. Imposing normalization restrictions by means of Lagrange multipliers [Lang, J., 1996. On the comparison of multinomial and Poisson log-linear models. J. Roy. Statist. Soc. Ser. B Statist. Methodology 58, 253–266] justifies the approach. Using the self-consistency framework we develop an alternative solution to multinomial model fitting that does not require augmenting parameters while allowing for a Poisson likelihood and arbitrary covariate structures. Normalization restrictions are imposed by averaging over artificial “missing data” (fake mixture). Lack of probabilistic interpretation at the “complete-data” level makes the use of the generalized self-consistency machinery essential.     

Robust designs for multinomial models

Abstract

Model misspecification in generalized linear models (GLMs) occurs usually when the linear predictor and/or the link function assumed are incorrect. This article discusses the effect of such misspecification on design selection for multinomial GLMs and proposes the use of quantile dispersion graphs to select robust designs. Due to misspecification in the model, parameter estimates are usually biased and the designs are compared on the basis of their mean squared error of prediction. Several numerical examples including a real data set are presented to illustrate the proposed methodology.     

Goodness-of-fit test for Gaussian regression with block correlated errors

We propose a procedure to test that the expectation of a Gaussian vector is linear against a nonparametric alternative. We consider the case where the covariance matrix of the observations has a block diagonal structure. This framework encompasses regression models with autocorrelated errors, heteroscedastic regression models, mixed-effects models and growth curves. Our procedure does not depend on any prior information about the alternative. We prove that the test is asymptotically of the nominal level and consistent. We characterize the set of vectors on which the test is powerful and prove the classical √log log (n)/n convergence rate over directional alternatives. We propose a bootstrap version of the test as an alternative to the initial one and provide a simulation study in order to evaluate both procedures for small sample sizes when the purpose is to test goodness of fit in a Gaussian mixed-effects model. Finally, we illustrate the procedures using a real data set.     

Optimal and efficient crossover designs for comparing test treatments to a control treatment under various models

We study the optimality, efficiency, and robustness of crossover designs for comparing several test treatments to a control treatment. Since A-optimality is a natural criterion in this context, we establish lower bounds for the trace of the inverse of the information matrix for the test treatments versus control comparisons under various models. These bounds are then used to obtain lower bounds for efficiencies of a design under these models. Two algorithms, both guided by these efficiencies and results from optimal design theory, are proposed for obtaining efficient designs under the various models.     

Optimal designs for multivariate logistic mixed models with longitudinal data

This paper considers the optimal design problem for multivariate mixed-effects logistic models with longitudinal data. A decomposition method of the binary outcome and the penalized quasi-likelihood are used to obtain the information matrix. The D-optimality criterion based on the approximate information matrix is minimized under different cost constraints. The results show that the autocorrelation coefficient plays a significant role in the design. To overcome the dependence of the D-optimal designs on the unknown fixed-effects parameters, the Bayesian D-optimality criterion is proposed. The relative efficiencies of designs reveal that both the cost ratio and autocorrelation coefficient play an important role in the optimal designs.     

Optimal designs for main effects in linear paired comparison models

In psychology, marketing research and sensory analysis paired comparisons which demand judges to evaluate the trade-off between two alternatives constitute a popular method of data collection. For this situation we present optimal designs in a discrete setting when the alternatives are specified by an analysis of variance model with main effects only. We employ combinatorial tools to achieve optimal designs which have sufficiently small sample sizes. Moreover, optimal designs are constructed when the number of factors presented is restricted for each pair of alternatives.     

An evolutionary algorithm for A-optimal incomplete block designs

Evolutionary algorithms are heuristic stochastic search and optimization techniques with principles taken from natural genetics. They are procedures mimicking the evolution process of an initial population through genetic transformations. This paper is concerned with the problem of finding A-optimal incomplete block designs for multiple treatment comparisons represented by a matrix of contrasts. An evolutionary algorithm for searching optimal, or nearly optimal, incomplete block designs is described in detail. Various examples regarding the application of the algorithm to some well-known problems illustrate the good performance of the algorithm     

Score test for testing zero-inflated Poisson regression against zero-inflated generalized Poisson alternatives

In several cases, count data often have excessive number of zero outcomes. This zero-inflated phenomenon is a specific cause of overdispersion, and zero-inflated Poisson regression model (ZIP) has been proposed for accommodating zero-inflated data. However, if the data continue to suggest additional overdispersion, zero-inflated negative binomial (ZINB) and zero-inflated generalized Poisson (ZIGP) regression models have been considered as alternatives. This study proposes the score test for testing ZIP regression model against ZIGP alternatives and proves that it is equal to the score test for testing ZIP regression model against ZINB alternatives. The advantage of using the score test over other alternative tests such as likelihood ratio and Wald is that the score test can be used to determine whether a more complex model is appropriate without fitting the more complex model. Applications of the proposed score test on several datasets are also illustrated.     

Robust designs for experiments with blocks

ABSTRACT

For experiments running in field plots or over time, the observations are often correlated due to spatial or serial correlation, which leads to correlated errors in a linear model analyzing the treatment means. Without knowing the exact correlation matrix of the errors, it is not possible to compute the generalized least-squares estimator for the treatment means and use it to construct optimal designs for the experiments. In this paper, we propose to use neighborhoods to model the covariance matrix of the errors, and apply a modified generalized least-squares estimator to construct robust designs for experiments with blocks. A minimax design criterion is investigated, and a simulated annealing algorithm is developed to find robust designs. We have derived several theoretical results, and representative examples are presented.     

Optimal design for the Bradley–Terry paired comparison model

Paired comparisons are a popular tool for questionnaires in psychological marketing research. The quality of the statistical analysis of the responses heavily depends on the design, i.e. the choice of the alternatives in the comparisons. In this paper we show that the structure of locally optimal designs changes substantially with the parameters in the underlying utility. This fact is illustrated by elementary examples, where the optimal designs can be completely characterized. As an alternative maximin efficient designs are proposed which perform well for all parameter settings. Research supported by grant Ho 1286 of the German Research Council (Deutsche Forschungsgemeinschaft).