A Guided Learning Approach for Item Recommendation via Surrogate Loss Learning
Ahmed Rashed, Josif Grabocka, Lars Schmidt-Thieme
Abstract
Normalized discounted cumulative gain (NDCG) is one of the popular evaluation metrics for recommender systems and learning-to-rank problems. As it is non-differentiable, it cannot be optimized by gradient-based optimization procedures. In the last twenty years, a plethora of surrogate losses have been engineered that aim to make learning recommendation and ranking models that optimize NDCG possible. However, binary relevance implicit feedback settings still pose a significant challenge for such surrogate losses as they are usually designed and evaluated only for multi-level relevance feedback. In this paper, we address the limitations of directly optimizing the NDCG measure by proposing a guided learning approach (GuidedRec) that adopts recent advances in parameterized surrogate losses for NDCG. Starting from the observation that jointly learning a surrogate loss for NDCG and the recommendation model is very unstable, we design a stepwise approach that can be seamlessly applied to any recommender system model that uses a point-wise logistic loss function. The proposed approach guides the models towards optimizing the NDCG using an independent surrogate-loss model trained to approximate the true NDCG measure while maintaining the original logistic loss function as a stabilizer for the guiding procedure. In experiments on three recommendation datasets, we show that our guided surrogate learning approach yields models better optimized for NDCG than recent state-of-the-art approaches using engineered surrogate losses.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 1122f1d1-417f-47d9-be90-2bdcc18e40d9Cited by top-tier papers4
- PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for RecommendationWeiqin Yang, Jiawei Chen, Xin Xin, Sheng Zhou et al.NeurIPS 2024 · 17 citations
- Advancing Loss Functions in Recommender Systems: A Comparative Study with a Rényi Divergence-Based SolutionShengjia Zhang, Jiawei Chen, Changdong Li, Sheng Zhou et al.AAAI 2025 · 6 citations
- IDRBench: Understanding the Capability of Large Language Models on Interdisciplinary ResearchYuanhao Shen, Daniel de Sousa, Ricardo de Andrade Nascimento, Hongyu Guo et al.ICML 2026 · 1 citation
- Breaking the Top-K Barrier: Advancing Top-K Ranking Metrics Optimization in Recommender SystemsWeiqin Yang, Jiawei Chen, Shengjia Zhang, Peng Wu et al.KDD 2025
Related papers
- Large-scale Stochastic Optimization of NDCG Surrogates for Deep Learning with Provable ConvergenceZi-Hao Qiu, Quanqi Hu, Yongjian Zhong, Lijun Zhang et al.ICML 2022 · 25 citations
- An Alternative Cross Entropy Loss for Learning-to-RankSebastian BruchWWW 2021 · 58 citations
- On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-n RecommendationOlivier Jeunen, Ivan Potapov, Aleksei UstimenkoKDD 2024 · 16 citations
- Permutative Preference Alignment from Listwise Ranking of Human JudgmentsYang Zhao, Yixin Wang, Mingzhang YinEMNLP 2025 · 5 citations
- New Insights into Metric Optimization for Ranking-based RecommendationRoger Zhe Li, Julián Urbano, Alan HanjalicSIGIR 2021 · 6 citations
