mlsanityData to 14 Oct 2026

The Simpson's Paradox in the Offline Evaluation of Recommendation Systems

arXiv 2104.08912 ↗First posted 18 Apr 2021cs.IRcited by 16

Not on the map. Why?

Abstract (arXiv)

Recommendation systems are often evaluated based on user's interactions that were collected from an existing, already deployed recommendation system. In this situation, users only provide feedback on the exposed items and they may not leave feedback on other items since they have not been exposed to them by the deployed system. As a result, the collected feedback dataset that is used to evaluate a new model is influenced by the deployed system, as a form of closed loop feedback. In this paper, we show that the typical offline evaluation of recommender systems suffers from the so-called Simpson's paradox. Simpson's paradox is the name given to a phenomenon observed when a significant trend appears in several different sub-populations of observational data but disappears or is even reversed when these sub-populations are combined together. Our in-depth experiments based on stratified sampling reveal that a very small minority of items that are frequently exposed by the deployed system plays a confounding factor in the offline evaluation of recommendation systems. In addition, we propose a novel evaluation methodology that takes into account the confounder, i.e the deployed system's characteristics. Using the relative comparison of many recommendation models as in the typical offline evaluation of recommender systems, and based on the Kendall rank correlation coefficient, we show that our proposed evaluation methodology exhibits statistically significant improvements of 14% and 40% on the examined open loop datasets (Yahoo! and Coat), respectively, in reflecting the true ranking of systems with an open loop (randomised) evaluation in comparison to the standard evaluation.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Apr 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

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

16 papers.

Sort:

By area:

  1. 2023On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-n Recommendationcited by 13
  2. 2022Simpson's Paradox in Recommender Fairness: Reconciling differences between per-user and aggregated evaluationscited by 5
  3. 2023Offline Recommender System Evaluation under Unobserved Confoundingcited by 4
  4. 2024Active Inference and Human--Computer Interactioncited by 4
  5. 2025Fashion-AlterEval: A Dataset for Improved Evaluation of Conversational Recommendation Systems with Alternative Relevant Itemscited by 1
  6. 2023Recommender Systems: A Primercited by 0
  7. 2023Separating and Learning Latent Confounders to Enhancing User Preferences Modelingcited by 0
  8. 2023Exploring Popularity Bias in Session-based Recommendationcited by 0
  9. 2024Counterfactual Evaluation of Ads Ranking Models through Domain Adaptationcited by 0
  10. 2025Confounding is a Pervasive Problem in Real World Recommender Systemscited by 0
  11. 2025Causality-aware Graph Aggregation Weight Estimator for Popularity Debiasing in Top-K Recommendationcited by 0
  12. 2026An Interpretable CF-RL-TOPSIS Fusion Model for Skills-Aware Talent Recommendationcited by 0
4 more
  1. 2026Distributional Approximate Nearest Neighbour Search for Uncertainty-Aware Retrievalcited by 0
  2. 2026NxN E-valuation: Hypothesis Certification via a Conformal CRT Nullcited by 0
  3. 2026The Laws of Context Allocation: Causal Measurement and Closed-Loop Orchestration in Generative Searchcited by 0
  4. 2026AURA: Agentic Diagnosis and Refinement for Production Recommender Systems at Scalecited by 0