Differential Privacy in Kernelized Contextual Bandits via Random Projections
Not on the map. Why?
Abstract (arXiv)
We consider the problem of contextual kernel bandits with stochastic contexts, where the underlying reward function belongs to a known Reproducing Kernel Hilbert Space. We study this problem under an additional constraint of Differential Privacy, where the agent needs to ensure that the sequence of query points is differentially private with respect to both the sequence of contexts and rewards. We propose a novel algorithm that achieves the state-of-the-art cumulative regret of widetildeO(√γTT+fracγTvarepsilonDP) and widetildeO(√γTT+fracγT√TvarepsilonDP) over a time horizon of T in the joint and local models of differential privacy, respectively, where γT is the effective dimension of the kernel and varepsilonDP > 0 is the privacy parameter. The key ingredient of the proposed algorithm is a novel private kernel-ridge regression estimator which is based on a combination of private covariance estimation and private random projections. It offers a significantly reduced sensitivity compared to its classical counterpart while maintaining a high prediction accuracy, allowing our algorithm to achieve the state-of-the-art performance guarantees.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 39 references that are in the map. First posted on arXiv 18 Jul 2025.
Builds on
26 of 39 references.
References · 26
- 2017On Kernelized Multi-armed Banditscited by 348
- 2013The Composition Theorem for Differential Privacycited by 290
- 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
- 2020On Information Gain and Regret Bounds in Gaussian Process Banditscited by 156
- 2020Differentially-Private Federated Linear Banditscited by 83
- 2018Differentially Private Contextual Linear Banditscited by 82
- 2017Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimizationcited by 77
- 2021Gaussian Process Bandit Optimization with Few Batchescited by 57
- 2020Locally Differentially Private (Contextual) Bandits Learningcited by 52
- 2020Efficient and Robust Algorithms for Adversarial Linear Contextual Banditscited by 42
- 2020A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performancecited by 38
- 2021Generalized Linear Bandits with Local Differential Privacycited by 29
14 more
- 2022When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Banditscited by 28
- 2021Differentially Private Multi-Armed Bandits in the Shuffle Modelcited by 24
- 2020Local Differential Privacy for Bayesian Optimizationcited by 19
- 2022Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithmscited by 19
- 2023Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiencycited by 16
- 2020Private Outsourced Bayesian Optimizationcited by 15
- 2022Distributed Contextual Linear Bandits with Minimax Optimal Communication Costcited by 13
- 2015Differentially Private Bayesian Optimizationcited by 12
- 2023Federated Linear Contextual Bandits with User-level Differential Privacycited by 12
- 2021No-Regret Algorithms for Private Gaussian Process Bandit Optimizationcited by 11
- 2022Collaborative Learning in Kernel-based Bandits for Distributed Userscited by 6
- 2023On the Complexity of Differentially Private Best-Arm Identification with Fixed Confidencecited by 6
- 2023Adversarial Contextual Bandits Go Kernelizedcited by 6
- 2025Differentially Private Kernelized Contextual Banditscited by 3
Built on by
Not cited yet.