Papers › Hierarchical Bayesian CMB Component Separation with the No-U-Turn Sampler
Hierarchical Bayesian CMB Component Separation with the No-U-Turn Sampler
R. D. P. Grumitt, Luke R. P. Jew, C. Dickinson
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper we present a novel implementation of Bayesian CMB component separation. We sample from the full posterior distribution using the No-U-Turn Sampler (NUTS), a gradient-based sampling algorithm. Alongside this, we introduce new foreground modelling approaches. We use the mean-shift algorithm to define regions on the sky, clustering according to naively estimated foreground spectral parameters. Over these regions we adopt a complete pooling model, where we assume constant spectral parameters, and a hierarchical model, where we model individual pixel spectral parameters as being drawn from underlying hyper-distributions. We validate the algorithm against simulations of the \textit{LiteBIRD} and C-BASS experiments, with an input tensor-to-scalar ratio of r=5×10⁻³. Considering multipoles 30≤ℓ<180, we are able to recover estimates for r. With \textit{LiteBIRD}-only observations, and using the complete pooling model, we recover r=(12.9±1.4)×10⁻³. For C-BASS and \textit{LiteBIRD} observations we find r=(9.0±1.1)×10⁻³ using the complete pooling model, and r=(5.2±1.0)×10⁻³ using the hierarchical model. Unlike the complete pooling model, the hierarchical model captures pixel-scale spatial variations in the foreground spectral parameters, and therefore produces cosmological parameter estimates with reduced bias, without inflating the their uncertainties. Measured by the rate of effective sample generation, NUTS offers performance improvements of ∼10³ over using Metropolis-Hastings to fit the complete pooling model. The efficiency of NUTS allows us to fit the more sophisticated hierarchical foreground model, that would likely be intractable with non-gradient based sampling algorithms.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections