GCIB: Graph Contrastive Information Bottleneck for Multi-Behavior Recommendation
Likang Wu, Zihao Chen, Jianxin Zhang, Sangqi Zhu, Yuanyuan Ge, Haipeng Yang, Lei Zhang
Abstract
With the rapid emergence of multi-behavior learning in recommender systems, leveraging auxiliary user behaviors has proven effective for mitigating target-behavior data sparsity. Yet auxiliary behavior graphs frequently contain noisy or irrelevant interactions that do not align with the target task, impeding the learning of accurate user and item embeddings. Moreover, the scarcity of direct supervised from the target behavior complicates the extraction of informative collaborative signals. In this paper, we introduce GCIB Graph Contrastive Information Bottleneck, a novel framework that denoises auxiliary behavior information and enriches target behavior representations at both the structural and feature levels. At the structural level, GCIB employs a Graph Information Bottleneck (GIB) objective to maximize mutual information between the denoised auxiliary graph and the target-behavior graph while minimizing mutual information with the original auxiliary graph. This formulation preserves task-relevant structural patterns and suppresses spurious interactions. At the feature level, we propose a cross-behavior Graph Contrastive Learning (GCL) scheme in which denoised auxiliary features and target-behavior features serve as complementary views for both users and items. By contrasting these views, GCIB enriches sparse target-behavior representations with semantics distilled from auxiliary behaviors. Extensive experiments on multiple real-world datasets demonstrate that GCIB outperforms state-of-the-art baselines, highlighting its ability to learn noise-resilient and target-aware representations for multi-behavior recommendation.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e6cacbcb-8f8f-4f84-9a6c-3bb68abd0735Builds on16
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
- InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information MaximizationFan-Yun Sun, Jordan Hoffmann, Vikas Verma, Jian TangICLR 2020 · 1,010 citations
- CLUB: A Contrastive Log-ratio Upper Bound of Mutual InformationPengyu Cheng, Weituo Hao, Shuyang Dai, Jiachang Liu et al.ICML 2020 · 512 citations
- Multi-behavior Recommendation with Graph Convolutional NetworksBowen Jin, Chen Gao, Xiangnan He, Depeng Jin et al.SIGIR 2020 · 420 citations
Related papers
- Graph Augmentation for RecommendationQianru Zhang, Lianghao Xia, Xuheng Cai, Siu-Ming Yiu et al.ICDE 2024 · 31 citations
- Robust Graph Based Social Recommendation Through Contrastive Multi-View LearningFei Xiong, Tao Zhang, Shirui Pan, Guixun Luo et al.AAAI 2025 · 8 citations
- Contrastive Graph Structure Learning via Information Bottleneck for RecommendationChunyu Wei, Jian Liang, Di Liu, Fei WangNeurIPS 2022 · 100 citations
- A Review-aware Graph Contrastive Learning Framework for RecommendationJie Shuai, Kun Zhang, Le Wu, Peijie Sun et al.SIGIR 2022 · 170 citations
- MCLMR: A Model-Agnostic Causal Learning Framework for Multi-Behavior RecommendationRanxu Zhang, Junjie Meng, Ying Sun, Ziqi Xu et al.WWW 2026
