Introduction
Neutrino oscillation studies are fundamental to our understanding of particle physics, yet the statistical methods required to infer oscillation parameters are notoriously computationally expensive. The standard Feldman-Cousins (FC) method, while robust for small datasets and complex physics, requires exhaustive Monte Carlo simulations across a dense parameter grid. This often translates to millions of CPU hours for a single analysis. This paper presents an iterative approach using Gaussian Processes (GP) to significantly reduce this computational burden by focusing resources on the most critical regions of the parameter space.
Methodology: Gaussian Process Iterative Refinement
The proposed method replaces the brute-force grid search with an active learning framework based on Bayesian Optimization. Instead of calculating critical values for every point, a Gaussian Process serves as a surrogate model to estimate the underlying function of critical values, $c(\theta)$.
The core of the efficiency lies in the acquisition function, which identifies points where the GP is most uncertain about the boundary of the confidence contour. By iteratively sampling only these high-information points and updating the surrogate model, the algorithm converges on the final contour without needing to explore the entire grid.
Experimental Evaluation
The method was tested using a toy neutrino oscillation experiment focusing on the parameters $\sin^2 \theta_{23}$ and $\delta_{CP}$. A "true" ground-truth contour was established using a standard 400-point FC grid search. The GP-based approach was then evaluated against this baseline across 200 simulated datasets to ensure statistical consistency.
Results and Performance
The GP iterative method achieved a 70% reduction in computational cost compared to the traditional grid search. As shown in the performance analysis, the method reaches high accuracy with a fraction of the total grid points.
Key findings include:
- Efficiency: Identical results were produced using only 30% of the original computation budget.
- Accuracy: The confidence contours generated by the GP showed exceptional overlap with the ground-truth FC contours, validating the method's reliability.
- Convergence: The acquisition function effectively prioritized sampling near the 68% and 95% confidence boundaries, ignoring regions deep inside or far outside the contours.
Conclusion
By shifting from exhaustive calculation to active learning, researchers can accelerate neutrino parameter inference by an order of magnitude. While currently demonstrated in 2D, future work will focus on scaling this approach to higher-dimensional spaces involving multiple systematic uncertainties. This technique holds broad potential for any high-energy physics application currently limited by the computational intensity of the Feldman-Cousins method.
Summary updated