mlsanityData to 14 Oct 2026

VoteGCL: Enhancing Graph-based Recommendations with Majority-Voting LLM-Rerank Augmentation

arXiv 2507.21563 ↗First posted 29 Jul 2025cs.IR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Recommendation systems often suffer from data sparsity caused by limited user-item interactions, which degrade their performance and amplify popularity bias in real-world scenarios. This paper proposes a novel data augmentation framework that leverages Large Language Models (LLMs) and item textual descriptions to enrich interaction data. By few-shot prompting LLMs multiple times to rerank items and aggregating the results via majority voting, we generate high-confidence synthetic user-item interactions, supported by theoretical guarantees based on the concentration of measure. To effectively leverage the augmented data in the context of a graph recommendation system, we integrate it into a graph contrastive learning framework to mitigate distributional shift and alleviate popularity bias. Extensive experiments show that our method improves accuracy and reduces popularity bias, outperforming strong baselines.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 41 references that are in the map. First posted on arXiv 29 Jul 2025.

Builds on

26 of 41 references.

References · 26

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2024Qwen2.5 Technical Reportcited by 4,942
  4. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
  5. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  6. 2019Neural Graph Collaborative Filteringcited by 661
  7. 2023A Survey on Large Language Models for Recommendationcited by 379
  8. 2023Large Language Models are Zero-Shot Rankers for Recommender Systemscited by 309
  9. 2020Self-supervised Graph Learning for Recommendationcited by 305
  10. 2021Contrastive Learning Inverts the Data Generating Processcited by 221
  11. 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
  12. 2023LLMRec: Large Language Models with Graph Augmentation for Recommendationcited by 172
14 more
  1. 2023Representation Learning with Large Language Models for Recommendationcited by 155
  2. 2022Data Augmentation for Deep Graph Learning: A Surveycited by 133
  3. 2019Managing Popularity Bias in Recommender Systems with Personalized Re-rankingcited by 82
  4. 2023Towards Open-World Recommendation with Knowledge Augmentation from Large Language Modelscited by 74
  5. 2022XSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendationcited by 57
  6. 2023ONCE: Boosting Content-based Recommendation with Both Open- and Closed-source Large Language Modelscited by 54
  7. 2024CoRAL: Collaborative Retrieval-Augmented Large Language Models Improve Long-tail Recommendationcited by 44
  8. 2023Graph Transformer for Recommendationcited by 28
  9. 2024Integrating Large Language Models into Recommendation via Mutual Augmentation and Adaptive Aggregationcited by 26
  10. 2021Contrastive Cross-domain Recommendation in Matchingcited by 25
  11. 2023Graph Collaborative Signals Denoising and Augmentation for Recommendationcited by 16
  12. 2021SelfCF: A Simple Framework for Self-supervised Collaborative Filteringcited by 15
  13. 2024Graph Augmentation for Recommendationcited by 4
  14. 2024Large Language Model Enhanced Hard Sample Identification for Denoising Recommendationcited by 3

Built on by

Not cited yet.