mlsanityData to 14 Oct 2026

CE-U: Cross Entropy Unlearning

arXiv 2503.01224 ↗First posted 3 Mar 2025cs.LGcited by 4

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

Large language models memorize sensitive data from their pretraining corpora. In this work, we propose CE-U (Cross Entropy Unlearning), a loss function for unlearning. CE-U addresses fundamental limitations of gradient ascent approaches that suffer from vanishing gradients when model confidence is high and exploding gradients when confidence is low. We also unify standard cross entropy learning and unlearning into a single framework. On the TOFU benchmark for unlearning, CE-U achieves state-of-the-art results on LLaMA2-7B models without using an extra oracle model or additional positive samples. Our analysis reveals that the problematic gradient ascent component also exists in reinforcement learning algorithms like DPO and GRPO. This suggests that applying CE-U approach to reinforcement learning could be promising to improve stability and convergence.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 7 of its 13 references that are in the map. First posted on arXiv 3 Mar 2025.

Builds on

7 of 13 references.

Closest ancestors · 4

Same direction, newest first

  1. 2024LLM Unlearning via Loss Adjustment with Only Forget Data14 Oct
  2. 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning8 Apr
  3. 2024Machine Unlearning of Pre-trained Large Language Models23 Feb
  4. 2022Knowledge Unlearning for Mitigating Privacy Risks in Language Models4 Oct

Other references · 3

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  2. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
  3. 2019Machine Unlearningcited by 1,061

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Label-Free Reinforcement Learning via Cross-Model Entropy
  2. 2026Entropy-Preserving Reinforcement Learning
  3. 2025RULE: Reinforcement UnLEarning Achieves Forget-Retain Pareto Optimality
  4. 2025Constrained Entropic Unlearning: A Primal-Dual Framework for Large Language Models
  5. 2025Leveraging Machine Unlearning for Cost-Efficient Preference Alignment
  6. 2024UNDIAL: Self-Distillation with Adjusted Logits for Robust Unlearning in Large Language Models
  7. 2026Beyond Binary Rewards: A Comparative Study of Reward Design for Reinforcement Unlearning
  8. 2025Squeeze the Soaked Sponge: Efficient Off-policy Reinforcement Finetuning for Large Language Model