mlsanityData to 7 Oct 2026

Fast Bayesian Inference for Neutrino Non-Standard Interactions at Dark Matter Direct Detection Experiments

arXiv 2405.14932 ↗First posted 23 May 2024cs.LG hep-ph stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Multi-dimensional parameter spaces are commonly encountered in physics theories that go beyond the Standard Model. However, they often possess complicated posterior geometries that are expensive to traverse using techniques traditional to astroparticle physics. Several recent innovations, which are only beginning to make their way into this field, have made navigating such complex posteriors possible. These include GPU acceleration, automatic differentiation, and neural-network-guided reparameterization. We apply these advancements to dark matter direct detection experiments in the context of non-standard neutrino interactions and benchmark their performances against traditional nested sampling techniques when conducting Bayesian inference. Compared to nested sampling alone, we find that these techniques increase performance for both nested sampling and Hamiltonian Monte Carlo, accelerating inference by factors of ~ 100 and ~ 60, respectively. As nested sampling also evaluates the Bayesian evidence, these advancements can be exploited to improve model comparison performance while retaining compatibility with existing implementations that are widely used in the natural sciences. Using these techniques, we perform the first scan in the neutrino non-standard interactions parameter space for direct detection experiments whereby all parameters are allowed to vary simultaneously. We expect that these advancements are broadly applicable to other areas of astroparticle physics featuring multi-dimensional parameter spaces.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 81 references that are in the map. First posted on arXiv 23 May 2024.

Builds on

10 of 81 references.

References · 10

  1. 2018Pyro: Deep Universal Probabilistic Programmingcited by 379
  2. 2013Black Box Variational Inferencecited by 317
  3. 2017A Conceptual Introduction to Hamiltonian Monte Carlocited by 207
  4. 2019Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyrocited by 187
  5. 2019Rank-normalization, folding, and localization: An improved widehatR for assessing convergence of MCMCcited by 90
  6. 2019NeuTra-lizing Bad Geometry in Hamiltonian Monte Carlo Using Neural Transportcited by 73
  7. 2019Block Neural Autoregressive Flowcited by 62
  8. 2023On Sampling with Approximate Transport Mapscited by 20
  9. 2019Automatic Reparameterisation of Probabilistic Programscited by 18
  10. 2024Gaussian distributional structural equation models: A framework for modeling latent heteroscedasticitycited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.