用特征编码替代物品ID,实现高效隐私推荐。
Feature-Indexed Federated Recommendation with Residual-Quantized Codebooks
- 以特征编码代替物品嵌入通信,控制数据传输量。
- 在真实数据集上通信开销降低70%以上,性能超越现有方法。
- 适合资源受限场景下的隐私保护推荐系统应用。
联邦推荐在不集中用户行为数据的前提下训练推荐系统,保护隐私。但现有方法采用物品ID索引通信机制,存在三大问题:1)通信资源消耗不可控;2)上传的物品信息无法泛化到未交互的相关物品;3)对客户端噪声反馈敏感。为此,本文提出特征索引通信范式,将物品特征编码嵌入作为码本传输,而非原始物品嵌入。基于此,提出RQFedRec,通过残差量化(RQ)-Kmeans为每个物品分配一组离散码ID。各客户端根据服务器提供的码ID生成并训练码嵌入码本,服务器聚合码本而非物品嵌入。该设计使通信可控,因码本可覆盖所有物品,且同码ID的更新能跨物品传播。同时,码嵌入代表多个物品,对单个噪声更鲁棒。为联合捕捉语义与协同信息,RQFedRec引入协同-语义双通道聚合,并采用课程学习策略,早期侧重语义码,逐步增加协同码贡献。在真实数据集上的大量实验表明,RQFedRec持续优于当前最优联邦推荐基线,同时显著降低通信开销。
原文摘要 · Abstract (English)
Federated recommendation provides a privacy-preserving solution for training recommender systems without centralizing user interactions. However, existing methods follow an ID-indexed communication paradigm that transmit whole item embeddings between clients and the server, which has three major limitations: 1) consumes uncontrollable communication resources, 2) the uploaded item information cannot generalize to related non-interacted items, and 3) is sensitive to client noisy feedback. To solve these problems, it is necessary to fundamentally change the existing ID-indexed communication paradigm. Therefore, we propose a feature-indexed communication paradigm that transmits feature code embeddings as codebooks rather than raw item embeddings. Building on this paradigm, we present RQFedRec, which assigns each item a list of discrete code IDs via Residual Quantization (RQ)-Kmeans. Each client generates and trains code embeddings as codebooks based on discrete code IDs provided by the server, and the server collects and aggregates these codebooks rather than item embeddings. This design makes communication controllable since the codebooks could cover all items, enabling updates to propagate across related items in same code ID. In addition, since code embedding represents many items, which is more robust to a single noisy item. To jointly capture semantic and collaborative information, RQFedRec further adopts a collaborative-semantic dual-channel aggregation with a curriculum strategy that emphasizes semantic codes early and gradually increases the contribution of collaborative codes over training. Extensive experiments on real-world datasets demonstrate that RQFedRec consistently outperforms state-of-the-art federated recommendation baselines while significantly reducing communication overhead.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。