论文标题
Cali3F:校准快速公平联合建议系统
Cali3F: Calibrated Fast Fair Federated Recommendation System
论文作者
论文摘要
关于隐私保护的越来越严格的法规引发了人们对联邦学习的兴趣。作为一个分布式机器学习框架,它通过通过设备训练全球模型的同时将数据局部化来弥合孤立的数据岛。针对推荐系统,已经提出了许多联合建议算法来实现隐私的协作建议。但是,在很大程度上尚未探索几个限制。一个大问题是如何确保联合学习的参与者之间的公平性,即保持跨设备推荐性能的统一性。另一方面,由于数据异质性和有限的网络,收敛速度会出现其他挑战。为了解决这些问题,在本文中,我们首先提出了一种个性化联合建议系统培训算法,以提高建议性能公平。然后,我们采用基于聚类的聚合方法来加速训练过程。通过将两个组件结合在一起,我们提出了CALI3F,这是一个经过校准的快速而公平的联合推荐框架。 Cali3F不仅通过集群内参数共享方法解决了收敛问题,而且还通过使用全局模型来校准本地模型来显着提高公平性。我们证明了Cali3F在标准基准数据集中的性能,并与传统的聚合方法相比探索了功效。
The increasingly stringent regulations on privacy protection have sparked interest in federated learning. As a distributed machine learning framework, it bridges isolated data islands by training a global model over devices while keeping data localized. Specific to recommendation systems, many federated recommendation algorithms have been proposed to realize the privacy-preserving collaborative recommendation. However, several constraints remain largely unexplored. One big concern is how to ensure fairness between participants of federated learning, that is, to maintain the uniformity of recommendation performance across devices. On the other hand, due to data heterogeneity and limited networks, additional challenges occur in the convergence speed. To address these problems, in this paper, we first propose a personalized federated recommendation system training algorithm to improve the recommendation performance fairness. Then we adopt a clustering-based aggregation method to accelerate the training process. Combining the two components, we proposed Cali3F, a calibrated fast and fair federated recommendation framework. Cali3F not only addresses the convergence problem by a within-cluster parameter sharing approach but also significantly boosts fairness by calibrating local models with the global model. We demonstrate the performance of Cali3F across standard benchmark datasets and explore the efficacy in comparison to traditional aggregation approaches.