Probabilistic Residual Learning for Online Recommendations
Abstract
Modern recommender systems are typically based on deep learning (DL) models, where a dense encoder learns representations of users and items. As a result, these systems often suffer from the black-box nature and computational complexity of the underlying models, making it difficult to systematically enhance their recommendation capabilities. To address this problem, we propose Probabilistic Residual Learning (PRL), a causal Bayesian recommendation model that models the residual between ground-truth and base predictions, enabling targeted refinement of existing systems. Specifically, PRL (1) probabilistically groups users for localized residual modeling, (2) models domain-level confounders that influence user and item representations, and (3) aggregates cluster-specific residual predictions over the confounders using do-calculus. Experiments demonstrate that our plug-and-play PRL is compatible with various base deep learning recommender systems, improving their performance while automatically discovering meaningful user clusters.
Cite
@article{arxiv.2607.20863,
title = {Probabilistic Residual Learning for Online Recommendations},
author = {Wenyuan Wang and Yusong Zhao and Zihao Xu and Hengyi Wang and Qi Xu and Zhigang Hua and Yan Xie and Yi Wang and Zihao Zhao and Bo Long and Chengzhi Mao and Shuang Yang and Hengguan Huang and Hao Wang},
journal= {arXiv preprint arXiv:2607.20863},
year = {2026}
}
Comments
Accepted at the 20th ACM Conference on Recommender Systems (RecSys 2026)