Handling Large-scale Cardinality in building recommendation systems

Dhruva Dixith Kurra, Bo Ling, Chun Zh, Seyedshahin Ashrafzadeh
1/17/2024
cs.IRcs.AI

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kurra2024handling,
  title  = {Handling Large-scale Cardinality in building recommendation systems},
  author = {Dhruva Dixith Kurra and Bo Ling and Chun Zh and Seyedshahin Ashrafzadeh},
  year   = {2024},
  eprint = {2401.09572},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.09572v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.09572.svg)](https://codeofpaper.com/paper/2401.09572)

Discussion