Federated recommendation facilitates collaborative model training across distributed clients while keeping sensitive user interaction data local. Conventional approaches typically rely on synchronizing high-dimensional item representations between the server and clients. This paradigm implicitly assumes that precise geometric alignment of embedding coordinates is necessary for collaboration across clients. We posit that establishing relative semantic relationships among items is more effective than enforcing shared representations. Specifically, global semantic relations serve as structural constraints for items. Within these constraints, the framework allows item representations to vary locally on each client, which flexibility enables the model to capture fine-grained user personalization while maintaining global consistency. To this end, we propose Cluster-Guided FedRec framework (CGFedRec), a framework that transforms uploaded embeddings into compact cluster labels. In this framework, the server functions as a global structure discoverer to learn item clusters and distributes only the resulting labels. This mechanism explicitly cuts off the downstream transmission of item embeddings, relieving clients from maintaining global shared item embeddings. Consequently, CGFedRec achieves the effective injection of global collaborative signals into local item representations without transmitting full embeddings. Extensive experiments demonstrate that our approach significantly improves communication efficiency while maintaining superior recommendation accuracy across multiple datasets.
Figures & tables
Figure 1: Comparison of representative federated recommendation paradigms for communication. O(⋅) denotes the communication complexity.
Figure 2: The framework of CGFedRec. Each client first trains a local recommendation model to learn item representations. The server aggregates the uploaded representations and discovers global item structures via clustering, producing cluster labels for all items. Instead of broadcasting global embeddings, the server only sends these lightweight cluster labels back to clients. Clients then use the labels as structural supervision to align item representations through contrastive learning, enabling global knowledge injection with significantly reduced communication cost.
Input:
Initialize global item embeddings E0 , participation rate γ , all participants P , each holds a set of training data D , cluster label of items C , number of clusters k
Output:
Each client’s item embeddings E , model parameters Θ
Algorithm 1 CGFedRec framework.
Datasets
#Users
#Items
#Interactions
Sparsity (%)
MovieLens-100K
943
1,682
100,000
93.70
MovieLens-1M
6,040
3,706
1,000,209
95.53
KU
204
560
3,489
96.95
Beauty
253
356
2,535
97.19
FilmTrust
1,227
2,059
34,888
98.62
Table 1: Dataset Statistics. We selected 5 datasets with varying degrees of sparsity to validate our model’s performance and show their statistical characteristics.
Method
ML-100K
ML-1M
Filmtrust
KU
Beauty
HR@5
NDCG@5
HR@5
NDCG@5
HR@5
NDCG@5
HR@5
NDCG@5
HR@5
NDCG@5
PFedRec
0.5239
0.3684
0.5475
0.3829
0.9006
0.8170
0.3676
0.2826
0.0632
0.0355
GPFedRec
0.4867
0.3342
0.4308
0.2668
0.8900
0.8105
0.2696
0.2079
0.0514
0.0287
CoFedRec
0.4613
0.3539
0.4877
0.3721
0.9234
0.8417
0.2206
0.1522
0.1265
0.0803
FedRAP
0.4602
0.3748
0.3162
0.2747
0.5100
0.4189
0.4783
0.4565
0.6173
0.5828
FedCA
0.7975
0.7300
0.7571
0.6714
0.8862
0.8048
0.7391
0.6483
0.9259
0.8355
Table 2: Performance comparison of different FedRec methods on five benchmark datasets in terms of HR@5 and NDCG@5. The best result for each dataset-metric pair is highlighted in " bold ", while the second-best result is marked with " underline ". The "Improvement" row reports the relative percentage gain of the best-performing method over the second-best method.
Ablation
ML-100K
ML-1M
Filmtrust
KU
Beauty
HR@5
NDCG@5
HR@5
NDCG@5
HR@5
NDCG@5
HR@5
NDCG@5
HR@5
NDCG@5
CGFedRec
0.9777
0.8927
0.9533
0.8851
0.9348
0.8512
0.7402
0.5089
0.9565
0.8458
CGFedRec-E
0.5239
0.3684
0.5475
0.3829
0.9006
0.8170
0.3676
0.2826
0.0632
0.0355
CGFedRec-EC
0.4836
0.3388
0.5280
0.3641
0.8981
0.8199
0.1961
0.1219
0.0672
0.0365
CGFedRec-ERC
0.4857
0.3405
0.5359
0.3737
0.8989
0.8215
0.2010
0.1258
0.0672
0.0365
Table 3: Ablation results of CGFedRec under different global knowledge sharing strategies. CGFedRec shares global semantic structures by broadcasting only item cluster labels from the server. CGFedRec-EC broadcasts aggregated global item embeddings and cluster labels. CGFedRec-E broadcasts only aggregated global item embeddings without structural signals. CGFedRec-ERC broadcasts aggregated global item embeddings with random cluster labels.
Figure 3: Heatmaps of item embeddings for 4 randomly selected clients in CGFedRec on the ML-100K dataset. Each heatmap visualizes 32 randomly selected items, with color intensity representing embedding values.
Figure 4: Heatmaps of item-item similarity for 4 selected clients in CGFedRec on the ML-100K dataset. Each heatmap shows cosine similarity computed from item embeddings (Figure 3 ) for 32 randomly selected items, with color intensity representing similarity values.
Figure 5: Effect of the temperature parameter on the performance of CGFedRec on the ML-100K dataset.
Figure 6: Effect of the coefficient of regularization on the performance of CGFedRec on the ML-100K dataset.
Figure 7: Effect of the number of clusters on the performance of CGFedRec on the ML-100K dataset.
Intensity δ
0
0.1
0.2
0.3
0.4
0.5
HR@5
0.9777
0.9936
0.9756
0.9724
0.9894
0.9788
NDCG@5
0.8927
0.9294
0.8954
0.8731
0.9086
0.8894
Table 4: Results of applying local differential privacy into CGFedRec with various noise intensity on the ML-100K.
Figure 8: Statistical characteristics and interaction distributions of the five benchmark datasets. The columns from left to right represent: (a) User Activity Distribution, showing the long-tail nature of user interactions; (b) Lorenz Curve of Item Popularity, illustrating the concentration of interactions among items (the dashed line represents perfect equality); (c) Hexbin Density Plots of User-Item Degrees, visualizing the correlation between user activity and item popularity on a logarithmic scale.
Figure 9: T-SNE visualization comparing item clustering representations of PFedRec and CGFedRec.
Federated recommender systems enable collaborative model training while keeping user interaction data local and sharing only essential model parameters, thereby mitigating privacy risks. However, existing methods overlook a critical issue, i.e., the stable learning of a generalized item embedding throughout the federated recommender system training process. Item embedding plays a central role in facilitating knowledge sharing across clients. Yet, under the cross-device setting, local data distributions exhibit significant heterogeneity and sparsity, exacerbating the difficulty of learning generalized embeddings. These factors make the stable learning of generalized item embeddings both indispensable for effective federated recommendation and inherently difficult to achieve. To fill this gap, we propose a new federated recommendation framework, named Federated Recommendation with Generalized Embedding Learning (FedRecGEL). We reformulate the federated recommendation problem from an item-centered perspective and cast it as a multi-task learning problem, aiming to learn generalized embeddings throughout the training procedure. Based on theoretical analysis, we employ sharpness-aware minimization to address the generalization problem, thereby stabilizing the training process and enhancing recommendation performance. Extensive experiments on four datasets demonstrate the effectiveness of FedRecGEL in significantly improving federated recommendation performance. Our code is available at https://github.com/anonymifish/FedRecGEL.
Fengyuan Yu, Xiaohua Feng, Yuyuan Li +3
Zhejiang University, Hangzhou, China · Hangzhou Dianzi University, Hangzhou, China · OPPO Research Institute, Shenzhen, China
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
Federated recommendation (FedRec) enables personalized modeling without centralizing users' interaction histories, but most existing methods assume a fixed item pool and thus overlook the practical cold-item setting where new items continuously arrive. Under the dual-sided constraint, where the server cannot access clients' interactions while clients cannot access the server's proprietary item attribute features, prior federated cold-start recommendation approaches suffer from three structural limitations: a lack of personalization, compositionality failure caused by forcing heterogeneous semantics into a single embedding space, and training- and communication-inefficiency arising from explicit alignment between separate collaborative and attribute representations. To address these challenges, we propose Personalized and Multi-view Representation for Federated Cold-Start Recommendation (PMFRec). PMFRec learns a personalized representation generator to produce user-specific item representations from attribute features, and introduces a global multi-view encoder with item-adaptive gating and an orthogonality objective to capture complementary semantic views while reducing cross-view redundancy. In addition, PMFRec fuses collaborative and attribute knowledge into a single exchanged item representation, eliminating the need for an explicit client-side regularizer and reducing communication overhead. Extensive experiments on real-world datasets show that PMFRec consistently outperforms strong baselines in cold-item recommendation and further improves user-level fairness, warm-scenario adaptability, and robustness under Local Differential Privacy (LDP).
Jaehyung Lim, Wonbin Kweon, Woojoo Kim +3
Pohang University of Science and Technology Pohang, Republic of Korea · University of Illinois Urbana-Champaign Champaign, IL, USA