Leak@$k$: Unlearning Does Not Make LLMs Forget Under Probabilistic Decoding

Unlearning in large language models (LLMs) is critical for regulatory compliance and for building ethical generative AI systems that avoid producing private, toxic, illegal, or copyrighted content. Despite rapid progress, in this work, we show that almost all existing unlearning methods fail to achieve true forgetting in practice. Specifically, while evaluations of these unlearned' models under deterministic (greedy) decoding often suggest successful knowledge removal using standard benchmarks, we show that sensitive information reliably resurfaces when models are sampled with standard probabilistic decoding. To rigorously capture this vulnerability, we introduce leak@$k$, a new meta-evaluation metric that quantifies the likelihood of forgotten knowledge reappearing when generating $k$ samples from the model under realistic decoding strategies. Using three widely adopted benchmarks, TOFU, MUSE, and WMDP, we conduct the first large-scale, systematic study of unlearning reliability using leak@$k$ metric. Our findings demonstrate that knowledge leakage persists across methods and tasks, underscoring that current state-of-the-art (SOTA) unlearning techniques provide only limited forgetting. We propose an algorithm, termed Robust Unlearning under LEak@$k$ metric (RULE) to address this concern. We demonstrate that RULEprovides an unlearned model for TOFU benchmark with no information leakage for a large number of generation samples. On the MUSE benchmark,RULEoutperforms SOTA unlearning methods under theleak@$k$` metric across most sampling budgets $k$. Codes are available at https://github.com/OptimAI-Lab/Leak-k.