mlsanityData to 14 Oct 2026

Safe, Scalable, and Accurate Bayes Posterior Sampling for Large-Data Generalized Linear Mixed Models

arXiv 2604.26029 ↗First posted 28 Apr 2026stat.ME stat.CO stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We consider the problem of scalable sampling algorithms to fit Bayesian generalized linear mixed models on large datasets. Stochastic gradient Langevin dynamics, coupled with smooth re-parameterizations of variance parameters, produces divergent Markov chains and cannot be reliably used for sampling covariance parameters of random effects. We advocate the use of a mirror Langevin dynamics algorithm, propose the novel stochastic mirror Langevin dynamics based on data subsampling, and provide concrete guidelines for its use in a Bayesian inference framework. Based on an explicit Wasserstein distance error bound between the posterior and its algorithmic approximation, we propose a post-processing step that yields an asymptotic, order-wise correct estimation of the posterior variance, eliminating the irreducible posterior variance estimation bias due to subsampling. Empirical performance of the method is evaluated through simulated experiments and a longitudinal study of pain trajectories in a study of breast cancer survivors.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 29 references that are in the map. First posted on arXiv 28 Apr 2026.

Builds on

13 of 29 references.

References · 13

  1. 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 227
  2. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
  3. 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 146
  4. 2017User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradientcited by 116
  5. 2018Mirrored Langevin Dynamicscited by 61
  6. 2018The promises and pitfalls of Stochastic Gradient Langevin Dynamicscited by 56
  7. 2019Stochastic gradient Markov chain Monte Carlocited by 56
  8. 2020Efficient constrained sampling via the mirror-Langevin algorithmcited by 55
  9. 2020Efficiently Solving MDPs with Stochastic Mirror Descentcited by 53
  10. 2021The Mirror Langevin Algorithm Converges with Vanishing Biascited by 37
  11. 2017Control Variates for Stochastic Gradient MCMCcited by 25
  12. 2019Policy Optimization with Stochastic Mirror Descentcited by 18
1 more
  1. 2024Scalable and Calibrated Sampling for Bayesian Generalized Linear Mixed Model via Stochastic Gradient Markov Chain Monte Carlocited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.