In *Proceedings of the Second Seattle Symposium in Biostatistics*, of *Lecture Notes in Statistics*, pages 1–22. Springer, New York, NY, 2004.

Paper doi abstract bibtex

Paper doi abstract bibtex

Generalized linear mixed models (GLMM) are generalized linear models with normally distributed random effects in the linear predictor. Penalized quasi-likelihood (PQL), an approximate method of inference in GLMMs, involves repeated fitting of linear mixed models with “working” dependent variables and iterative weights that depend on parameter estimates from the previous cycle of iteration. The generality of PQL, and its implementation in commercially available software, has encouraged the application of GLMMs in many scientific fields. Caution is needed, however, since PQL may sometimes yield badly biased estimates of variance components, especially with binary outcomes.Recent developments in numerical integration, including adaptive Gaussian quadrature, higher order Laplace expansions, stochastic integration and Markov chain Monte Oarlo (MOMO) algorithms, provide attractive alternatives to PQL for approximate likelihood inference in GLMMs. Analyses of some well known datasets, and simulations based on these analyses, suggest that PQL still performs remarkably well in comparison with more elaborate procedures in many practical situations. Adaptive Gaussian quadrature is a viable alternative for nested designs where the numerical integration is limited to a small number of dimensions. Higher order Laplace approximations hold the promise of accurate inference more generally. MOMO is likely the method of choice for the most complex problems that involve high dimensional integrals

@incollection{breslow_whither_2004, series = {Lecture {Notes} in {Statistics}}, title = {Whither {PQL}?}, isbn = {978-0-387-20862-6 978-1-4419-9076-1}, url = {https://link.springer.com/chapter/10.1007/978-1-4419-9076-1_1}, abstract = {Generalized linear mixed models (GLMM) are generalized linear models with normally distributed random effects in the linear predictor. Penalized quasi-likelihood (PQL), an approximate method of inference in GLMMs, involves repeated fitting of linear mixed models with “working” dependent variables and iterative weights that depend on parameter estimates from the previous cycle of iteration. The generality of PQL, and its implementation in commercially available software, has encouraged the application of GLMMs in many scientific fields. Caution is needed, however, since PQL may sometimes yield badly biased estimates of variance components, especially with binary outcomes.Recent developments in numerical integration, including adaptive Gaussian quadrature, higher order Laplace expansions, stochastic integration and Markov chain Monte Oarlo (MOMO) algorithms, provide attractive alternatives to PQL for approximate likelihood inference in GLMMs. Analyses of some well known datasets, and simulations based on these analyses, suggest that PQL still performs remarkably well in comparison with more elaborate procedures in many practical situations. Adaptive Gaussian quadrature is a viable alternative for nested designs where the numerical integration is limited to a small number of dimensions. Higher order Laplace approximations hold the promise of accurate inference more generally. MOMO is likely the method of choice for the most complex problems that involve high dimensional integrals}, language = {en}, urldate = {2018-02-16}, booktitle = {Proceedings of the {Second} {Seattle} {Symposium} in {Biostatistics}}, publisher = {Springer, New York, NY}, author = {Breslow, Norman}, year = {2004}, doi = {10.1007/978-1-4419-9076-1_1}, pages = {1--22} }

Downloads: 0