Private Reinforcement Learning with PAC and Regret Guarantees
Vietri, Giuseppe, Balle, Borja, Krishnamurthy, Akshay, Wu, Zhiwei Steven
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.
Sep-18-2020
- Country:
- North America
- United States
- Virginia (0.04)
- Minnesota (0.04)
- Pennsylvania > Allegheny County
- Pittsburgh (0.04)
- New York
- New York County > New York City (0.14)
- Richmond County > New York City (0.04)
- Queens County > New York City (0.04)
- Kings County > New York City (0.04)
- Bronx County > New York City (0.04)
- New Jersey > Mercer County
- Princeton (0.04)
- Canada > Quebec
- Montreal (0.04)
- United States
- Europe > Sweden
- North America
- Genre:
- Research Report (0.64)
- Industry:
- Technology: