mlsanityData to 14 Oct 2026

From Gradient-Boosted Trees to Deep Recommenders: Practical Lessons from Migrating a Production Customer Support Recommender

arXiv 2608.24132 ↗First posted 25 Aug 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Product catalogs in fast-moving service businesses are shifting from static, independently priced SKUs toward dynamically bundled, discount-coupled offerings--a shift that strains the tree-based classifiers traditionally preferred for sparse and highly imbalanced data. These classifiers assume a fixed, slowly changing label space and struggle to incorporate multimodal signals such as tabular data and transcripts. We present the migration of a live, production conversational recommendation system from a gradient-boosted multiclass model to a pairwise-binary deep recommender. Because this system is critical to ecosystem growth initiatives and downstream features like dynamic pitching--surfacing the most relevant pitch text to a support agent in real time during a live customer conversation--maintaining live recommendation quality was a non-negotiable constraint. We detail the techniques that made this migration successful--reformulating recommendation as pairwise binary prediction to learn jointly from user and item features, and enhancing learned representations via negative sampling and noise injection. To efficiently incorporate long, live conversation context, we apply attention pooling over transcript chunks and benchmark it against TF-IDF and sentence-embedding baselines. Finally, we explore multiple architectures (including two-tower models, DeepFM, and their variants) and loss functions such as contrastive loss. Evaluating against a CatBoost baseline across all conversational stages, we demonstrate that our approach achieves parity at conversation beginning and outperforms at later conversational stages.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 14 references that are in the map. First posted on arXiv 25 Aug 2026.

Builds on

6 of 14 references.

References · 6

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  4. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  5. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
  6. 2017Deep Interest Network for Click-Through Rate Predictioncited by 544

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.