arXiv:2507.01285cs.LGcs.DC2025-07被引 1

基于用户相似度加权聚合,提升联邦推荐系统精度与个性化

Far From Sight, Far From Mind: Inverse Distance Weighting for Graph Federated Recommendation

  • 根据用户嵌入相似度动态分配聚合权重,增强个性化
  • 在多个数据集上显著提升推荐准确率,优于传统方法
  • 适合关注隐私保护推荐系统的研究人员与开发者

图联邦推荐系统为传统集中式推荐架构提供了一种保护隐私的替代方案,避免了数据安全担忧。虽然联邦学习可在不暴露原始用户数据的情况下实现个性化推荐,但现有聚合方法忽略了该场景下用户嵌入的独特性质。传统方法未能考虑嵌入的复杂性及用户相似度对推荐效果的关键作用。此外,不断变化的用户交互需要自适应聚合机制,同时保持高相关性锚点用户(图框架中扩展前的主要用户)的影响。为此,我们提出 Dist-FedAvg,一种基于距离的新型聚合方法,旨在提升图联邦学习中的个性化与聚合效率。该方法为嵌入相似度高的用户分配更高权重,同时确保锚点用户在本地更新中仍保有显著影响。在多个数据集上的实证评估表明,Dist-FedAvg 持续优于基线聚合技术,在提升推荐准确率的同时,无缝集成至现有联邦学习框架。

原文摘要 · Abstract (English)

Graph federated recommendation systems offer a privacy-preserving alternative to traditional centralized recommendation architectures, which often raise concerns about data security. While federated learning enables personalized recommendations without exposing raw user data, existing aggregation methods overlook the unique properties of user embeddings in this setting. Indeed, traditional aggregation methods fail to account for their complexity and the critical role of user similarity in recommendation effectiveness. Moreover, evolving user interactions require adaptive aggregation while preserving the influence of high-relevance anchor users (the primary users before expansion in graph-based frameworks). To address these limitations, we introduce Dist-FedAvg, a novel distance-based aggregation method designed to enhance personalization and aggregation efficiency in graph federated learning. Our method assigns higher aggregation weights to users with similar embeddings, while ensuring that anchor users retain significant influence in local updates. Empirical evaluations on multiple datasets demonstrate that Dist-FedAvg consistently outperforms baseline aggregation techniques, improving recommendation accuracy while maintaining seamless integration into existing federated learning frameworks.

联邦学习推荐系统图神经网络

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。