arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.2106cs.LG
收藏

基于逻辑损失最小化的AMS一致优化

Consistent optimization of AMS by logistic loss minimization

Poznań University of Technology(波兹南理工大学)

Wojciech Kotłowski

摘要:

在本文中,我们从理论上证明了一种在希格斯玻色子机器学习挑战赛的参与者中流行的方法,以优化近似中位数显著性(AMS)。该方法基于以下两阶段程序。首先,通过最小化训练样本上的二元分类的替代损失(例如逻辑损失)来学习实值函数。然后,通过AMS的直接优化,在单独的验证样本上调整阈值。我们表明,所得到的(阈值)分类器测量相对于平方AMS的遗憾,是上界的底层实值函数测量相对于逻辑损失的遗憾。因此,我们证明了最小化逻辑代理是优化AMS的一致方法。

英文摘要:

In this paper, we theoretically justify an approach popular among participants of the Higgs Boson Machine Learning Challenge to optimize approximate median significance (AMS). The approach is based on the following two-stage procedure. First, a real-valued function is learned by minimizing a surrogate loss for binary classification, such as logistic loss, on the training sample. Then, a threshold is tuned on a separate validation sample, by direct optimization of AMS. We show that the regret of the resulting (thresholded) classifier measured with respect to the squared AMS, is upperbounded by the regret of the underlying real-valued function measured with respect to the logistic loss. Hence, we prove that minimizing logistic surrogate is a consistent method of optimizing AMS.

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

↑