Contrastive Graph Structure Learning via Information Bottleneck for Recommendation

Chunyu Wei · Jian Liang · Di Liu · Fei Wang

Hall J #131

Keywords: [ recommender system ] [ graph neural networks ] [ contrastive learning ]

[ Abstract ]
[ Poster [ OpenReview
Wed 30 Nov 2 p.m. PST — 4 p.m. PST
Spotlight presentation: Lightning Talks 3B-3
Wed 7 Dec 10 a.m. PST — 10:15 a.m. PST


Graph convolution networks (GCNs) for recommendations have emerged as an important research topic due to their ability to exploit higher-order neighbors. Despite their success, most of them suffer from the popularity bias brought by a small number of active users and popular items. Also, a real-world user-item bipartite graph contains many noisy interactions, which may hamper the sensitive GCNs. Graph contrastive learning show promising performance for solving the above challenges in recommender systems. Most existing works typically perform graph augmentation to create multiple views of the original graph by randomly dropping edges/nodes or relying on predefined rules, and these augmented views always serve as an auxiliary task by maximizing their correspondence. However, we argue that the graph structures generated from these vanilla approaches may be suboptimal, and maximizing their correspondence will force the representation to capture information irrelevant for the recommendation task. Here, we propose a Contrastive Graph Structure Learning via Information Bottleneck (CGI) for recommendation, which adaptively learns whether to drop an edge or node to obtain optimized graph structures in an end-to-end manner. Moreover, we innovatively introduce the Information Bottleneck into the contrastive learning process to avoid capturing irrelevant information among different views and help enrich the final representation for recommendation. Extensive experiments on public datasets are provided to show that our model significantly outperforms strong baselines.

Chat is not available.