LGIRApr 18, 2024

Estimating the Hessian Matrix of Ranking Objectives for Stochastic Learning to Rank with Gradient Boosted Trees

arXiv:2404.12190v2h-index: 20SIGIR
Originality Incremental advance
AI Analysis

This work addresses a gap in stochastic LTR for practitioners who rely on GBDTs, enabling competitive performance with existing methods, though it is incremental as it extends an existing framework.

The paper tackled the problem of enabling Gradient Boosted Decision Trees (GBDTs) in stochastic learning to rank (LTR), which previously was limited to differentiable models, by introducing a novel Hessian matrix estimator for second-order derivatives. The result showed that stochastic LTR without the Hessian had extremely poor performance, but with their estimated Hessian, it became competitive with the current state-of-the-art.

Stochastic learning to rank (LTR) is a recent branch in the LTR field that concerns the optimization of probabilistic ranking models. Their probabilistic behavior enables certain ranking qualities that are impossible with deterministic models. For example, they can increase the diversity of displayed documents, increase fairness of exposure over documents, and better balance exploitation and exploration through randomization. A core difficulty in LTR is gradient estimation, for this reason, existing stochastic LTR methods have been limited to differentiable ranking models (e.g., neural networks). This is in stark contrast with the general field of LTR where Gradient Boosted Decision Trees (GBDTs) have long been considered the state-of-the-art. In this work, we address this gap by introducing the first stochastic LTR method for GBDTs. Our main contribution is a novel estimator for the second-order derivatives, i.e., the Hessian matrix, which is a requirement for effective GBDTs. To efficiently compute both the first and second-order derivatives simultaneously, we incorporate our estimator into the existing PL-Rank framework, which was originally designed for first-order derivatives only. Our experimental results indicate that stochastic LTR without the Hessian has extremely poor performance, whilst the performance is competitive with the current state-of-the-art with our estimated Hessian. Thus, through the contribution of our novel Hessian estimation method, we have successfully introduced GBDTs to stochastic LTR.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes