Locally Private Nonparametric Contextual Multi-armed Bandits with Transfer Learning
局部隐私下非参数情境多臂老虎机的迁移学习
Motivated by privacy concerns in sequential decision-making on sensitive data, we address the challenging problem of nonparametric contextual multi-armed bandits (MAB) under local differential privacy (LDP). Via a novelly designed LDP-compatible confidence bound, we propose an algorithm that achieves near-optimal regret performance, whose optimality is further supported by a first-seen minimax lower bound. We further consider the case of private transfer learning where…