Graph Contrastive Learning for Optimizing Sparse Data in Recommender Systems with LightGCL
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) are powerful tools for recommendation systems, but they often struggle under data sparsity and noise. To address these issues, we implemented LightGCL, a graph contrastive learning model that uses Singular Value Decomposition (SVD) for robust graph augmentation, preserving semantic integrity without relying on stochastic or heuristic perturbations. LightGCL enables structural refinement and captures global collaborative signals, achieving significant gains over state-of-the-art models across benchmark datasets. Our experiments also demonstrate improved fairness and resilience to popularity bias, making it well-suited for real-world recommender systems.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 12 references that are in the map. First posted on arXiv 28 May 2025.
Builds on
9 of 12 references.
References · 9
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2020Contrastive Multi-View Representation Learning on Graphscited by 652
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
- 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 120
- 2023LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendationcited by 72
- 2021Task-adaptive Neural Process for User Cold-Start Recommendationcited by 32
- 2022Enhancing Sequential Recommendation with Graph Contrastive Learningcited by 18
Built on by
Not cited yet.