Graph Contrastive Learning for Optimizing Sparse Data in Recommender Systems with LightGCL

Aravinda Jatavallabha, Prabhanjan Bharadwaj, Ashish Chander
5/28/2025
cs.IRcs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{jatavallabha2025graph,
  title  = {Graph Contrastive Learning for Optimizing Sparse Data in Recommender Systems with LightGCL},
  author = {Aravinda Jatavallabha and Prabhanjan Bharadwaj and Ashish Chander},
  year   = {2025},
  eprint = {2506.00048},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.00048v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.00048.svg)](https://codeofpaper.com/paper/2506.00048)

Discussion