Vertical Federated Linear Contextual Bandits
Not on the map. Why?
Abstract (arXiv)
In this paper, we investigate a novel problem of building contextual bandits in the vertical federated setting, i.e., contextual information is vertically distributed over different departments. This problem remains largely unexplored in the research community. To this end, we carefully design a customized encryption scheme named orthogonal matrix-based mask mechanism(O3M) for encrypting local contextual information while avoiding expensive conventional cryptographic techniques. We further apply the mechanism to two commonly-used bandit algorithms, LinUCB and LinTS, and instantiate two practical protocols for online recommendation under the vertical federated setting. The proposed protocols can perfectly recover the service quality of centralized bandit algorithms while achieving a satisfactory runtime efficiency, which is theoretically proved and analyzed in this paper. By conducting extensive experiments on both synthetic and real-world datasets, we show the superiority of the proposed method in terms of privacy protection and recommendation performance.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 35 references that are in the map. First posted on arXiv 20 Oct 2022.
Builds on
19 of 35 references.
References · 19
- 2019Introduction to Multi-Armed Banditscited by 475
- 2017Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryptioncited by 174
- 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 100
- 2020Privacy Preserving Vertical Federated Learning for Tree-based Modelscited by 89
- 2020VAFL: a Method of Vertical Asynchronous Federated Learningcited by 87
- 2020Differentially-Private Federated Linear Banditscited by 83
- 2018Differentially Private Contextual Linear Banditscited by 82
- 2021Federated Multi-armed Bandits with Personalizationcited by 62
- 2021Federated Linear Contextual Banditscited by 61
- 2022Vertical Federated Learning: Challenges, Methodologies and Experimentscited by 55
- 2020Locally Differentially Private (Contextual) Bandits Learningcited by 52
- 2021PyVertical: A Vertical Federated Learning Framework for Multi-headed SplitNNcited by 35
7 more
- 2021Asynchronous Upper Confidence Bound Algorithms for Federated Linear Banditscited by 31
- 2021Generalized Linear Bandits with Local Differential Privacycited by 29
- 2020Federated Recommendation System via Differential Privacycited by 26
- 2020Federated Residual Learningcited by 23
- 2021Practical Lossless Federated Singular Vector Decomposition over Billion-Scale Datacited by 18
- 2022Vertical Federated Principal Component Analysis and Its Kernel Extension on Feature-wise Distributed Datacited by 9
- 2019Privacy-Preserving Banditscited by 6
Built on by
Not cited yet.