Exact Unlearning in Reinforcement Learning

In three linesTheoretical paper on exact unlearning in reinforcement learning. Authors propose a ρ-TV-stable RL algorithm enabling user data deletion with computational cost only ρ√ln T fraction of retraining. Regret bound O(H²√SAT + H³S²A + H^2.5S²A/ρ) for tabular MDPs, with nearly minimax-optimal lower bound.

Summary generated by Claude — human-verified