Fast Moment-Based Estimation for Hierarchical Models
Not on the map. Why?
Abstract (arXiv)
Hierarchical models allow for heterogeneous behaviours in a population while simultaneously borrowing estimation strength across all subpopulations. Unfortunately, existing likelihood-based methods for fitting hierarchical models have high computational demands, and these demands have limited their adoption in large-scale prediction and inference problems. This paper proposes a moment-based procedure for estimating the parameters of a hierarchical model which has its roots in a method originally introduced by Cochran in 1937. The method trades statistical efficiency for computational efficiency. It gives consistent parameter estimates, competitive prediction error performance, and substantial computational improvements. When applied to a large-scale recommender system application and compared to a standard maximum likelihood procedure, the method delivers competitive prediction performance while reducing the sequential computation time from hours to minutes.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Apr 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 2.
4 papers.
- 2023Partially factorized variational inference for high-dimensional mixed modelscited by 10
- 2021Asynchronous and Distributed Data Augmentation for Massive Data Settingscited by 2
- 2024Linear-cost unbiased posterior estimates for crossed effects and matrix factorization models via couplingscited by 2
- 2024The data augmentation algorithmcited by 0
- 2024Linear-cost unbiased posterior estimates for crossed effects and matrix factorization models via couplings11 Oct 2024
- 2024The data augmentation algorithm15 Jun 2024
- 2023Partially factorized variational inference for high-dimensional mixed models20 Dec 2023
- 2021Asynchronous and Distributed Data Augmentation for Massive Data Settings18 Sep 2021