Industry Insights from Comparing Deep Learning and GBDT Models for E-Commerce Learning-to-Rank

Yunus Lutz, Timo Wilm, Philipp Duwe
7/28/2025
cs.IRcs.AIcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

In e-commerce recommender and search systems, tree-based models, such as LambdaMART, have set a strong baseline for Learning-to-Rank (LTR) tasks. Despite their effectiveness and widespread adoption in industry, the debate continues whether deep neural networks (DNNs) can outperform traditional tree-based models in this domain. To contribute to this discussion, we systematically benchmark DNNs against our production-grade LambdaMART model. We evaluate multiple DNN architectures and loss functions on a proprietary dataset from OTTO and validate our findings through an 8-week online A/B test. The results show that a simple DNN architecture outperforms a strong tree-based baseline in terms of total clicks and revenue, while achieving parity in total units sold.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lutz2025industry,
  title  = {Industry Insights from Comparing Deep Learning and GBDT Models for E-Commerce Learning-to-Rank},
  author = {Yunus Lutz and Timo Wilm and Philipp Duwe},
  year   = {2025},
  eprint = {2507.20753},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.20753v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.20753.svg)](https://codeofpaper.com/paper/2507.20753)

Discussion