arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.02405hep-phcs.LGhep-ex
收藏

ν²-Flows:利用条件归一化流在多中微子末态中实现快速且改进的中微子重建

$ν^2$-Flows: Fast and improved neutrino reconstruction in multi-neutrino final states with conditional normalizing flows

University of Geneva(日内瓦大学);Harvard University(哈佛大学)

John Andrew Raine, Matthew Leigh, Knut Zoch, Tobias Golling

AI总结:

本文提出ν²-Flows方法,将条件归一化流扩展到多中微子末态,在t̄t双轻子事例中实现更快、更准确的中微子重建,显著提升统计精度。

摘要:

在这项工作中,我们引入了ν²-Flows,它是ν-Flows方法向包含多个中微子的末态的扩展。该架构能够原生地扩展到末态中所有对象类型和多重数的组合,适用于任意期望的中微子多重数。在t̄t双轻子事例中,与使用最流行的标准解析技术相比,两个中微子的动量以及它们之间的关联被更准确地重建,并且所有事例都能找到解。推理时间显著快于竞争方法,并且可以通过在图形处理单元上并行评估进一步缩短。我们将ν²-Flows应用于t̄t双轻子事例,并表明在展开分布中逐箱的不确定性比标准技术更接近完美中微子重建所设定的性能极限。对于所选择的双重微分观测量,与中微子加权方法相比,ν²-Flows使每个箱的统计精度提高了1.5到2倍,与椭圆方法相比则最多提高了四倍。

英文摘要:

In this work we introduce $ν^2$-Flows, an extension of the $ν$-Flows method to final states containing multiple neutrinos. The architecture can natively scale for all combinations of object types and multiplicities in the final state for any desired neutrino multiplicities. In $t\bar{t}$ dilepton events, the momenta of both neutrinos and correlations between them are reconstructed more accurately than when using the most popular standard analytical techniques, and solutions are found for all events. Inference time is significantly faster than competing methods, and can be reduced further by evaluating in parallel on graphics processing units. We apply $ν^2$-Flows to $t\bar{t}$ dilepton events and show that the per-bin uncertainties in unfolded distributions is much closer to the limit of performance set by perfect neutrino reconstruction than standard techniques. For the chosen double differential observables $ν^2$-Flows results in improved statistical precision for each bin by a factor of 1.5 to 2 in comparison to the Neutrino Weighting method and up to a factor of four in comparison to the Ellipse approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑