We introduce the payload optimization method for federated recommender systems (FRS). In federated learning (FL), the global model payload that is moved between the server and users depends on the number of items to recommend. The model payload grows when there is an increasing number of items. This becomes challenging for an FRS if it is running in production mode. To tackle the payload challenge, we formulated a multi-arm bandit solution that selected part of the global model and transmitted it to all users. The selection process was guided by a novel reward function suitable for FL systems. So far as we are aware, this is the first optimization method that seeks to address item dependent payloads. The method was evaluated using three benchmark recommendation datasets. The empirical validation confirmed that the proposed method outperforms the simpler methods that do not benefit from the bandits for the purpose of item selection. In addition, we have demonstrated the usefulness of our proposed method by rigorously evaluating the effects of a payload reduction on the recommendation performance degradation. Our method achieved up to a 90\% reduction in model payload, yielding only a $\sim$4\% - 8\% loss in the recommendation performance for highly sparse datasets
翻译:我们为联合推荐人系统引入了有效载荷优化法(FRS)。在联合学习(FRS)中,在服务器和用户之间移动的全球模型有效载荷取决于建议的项目数量。模型有效载荷在数量不断增加时会增长。如果在生产模式中运行,这对FRS具有挑战性。为了应对有效载荷挑战,我们制定了一个多臂强盗解决方案,选择了全球模型的一部分,并将其传送给所有用户。选择过程以适合FL系统的新奖励功能为指导。据我们所知,这是试图解决项目依赖性有效载荷的第一个优化方法。这种方法是使用三个基准建议数据集进行评估的。经验验证证实,拟议的方法优于在项目选择方面无法从强盗中受益的更简单方法。此外,我们通过严格评估有效载荷减少对建议性能退化的影响,证明了我们拟议方法的效用。我们的方法达到了90- ⁇ 标准有效载荷的削减,在高密数据系统的建议性性能中只产生1美元=8 ⁇ 损失。