学习排序中回归树拟合算法分析
Analysis of Regression Tree Fitting Algorithms in Learning to Rank
摘要:
在学习排序领域,行业级应用主要是梯度提升框架,该框架使用最小二乘误差原理拟合树。而在分类领域,另一种树拟合原理--加权最小二乘误差,如LogitBoost及其变体,得到了广泛的应用。然而,在学习排序的情境中,对这两个原则之间的关系缺乏分析。我们提出了一个新的原则命名为最小客观损失的错误,使我们能够分析上述问题以及几个重要的学习排序模型。我们还实现了两个典型的和强大的系统,并在两个真实世界的数据集进行我们的实验。实验结果表明,我们提出的方法带来适度的改善最小平方误差原则。
英文摘要:
In learning to rank area, industry-level applications have been dominated by gradient boosting framework, which fits a tree using least square error principle. While in classification area, another tree fitting principle, weighted least square error, has been widely used, such as LogitBoost and its variants. However, there is a lack of analysis on the relationship between the two principles in the scenario of learning to rank. We propose a new principle named least objective loss based error that enables us to analyze the issue above as well as several important learning to rank models. We also implement two typical and strong systems and conduct our experiments in two real-world datasets. Experimental results show that our proposed method brings moderate improvements over least square error principle.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。