mlsanityData to 14 Oct 2026

On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-n Recommendation

arXiv 2307.15053 ↗First posted 27 Jul 2023cs.IR cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Approaches to recommendation are typically evaluated in one of two ways: (1) via a (simulated) online experiment, often seen as the gold standard, or (2) via some offline evaluation procedure, where the goal is to approximate the outcome of an online experiment. Several offline evaluation metrics have been adopted in the literature, inspired by ranking metrics prevalent in the field of Information Retrieval. (Normalised) Discounted Cumulative Gain (nDCG) is one such metric that has seen widespread adoption in empirical studies, and higher (n)DCG values have been used to present new methods as the state-of-the-art in top-n recommendation for many years. Our work takes a critical look at this approach, and investigates when we can expect such metrics to approximate the gold standard outcome of an online experiment. We formally present the assumptions that are necessary to consider DCG an unbiased estimator of online reward and provide a derivation for this metric from first principles, highlighting where we deviate from its traditional uses in IR. Importantly, we show that normalising the metric renders it inconsistent, in that even when DCG is unbiased, ranking competing methods by their normalised DCG can invert their relative order. Through a correlation analysis between off- and on-line experiments conducted on a large-scale recommendation platform, we show that our unbiased DCG estimates strongly correlate with online reward, even when some of the metric's inherent assumptions are violated. This statement no longer holds for its normalised variant, suggesting that nDCG's practical utility may be limited.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 40 of its 111 references that are in the map. First posted on arXiv 27 Jul 2023.

Builds on

40 of 111 references.

References · 40

  1. 2019Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approachescited by 185
  2. 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 182
  3. 2020Neural Collaborative Filtering vs. Matrix Factorization Revisitedcited by 123
  4. 2016Off-policy evaluation for slate recommendationcited by 103
  5. 2018Offline A/B testing for Recommender Systemscited by 96
  6. 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 94
  7. 2019RecSim: A Configurable Simulation Platform for Recommender Systemscited by 94
  8. 2019Doubly robust off-policy evaluation with shrinkagecited by 87
  9. 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
  10. 2018RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertisingcited by 65
  11. 2019A Troubling Analysis of Reproducibility and Progress in Recommender Systems Researchcited by 65
  12. 2020Off-policy Bandits with Deficient Supportcited by 61
28 more
  1. 2020Evaluating Stochastic Rankings with Expected Exposurecited by 53
  2. 2019On the Difficulty of Evaluating Baselines: A Study on Recommender Systemscited by 46
  3. 2020A Critical Study on Data Leakage in Recommender System Offline Evaluationcited by 39
  4. 2020Adaptive Estimator Selection for Off-Policy Evaluationcited by 38
  5. 2020Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactionscited by 35
  6. 2023Off-Policy Evaluation for Large Action Spaces via Conjunct Effect Modelingcited by 34
  7. 2021Evaluating the Robustness of Off-Policy Evaluationcited by 32
  8. 2020Optimal Off-Policy Evaluation from Multiple Logging Policiescited by 30
  9. 2022Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Modelcited by 30
  10. 2020Carousel Personalization in Music Streaming Apps with Contextual Banditscited by 26
  11. 2022Policy-Adaptive Estimator Selection for Off-Policy Evaluationcited by 24
  12. 2021Revisiting the Performance of iALS on Item Recommendation Benchmarkscited by 21
  13. 2017Effective Evaluation using Logged Bandit Feedback from Multiple Loggerscited by 20
  14. 2021On Sampling Top-K Recommendation Evaluationcited by 20
  15. 2020BLOB : A Probabilistic Model for Recommendation that Combines Organic and Bandit Signalscited by 19
  16. 2022Doubly-Robust Estimation for Correcting Position-Bias in Click Feedback for Unbiased Learning to Rankcited by 18
  17. 2020Learning from eXtreme Bandit Feedbackcited by 17
  18. 2021The Simpson's Paradox in the Offline Evaluation of Recommendation Systemscited by 16
  19. 2018Intervention Harvesting for Context-Dependent Examination-Bias Estimationcited by 14
  20. 2020StochasticRank: Global Optimization of Scale-Free Discrete Functionscited by 13
  21. 2022Learning-to-Rank at the Speed of Sampling: Plackett-Luce Gradient Estimation With Minimal Computational Complexitycited by 13
  22. 2023Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimizationcited by 11
  23. 2023A Probabilistic Position Bias Model for Short-Video Recommendation Feedscited by 7
  24. 2023A Common Misassumption in Online Experiments with Machine Learning Modelscited by 5
  25. 2021Towards Meaningful Statements in IR Evaluation. Mapping Evaluation Measures to Interval Scalescited by 4
  26. 2022Which Tricks Are Important for Learning to Rank?cited by 3
  27. 2023Offline Evaluation for Reinforcement Learning-based Recommendation: A Critical Issue and Some Alternativescited by 3
  28. 2019On the Value of Bandit Feedback for Offline Recommender System Evaluationcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 5; 2026: 3.

13 papers.

Sort:

By area: