Scaling New Frontiers: Insights into Large Recommendation Models
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , , , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909410666741760 |
|---|---|
| author | Guo, Wei Wang, Hao Zhang, Luankang Chin, Jin Yao Liu, Zhongzhou Cheng, Kai Pan, Qiushi Lee, Yi Quan Xue, Wanqi Shen, Tingjia Song, Kenan Wang, Kefan Xie, Wenjia Ye, Yuyang Guo, Huifeng Liu, Yong Lian, Defu Tang, Ruiming Chen, Enhong |
| author_facet | Guo, Wei Wang, Hao Zhang, Luankang Chin, Jin Yao Liu, Zhongzhou Cheng, Kai Pan, Qiushi Lee, Yi Quan Xue, Wanqi Shen, Tingjia Song, Kenan Wang, Kefan Xie, Wenjia Ye, Yuyang Guo, Huifeng Liu, Yong Lian, Defu Tang, Ruiming Chen, Enhong |
| contents | Recommendation systems are essential for filtering data and retrieving relevant information across various applications. Recent advancements have seen these systems incorporate increasingly large embedding tables, scaling up to tens of terabytes for industrial use. However, the expansion of network parameters in traditional recommendation models has plateaued at tens of millions, limiting further benefits from increased embedding parameters. Inspired by the success of large language models (LLMs), a new approach has emerged that scales network parameters using innovative structures, enabling continued performance improvements. A significant development in this area is Meta's generative recommendation model HSTU, which illustrates the scaling laws of recommendation systems by expanding parameters to thousands of billions. This new paradigm has achieved substantial performance gains in online experiments. In this paper, we aim to enhance the understanding of scaling laws by conducting comprehensive evaluations of large recommendation models. Firstly, we investigate the scaling laws across different backbone architectures of the large recommendation models. Secondly, we conduct comprehensive ablation studies to explore the origins of these scaling laws. We then further assess the performance of HSTU, as the representative of large recommendation models, on complex user behavior modeling tasks to evaluate its applicability. Notably, we also analyze its effectiveness in ranking tasks for the first time. Finally, we offer insights into future directions for large recommendation models. Supplementary materials for our research are available on GitHub at https://github.com/USTC-StarTeam/Large-Recommendation-Models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_00714 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Scaling New Frontiers: Insights into Large Recommendation Models Guo, Wei Wang, Hao Zhang, Luankang Chin, Jin Yao Liu, Zhongzhou Cheng, Kai Pan, Qiushi Lee, Yi Quan Xue, Wanqi Shen, Tingjia Song, Kenan Wang, Kefan Xie, Wenjia Ye, Yuyang Guo, Huifeng Liu, Yong Lian, Defu Tang, Ruiming Chen, Enhong Information Retrieval Recommendation systems are essential for filtering data and retrieving relevant information across various applications. Recent advancements have seen these systems incorporate increasingly large embedding tables, scaling up to tens of terabytes for industrial use. However, the expansion of network parameters in traditional recommendation models has plateaued at tens of millions, limiting further benefits from increased embedding parameters. Inspired by the success of large language models (LLMs), a new approach has emerged that scales network parameters using innovative structures, enabling continued performance improvements. A significant development in this area is Meta's generative recommendation model HSTU, which illustrates the scaling laws of recommendation systems by expanding parameters to thousands of billions. This new paradigm has achieved substantial performance gains in online experiments. In this paper, we aim to enhance the understanding of scaling laws by conducting comprehensive evaluations of large recommendation models. Firstly, we investigate the scaling laws across different backbone architectures of the large recommendation models. Secondly, we conduct comprehensive ablation studies to explore the origins of these scaling laws. We then further assess the performance of HSTU, as the representative of large recommendation models, on complex user behavior modeling tasks to evaluate its applicability. Notably, we also analyze its effectiveness in ranking tasks for the first time. Finally, we offer insights into future directions for large recommendation models. Supplementary materials for our research are available on GitHub at https://github.com/USTC-StarTeam/Large-Recommendation-Models. |
| title | Scaling New Frontiers: Insights into Large Recommendation Models |
| topic | Information Retrieval |
| url | https://arxiv.org/abs/2412.00714 |