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:2606.15277v2 Announce Type: replace-cross Abstract: Graph-based recommendation models effectively capture high-order collaborative signals from user--item interaction graphs. Federated learning...
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.
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:2601. 02366v3 Announce Type: replace-cross Abstract: Graph-based recommendation has achieved great success in recent years.
arXiv:2512. 12477v3 Announce Type: replace Abstract: Estimating node importance in heterogeneous knowledge graphs is a fundamental problem underlying recommendation, search, and knowledge decision systems.
The paper introduces PMFRec, a federated cold-start recommendation framework that addresses personalization, compositionality, and communication inefficiencies. PMFRec generates user-specific item representations from attribute features, employs a global multi-view encoder with adaptive gating and orthogonality to capture complementary semantics, and fuses collaborative and attribute knowledge into a single exchanged representation. Experiments on real-world datasets demonstrate that PMFRec outperforms strong baselines in cold-item recommendation while improving user-level fairness, warm-scenario adaptability, and robustness under Local Differential Privacy.
The paper introduces FedRoRA, a federated learning framework that combines Low‑Rank Adaptation (LoRA) with rank‑heterogeneous personalization. It separates model adaptation into shared global directions and client‑specific rank‑wise magnitudes, using SVD on the server to extract a global subspace and a personalized projection with top‑k selection for each client. Experiments on natural language understanding and generation tasks show that FedRoRA outperforms existing state‑of‑the‑art methods.
arXiv:2512. 12477v2 Announce Type: replace Abstract: Estimating node importance in heterogeneous knowledge graphs is a fundamental problem underlying recommendation, search, and knowledge decision systems.
arXiv:2608. 10929v1 Announce Type: new Abstract: Cross-domain recommendation (CDR) transfers preference knowledge across related domains, but federated deployment makes cross-domain alignment difficult because the behavioral anchors that align item spaces, such as overlapping users and shared interaction signals, are often sparse, unavailable, or privacy-sensitive across clients.
arXiv:2607. 20477v1 Announce Type: new Abstract: {\em Text-Attributed Graphs} (TAGs) have emerged as an expressive data model for integrating graph topology with rich textual semantics.
arXiv:2607. 00003v1 Announce Type: cross Abstract: Personal Knowledge Graphs (PKGs) offer a privacy-preserving framework for modeling user preferences, yet constructing them from unstructured, decentralized conversational data remains a challenge.
arXiv:2606. 16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations.