Self-supervised Graph Learning for Recommendation

🤖 Plain-English Summary

Representation learning on user-item graph for recommendation has evolved from using single ID or interaction history to exploiting higher-order neighbors. This leads to the success of graph convolution networks (GCNs) for recommendation such as PinSage and LightGCN.

🔑 Key Findings

• This leads to the success of graph convolution networks (GCNs) for recommendation such as PinSage and LightGCN.
• Despite effectiveness, we argue that they suffer from two limitations: (1) high-degree nodes exert larger impact on the representation learning, deteriorating the recommendations of low-degree (long-tail) items; and (2) representations are vulnerable to noisy interactions, as the neighborhood aggregation scheme further enlarges the impact of observed edges.

🔗 Related Resources