mlsanityData to 7 Oct 2026

Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrieval

arXiv 2607.00448 ↗First posted 1 Jul 2026cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

The two-tower model is widely used in the retrieval stage of large-scale recommendation systems, where training typically relies on in-batch and/or out-of-batch negative sampling. These methods, however, tend to produce easy negatives that the model learns quickly and that provide little training signal. This paper proposes a self-supervised, cluster-based hard negative sampling technique that draws negatives from the same semantic cluster as the positive item; in our production deployment the clusters are derived from large language model (LLM) based multimodal content representations, so that intra-cluster items are genuinely similar and yield informative negatives. To make this deployable at industrial scale, we realize the technique in a real-time, end-to-end framework that maintains a live in-memory item pool and draws cluster-based negatives from it on the fly via global out-of-batch sampling (GOOBS). The framework integrates directly into production two-tower training and serving and scales to billions of training examples with minimal computational overhead. Experiments on four public datasets and a 14-day online A/B test in a large-scale production system show that the proposed technique outperforms widely used industry methods, while also helping to break recommendation feedback loops and substantially reducing popularity bias.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 34 references that are in the map. First posted on arXiv 1 Jul 2026.

Builds on

17 of 34 references.

References · 17

  1. 2015Session-based Recommendations with Recurrent Neural Networkscited by 685
  2. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
  3. 2024Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendationscited by 184
  4. 2017Recurrent Neural Networks with Top-k Gains for Session-based Recommendationscited by 165
  5. 2020Embedding-based Retrieval in Facebook Searchcited by 155
  6. 2019Learning Dense Representations for Entity Retrievalcited by 122
  7. 2020Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender Systemcited by 94
  8. 2019Managing Popularity Bias in Recommender Systems with Personalized Re-rankingcited by 81
  9. 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
  10. 2020Controlling Fairness and Bias in Dynamic Learning-to-Rankcited by 67
  11. 2021Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairnesscited by 35
  12. 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
5 more
  1. 2017Cascade Ranking for Operational E-commerce Searchcited by 29
  2. 2021Cross-Batch Negative Sampling for Training Two-Tower Recommenderscited by 24
  3. 2023Revisiting Neural Retrieval on Acceleratorscited by 14
  4. 2024Trinity: Syncretizing Multi-/Long-tail/Long-term Interests All in Onecited by 7
  5. 2024KuaiFormer: Transformer-Based Retrieval at Kuaishoucited by 6

Built on by

Not cited yet.