Offline Reinforcement Learning with Differential Privacy
Dan Qiao, Yu-Xiang Wang
Abstract
The offline reinforcement learning (RL) problem is often motivated by the need to learn data-driven decision policies in financial, legal and healthcare applications. However, the learned policy could retain sensitive information of individuals in the training data (e.g., treatment and outcome of patients), thus susceptible to various privacy risks. We design offline RL algorithms with differential privacy guarantees which provably prevent such risks. These algorithms also enjoy strong instance-dependent learning bounds under both tabular and linear Markov decision process (MDP) settings. Our theory and simulation suggest that the privacy guarantee comes at (almost) no drop in utility comparing to the non-private counterpart for a medium-size dataset.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6c379075-8935-413a-9751-6575fd9f0a96Cited by top-tier papers13
- Provably Robust DPO: Aligning Language Models with Noisy FeedbackSayak Ray Chowdhury, Anush Kini, Nagarajan NatarajanICML 2024 · 118 citations
- Differentially Private Linear Sketches: Efficient Implementations and ApplicationsFuheng Zhao, Dan Qiao, Rachel Redberg, Divyakant Agrawal et al.NeurIPS 2022 · 40 citations
- Privately Aligning Language Models with Reinforcement LearningFan Wu, Huseyin A. Inan, Arturs Backurs, Varun Chandrasekaran et al.ICLR 2024 · 16 citations
- Stable Minima Cannot Overfit in Univariate ReLU Networks: Generalization by Large Step SizesDan Qiao, Kaiqi Zhang, Esha Singh, Daniel Soudry et al.NeurIPS 2024 · 15 citations
- Thinking Racial Bias in Fair Forgery Detection: Models, Datasets and EvaluationsDecheng Liu, Zongqi Wang, Chunlei Peng, Nannan Wang et al.AAAI 2025 · 11 citations
Builds on23
- The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural NetworksNicholas Carlini, Chang Liu, Úlfar Erlingsson, Jernej Kos et al.USENIX Security 2019 · 1,386 citations
- Is Pessimism Provably Efficient for Offline RL?Ying Jin, Zhuoran Yang, Zhaoran WangICML 2021 · 419 citations
- Bellman-consistent Pessimism for Offline Reinforcement LearningTengyang Xie, Ching-An Cheng, Nan Jiang, Paul Mineiro et al.NeurIPS 2021 · 339 citations
- Model-Based Reinforcement Learning with Value-Targeted RegressionAlex Ayoub, Zeyu Jia, Csaba Szepesvári, Mengdi Wang et al.ICML 2020 · 324 citations
- Provably Efficient Exploration in Policy OptimizationQi Cai, Zhuoran Yang, Chi Jin, Zhaoran WangICML 2020 · 304 citations
Related papers
- Differentially Private Regret Minimization in Episodic Markov Decision ProcessesSayak Ray Chowdhury, Xingyu ZhouAAAI 2022 · 26 citations
- Private Reinforcement Learning with PAC and Regret GuaranteesGiuseppe Vietri, Borja Balle, Akshay Krishnamurthy, Zhiwei Steven WuICML 2020 · 70 citations
- Pessimism in the Face of Confounders: Provably Efficient Offline Reinforcement Learning in Partially Observable Markov Decision ProcessesMiao Lu, Yifei Min, Zhaoran Wang, Zhuoran YangICLR 2023
- Local Differential Privacy for Regret Minimization in Reinforcement LearningEvrard Garcelon, Vianney Perchet, Ciara Pike-Burke, Matteo PirottaNeurIPS 2021 · 47 citations
- Constraints Penalized Q-learning for Safe Offline Reinforcement LearningHaoran Xu, Xianyuan Zhan, Xiangyu ZhuAAAI 2022 · 127 citations
