Barlow and Beeston presented an exact likelihood for the problem of fitting a composite model consisting of binned templates obtained from Monte-Carlo simulation which are fitted to equally binned data. Solving the exact likelihood is technically challenging, and therefore Conway proposed an approximate likelihood to address these challenges. In this paper, a new approximate likelihood is derived from the exact Barlow-Beeston one. The new approximate likelihood and Conway's likelihood are generalized to problems of fitting weighted data with weighted templates. The performance of estimates obtained with all three likelihoods is studied on two toy examples: a simple one and a challenging one. The performance of the approximate likelihoods is comparable to the exact Barlow-Beeston likelihood, while the performance in fits with weighted templates is better. The approximate likelihoods evaluate faster than the Barlow-Beeston one when the number of bins is large.
翻译:Barlow和Beeston提出了设计一个综合模型的准确可能性,该模型由蒙特-卡洛模拟中获得的、与同样被捆绑的数据相匹配的捆绑模板组成。解决确切可能性在技术上是具有挑战性的,因此Conway提出了应对这些挑战的大致可能性。在本文中,新的大概可能性来自Barlow-Beeston的精确概率。新的大概可能性和Conway的可能性被广泛概括为使用加权模板来匹配加权数据的问题。用所有三种可能性得出的估算的性能在两个微小的例子中进行了研究:一个是简单的,一个是具有挑战性的。大致概率的性能与Barlow-Beeston的精确概率相当,而与加权模板的性能则更好。当垃圾数量巨大时,估计的概率比Barlow-Beeston的概率要快。