Doubly Robust Joint Learning for Recommendation on Data Missing Not at Random
In recommender systems, usually the ratings of a user to most items are missing and a critical problem is that the missing ratings are often missing not at random (MNAR) in reality. It is widely acknowledged that MNAR ratings make it difficult to accurately predict the ratings and unbiasedly estimate the performance of rating prediction. Recent approaches use imputed errors to recover the prediction errors for missing ratings, or weight observed ratings with the propensities of being observed. These approaches can still be severely biased in performance estimation or suffer from the variance of the propensities. To overcome these limitations, we first propose an estimator that integrates the imputed errors and propensities in a doubly robust way to obtain unbiased performance estimation and alleviate the effect of the propensity variance. To achieve good performance guarantees, based on this estimator, we propose joint learning of rating prediction and error imputation, which outperforms the state-of-the-art approaches on four real-world datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
ImputationPredictionRecommendation SystemsSimilar Papers 제목 키워드 기반
Doubly Calibrated Estimator for Recommendation on Data Missing Not At Random
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 …
ImputationRecommendation SystemsSelection biasStableDR: Stabilized Doubly Robust Learning for Recommendation on Data Missing Not at Random
In recommender systems, users always choose the favorite items to rate, which leads to data missing not at random and poses a great challenge for unbiased evaluation and learning of prediction models. Currently, the doub…
Generalization BoundsImputationRecommendation SystemsLearning Deep Generative Models with Doubly Stochastic MCMC
We present doubly stochastic gradient MCMC, a simple and generic method for (approximate) Bayesian inference of deep generative models (DGMs) in a collapsed continuous parameter space. At each MCMC sampling step, the alg…
Bayesian InferenceDensity EstimationImputationTemporal Smoothness Doubly Robust Learning for Debiased Knowledge Tracing
Knowledge Tracing (KT) is fundamental to intelligent education systems, yet relies on educational logs that are selectively observed. The non-random nature of exercise recommendations and student choices inevitably induc…
Knowledge TracingDoubly-Robust Lasso Bandit
Contextual multi-armed bandit algorithms are widely used in sequential decision tasks such as news article recommendation systems, web page ad placement algorithms, and mobile health. Most of the existing algorithms have…
Multi-Armed BanditsRecommendation Systems