The article surveys graph foundation models (GFMs) for recommender systems, highlighting how they combine graph neural networks (GNNs) and large language models (LLMs) to better capture user-item relationships and textual data. It offers a taxonomy of current GFM approaches, discusses methodological details, and identifies key challenges and future research directions. The survey aims to provide comprehensive insights into the evolving landscape of GFM-based recommender systems.
arXiv:2607. 25471v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) and Large Language Models (LLMs) have each advanced recommendation systems by modeling structural and semantic signals, respectively.
arXiv:2606. 07526v1 Announce Type: cross Abstract: Large Language Models (LLMs) have shown strong potential for recommendation (LLMRec) due to their powerful reasoning and generalization abilities.
arXiv:2601. 02366v3 Announce Type: replace-cross Abstract: Graph-based recommendation has achieved great success in recent years.
arXiv:2606. 15277v1 Announce Type: cross Abstract: Graph-based recommender systems are highly effective at extracting collaborative signals from user--item interactions, and federated learning (FL) allows these models to be trained while preserving user privacy.
arXiv:2506. 10520v5 Announce Type: replace-cross Abstract: Graph-based multi-task learning at billion-scale presents a significant challenge, as different tasks correspond to distinct billion-scale graphs.
arXiv:2506. 07449v2 Announce Type: replace-cross Abstract: Recent advances in Large Language Models (LLMs) have driven their adoption in recommender systems through Retrieval-Augmented Generation (RAG) frameworks.
arXiv:2606.15277v2 Announce Type: replace-cross Abstract: Graph-based recommendation models effectively capture high-order collaborative signals from user--item interaction graphs. Federated learning...
The paper introduces SLM-Conditioned Hierarchical Relation Routing, a graph neural network architecture that incorporates a small language model to guide message selection in labeled property graphs. It combines structural states, node and relationship property encodings, and relationship types into messages, then uses a parameter‑efficient language model to generate target‑conditioned routing queries that filter relevant messages and route information across relation‑level summaries. The resulting representation updates a topology anchor with bounded residuals, preserving structural evidence while allowing contextual semantic information to influence predictions, and offers interpretable analysis at both neighbor and relationship‑type levels.
arXiv:2607. 16198v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have emerged as the leading paradigm for link prediction, enabling the inference of missing connections and the anticipation of potential future links.
The paper reinterprets graph neural networks (GNNs) as retrieval-augmented models, where each layer uses an MLP on a node representation and a permutation‑invariant summary of retrieved graph context instead of traditional message passing. It introduces RTA, a lightweight MLP‑based framework that replaces structural message passing with label‑aware retrieval and propagation, and provides theoretical links to softmax‑attention message passing and robustness to mis‑retrieved outliers. Experiments on text‑attributed graph benchmarks demonstrate that RTA matches or surpasses strong GNN and graph LLM baselines while improving efficiency and robustness.
arXiv:2606. 20554v1 Announce Type: cross Abstract: Generative recommendation is an emerging paradigm that has shown promise in industrial recommendation systems, aiming to predict users' next interactions from their historical behaviors.
arXiv:2607. 19253v1 Announce Type: new Abstract: User modeling is a critical task in a variety of personalized systems.