# Enhancing LambdaMART Using Oblivious Trees

Source: [Enhancing LambdaMART Using Oblivious Trees](<https://www.sota2.com/research/paper/68fa62bf1e209131ce9fb1e6>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:56:32.412Z

Authors: Michal Ferov, Marek Modr\\'y

Published: 2016-09-19T07:03:29.000Z

## Abstract

Learning to rank is a machine learning technique broadly used in many areas such as document retrieval, collaborative filtering or question answering. We present experimental results which suggest that the performance of the current state-of-the-art learning to rank algorithm LambdaMART, when used for document retrieval for search engines, can be improved if standard regression trees are replaced by oblivious trees. This paper provides a comparison of both variants and our results demonstrate that the use of oblivious trees can improve the performance by more than $2.2\\%$. Additional experimental analysis of the influence of a number of features and of a size of the training set is also provided and confirms the desirability of properties of oblivious decision trees.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1609.05610>)

[PDF](<https://arxiv.org/pdf/1609.05610.pdf>)
