论文标题
胡椒:赋予以用户为中心的推荐系统通过八卦学习
PEPPER: Empowering User-Centric Recommender Systems over Gossip Learning
论文作者
论文摘要
事实证明,推荐系统是提取与用户相关的内容帮助用户进行日常活动的宝贵工具(例如,找到相关的访问地点,要食用的内容,要购买的商品)。但是,为了有效,这些系统需要收集和分析大量个人数据(例如,位置检查,电影评分,点击率等),这使用户面临许多隐私威胁。在这种情况下,基于联合学习(FL)的推荐系统似乎是一个有前途的解决方案,可以在计算准确的建议的同时将个人数据保存在用户设备上,以实施隐私。但是,FL,因此基于FL的推荐系统依靠中央服务器,该中央服务器除了容易受到攻击外还可以遇到可扩展性问题。为了解决这个问题,我们提出了基于八卦学习原理的分散推荐系统Pepper。在胡椒中,用户八卦模型更新并不同步。胡椒的核心位于两个关键组成部分:一个保持在每个节点附近的个性化同行采样协议,这是一个与前者具有相似兴趣的节点的一部分以及一个简单而有效的模型汇总功能,该函数构建了一个更适合每个用户的模型。通过在三个实施两个用例的实际数据集上进行的实验:位置入住建议和电影推荐,我们证明,与其他分散的解决方案相比,与其他分散的解决方案相比,我们的解决方案比其他分散的解决方案的收敛速度最高42%,例如命中率,例如命中率,与分散竞争的竞争者相比,速度长达21%。
Recommender systems are proving to be an invaluable tool for extracting user-relevant content helping users in their daily activities (e.g., finding relevant places to visit, content to consume, items to purchase). However, to be effective, these systems need to collect and analyze large volumes of personal data (e.g., location check-ins, movie ratings, click rates .. etc.), which exposes users to numerous privacy threats. In this context, recommender systems based on Federated Learning (FL) appear to be a promising solution for enforcing privacy as they compute accurate recommendations while keeping personal data on the users' devices. However, FL, and therefore FL-based recommender systems, rely on a central server that can experience scalability issues besides being vulnerable to attacks. To remedy this, we propose PEPPER, a decentralized recommender system based on gossip learning principles. In PEPPER, users gossip model updates and aggregate them asynchronously. At the heart of PEPPER reside two key components: a personalized peer-sampling protocol that keeps in the neighborhood of each node, a proportion of nodes that have similar interests to the former and a simple yet effective model aggregation function that builds a model that is better suited to each user. Through experiments on three real datasets implementing two use cases: a location check-in recommendation and a movie recommendation, we demonstrate that our solution converges up to 42% faster than with other decentralized solutions providing up to 9% improvement on average performance metric such as hit ratio and up to 21% improvement on long tail performance compared to decentralized competitors.