English

Private Reinforcement Learning with PAC and Regret Guarantees

Machine Learning 2020-09-22 v1 Cryptography and Security Machine Learning

Abstract

Motivated by high-stakes decision-making domains like personalized medicine where user information is inherently sensitive, we design privacy preserving exploration policies for episodic reinforcement learning (RL). We first provide a meaningful privacy formulation using the notion of joint differential privacy (JDP)--a strong variant of differential privacy for settings where each user receives their own sets of output (e.g., policy recommendations). We then develop a private optimism-based learning algorithm that simultaneously achieves strong PAC and regret bounds, and enjoys a JDP guarantee. Our algorithm only pays for a moderate privacy cost on exploration: in comparison to the non-private bounds, the privacy parameter only appears in lower-order terms. Finally, we present lower bounds on sample complexity and regret for reinforcement learning subject to JDP.

Keywords

Cite

@article{arxiv.2009.09052,
  title  = {Private Reinforcement Learning with PAC and Regret Guarantees},
  author = {Giuseppe Vietri and Borja Balle and Akshay Krishnamurthy and Zhiwei Steven Wu},
  journal= {arXiv preprint arXiv:2009.09052},
  year   = {2020}
}
R2 v1 2026-06-23T18:39:13.589Z