Hamiltonian Monte Carlo Inference of Marginalized Linear Mixed-Effects Models
Not on the map. Why?
Abstract (arXiv)
Bayesian reasoning in linear mixed-effects models (LMMs) is challenging and often requires advanced sampling techniques like Markov chain Monte Carlo (MCMC). A common approach is to write the model in a probabilistic programming language and then sample via Hamiltonian Monte Carlo (HMC). However, there are many ways a user can transform a model that make inference more or less efficient. In particular, marginalizing some variables can greatly improve inference but is difficult for users to do manually. We develop an algorithm to easily marginalize random effects in LMMs. A naive approach introduces cubic time operations within an inference algorithm like HMC, but we reduce the running time to linear using fast linear algebra techniques. We show that marginalization is always beneficial when applicable and highlight improvements in various models, especially ones from cognitive sciences.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 76 references that are in the map. First posted on arXiv 31 Oct 2024.
Builds on
27 of 76 references.
References · 27
- 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 603
- 2018Pyro: Deep Universal Probabilistic Programmingcited by 379
- 2019Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyrocited by 187
- 2017TensorFlow Distributionscited by 105
- 2019NeuTra-lizing Bad Geometry in Hamiltonian Monte Carlo Using Neural Transportcited by 73
- 2018Yes, but Did It Work?: Evaluating Variational Inferencecited by 52
- 2013Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networkscited by 46
- 2022Integrating Random Effects in Deep Neural Networkscited by 22
- 2019Automatic Reparameterisation of Probabilistic Programscited by 18
- 2015Lecture notes on ridge regressioncited by 16
- 2022Deterministic Langevin Monte Carlo with Normalizing Flows for Bayesian Inferencecited by 10
- 2021Scalable Bayesian computation for crossed and nested hierarchical modelscited by 9
15 more
- 2021Hamiltonian Dynamics with Non-Newtonian Momentum for Rapid Samplingcited by 9
- 2017Delayed Sampling and Automatic Rao-Blackwellization of Probabilistic Programscited by 8
- 2018Scalable inference for crossed random effects modelscited by 8
- 2017Auto-Differentiating Linear Algebracited by 7
- 2022Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Timecited by 7
- 2023CoLA: Exploiting Compositional Structure for Automatic and Efficient Numerical Linear Algebracited by 7
- 2020Conditional independence by typingcited by 5
- 2022Semi-Symbolic Inference for Efficient Streaming Probabilistic Programmingcited by 5
- 2023Neural Mixed Effects for Nonlinear Personalized Predictionscited by 5
- 2023Automatically Marginalized MCMC in Probabilistic Programmingcited by 4
- 2016Estimation and Inference for Very Large Linear Mixed Effects Modelscited by 3
- 2019Bayesian Multinomial Logistic Normal Models through Marginally Latent Matrix-T Processescited by 3
- 2023Scalable solution to crossed random effects model with random slopescited by 2
- 2015Sparse Probit Linear Mixed Modelcited by 1
- 2021Fast methods for posterior inference of two-group normal-normal modelscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.