Search arXivSearch

arXiv · 2605.21066

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

Abstract

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Zongyu Li. 2026-09-05. PUID: A Personalized Deconfounding Framework for Recommender Systems under Hidden Confounding. https://arxiv.org/abs/2605.21066

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Deep belief networks are exact

We prove that every strictly positive probability distribution on \(\{-1,1\}^n\) is represented exactly by a sigmoid belief network with finite parameters. This answers a question of Sutskever and Hinton. The proof upgrades their probability-sharing approximation to exact representation using Brouwer's fixed-point theorem.

cs.AI

Stacked conformal prediction

We consider a method for conformalizing a stacked ensemble of predictive models, showing that the potentially simple form of the meta-learner at the top of the stack enables a procedure with manageable computational cost that achieves approximate marginal validity without requiring the use of a separate calibration sample. Empirical results indicate that the method compares favorably to a standard inductive alternative.

stat.ML

Higher Structures in Deep Learning

We provide an expository introduction on the importance of higher-arity tensor operations to deep learning. Then, we conduct a novel empirical investigation of higher-arity phenomenon in trained neural networks, introduce a hypergraphical generalization of the multilayer perceptron, and explore connections to evolutionary algorithms. We conclude with a discussion of promising directions for future research.

cs.LG