Betancourt-Girolami (2015) Hamiltonian Monte Carlo for Hierarchical Models

hamiltonian-monte-carlomcmchierarchical-modelnon-centered-parameterizationfunnelnutsriemannian-hmcdivergencesbayesiancomputational-statistics

Summary

Betancourt and Girolami explain why hierarchical models are notoriously hard to sample and how Hamiltonian Monte Carlo (HMC), combined with the right parameterization, overcomes the difficulty. The exchangeable-group structure that makes hierarchical models powerful also induces a characteristic pathological geometry — the funnel — whose curvature varies so strongly that most common samplers stall. The paper reviews these pathologies, shows why naive Gibbs and Random-Walk Metropolis (and even global-covariance corrections) fail, contrasts the centered and non-centered parameterizations, and demonstrates that HMC (with NUTS, a suitable metric, and divergence monitoring) is the practical route to efficient inference. Published as a chapter in Current Trends in Bayesian Methodology with Applications (Chapman & Hall/CRC, 2015; arXiv:1312.0906).

Key Claims

Concepts Introduced or Extended

Entities Mentioned

Quotes

"When the data are sparse the density of these models looks like a 'funnel', with a region of high density but low volume below a region of low density and high volume."

"The correlations in hierarchical models, however, are not global but rather local and efficient implementations require more sophistication."

My Take

This chapter is the reference that turned "hierarchical models are hard to sample" from folklore into a precise geometric story, and it is the intellectual basis for how Stan users are taught to work today: reparameterize non-centered when the data are weak, run NUTS, and treat divergences as a red flag rather than noise. The deepest point is that the pathology is local curvature, which is why the twentieth-century fixes — rotate to decorrelate, tune a global mass matrix — don't rescue Gibbs or Random-Walk Metropolis, and why even HMC needs either a Riemannian metric or a parameterization that flattens the geometry. It pairs naturally with the mechanics in Hamiltonian Monte Carlo and with the hierarchical-modeling literature, and its centered/non-centered dichotomy is the same reparameterization idea that appears in the data-augmentation and parameter-expansion work (Gelman–Van Dyk; Liu–Wu).