Exact Unlearning in Reinforcement Learning

We formulate the problem of exact unlearning in reinforcement learning, where the goal is to design an efficient framework that enables the removal of any user's data upon deletion request, i.e., the online learner's output after unlearning is indistinguishable from what would have been produced had the deleted user never interacted with the learner. For any ρ >0, we show that there exists a reinforcement learning (RL) algorithm that is ρ-TV-stable and supports an exact unlearning procedure whose expected computational cost is only a ρ √ln T fraction of the computational cost of retraining from scratch. We construct such a ρ-TV-stable RL algorithm for tabular Markov decision processes (MDPs), which achieves a regret bound of O(H2 √SAT + H3 S2 A + H2.5 S2 A/ρ), where S, A, H, and T denote the number of states, the number of actions, the episode horizon, and the number of episodes, respectively. We also establish a lower bound of Omega(H√!SAT! +! SAH/ρ) for ρ-TV-stable RL algorithms, showing that our algorithm is nearly minimax optimal.