一维和二维展开的启发式算法
Heuristic algorithm for 1D and 2D unfolding
摘要:
一个非常简单的启发式方法展开的问题将被描述。迭代算法从一个空直方图开始,每次迭代的目的是向该直方图添加一个条目。要添加的条目是根据包括$χ^2$测试和正则化在内的标准选择的。在相对较少的迭代次数(500 - 1000)之后,增长的重建分布收敛到真实分布。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。