Near-Optimal Differentially Private Reinforcement Learning
share
Motivated by personalized healthcare and other applications involving sensitive data, we study online exploration in reinforcement learning with differential privacy (DP) constraints. Existing work on this problem established that no-regret learning is possible under joint differential privacy (JDP) and local differential privacy (LDP) but did not provide an algorithm with optimal regret. We close this gap for the JDP case by designing an ϵ-JDP algorithm with a regret of O(√(SAH^2T)+S^2AH^3/ϵ) which matches the information-theoretic lower bound of non-private learning for all choices of ϵ> S^1.5A^0.5 H^2/√(T). In the above, S, A denote the number of states and actions, H denotes the planning horizon, and T is the number of steps. To the best of our knowledge, this is the first private RL algorithm that achieves privacy for free asymptotically as T→∞. Our techniques – which could be of independent interest – include privately releasing Bernstein-type exploration bonuses and an improved method for releasing visitation statistics. The same techniques also imply a slightly improved regret bound for the LDP case.
READ FULL TEXT
