AI RESEARCH
Exact Unlearning in Reinforcement Learning
arXiv CS.AI
•
ArXi:2606.04182v1 Announce Type: cross We formulate the problem of \emph{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 \emph{indistinguishable} from what would have been produced had the deleted user never interacted with the learner.