Abstract

Representation learning on user-item graph for recommendation has evolved\nfrom using single ID or interaction history to exploiting higher-order\nneighbors. This leads to the success of graph convolution networks (GCNs) for\nrecommendation such as PinSage and LightGCN. Despite effectiveness, we argue\nthat they suffer from two limitations: (1) high-degree nodes exert larger\nimpact on the representation learning, deteriorating the recommendations of\nlow-degree (long-tail) items; and (2) representations are vulnerable to noisy\ninteractions, as the neighborhood aggregation scheme further enlarges the\nimpact of observed edges.\n In this work, we explore self-supervised learning on user-item graph, so as\nto improve the accuracy and robustness of GCNs for recommendation. The idea is\nto supplement the classical supervised task of recommendation with an auxiliary\nself-supervised task, which reinforces node representation learning via\nself-discrimination. Specifically, we generate multiple views of a node,\nmaximizing the agreement between different views of the same node compared to\nthat of other nodes. We devise three operators to generate the views -- node\ndropout, edge dropout, and random walk -- that change the graph structure in\ndifferent manners. We term this new learning paradigm as\n\\textit{Self-supervised Graph Learning} (SGL), implementing it on the\nstate-of-the-art model LightGCN. Through theoretical analyses, we find that SGL\nhas the ability of automatically mining hard negatives. Empirical studies on\nthree benchmark datasets demonstrate the effectiveness of SGL, which improves\nthe recommendation accuracy, especially on long-tail items, and the robustness\nagainst interaction noises. Our implementations are available at\n\\url{https://github.com/wujcan/SGL}.\n

Affiliated Institutions

Related Publications

LightGCN

Graph Convolution Network (GCN) has become new state-of-the-art for collaborative filtering. Nevertheless, the reasons of its effectiveness for recommendation are not well under...

2020 3523 citations

KGAT

To provide more accurate, diverse, and explainable recommendation, it is\ncompulsory to go beyond modeling user-item interactions and take side\ninformation into account. Tradit...

2019 Proceedings of the 25th ACM SIGKDD In... 1899 citations

BERT4Rec

Fei Sun , Jun Liu , Jian Wu +4 more

Modeling users' dynamic preferences from their historical behaviors is challenging and crucial for recommendation systems. Previous methods employ sequential neural networks to ...

2019 Proceedings of the 28th ACM Internati... 1977 citations

Publication Info

Year
2021
Type
article
Pages
726-735
Citations
1162
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

1162
OpenAlex

Cite This

Jiancan Wu, Xiang Wang, Fuli Feng et al. (2021). Self-supervised Graph Learning for Recommendation. , 726-735. https://doi.org/10.1145/3404835.3462862

Identifiers

DOI
10.1145/3404835.3462862