Data Efficiency for Large Recommendation Models
Not on the map. Why?
Abstract (arXiv)
Large recommendation models (LRMs) are fundamental to the multi-billion dollar online advertising industry, processing massive datasets of hundreds of billions of examples before transitioning to continuous online training to adapt to rapidly changing user behavior. The massive scale of data directly impacts both computational costs and the speed at which new methods can be evaluated (R&D velocity). This paper presents actionable principles and high-level frameworks to guide practitioners in optimizing training data requirements. These strategies have been successfully deployed in Google's largest Ads CTR prediction models and are broadly applicable beyond LRMs. We outline the concept of data convergence, describe methods to accelerate this convergence, and finally, detail how to optimally balance training data volume with model size.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 11 references that are in the map. First posted on arXiv 8 Oct 2024.
Builds on
6 of 11 references.
References · 6
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2017In-Datacenter Performance Analysis of a Tensor Processing Unitcited by 610
- 2022Unified Scaling Laws for Routed Language Modelscited by 249
- 2022Understanding Scaling Laws for Recommendation Modelscited by 38
- 2022On the Factory Floor: ML Engineering for Industrial-Scale Ads Recommendation Modelscited by 34
Built on by
Citing papers per year: 2025: 2.
2 papers.