FedCIA通过共享物品相似性矩阵实现隐私推荐,避免信息丢失和个性化特征丢失。
FedCIA: Federated Collaborative Information Aggregation for Privacy-Preserving Recommendation
- 用物品相似性矩阵替代参数求和,实现协作信息聚合
- 在真实数据集上优于现有联邦推荐方法,提升推荐效果
- 适用于无参数模型,适合保护用户个性化特征的场景
推荐算法依赖用户历史交互数据提供个性化服务,引发严重隐私担忧。联邦推荐通过本地训练与服务器端模型聚合结合来缓解此问题,但现有方法多采用统一加权求和方式聚合物品嵌入,存在三大缺陷:1)聚合过程导致信息损失;2)无法保留个性化局部特征;3)不支持无参数推荐算法。本文回顾推荐算法发展,提出其核心是共享用户与物品间的协同关系。据此,我们提出协同信息聚合新范式,聚焦于共享协同信息而非物品参数。基于此,提出联邦协同信息聚合(FedCIA)方法,要求客户端上传物品相似性矩阵进行聚合,使客户端无需约束嵌入至统一向量空间即可对齐本地模型。该方法有效减少直接求和带来的信息损失,保留各客户端个性化嵌入分布,并支持无参数模型聚合。理论分析与真实数据集实验表明,FedCIA显著优于当前最优联邦推荐算法。代码已开源:https://github.com/Mingzhe-Han/FedCIA。
原文摘要 · Abstract (English)
Recommendation algorithms rely on user historical interactions to deliver personalized suggestions, which raises significant privacy concerns. Federated recommendation algorithms tackle this issue by combining local model training with server-side model aggregation, where most existing algorithms use a uniform weighted summation to aggregate item embeddings from different client models. This approach has three major limitations: 1) information loss during aggregation, 2) failure to retain personalized local features, and 3) incompatibility with parameter-free recommendation algorithms. To address these limitations, we first review the development of recommendation algorithms and recognize that their core function is to share collaborative information, specifically the global relationship between users and items. With this understanding, we propose a novel aggregation paradigm named collaborative information aggregation, which focuses on sharing collaborative information rather than item parameters. Based on this new paradigm, we introduce the federated collaborative information aggregation (FedCIA) method for privacy-preserving recommendation. This method requires each client to upload item similarity matrices for aggregation, which allows clients to align their local models without constraining embeddings to a unified vector space. As a result, it mitigates information loss caused by direct summation, preserves the personalized embedding distributions of individual clients, and supports the aggregation of parameter-free models. Theoretical analysis and experimental results on real-world datasets demonstrate the superior performance of FedCIA compared with the state-of-the-art federated recommendation algorithms. Code is available at https://github.com/Mingzhe-Han/FedCIA.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。