cs.LGSep 29, 2026

UnlearningSoup: Is Repeated Tuning Necessary for Large Language Model Unlearning?

Authors: Puning Yang, Qizhou Wang, Junchi Yu, Bo Han, Xiuying Chen

Organizations: Division of Computing and Mathematical Sciences, MBZUAI · RIKEN Center for Advanced Intelligence Project · TMLR Group, Department of Computer Science, Hong Kong Baptist University · Torr Vision Group, Department of Engineering Science, University of Oxford

Abstract

Large language models trained on vast corpora inherently risk memorizing harmful content that may later re-emerge in their outputs. To mitigate this issue, existing unlearning methods typically rely on training-based parameter updates, such as gradient ascent and its variants, to delete targeted content while preserving other knowledge. However, balancing the competing goals of forgetting and retention makes hyperparameter choices for these methods particularly difficult, often requiring repeated tuning to obtain a strong model that still leaves substantial room for improvement and transfers poorly across models and datasets. To address this challenge, we investigate whether unlearning runs exhibit exploitable structure in weight space, and observe that models from different runs still lie in a shared evaluation-performance basin. This suggests that stronger models may be recovered through an unlearning-tailored soup strategy, reducing the need for repeated tuning for further improvement or new settings. Motivated by this, we propose UnlearningSoup, a unified framework that provides two strategies: EfficientSoup uses binary-search-based interpolation to quickly discover a well-performing model in the early stage, where repeated tuning would otherwise make strong model selection costly. PerformanceSoup uses reweighted souping to efficiently unlock the remaining performance potential in the later stage, where repeated tuning becomes increasingly inefficient. Extensive experiments across diverse datasets and models show that UnlearningSoup delivers 2.4x to 3.3x efficiency gains in hyperparameter selection, while consistently improving performance across settings.

Figures & tables

Appendix figures & tables19 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. RapidUn: Influence-Driven Parameter Reweighting for Efficient Large Language Model Unlearning

    Dec 4, 2025Guoshenghui Zhao, Huawei Lin, Weijie ZhaoMachine UnlearningLLM Unlearning

  2. Fast Unlearning at Scale via Margin Self-Correction

    Jun 1, 2026Federico Di Gennaro, Alexander Shevchenko, Fanny YangMachine UnlearningLLM Unlearning

  3. Representation-Guided Parameter-Efficient LLM Unlearning

    Apr 19, 2026Zeguan Xiao, Lang Mo, Yun Chen +4Machine UnlearningLLM Unlearning