arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.10262cs.IR
收藏

在线环境中优化排名模型

Optimizing Ranking Models in an Online Setting

Harrie Oosterhuis, Maarten de Rijke

摘要:

在线学习排名(OLTR)方法通过直接与用户交互来优化排名模型,这使得它们非常高效和响应迅速。在过去十年中引入的所有OLTR方法都是在原始OLTR方法的基础上扩展的:决斗强盗梯度下降(DBGD)。最近,引入了一种根本不同的方法,即成对可微梯度下降(PDGD)算法。到目前为止,这两种方法的比较仅限于级联点击模型和低噪声水平的模拟。到目前为止的主要成果是PDGD收敛于更高的性能水平,并且比基于DBGD的方法学习得更快。然而,PDGD算法假设级联用户行为,潜在地给予其不公平的优势。此外,这两种方法对高水平噪声的鲁棒性尚未研究。因此,目前尚不清楚所报道的PDGD优于DBGD的优点是否适用于不同的实验条件。在本文中,我们调查是否以前的结论PDGD和DBGD比较推广从理想的最坏情况下。我们以两种方式这样做。首先,我们比较PDGD和DBGD的理论属性,通过在排名的背景下,在以前证明的属性进行批判性的研究。其次,我们通过模拟理想的用户行为和非常困难的行为来估计方法性能的上限和下限,即,几乎随机的非级联用户模型。我们的研究结果表明,DBGD的理论界不适用于任何常见的排名模型,而且,DBGD的性能是大大不如PDGD在理想和最坏的情况下。这些结果再现了先前发表的研究结果的相对性能PDGD与DBGD和推广他们非常嘈杂和非级联的情况下。

英文摘要:

Online Learning to Rank (OLTR) methods optimize ranking models by directly interacting with users, which allows them to be very efficient and responsive. All OLTR methods introduced during the past decade have extended on the original OLTR method: Dueling Bandit Gradient Descent (DBGD). Recently, a fundamentally different approach was introduced with the Pairwise Differentiable Gradient Descent (PDGD) algorithm. To date the only comparisons of the two approaches are limited to simulations with cascading click models and low levels of noise. The main outcome so far is that PDGD converges at higher levels of performance and learns considerably faster than DBGD-based methods. However, the PDGD algorithm assumes cascading user behavior, potentially giving it an unfair advantage. Furthermore, the robustness of both methods to high levels of noise has not been investigated. Therefore, it is unclear whether the reported advantages of PDGD over DBGD generalize to different experimental conditions. In this paper, we investigate whether the previous conclusions about the PDGD and DBGD comparison generalize from ideal to worst-case circumstances. We do so in two ways. First, we compare the theoretical properties of PDGD and DBGD, by taking a critical look at previously proven properties in the context of ranking. Second, we estimate an upper and lower bound on the performance of methods by simulating both ideal user behavior and extremely difficult behavior, i.e., almost-random non-cascading user models. Our findings show that the theoretical bounds of DBGD do not apply to any common ranking model and, furthermore, that the performance of DBGD is substantially worse than PDGD in both ideal and worst-case circumstances. These results reproduce previously published findings about the relative performance of PDGD vs. DBGD and generalize them to extremely noisy and non-cascading circumstances.

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

↑