Papers › Detecting Fast Neutrino Flavor Conversions with Machine Learning

Detecting Fast Neutrino Flavor Conversions with Machine Learning

5 Oct 2023arXiv:2310.03807links table onlyarchive 2025-07-28

Sajad Abbar, Hiroki Nagakura

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.

Neutrinos in dense environments like core-collapse supernovae (CCSNe) and neutron star mergers (NSMs) can undergo fast flavor conversions (FFCs) once the angular distribution of neutrino lepton number crosses zero along a certain direction. Recent advancements have demonstrated the effectiveness of machine learning (ML) in detecting these crossings. In this study, we enhance prior research in two significant ways. Firstly, we utilize realistic data from CCSN simulations, where neutrino transport is solved using the full Boltzmann equation. We evaluate the ML methods' adaptability in a real-world context, enhancing their robustness. In particular, we demonstrate that when working with artificial data, simpler models outperform their more complex counterparts, a noteworthy illustration of the bias-variance tradeoff in the context of ML. We also explore methods to improve artificial datasets for ML training. In addition, we extend our ML techniques to detect the crossings in the heavy-leptonic channels, accommodating scenarios where νₓ and ν̅ₓ may differ. Our research highlights the extensive versatility and effectiveness of ML techniques, presenting an unparalleled opportunity to evaluate the occurrence of FFCs in CCSN and NSM simulations.

PaperPDFCode

Code

sajadabbar/realistic-data-xln officialmentioned in paper report

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