mlsanityData to 14 Oct 2026

Cross-Batch Negative Sampling for Training Two-Tower Recommenders

arXiv 2110.15154 ↗First posted 28 Oct 2021cs.IRcited by 24

Not on the map. Why?

Abstract (arXiv)

The two-tower architecture has been widely applied for learning item and user representations, which is important for large-scale recommender systems. Many two-tower models are trained using various in-batch negative sampling strategies, where the effects of such strategies inherently rely on the size of mini-batches. However, training two-tower models with a large batch size is inefficient, as it demands a large volume of memory for item and user contents and consumes a lot of time for feature encoding. Interestingly, we find that neural encoders can output relatively stable features for the same input after warming up in the training process. Based on such facts, we propose a simple yet effective sampling strategy called Cross-Batch Negative Sampling (CBNS), which takes advantage of the encoded item embeddings from recent mini-batches to boost the model training. Both theoretical analysis and empirical evaluations demonstrate the effectiveness and the efficiency of CBNS.

Key facts. Cited by 24 papers in the map (data through 14 Oct 2026). First posted on arXiv 28 Oct 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 3; 2023: 7; 2024: 5; 2025: 4; 2026: 5.

24 papers.

Sort:

By area:

  1. 2026Your Group-Relative Advantage Is Biasedcited by 34
  2. 2022BRIGHT -- Graph Neural Networks in Real-Time Fraud Detectioncited by 15
  3. 2024Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogscited by 15
  4. 2023Revisiting Neural Retrieval on Acceleratorscited by 14
  5. 2023Que2Engage: Embedding-based Retrieval for Relevant and Engaging Products at Facebook Marketplacecited by 9
  6. 2024RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenderscited by 9
  7. 2023HyperFormer: Learning Expressive Sparse Feature Representations via Hypergraph Transformercited by 8
  8. 2022FedCL: Federated Contrastive Learning for Privacy-Preserving Recommendationcited by 6
  9. 2024X-Reflect: Cross-Reflection Prompting for Multimodal Recommendationcited by 6
  10. 2025EAGER-LLM: Enhancing Large Language Models as Recommenders through Exogenous Behavior-Semantic Integrationcited by 6
  11. 2022Global Contrastive Batch Sampling via Optimization on Sample Permutationscited by 5
  12. 2023Neighborhood-based Hard Negative Mining for Sequential Recommendationcited by 5
12 more
  1. 2024Evaluating Performance and Bias of Negative Sampling in Large-Scale Sequential Recommendation Modelscited by 4
  2. 2025A Hybrid Cross-Stage Coordination Pre-ranking Model for Online Recommendation Systemscited by 3
  3. 2025GFlowGR: Fine-tuning Generative Recommendation Frameworks with Generative Flow Networkscited by 3
  4. 2023Delving into E-Commerce Product Retrieval with Vision-Language Pre-trainingcited by 2
  5. 2024Handling Large-scale Cardinality in building recommendation systemscited by 2
  6. 2026Policy Improvement Reinforcement Learningcited by 2
  7. 2023Ranking Differential Privacycited by 1
  8. 2025SciTopic: Enhancing Topic Discovery in Scientific Literature through Advanced LLMcited by 1
  9. 2023DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loopscited by 0
  10. 2026Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrievalcited by 0
  11. 2026Don't Contrast the Impossible: Region-Constrained Batching for Contrastive User Modeling on a Local Community Platformcited by 0
  12. 2026Keeping the Index Open: The Recommendation-Side Cost of Shared Search and Recommendationcited by 0