Grid-based minimization at scale: Feldman-Cousins corrections for light sterile neutrino search

About

High Energy Physics (HEP) experiments generally employ sophisticated statistical methods to present results in searches of new physics. In the problem of searching for sterile neutrinos, likelihood ratio tests are applied to short-baseline neutrino oscillation experiments to construct confidence intervals for the parameters of interest. The test statistics of the form $\Delta \chi^2$ is often used to form the confidence intervals, however, this approach can lead to statistical inaccuracies due to the small signal rate in the region-of-interest. In this paper, we present a computational model for the computationally expensive Feldman-Cousins corrections to construct a statistically accurate confidence interval for neutrino oscillation analysis. The program performs a grid-based minimization over oscillation parameters and is written in C++. Our algorithms make use of vectorization through Eigen3, yielding a single-core speed-up of 350 compared to the original implementation, and achieve MPI data parallelism by employing DIY. We demonstrate the strong scaling of the application at High-Performance Computing (HPC) sites. We utilize HDF5 along with HighFive to write the results of the calculation to file..

0:00:00 Slide 1

0:01:12 Slide 2

0:02:24 Slide 3

0:03:35 Slide 4

0:04:47 Slide 5

0:05:58 Slide 6

0:07:10 Slide 7

0:08:21 Slide 8

0:09:33 Slide 9

0:10:44 Slide 10

0:11:56 Slide 11