mlsanityData to 14 Oct 2026

Handling Large-scale Cardinality in building recommendation systems

arXiv 2401.09572 ↗First posted 17 Jan 2024cs.IR cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Effective recommendation systems rely on capturing user preferences, often requiring incorporating numerous features such as universally unique identifiers (UUIDs) of entities. However, the exceptionally high cardinality of UUIDs poses a significant challenge in terms of model degradation and increased model size due to sparsity. This paper presents two innovative techniques to address the challenge of high cardinality in recommendation systems. Specifically, we propose a bag-of-words approach, combined with layer sharing, to substantially decrease the model size while improving performance. Our techniques were evaluated through offline and online experiments on Uber use cases, resulting in promising results demonstrating our approach's effectiveness in optimizing recommendation systems and enhancing their overall performance.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 4 of its 11 references that are in the map. First posted on arXiv 17 Jan 2024.

Builds on

4 of 11 references.

References · 4

  1. 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
  2. 2019Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systemscited by 68
  3. 2017Hash Embeddings for Efficient Word Representationscited by 55
  4. 2021Cross-Batch Negative Sampling for Training Two-Tower Recommenderscited by 24

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.