Personalized recommendation increasingly relies on private user data, motivating approaches that can adapt to individuals without centralizing their information. We present Federated Targeted Recommendations with Evolving Knowledge graphs and Language Models (FedTREK-LM), a framework that unifies lightweight large language models (LLMs), evolving personal knowledge graphs (PKGs), federated learning (FL), and Kahneman-Tversky Optimization to enable scalable, decentralized personalization. By prompting LLMs with structured PKGs, FedTREK-LM performs context-aware reasoning for personalized recommendation tasks such as movie and recipe suggestions. Across three lightweight Qwen3 models (0.6B, 1.7B, 4B), FedTREK-LM consistently and substantially outperforms state-of-the-art KG completion and federated recommendation baselines (HAKE, KBGAT, and FedKGRec), achieving more than a 4x improvement in F1-score on the movie and food benchmarks. Our results further show that real user data is critical for effective personalization, as synthetic data degrades performance by up to 46%. Overall, FedTREK-LM offers a practical paradigm for adaptive, LLM-powered personalization that generalizes across decentralized, evolving user PKGs.
Figures & tables
Figure 1: Overall performance results of our TREK-LM models against the baselines (KBGAT, HAKE, and FedKGRec).
Figure 2: Overview of the FedTREK-LM architecture.
Figure 3: Detailed view of the FedTREK-LM local operations: (a) shows the feedback-driven fine-tuning using KTO, and (b) illustrates how the LLM reasons over the PKG to derive recommendations.
Figure 4: Illustration of KTO data construction in the form of prompt–completion–label triplets from user-LLM interactions.
Model
Trainable Parameters
Per-Round Client Cost
128-Round Total Server Cost
Qwen3-0.6B
10.093 M
38.50 MB
38.5 GB
Qwen3-1.7B
17.433 M
66.50 MB
66.5 GB
Qwen3-4B
33.030 M
126.00 MB
126.0 GB
Table 1: Communication costs for FedTREK-LM models between the individual client overhead per active round and the total aggregated server load.
Model
Setting
Precision
Recall
F1-score
MRR
Hits@1
Hits@3
Hits@10
TREK-LM
Centralized
0.149
0.301
0.199
0.247
0.192
0.299
0.321
Centralized +Syn
0.122
0.240
0.162
0.209
0.177
0.238
0.255
Federated
0.238
0.251
0.244
0.284
0.280
0.290
0.290
Federated +Syn
0.090
0.247
0.132
0.218
0.183
0.254
0.270
Local-only
0.015
0.068
0.025
0.069
0.056
0.081
0.081
Local-only +Syn
0.015
0.068
0.025
0.069
0.056
0.081
0.081
Table 2: Comparative performance on the Movie PKG recommendation task. We compare our TREK-LM variants (using the Qwen3-4B model) across centralized, federated, and local-only settings, with and without synthetic data ( +Syn ). Baselines include traditional KG completion models (KBGAT and HAKE) and a federated recommendation model (FedKGRec). The best result in each column is bolded.
Figure 5: TREK-LM Performance by Setting (Qwen3-4B)
Figure 8
Figure 8: Impact of Synthetic Data Across All Models
Model
Setting
F1-score
MRR
Hits@10
TREK-LM
Centralized
0.000
0.000
0.000
Federated
0.002
0.002
0.000
Local
0.000
0.000
0.000
KBGAT
Cen./Fed.
< 0.004
< 0.017
< 0.019
HAKE
Cen./Fed.
< 0.002
< 0.003
< 0.007
FedKGRec
Federated
0.000
0.000
0.000
Table 3: Performance on the Recipe PKG recommendation task. All TREK-LM variants and baselines achieved near-zero performance across all metrics.
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. However, aggregating graph representations across distributed, non-IID clients remains a challenge; structural embeddings learned locally often misalign, and naive averaging fails to capture meaningful cross-client relationships. Most existing federated graph methods rely exclusively on structural aggregation, neglecting the rich, global semantic context available in large language models (LLMs). In this paper, we propose a novel framework that uses LLM-encoded knowledge to guide federated graph recommendation. Specifically, clients learn structural representations from local graphs while simultaneously summarizing their typical interaction patterns into compact semantic vectors via a frozen LLM. The central server then uses these LLM-encoded semantic signals to discover related preference patterns across clients, guiding the selective aggregation of their structural representations. This enables semantically informed cross-client collaboration without exposing raw data. Extensive experiments on standard benchmarks show that guiding structural alignment with LLM-encoded knowledge consistently improves recommendation accuracy over existing federated graph baselines.
Thi Minh Chau Nguyen, Hien Trang Nguyen, Duc Anh Nguyen +3
Adapting large language models (LLMs) for personalized recommendation requires aligning their general-purpose capabilities with user-specific preferences while effectively leveraging both behavioral and semantic signals. Existing approaches typically integrate these signals at either the input level (e.g., injecting behavioral embeddings into the token space) or the output level (e.g., contrastive alignment of separate encoders), suffering from distribution gaps or lack of end-to-end task supervision. In this work, we introduce L2Rec, which unifies behavioral and semantic understanding at the parameter level of LLMs. Our key insight is that the same set of Transformer parameters can serve as a shared medium for both views: by applying view-specific, personalized low-rank perturbations via a Dual-view Personalized Mixture-of-Experts (DPMoE) mechanism, L2Rec enables a single LLM backbone to produce complementary behavioral and semantic adaptations for each user with minimal representation-level misalignment. An adaptive cross-view fusion module further integrates the dual-view outputs into a unified user preference. Experiments on four datasets show that L2Rec consistently outperforms state-of-the-art baselines, and online A/B testing on a large-scale industrial platform validates significant improvements in key engagement metrics.
Large language models (LLMs) struggle to accumulate evidence across multiple rounds of user interactions, failing to update their beliefs in a manner consistent with Bayesian inference. Existing solutions require fine-tuning on sensitive user interaction data, limiting their applicability in privacy-conscious settings. We propose AdaptFuse, a training-free framework that externalizes probabilistic computation entirely from the LLM, where a symbolic module maintains a Bayesian posterior over a discrete hypothesis set, while a frozen LLM contributes semantic reasoning via multi-sample Dirichlet aggregation. The two signals are combined through entropy-adaptive fusion, which automatically weights each source by its predictive confidence, shifting reliance from the LLM to the symbolic posterior as evidence accumulates. We evaluate across three domains: flight recommendation, hotel recommendation, and web shopping; on Gemma2 9B, Llama3 8B, and Qwen~2.5 7B. AdaptFuse consistently outperforms both prompting baselines and fine-tuned Bayesian Teaching models on all tasks, with accuracy improving monotonically over interaction rounds. These results demonstrate that principled inference-time algorithms can substitute for fine-tuning in personalized recommendation, without storing or training on sensitive user data.
Fangzhou Lin, Zilin Dai, Shuo Xing +8
Texas A&M University · Worcester Polytechnic Institute · Tohoku University +1