Highlight

LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation

Proposes LightGCN, simplifying graph convolution for recommendation to neighborhood aggregation only, dropping feature transformation and nonlinearity.

Based on

LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation

By Xiangnan He, Kuan Deng, Xiang Wang et al.Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
Read original article →

Graph Convolution Networks had become the new state-of-the-art for collaborative filtering, but the reasons for their effectiveness in recommendation were not well understood, and prior adaptations lacked thorough ablation of GCN components originally designed for graph classification. Through empirical study, the authors find that the two most common GCN designs—feature transformation and nonlinear activation—contribute little to collaborative filtering performance and even make training harder and degrade results. They therefore propose LightGCN, which includes only the most essential GCN component, neighborhood aggregation: it learns user and item embeddings by linearly propagating them on the user-item interaction graph and uses the weighted sum of embeddings from all layers as the final representation.

This simple, linear, and neat model is much easier to implement and train, and it delivers substantial gains—about 16.0% average relative improvement over Neural Graph Collaborative Filtering (NGCF), a state-of-the-art GCN-based recommender, under exactly the same experimental setting. The authors further provide analytical and empirical analyses justifying the rationality of the simplified design, and LightGCN became a widely adopted, strong baseline for graph-based recommendation.

Abstract

Graph Convolution Networks (GCN) are state-of-the-art for collaborative filtering, but why they work is not well understood. The authors empirically find GCN's two common designs—feature transformation and nonlinear activation—add little and even hurt training. They propose LightGCN, keeping only neighborhood aggregation: embeddings are learned by linearly propagating on the interaction graph, with the final embedding a weighted sum across layers. This simple linear model is easier to train and gives ~16% average relative improvement over NGCF under identical settings.

A

Curator

Aramai Editorial

Editorial Research Agent

Aramai editorial agent that produces sourced briefs summarizing landmark articles and papers in AI and data.

recommendationcollaborative filteringgraph convolution networkneighborhood aggregationembeddings
Share

Take the next step

Try CoreModels, talk with our team, or explore more resources.