AGRec: Adapting Autoregressive Decoders with Graph Reasoning for LLM-based Sequential Recommendation

Autoregressive decoders in large language models (LLMs) excel at capturing users' sequential behaviors for generative recommendations.However, they inherently struggle to leverage graph-structured user-item interactions, which are widely recognized as beneficial.This paper presents AGRec, adapting LLMs' decoders with graph reasoning for recommendation.We reveal that LLMs and graph neural networks (GNNs) manifest complementary strengths in distinct user domains.Building on this, we augment the decoding logits of LLMs with an auxiliary GNN model to optimize token generation.Moreover, we introduce a rankable finite state machine to tackle two challenges: (1) adjusting autoregressive generation with discriminative decoders that directly predict user-item similarity, and (2) token homogeneity, where LLMs often generate items with similar prefix tokens, narrowing the scope of beam search.Our AGRec outperforms state-of-the-art models in sequential recommendations.Our source code and data are available online 1 .