An Empirical Study of Reward Specification and Benchmark Reliability in GRPO-based LLM Unlearning
On the map: LLM reasoning → Reinforcement learning for reasoning
also in 1 more
Abstract (arXiv)
Practical LLM unlearning is usually evaluated through two objectives: suppress target-specific knowledge and preserve non-target utility. In generative QA, this leaves a third behavior underspecified: when a target-adjacent prompt admits a broader answer without target-specific leakage, the model should answer at that level rather than leak, evade, or refuse. We study this specification problem in a controlled LoRA-GRPO RWKU setting, comparing four reward designs that span lexical suppression, anti-refusal shaping, rubric-based broad answering, and an explicit refusal contrast, with and without SFT warm-up. The experiments show that optimization success is not equivalent to behavioral unlearning: RWKU forget scores, held-out completion audits, and training dynamics can point to different conclusions. We trace these disagreements to reward-hacking endpoints, policy-support limits in GRPO, benchmark probes that miss endpoint changes, and a rubric reward that selects broad-topic answering with low semantic leakage under held-out evaluation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Reinforcement learning for reasoning, one of 17 directions in LLM reasoning. Builds on 24 of its 34 references that are in the map. First posted on arXiv 18 Aug 2026.
Builds on
24 of 34 references.
Closest ancestors · 4
Same direction, newest first
- 2026LLMs Gaming Verifiers: RLVR can Lead to Reward Hacking16 Apr
- 2025Spurious Rewards: Rethinking Training Signals in RLVR12 Jun
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning22 Jan
- 2017Proximal Policy Optimization Algorithms20 Jul
Other references · 20
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2025Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learningcited by 1,444
- 2019Machine Unlearningcited by 1,061
- 2024TOFU: A Task of Fictitious Unlearning for LLMscited by 533
- 2024The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearningcited by 509
- 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearningcited by 504
- 2023Who's Harry Potter? Approximate Unlearning in LLMscited by 381
- 2025Rubrics as Rewards: Reinforcement Learning Beyond Verifiable Domainscited by 366
- 2022CodeRL: Mastering Code Generation through Pretrained Models and Deep Reinforcement Learningcited by 358
8 more
- 2024MUSE: Machine Unlearning Six-Way Evaluation for Language Modelscited by 261
- 2024Rethinking Machine Unlearning for Large Language Modelscited by 257
- 2024garak: A Framework for Security Probing Large Language Modelscited by 49
- 2026Reward Hacking in Rubric-Based Reinforcement Learningcited by 26
- 2025RULE: Reinforcement UnLEarning Achieves Forget-Retain Pareto Optimalitycited by 16
- 2025Leak@k: Unlearning Does Not Make LLMs Forget Under Probabilistic Decodingcited by 9
- 2026Reinforcement Unlearning via Group Relative Policy Optimizationcited by 4
- 2026Beyond Binary Rewards: A Comparative Study of Reward Design for Reinforcement Unlearningcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Lessons from Training Grounded LLMs with Verifiable Rewards
- 2026Likelihood-Based Reward Designs for General LLM Reasoning
- 2025LLM Unlearning Under the Microscope: A Full-Stack View on Methods and Metrics
- 2025Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs
- 2024Rejection Improves Reliability: Training LLMs to Refuse Unknown Questions Using RL from Knowledge Feedback
- 2025Scalable and Robust LLM Unlearning by Correcting Responses with Retrieved Exclusions
- 2026Range-GRPO: Policy Optimization via Pairwise Relations among Reward Intervals
- 2025A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce