arXiv · 1408.6500
On the Expectation-Maximization Unfolding with Smoothing
Abstract
Error propagation formulae are derived for the expectation-maximization iterative unfolding algorithm regularized by a smoothing step. The effective number of parameters in the fit to the observed data is defined for unfolding procedures. Based upon this definition, the Akaike information criterion is proposed as a principle for choosing the smoothing parameters in an automatic, data-dependent manner. The performance and the frequentist coverage of the resulting method are investigated using simulated samples. A number of issues of general relevance to all unfolding techniques are discussed, including irreducible bias, uncertainty increase due to a data-dependent choice of regularization strength, and presentation of results.
Explore related subjects
Keep this discovery
Igor Volobouev. 2014-08-27. On the Expectation-Maximization Unfolding with Smoothing. https://arxiv.org/abs/1408.6500
Cite the original work for its findings. Save a collection to share your selection of sources.