Fast expectation-maximization algorithms for spatial generalized linear mixed models
Yawen Guan, Murali Haran

TL;DR
This paper introduces fast, scalable expectation-maximization algorithms for fitting spatial generalized linear mixed models, enabling efficient maximum likelihood estimation for large, complex spatial datasets across various disciplines.
Contribution
It proposes two novel EM-based algorithms using MCMC and Laplace approximation, improving computational efficiency for SGLMMs in high-dimensional settings.
Findings
Algorithms perform well in parameter estimation and prediction.
Methods scale efficiently with data size.
Applicable to both discrete and continuous spatial models.
Abstract
Spatial generalized linear mixed models (SGLMMs) are popular and flexible models for non-Gaussian spatial data. They are useful for spatial interpolations as well as for fitting regression models that account for spatial dependence, and are commonly used in many disciplines such as epidemiology, atmospheric science, and sociology. Inference for SGLMMs is typically carried out under the Bayesian framework at least in part because computational issues make maximum likelihood estimation challenging, especially when high-dimensional spatial data are involved. Here we provide a computationally efficient projection-based maximum likelihood approach and two computationally efficient algorithms for routinely fitting SGLMMs. The two algorithms proposed are both variants of expectation maximization algorithm, using either Markov chain Monte Carlo or a Laplace approximation for the conditional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpatial and Panel Data Analysis · Statistical Methods and Bayesian Inference · Soil Geostatistics and Mapping
