Papers › Feed-forward neural network unfolding

Feed-forward neural network unfolding

15 Dec 2021arXiv:2112.08180links table onlyarchive 2025-07-28

Ming-Liang Wong, Andrew Edmonds, Chen Wu

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.

A feed-forward neural network is demonstrated to efficiently unfold the energy distribution of protons and alpha particles passing through passive material. This model-independent approach works with unbinned data and does not require regularization. The training dataset was produced with the same Monte Carlo simulation framework used by the AlCap experiment. The common problem of designing a network is also addressed by performing a hyperparameter space scan to find the best network geometry possible within reasonable computation time. Finally, a comparison with other unfolding methods such as the iterative d'Agostini Bayesian unfolding, and Singular Value Decomposition (SVD) are shown.

PaperPDFCode

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