CROLoss: Towards a Customizable Loss for Retrieval Models in Recommender Systems
Not on the map. Why?
Abstract (arXiv)
In large-scale recommender systems, retrieving top N relevant candidates accurately with resource constrain is crucial. To evaluate the performance of such retrieval models, Recall@N, the frequency of positive samples being retrieved in the top N ranking, is widely used. However, most of the conventional loss functions for retrieval models such as softmax cross-entropy and pairwise comparison methods do not directly optimize Recall@N. Moreover, those conventional loss functions cannot be customized for the specific retrieval size N required by each application and thus may lead to sub-optimal performance. In this paper, we proposed the Customizable Recall@N Optimization Loss (CROLoss), a loss function that can directly optimize the Recall@N metrics and is customizable for different choices of N. This proposed CROLoss formulation defines a more generalized loss function space, covering most of the conventional loss functions as special cases. Furthermore, we develop the Lambda method, a gradient-based method that invites more flexibility and can further boost the system performance. We evaluate the proposed CROLoss on two public benchmark datasets. The results show that CROLoss achieves SOTA results over conventional loss functions for both datasets with various choices of retrieval size N. CROLoss has been deployed onto our online E-commerce advertising platform, where a fourteen-day online A/B test demonstrated that CROLoss contributes to a significant business revenue growth of 4.75%.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 5 Aug 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 1.
4 papers.
- 2024Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for Recommendationcited by 9
- 2023Toward a Better Understanding of Loss Functions for Collaborative Filteringcited by 8
- 2025Learning Cascade Ranking as One Networkcited by 2
- 2023Class Anchor Margin Loss for Content-Based Image Retrievalcited by 0
- 2025Learning Cascade Ranking as One Network12 Mar 2025
- 2024Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for Recommendation29 Feb 2024
- 2023Toward a Better Understanding of Loss Functions for Collaborative Filtering11 Aug 2023
- 2023Class Anchor Margin Loss for Content-Based Image Retrieval1 Jun 2023