UCGRec: User-Centric Graph Learning for LLM-based Sequential Recommendation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for sequential recommendation rely primarily on item descriptions or utilize user preferences independently. |
| Approach: | They propose a method that integrates diverse user-relevant preference signals into a unified user-centric graph and injects the graph-based knowledge into the LLM through end-to-end training with graph neural networks. |
| Outcome: | The proposed method outperforms conventional and state-of-the-art methods on four widely used sequential real-world recommendation datasets. |
Similar Papers
AGRec: Adapting Autoregressive Decoders with Graph Reasoning for LLM-based Sequential Recommendation (2025.findings-acl)
Copied to clipboard
| Challenge: | Autoregressive decoders in large language models excel at capturing sequential behaviors for generative recommendations, but they lack graph-structured user-item interactions, which are widely recognized as beneficial. |
| Approach: | They propose a novel algorithm that adapts LLMs’ decoders with graph reasoning for recommendation by augmenting the decoding logits with an auxiliary GNN model to optimize token generation. |
| Outcome: | The proposed model outperforms state-of-the-art models in sequential recommendations. |
LAGCL4Rec: When LLMs Activate Interactions Potential in Graph Contrastive Learning for Recommendation (2025.findings-emnlp)
Copied to clipboard
Leqi Zheng, Chaokun Wang, Canzhi Chen, Jiajun Zhang, Cheng Wu, Zixin Song, Shannan Yan, Ziyang Liu, Hongwei Li
| Challenge: | Traditional contrastive learning methods treat negative feedback as equally hard or easy, ignoring informative semantic difficulty during training. |
| Approach: | They propose a framework leveraging Large Language Models to Activate interactions in Graph Contrastive Learning for Recommendation. |
| Outcome: | The proposed framework outperforms state-of-the-art benchmarks on multiple benchmarks. |
What Makes LLMs Effective Sequential Recommenders? A Study on Preference Intensity and Temporal Context (2026.acl-long)
Copied to clipboard
| Challenge: | Existing preference-alignment approaches rely on binary pairwise comparisons, overlooking preference intensity and temporal context. |
| Approach: | They propose a unified preference optimization framework that maps both explicit and implicit feedback into a common preference signal and constructs adaptive reward margins that jointly account for preference intensity and interaction recency. |
| Outcome: | The proposed framework outperforms state-of-the-art recommendations while maintaining behavioral patterns aligned with human decision-making. |
The Whole is Better than the Sum: Using Aggregated Demonstrations in In-Context Learning for Sequential Recommendation (2024.findings-naacl)
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown excellent performance on various NLP tasks. |
| Approach: | They propose a method that integrates multiple demonstration users into one aggregated demonstration to improve sequential recommendation. |
| Outcome: | The proposed method outperforms state-of-the-art LLM-based sequential recommendation methods on three recommendation datasets. |
LOHRec: Leveraging Order and Hierarchy in Generative Sequential Recommendation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | generative recommenders focus on maximizing the prediction probability of the next item in the temporal sequence, ignoring diverse potential items. |
| Approach: | They propose a learning framework that leverages order and hierarchy in generative recommendation using quantized identifiers to further explore performance ceiling of lightweight generative recommenders. |
| Outcome: | The proposed learning framework outperforms strong prior baselines across multiple datasets. |
Large Language Models for Generative Recommendation: A Survey and Visionary Discussions (2024.lrec-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have revolutionized the field of natural language processing but are not fully able to leverage the generative power of LLM. |
| Approach: | They examine the progress, methods, and future directions of large language models . they examine what generative recommendation is, why RS should advance to generative recommendations . |
| Outcome: | The proposed approach can be simplified to generate recommendations from the entire pool of items. |
Exploring Graph Learning Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent studies focus on performance benchmarks without fully comparing LLMs to graph learning models. |
| Approach: | They evaluate off-the-shelf and instruction-tuned graph learning models across a variety of scenarios. |
| Outcome: | The proposed models outperform traditional graph learning models in few-shot settings, the authors show . their models out perform models with instruction tuning, and they show excellent generalization and robustness. |
HSUGA: LLM-Enhanced Recommendation with Hierarchical Semantic Understanding and Group-Aware Alignment (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for enhancing sequential recommendation use long interaction sequences, but they lack the ability to extract user preferences from long sequences. |
| Approach: | They propose a plugin that integrates LLMs to infer user preferences from interaction sequences. |
| Outcome: | The proposed algorithms improve user semantic embedding extraction and utilization on three benchmark datasets. |
Rethinking LLM-Based Recommendations: A Personalized Query-Driven Parallel Integration (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Query-to-Recommendation framework integrates large langucage models into recommendation systems . but it faces training-induced bias and bottlenecks from serialized architecture . |
| Approach: | They propose a parallel recommendation framework that decouples LLMs from candidate pre-selection and direct retrieval over the entire item pool. |
| Outcome: | The proposed framework decouples LLMs from candidate pre-selection and enables direct retrieval over the entire item pool. |
LPNL: Scalable Link Prediction with Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing studies on graph learning with large language models have focused on the link prediction task on large graphs. |
| Approach: | They propose a framework for scalable link prediction on large-scale heterogeneous graphs based on large language models. |
| Outcome: | The proposed framework outperforms baselines in link prediction tasks on large graphs. |