mlsanityData to 13 Oct 2026

PUID: A Personalized Deconfounding Framework for Recommender Systems under Hidden Confounding

arXiv 2605.21066 ↗First posted 20 May 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Recommender systems often rely on observational user-item interaction data, which is prone to selection bias due to users' selective interactions with items. While techniques such as inverse propensity weighting (IPW) and doubly robust estimators are effective in addressing selection bias from observed confounding, they become unreliable when hidden confounding exists, meaning that there are confounders that influence both user clicks and feedback but are not observable (e.g., user salary). Existing approaches relying on randomized controlled trials (RCTs) or global sensitivity bounds are constrained in practice: RCTs demand costly experimental data, while global sensitivity bounds presume a uniformly bounded effect of unmeasured confounders on propensities through sensitivity analysis, thereby neglecting heterogeneity across user-item interactions. To overcome this limitation, we propose a novel framework, Personalized Unobserved-Confounding-aware Interaction Deconfounder (PUID), which estimates user-item level sensitivity bounds, thereby substantially relaxing the homogeneity assumption inherent in global sensitivity bounds. Under mild assumptions, we use an entropy-based method to estimate the individualized strength of hidden confounding. Specifically, if observed user and item features can already well predict the exposure status (i.e., the mutual information is small), then the influence of hidden confounding is assumed to be small. To ensure both robustness and predictive accuracy, we further develop an adversarial optimization strategy and propose a benchmark-guided variant (BPUID) that incorporates pre-trained models as stabilizing references. Extensive experiments on three real-world datasets demonstrate that our approach consistently outperforms state-of-the-art baselines under hidden confounding, without requiring RCT data.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 9 of its 30 references that are in the map. First posted on arXiv 20 May 2026.

Builds on

9 of 30 references.

References · 9

  1. 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
  2. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 247
  3. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
  4. 2020Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender Systemcited by 94
  5. 2021AutoDebias: Learning to Debias for Recommendationcited by 68
  6. 2019Large-scale Causal Approaches to Debiasing Post-click Conversion Rate Estimation with Multi-task Learningcited by 39
  7. 2022Learning Causal Effects on Hypergraphscited by 31
  8. 2023Balancing Unobserved Confounding with a Few Unbiased Ratings in Debiased Recommendationscited by 18
  9. 2023Confounder Balancing in Adversarial Domain Adaptation for Pre-Trained Large Models Fine-Tuningcited by 1

Built on by

Not cited yet.