摘要
In this paper, we propose a new federated multi-armed bandit framework with vector rewards that can abstract personalized recommendations. In our setup, each reward is a vector, and each user may be interested in a different dimension of this vector. For example, some users may specifically care about the food quality, service, environment, location, or price, in restaurant recommendations. We propose a Federated Personalized Arm Elimination (FPAE) algorithm and explore two communication constrained scenarios. One scenario allows only one communication round during learning, while the other allows multiple communication rounds. We design two algorithms (FPAE-1 and FPAE-R) for the scenarios and theoretically evaluate their regret. We show that communication can speed up the learning process and that there is a tradeoff between the communication cost and the learning performance as captured by the regret. Numerical analysis results demonstrate the performance of our proposed methods.
学科与关键词
- Privacy-Preserving Communication-Efficient Federated Multi-Armed BanditsLi, Tan*; Song, Linqi*IEEE Journal on Selected Areas in Communications, 2022, 40(3): 773-787.被引 8
- Personalized Federated Recommendation via Joint Representation Learning, User Clustering, and Model AdaptationLuo, Sichun; Xiao, Yuanzhang; Song, Linqi*31st ACM International Conference on Information and Knowledge Management (CIKM), Atlanta, GA, 2022-10-17 To 2022-10-21.被引 2
- Fine-Grained Preference-Aware Personalized Federated POI Recommendation with Data SparsityZhang, Xiao; Ye, Ziming; Lu, Jianfeng; Zhuang, Fuzhen; Zheng, Yanwei; Yu, Dongxiao*46th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), Taipei, TAIWAN, 2023-07-23 To 2023-07-27.
