A data-driven convergence criterion for iterative unfolding of smeared spectra
Data Analysis, Statistics and Probability
2021-01-05 v1
Abstract
A data-driven convergence criterion for the D'Agostini (Richardson-Lucy) iterative unfolding is presented. It relies on the unregularized spectrum (infinite number of iterations), and allows a safe estimation of the bias and undercoverage induced by truncating the algorithm. In addition, situations where the response matrix is not perfectly known are also discussed, and show that in most cases the unregularized spectrum is not an unbiased estimator of the true distribution. Whenever a bias is introduced, either by truncation of by poor knowledge of the response, a way to retrieve appropriate coverage properties is proposed.
Cite
@article{arxiv.2101.01096,
title = {A data-driven convergence criterion for iterative unfolding of smeared spectra},
author = {M. Licciardi and B. Quilain},
journal= {arXiv preprint arXiv:2101.01096},
year = {2021}
}
Comments
17 pages, 9 figures