Gamerman (1997) proposes a unified Markov chain Monte Carlo (MCMC) scheme for Bayesian generalized linear mixed models (GLMMs) by repurposing the iteratively weighted least squares (IWLS) linearization from classical GLMM fitting as a Metropolis proposal. At each iteration, the current linear predictor is used to compute pseudo-responses and weights, yielding a working Normal posterior that serves as the Metropolis-Hastings (MH) proposal for both fixed effects and subject-level random effects ; variance components are drawn directly from a conjugate inverse-Wishart full conditional. The resulting Metropolis-within-Gibbs cycle achieves acceptance rates of 98% (binomial seeds example) and above 85% (Poisson epilepsy example) with no tuning, and extends readily to nested random effects, non-normal priors via scale mixtures, and unknown link functions.
"The main idea of the proposed sampling scheme is to use the normal approximation obtained from a first-order Taylor series expansion of the log-likelihood about the current values of the parameters as the candidate generating distribution."
"The proposal distribution for is a multivariate normal distribution centred at the WLS estimate, with variance proportional to the inverse of the information matrix of the working model."
The paper's core insight is elegant: the IWLS linearization used for decades in frequentist GLMM fitting already produces a locally accurate Normal approximation to the posterior — so why not use it as a Metropolis proposal? The resulting algorithm is almost parameter-free, adapts each iteration to the current state, and works across all exponential-family likelihoods without modification. This is a practical and theoretically sound shortcut that would have been practically unavailable without the Metropolis-Hastings formalism developed by Chib-Greenberg (1995).
Limitations worth noting: (1) The WLS proposal updates and in separate blocks, ignoring the posterior correlation between them — for highly correlated fixed and random effects this may still lead to slow mixing. (2) The method assumes the working-model Normal approximation is adequate; for very sparse binary data (near-zero or near-one probabilities) the linearization can be poor. (3) The paper predates adaptive MCMC and Hamiltonian Monte Carlo / no-U-turn sampler (HMC/NUTS), which now dominate GLMM Bayesian computation in practice (Stan, integrated nested Laplace approximation, INLA). Nonetheless, the WLS-proposal concept directly influenced subsequent MCMC literature for non-conjugate hierarchical models, including Chib-Carlin (1999) for hierarchical longitudinal models.