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

July 28, 2025 Β· Declared Dead Β· πŸ› ACM Conference on Recommender Systems

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yunus Lutz, Timo Wilm, Philipp Duwe arXiv ID 2507.20753 Category cs.IR: Information Retrieval Cross-listed cs.AI, cs.LG Citations 0 Venue ACM Conference on Recommender Systems Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted