mlsanityData to 7 Oct 2026

Top-N Recommendation with Counterfactual User Preference Simulation

arXiv 2109.02444 ↗First posted 2 Sep 2021cs.IR cs.AIcited by 21

Not on the map. Why?

Abstract (arXiv)

Top-N recommendation, which aims to learn user ranking-based preference, has long been a fundamental problem in a wide range of applications. Traditional models usually motivate themselves by designing complex or tailored architectures based on different assumptions. However, the training data of recommender system can be extremely sparse and imbalanced, which poses great challenges for boosting the recommendation performance. To alleviate this problem, in this paper, we propose to reformulate the recommendation task within the causal inference framework, which enables us to counterfactually simulate user ranking-based preferences to handle the data scarce problem. The core of our model lies in the counterfactual question: "what would be the user's decision if the recommended items had been different?". To answer this question, we firstly formulate the recommendation process with a series of structural equation models (SEMs), whose parameters are optimized based on the observed data. Then, we actively indicate many recommendation lists (called intervention in the causal inference terminology) which are not recorded in the dataset, and simulate user feedback according to the learned SEMs for generating new training samples. Instead of randomly intervening on the recommendation list, we design a learning-based method to discover more informative training samples. Considering that the learned SEMs can be not perfect, we, at last, theoretically analyze the relation between the number of generated samples and the model prediction error, based on which a heuristic method is designed to control the negative effect brought by the prediction error. Extensive experiments are conducted based on both synthetic and real-world datasets to demonstrate the effectiveness of our framework.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). Builds on 23 of its 43 references that are in the map. First posted on arXiv 2 Sep 2021.

Builds on

23 of 43 references.

References · 23

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Variational Inference: A Review for Statisticianscited by 1,466
  4. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  5. 2017Neural Collaborative Filteringcited by 1,108
  6. 2016Wide & Deep Learning for Recommender Systemscited by 745
  7. 2019Neural Graph Collaborative Filteringcited by 660
  8. 2017Deep & Cross Network for Ad Click Predictionscited by 392
  9. 2019Counterfactual Visual Explanationscited by 312
  10. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
  11. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
  12. 2019Counterfactual Data Augmentation for Mitigating Gender Stereotypes in Languages with Rich Morphologycited by 200
11 more
  1. 2019Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approachescited by 181
  2. 2020RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithmscited by 137
  3. 2017Causal Embeddings for Recommendationcited by 79
  4. 2019Specifying Object Attributes and Relations in Interactive Scene Generationcited by 76
  5. 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
  6. 2018Counterfactual Critic Multi-Agent Training for Scene Graph Generationcited by 53
  7. 2018Adversarial Personalized Ranking for Recommendationcited by 48
  8. 2017Deep Reinforcement Learning for List-wise Recommendationscited by 35
  9. 2019Counterfactual Vision-and-Language Navigation via Adversarial Path Samplingcited by 22
  10. 2018DeepFM: An End-to-End Wide & Deep Learning Framework for CTR Predictioncited by 9
  11. 2019FairyTED: A Fair Rating Predictor for TED Talk Datacited by 6

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 6; 2023: 5; 2024: 4; 2025: 4.

21 papers.

Sort:

By area:

  1. 2023On Generative Agents in Recommendationcited by 88
  2. 2022ESCM2: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimationcited by 47
  3. 2021Deconfounded Causal Collaborative Filteringcited by 14
  4. 2022Unbiased Knowledge Distillation for Recommendationcited by 11
  5. 2024Debiased Recommendation with Noisy Feedbackcited by 8
  6. 2021Learning Explicit User Interest Boundary for Recommendationcited by 6
  7. 2022Causal Disentanglement with Network Information for Debiased Recommendationscited by 4
  8. 2025Beyond Static Testbeds: An Interaction-Centric Agent Simulation Platform for Dynamic Recommender Systemscited by 4
  9. 2025Curious Causality-Seeking Agents Learn Meta Causal Worldcited by 4
  10. 2023Counterfactual Collaborative Reasoningcited by 3
  11. 2023Specify Robust Causal Representation from Mixed Observationscited by 3
  12. 2022Dynamic Causal Collaborative Filteringcited by 2
9 more
  1. 2023Deep Stable Multi-Interest Learning for Out-of-distribution Sequential Recommendationcited by 2
  2. 2022Deep Causal Reasoning for Recommendationscited by 1
  3. 2024The Importance of Causality in Decision Making: A Perspective on Recommender Systemscited by 1
  4. 2024Guided Diffusion-based Counterfactual Augmentation for Robust Session-based Recommendationcited by 1
  5. 2022Generalizable Information Theoretic Causal Representationcited by 0
  6. 2023Explainable History Distillation by Marked Temporal Point Processcited by 0
  7. 2024Causal Discovery in Recommender Systems: Example and Discussioncited by 0
  8. 2025On Predicting Post-Click Conversion Rate via Counterfactual Inferencecited by 0
  9. 2025Causality Enhancement for Cross-Domain Recommendationcited by 0