arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1811.04822physics.data-anhep-ex
收藏

使用弱学习者近似理解提升决策树方法

Understanding the boosted decision tree methods with the weak-learner approximation

Li-Gang Xia

摘要:

在假设所有树都是弱学习器的情况下,研究了两种流行的提升决策树(BDT)方法:自适应BDT(AdaBDT)和梯度BDT(GradBDT)在信号与背景分离分类问题中的应用。获得了以下结果。a)对于两种方法,BDT分数的分布近似为高斯分布。b)训练树越多,信号和背景的分数分布期望值的距离越大,但两者的方差也越大。c)AdaBDT中的增强机制可以扩展到任何损失函数。d)AdaBDT被示出为等价于对于决策树具有2个终端节点的GradBDT。在高能物理领域,许多应用都追求最佳的统计显著性。我们还表明,统计意义的最大化是密切相关的损失函数,这是目标的BDT算法的最小化。

英文摘要:

Two popular boosted decsion tree (BDT) methods, Adaptive BDT (AdaBDT) and Gradient BDT (GradBDT) are studied in the classification problem of separating signal from background assuming all trees are weak learners. The following results are obtained. a) The distribution of the BDT score is approximately Gaussian for both methods. b) With more trees in training, the distance of the expectaion of score distribution between signal and background is larger, but the variance of both distributions becomes greater at the same time. c) Extenstion of the boosting mechanism in AdaBDT to any loss function is possible. d) AdaBDT is shown to be equivalent to the GradBDT with 2 terminal nodes for a decision tree. In the field high energy physics, many applications persue the best statistical significance. We also show that the maximization of the statistical significance is closely related to the minimization of the loss function, which is the target of the BDT algorithms.

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

↑