Temper-Then-Tilt: Principled Unlearning for Generative Models through Tempering and Classifier Guidance
On the map: LLM safety and security → Vision-language and text-to-image safety
Abstract (arXiv)
We study machine unlearning in large generative models by framing the task as density ratio estimation to a target distribution rather than supervised fine-tuning. While classifier guidance is a standard approach for approximating this ratio and can succeed in general, we show it can fail to faithfully unlearn with finite samples when the forget set represents a sharp, concentrated data distribution. To address this, we introduce Temper-Then-Tilt Unlearning (T3-Unlearning), which freezes the base model and applies a two-step inference procedure: (i) tempering the base distribution to flatten high-confidence spikes, and (ii) tilting the tempered distribution using a lightweight classifier trained to distinguish retain from forget samples. Our theoretical analysis provides finite-sample guarantees linking the surrogate classifier's risk to unlearning error, proving that tempering is necessary to successfully unlearn for concentrated distributions. Empirical evaluations on the TOFU benchmark show that T3-Unlearning improves forget quality and generative utility over existing baselines, while training only a fraction of the parameters with a minimal runtime.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Vision-language and text-to-image safety, one of 12 directions in LLM safety and security. Builds on 37 of its 52 references that are in the map. First posted on arXiv 10 Feb 2026.
Builds on
37 of 52 references.
References · 37
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,185
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2015Trust Region Policy Optimizationcited by 2,503
- 2020Extracting Training Data from Large Language Modelscited by 2,144
- 2022Diffusion Posterior Sampling for General Noisy Inverse Problemscited by 1,375
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,278
- 2019Machine Unlearningcited by 1,020
- 2019Certified Data Removal from Machine Learning Modelscited by 512
- 2024TOFU: A Task of Fictitious Unlearning for LLMscited by 507
- 2024The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearningcited by 488
25 more
- 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearningcited by 484
- 2021FUDGE: Controlled Text Generation With Future Discriminatorscited by 374
- 2023Who's Harry Potter? Approximate Unlearning in LLMscited by 366
- 2021Remember What You Want to Forget: Algorithms for Machine Unlearningcited by 360
- 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 303
- 2024MUSE: Machine Unlearning Six-Way Evaluation for Language Modelscited by 251
- 2024Simplicity Prevails: Rethinking Negative Preference Optimization for LLM Unlearningcited by 160
- 2023Controlled Decoding from Language Modelscited by 133
- 2024Exploratory Preference Optimization: Harnessing Implicit Q*-Approximation for Sample-Efficient RLHFcited by 106
- 2025Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignmentcited by 91
- 2024Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Differencecited by 85
- 2025OpenUnlearning: Accelerating LLM Unlearning via Unified Benchmarking of Methods and Metricscited by 80
- 2025Rethinking LLM Unlearning Objectives: A Gradient Perspective and Go Beyondcited by 59
- 2015Pareto Smoothed Importance Samplingcited by 42
- 2025Exploring Criteria of Loss Reweighting to Enhance LLM Unlearningcited by 39
- 2025Is a Good Foundation Necessary for Efficient Reinforcement Learning? The Computational Role of the Base Model in Explorationcited by 34
- 2024Machine Unlearning Doesn't Do What You Think: Lessons for Generative AI Policy and Researchcited by 14
- 2025Taming Imperfect Process Verifiers: A Sampling Perspective on Backtrackingcited by 13
- 2024A Critical Look At Tokenwise Reward-Guided Text Generationcited by 12
- 2025Ascent Fails to Forgetcited by 12
- 2023Learning Likelihood Ratios with Neural Network Classifierscited by 11
- 2023Ticketed Learning-Unlearning Schemescited by 10
- 2025UCD: Unlearning in LLMs via Contrastive Decodingcited by 9
- 2025Machine Unlearning under Overparameterizationcited by 4
- 2025System-Aware Unlearning Algorithms: Use Lesser, Forget Fastercited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Behavioral Guarantees for Proxy-Based Unlearningcited by 0
- 2026Behavioral Guarantees for Proxy-Based Unlearning11 May 2026