Heuristic algorithm for 1D and 2D unfolding
Abstract
A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a criteria which includes a 2 test and a regularization. After a relatively small number of iterations (500 - 1000) the growing reconstructed distribution converges to the true distribution.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.