The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation
Abstract
With the recent success of graph convolutional networks (GCNs), they have been widely applied for recommendation, and achieved impressive performance gains. The core of GCNs lies in its message passing mechanism to aggregate neighborhood information. However, we observed that message passing largely slows down the convergence of GCNs during training, especially for large-scale recommender systems, which hinders their wide adoption. LightGCN makes an early attempt to simplify GCNs for collaborative filtering by omitting feature transformations and nonlinear activations. In this paper, we take one step further to propose an ultra-simplified formulation of GCNs (dubbed UltraGCN), which skips infinite layers of message passing for efficient recommendation. Instead of explicit message passing, UltraGCN resorts to directly approximate the limit of infinite-layer graph convolutions via a constraint loss. Meanwhile, UltraGCN allows for more appropriate edge weight assignments and flexible adjustment of the relative importances among different types of relationships. This finally yields a simple yet effective UltraGCN model, which is easy to implement and efficient to train. Experimental results on four benchmark datasets show that UltraGCN not only outperforms the state-of-the-art GCN models but also achieves more than 10x speedup over LightGCN.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926 · cited 4×
“Qiu et al. [21] have proved that many popular network embedding methods with negativesampling(e.g., DeepWalk [20],LINE[25],andNode2Vec[7]) all can be unified into the MF framework.”
BackgroundMethodInfluentialDeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
Neural Collaborative Filtering
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652
Self-citationLINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416 · cited 4×
“Qiu et al. [21] have proved that many popular network embedding methods with negativesampling(e.g., DeepWalk [20],LINE[25],andNode2Vec[7]) all can be unified into the MF framework.”
BackgroundMethodInfluentialLightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
He, X., Deng, K., Wang, X., Li, Y., Zhang, Y., & Wang, M. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401063 · Cited by 4,430
Self-citationNeural Graph Collaborative Filtering
Wang, X., He, X., Wang, M., Feng, F., & Chua, T.-S. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331267 · Cited by 3,823
Self-citationGraph Convolutional Neural Networks for Web-Scale Recommender Systems
Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W. L., & Leskovec, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219890 · Cited by 3,733
International Conference on Machine Learning (ICML)-2005
津田, 宏. (2006) · 人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence · Cited by 2,558
Self-supervised Graph Learning for Recommendation
Wu, J., Wang, X., Feng, F., He, X., Chen, L., Lian, J., & Xie, X. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3462862 · Cited by 1,488
Self-citationHe, R., & McAuley, J. (2016) · Proceedings of the 25th International Conference on World Wide Web · doi:10.1145/2872427.2883037 · Cited by 1,459
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., & Tang, J. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159706 · Cited by 717
Chen, L., Wu, L., Hong, R., Zhang, K., & Wang, M. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i01.5330 · Cited by 634
Disentangled Graph Collaborative Filtering
Wang, X., Jin, H., Zhang, A., He, X., Xu, T., & Chua, T.-S. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401137 · Cited by 624
Self-citationHsieh, C.-K., Yang, L., Cui, Y., Lin, T.-Y., Belongie, S., & Estrin, D. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052639 · Cited by 526
Dual Channel Hypergraph Collaborative Filtering
Ji, S., Feng, Y., Ji, R., Zhao, X., Tang, W., & Gao, Y. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403253 · Cited by 224
Efficient Neural Matrix Factorization without Sampling for Recommendation
Chen, C., Zhang, M., Zhang, Y., Liu, Y., & Ma, S. (2020) · ACM Transactions on Information Systems · doi:10.1145/3373807 · Cited by 204
Spectral collaborative filtering
Zheng, L., Lu, C.-T., Jiang, F., Zhang, J., & Yu, P. S. (2018) · Proceedings of the 12th ACM Conference on Recommender Systems · doi:10.1145/3240323.3240343 · Cited by 186
Neighbor Interaction Aware Graph Convolution Networks for Recommendation
Sun, J., Zhang, Y., Guo, W., Guo, H., Tang, R., He, X., Ma, C., & Coates, M. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401123 · Cited by 171
Self-citationAn Analysis of the Softmax Cross Entropy Loss for Learning-to-Rank with Binary Relevance
Bruch, S., Wang, X., Bendersky, M., & Najork, M. (2019) · ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR) · doi:10.1145/3341981.3344221 · Cited by 142
Wang, M., Lin, Y., Lin, G., Yang, K., & Wu, X.-M. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403284 · Cited by 113
Sun, J., Guo, W., Zhang, D., Zhang, Y., Regol, F., Hu, Y., Guo, H., Tang, R., Yuan, H., He, X., et al. (2020) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3394486.3403254 · Cited by 89
Self-citationSampler Design for Implicit Feedback Data by Noisy-label Robust Learning
Yu, W., & Qin, Z. (2020) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3397271.3401155 · Cited by 55
Cited by
A Survey of Graph Neural Networks for Social Recommender Systems
Sharma, K., Lee, Y.-C., Nambi, S., Salian, A., Shah, S., Kim, S.-W., & Kumar, S. (2024) · ACM Computing Surveys · doi:10.1145/3661821 · Cited by 268
Metadata
- Authors
- Mao, K., Zhu, J., Xiao, X., Lu, B., Wang, Z., & He, X.
- Venue
- Proceedings of the 30th ACM International Conference on Information & Knowledge Management
- Publisher
- ACM
- Published
- 2021-10-26
- Pages
- 1253-1262
- ISSN
- 2155-0751 (ISSN-L)
- OpenAlex
- W3211143493
- Cited by
- 370
- References
- 24
- FWCI
- 45.27
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.