mlsanityData to 14 Oct 2026

LightGNN: Simple Graph Neural Network for Recommendation

arXiv 2501.03228 ↗First posted 6 Jan 2025cs.IR cs.AI cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Graph neural networks (GNNs) have demonstrated superior performance in collaborative recommendation through their ability to conduct high-order representation smoothing, effectively capturing structural information within users' interaction patterns. However, existing GNN paradigms face significant challenges in scalability and robustness when handling large-scale, noisy, and real-world datasets. To address these challenges, we present LightGNN, a lightweight and distillation-based GNN pruning framework designed to substantially reduce model complexity while preserving essential collaboration modeling capabilities. Our LightGNN framework introduces a computationally efficient pruning module that adaptively identifies and removes redundant edges and embedding entries for model compression. The framework is guided by a resource-friendly hierarchical knowledge distillation objective, whose intermediate layer augments the observed graph to maintain performance, particularly in high-rate compression scenarios. Extensive experiments on public datasets demonstrate LightGNN's effectiveness, significantly improving both computational efficiency and recommendation accuracy. Notably, LightGNN achieves an 80% reduction in edge count and 90% reduction in embedding entries while maintaining performance comparable to more complex state-of-the-art baselines. The implementation of our LightGNN framework is available at the github repository: https://github.com/HKUDS/LightGNN.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 28 of its 39 references that are in the map. First posted on arXiv 6 Jan 2025.

Builds on

28 of 39 references.

References · 28

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  4. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  5. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
  6. 2017Neural Collaborative Filteringcited by 1,111
  7. 2019Neural Graph Collaborative Filteringcited by 661
  8. 2020Heterogeneous Graph Transformercited by 582
  9. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
  10. 2020Self-supervised Graph Learning for Recommendationcited by 305
  11. 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
  12. 2021Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillationcited by 152
16 more
  1. 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 120
  2. 2020Disentangled Graph Collaborative Filteringcited by 118
  3. 2021A Unified Lottery Ticket Hypothesis for Graph Neural Networkscited by 118
  4. 2023Diffusion Recommender Modelcited by 88
  5. 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learningcited by 86
  6. 2020Denoising Implicit Feedback for Recommendationcited by 80
  7. 2022Hypergraph Contrastive Collaborative Filteringcited by 63
  8. 2018Ranking Distillation: Learning Compact Ranking Models With High Performance for Recommender Systemcited by 60
  9. 2022Towards Representation Alignment and Uniformity in Collaborative Filteringcited by 57
  10. 2019STAR-GCN: Stacked and Reconstructed Graph Convolutional Networks for Recommender Systemscited by 54
  11. 2023Automated Self-Supervised Learning for Recommendationcited by 37
  12. 2023Adaptive Graph Contrastive Learning for Recommendationcited by 31
  13. 2022Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filteringcited by 29
  14. 2022On-Device Next-Item Recommendation with Self-Supervised Knowledge Distillationcited by 21
  15. 2022Unbiased Knowledge Distillation for Recommendationcited by 11
  16. 2023Graph-less Collaborative Filteringcited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2021Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods
  2. 2026Bridging the Topological Divide: Dual-Branch Graph Distillation with Semantic Priors for Robust Cold-Start Recommendation
  3. 2024An Automatic Graph Construction Framework based on Large Language Models for Recommendation
  4. 2025Scaling Down, Serving Fast: Compressing and Deploying Efficient LLMs for Recommendation Systems
  5. 2025Training Large Recommendation Models via Graph-Language Token Alignment
  6. 2026GraphLoRA: Structure-Aware Low-Rank Adaptation for Large Language Model Recommendation
  7. 2024Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning
  8. 2024DaRec: A Disentangled Alignment Framework for Large Language Model and Recommender System