Doubly Calibrated Estimator for Recommendation on Data Missing Not At Random
Not on the map. Why?
Abstract (arXiv)
Recommender systems often suffer from selection bias as users tend to rate their preferred items. The datasets collected under such conditions exhibit entries missing not at random and thus are not randomized-controlled trials representing the target population. To address this challenge, a doubly robust estimator and its enhanced variants have been proposed as they ensure unbiasedness when accurate imputed errors or predicted propensities are provided. However, we argue that existing estimators rely on miscalibrated imputed errors and propensity scores as they depend on rudimentary models for estimation. We provide theoretical insights into how miscalibrated imputation and propensity models may limit the effectiveness of doubly robust estimators and validate our theorems using real-world datasets. On this basis, we propose a Doubly Calibrated Estimator that involves the calibration of both the imputation and propensity models. To achieve this, we introduce calibration experts that consider different logit distributions across users. Moreover, we devise a tri-level joint learning framework, allowing the simultaneous optimization of calibration experts alongside prediction and imputation models. Through extensive experiments on real-world datasets, we demonstrate the superiority of the Doubly Calibrated Estimator in the context of debiased recommendation tasks.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 49 of its 104 references that are in the map. First posted on arXiv 26 Feb 2024.
Builds on
49 of 104 references.
References · 49
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2017Neural Collaborative Filteringcited by 1,108
- 2014Distributed Representations of Sentences and Documentscited by 677
- 2020Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlationcited by 420
- 2021Revisiting the Calibration of Modern Neural Networkscited by 387
37 more
- 2018Variational Autoencoders for Collaborative Filteringcited by 308
- 2019Verified Uncertainty Calibrationcited by 307
- 2020Calibration of Pre-trained Transformerscited by 307
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
- 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
- 2018Fairness of Exposure in Rankingscited by 189
- 2020Local Temperature Scaling for Probability Calibrationcited by 95
- 2022KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systemscited by 94
- 2017Causal Embeddings for Recommendationcited by 79
- 2019Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedbackcited by 79
- 2021AutoDebias: Learning to Debias for Recommendationcited by 68
- 2022ESCM2: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimationcited by 47
- 2019Large-scale Causal Approaches to Debiasing Post-click Conversion Rate Estimation with Multi-task Learningcited by 39
- 2021Don't Just Blame Over-parametrization for Over-confidence: Theoretical Analysis of Calibration in Binary Classificationcited by 39
- 2019Measuring the Business Value of Recommender Systemscited by 32
- 2020Information Theoretic Counterfactual Learning from Missing-Not-At-Random Feedbackcited by 30
- 2022Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filteringcited by 29
- 2019Asymmetric Tri-training for Debiasing Missing-Not-At-Random Explicit Feedbackcited by 28
- 2020DE-RRD: A Knowledge Distillation Framework for Recommender Systemcited by 28
- 2021Enhanced Doubly Robust Learning for Debiasing Post-click Conversion Rate Estimationcited by 28
- 2022On the Opportunity of Causal Learning in Recommendation Systems: Foundation, Estimation, Prediction and Challengescited by 28
- 2022StableDR: Stabilized Doubly Robust Learning for Recommendation on Data Missing Not at Randomcited by 24
- 2021Bootstrapping User and Item Representations for One-Class Collaborative Filteringcited by 22
- 2023A Survey on Causal Inference for Recommendationcited by 22
- 2021Bidirectional Distillation for Top-K Recommender Systemcited by 21
- 2018Aspect-Aware Latent Factor Model: Rating Prediction with Ratings and Reviewscited by 19
- 2022TDR-CL: Targeted Doubly Robust Collaborative Learning for Debiased Recommendationscited by 18
- 2022A Generalized Doubly Robust Learning Framework for Debiasing Post-Click Conversion Rate Predictioncited by 18
- 2023Balancing Unobserved Confounding with a Few Unbiased Ratings in Debiased Recommendationscited by 18
- 2021Obtaining Calibrated Probabilities with Personalized Ranking Modelscited by 15
- 2018Behaviour Policy Estimation in Off-Policy Policy Evaluation: Calibration Matterscited by 13
- 2022Fair Ranking as Fair Division: Impact-Based Individual Fairness in Rankingcited by 13
- 2023Distillation from Heterogeneous Models for Top-K Recommendationcited by 13
- 2020Choppy: Cut Transformer For Ranked List Truncationcited by 11
- 2022Consensus Learning from Heterogeneous Objectives for One-Class Collaborative Filteringcited by 5
- 2021Learning to Truncate Ranked Lists for Information Retrievalcited by 3
Built on by
Citing papers per year: 2024: 3; 2025: 4.
7 papers.
- 2025Uncertainty Quantification and Decomposition for LLM-based Recommendationcited by 12
- 2024Debiased Recommendation with Noisy Feedbackcited by 8
- 2024Fine-Grained Dynamic Framework for Bias-Variance Joint Optimization on Data Missing Not at Randomcited by 4
- 2024On the Necessity of World Knowledge for Mitigating Missing Labels in Extreme Classificationcited by 0
- 2025Model Evaluation in the Dark: Robust Classifier Metrics with Missing Labelscited by 0
- 2025Addressing Correlated Latent Exogenous Variables in Debiased Recommender Systemscited by 0
- 2025BPL: Bias-adaptive Preference Distillation Learning for Recommender Systemcited by 0
- 2025BPL: Bias-adaptive Preference Distillation Learning for Recommender System17 Oct 2025
- 2025Addressing Correlated Latent Exogenous Variables in Debiased Recommender Systems9 Jun 2025
- 2025Model Evaluation in the Dark: Robust Classifier Metrics with Missing Labels25 Apr 2025
- 2025Uncertainty Quantification and Decomposition for LLM-based Recommendation29 Jan 2025
- 2024On the Necessity of World Knowledge for Mitigating Missing Labels in Extreme Classification18 Aug 2024
- 2024Debiased Recommendation with Noisy Feedback24 Jun 2024
- 2024Fine-Grained Dynamic Framework for Bias-Variance Joint Optimization on Data Missing Not at Random24 May 2024