Papers › LLMRec: Large Language Models with Graph Augmentation for Recommendation

LLMRec: Large Language Models with Graph Augmentation for Recommendation

1 Nov 2023arXiv:2311.00423archive 2025-07-28

Wei Wei, Xubin Ren, Jiabin Tang, Qinyong Wang, Lixin Su, Suqi Cheng, Junfeng Wang, Dawei Yin, Chao Huang

The problem of data sparsity has long been a challenge in recommendation systems, and previous studies have attempted to address this issue by incorporating side information. However, this approach often introduces side effects such as noise, availability issues, and low data quality, which in turn hinder the accurate modeling of user preferences and adversely impact recommendation performance. In light of the recent advancements in large language models (LLMs), which possess extensive knowledge bases and strong reasoning capabilities, we propose a novel framework called LLMRec that enhances recommender systems by employing three simple yet effective LLM-based graph augmentation strategies. Our approach leverages the rich content available within online platforms (e.g., Netflix, MovieLens) to augment the interaction graph in three ways: (i) reinforcing user-item interaction egde, (ii) enhancing the understanding of item node attributes, and (iii) conducting user node profiling, intuitively from the natural language perspective. By employing these strategies, we address the challenges posed by sparse implicit feedback and low-quality side information in recommenders. Besides, to ensure the quality of the augmentation, we develop a denoised data robustification mechanism that includes techniques of noisy implicit feedback pruning and MAE-based feature enhancement that help refine the augmented data and improve its reliability. Furthermore, we provide theoretical analysis to support the effectiveness of LLMRec and clarify the benefits of our method in facilitating model optimization. Experimental results on benchmark datasets demonstrate the superiority of our LLM-based augmentation approach over state-of-the-art techniques. To ensure reproducibility, we have made our code and augmented data publicly available at: https://github.com/HKUDS/LLMRec.git

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2311.00423")

Code

Syntology Ran 15 of 16 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran · violated contract; 1 ran · our draft was wrong; 12 ran with no contract checked.

By repository: official repository: 16 samples from 1 repository, 15 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

hkuds/llmrec officialmentioned in papermentioned on GitHubpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

16 samples harvested; 15 ran; 1 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
1ran · violated contract
1ran · our draft was wrong
12ran
1unverified

Licence: 0 of the 16 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from hkuds/llmrec. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

LLM_request hkuds/llmrec/LLM_augmentation_construct_prompt/gpt_i_attribute_generate_aug.py official repository ran Apache-2.0 (permissive) · 5b38f312a03301ac · report
average_precision hkuds/llmrec/utility/metrics.py official repository ran Apache-2.0 (permissive) · ea02c0066939a02c · report
build_knn_neighbourhood hkuds/llmrec/LATTICE/codes/Models.py official repository ran · our draft was wrong fingerprinted Apache-2.0 (permissive) · 37c8ab61f69c3c23 · report
build_knn_normalized_graph hkuds/llmrec/utility/norm.py official repository ran Apache-2.0 (permissive) · 220cb127bddfb532 · report
build_sim hkuds/llmrec/LATTICE/codes/Models.py official repository ran · honoured contract fingerprinted Apache-2.0 (permissive) · e6fb9f69e2c06f0c · report
build_sim hkuds/llmrec/utility/norm.py official repository ran fingerprinted Apache-2.0 (permissive) · b18055ccb5503f13 · report
compute_normalized_laplacian hkuds/llmrec/LATTICE/codes/Models.py official repository ran · violated contract fingerprinted Apache-2.0 (permissive) · 698d3807a0c41ec9 · report
construct_prompting hkuds/llmrec/LLM_augmentation_construct_prompt/gpt_i_attribute_generate_aug.py official repository ran Apache-2.0 (permissive) · bdd46dd855ba018d · report
construct_prompting hkuds/llmrec/LLM_augmentation_construct_prompt/gpt_ui_aug.py official repository ran Apache-2.0 (permissive) · b5675cc2f92dfe30 · report
construct_prompting hkuds/llmrec/LLM_augmentation_construct_prompt/gpt_user_profiling.py official repository ran Apache-2.0 (permissive) · ab926c8b04596e98 · report
get_gpt_response_w_system hkuds/llmrec/LLM_augmentation_construct_prompt/gpt_user_profiling.py official repository ran Apache-2.0 (permissive) · 6671a1bd7a99e865 · report
guassian_kernel hkuds/llmrec/MMSSL/MMD.py official repository ran Apache-2.0 (permissive) · a88637e01d318677 · report
mmd_rbf hkuds/llmrec/MMSSL/MMD.py official repository ran Apache-2.0 (permissive) · e4b5dda77a9a6a63 · report
precision_at_k hkuds/llmrec/utility/metrics.py official repository ran Apache-2.0 (permissive) · de0d0e47ac6bbe6c · report
recall hkuds/llmrec/utility/metrics.py official repository ran Apache-2.0 (permissive) · 4437293713f250ee · report
get_sparse_laplacian hkuds/llmrec/utility/norm.py official repository unverified Apache-2.0 (permissive) · 9ca663afcc4bd067 · report

Tasks

Model OptimizationRecommendation Systems

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Pruning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections