Remaining-data-free Machine Unlearning by Suppressing Sample Contribution
Xinwen Cheng, Zhehao Huang, Wenxing Zhou, Zhengbao He, Ruikai Yang, Yingwen Wu, Xiaolin Huang
Abstract
Machine unlearning (MU) aims to remove the influence of specific training samples from a well-trained model, a task of growing importance due to the "right to be forgotten." The unlearned model should approach the retrained model, where forgetting data do not contribute to the training process. Therefore, unlearning should withdraw their contribution from the pre-trained model. However, quantifying and disentangling sample's contribution to overall learning process is highly challenging, leading most existing MU approaches to adopt other heuristic strategies such as random labeling or knowledge distillation. These operations inevitably degrade model utility, requiring additional maintenance with remaining data. To advance MU towards better utility and efficiency for practical deployment, we seek to approximate sample contribution with only the pre-trained model. We theoretically and empirically reveal that sample's contribution during training manifests in the learned model's increased sensitivity to it. In light of this, we propose MU-Mis (Machine Unlearning by Minimizing input sensitivity), which directly suppresses the contribution of forgetting data. This straightforward suppression enables MU-Mis to successfully unlearn without degrading model utility on the remaining data, thereby eliminating the need for access to the remaining data. To the best of our knowledge, this is the first time that a remaining-data-free method can perform on par with top performing remaining-data-dependent methods. The code is released in https://github.com/poppopbean0903/MU-Mis .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b70b4b44-59fb-4f39-99b1-29e47214d0b8Cited by top-tier papers2
- FG-OrIU: Towards Better Forgetting via Feature-Gradient Orthogonality for Incremental UnlearningQian Feng, Jiahang Tu, Mintong Kang, Hanbin Zhao et al.ICCV 2025 · 9 citations
- FaLW: A Forgetting-aware Loss Reweighting for Long-tailed UnlearningLiheng Yu, Zhe Zhao, Yuxuan Wang, Pengkun Wang et al.ICLR 2026 · 5 citations
Builds on32
- An Image is Worth 16x16 Words: Transformers for Image Recognition at ScaleAlexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weissenborn et al.ICLR 2021 · 21,477 citations
- Membership Inference Attacks Against Machine Learning ModelsReza Shokri, Marco Stronati, Congzheng Song, Vitaly ShmatikovS&P 2017 · 5,137 citations
- Machine UnlearningLucas Bourtoule, Varun Chandrasekaran, Christopher A. Choquette-Choo, Hengrui Jia et al.S&P 2021 · 1,381 citations
- Estimating Training Data Influence by Tracing Gradient DescentGarima Pruthi, Frederick Liu, Satyen Kale, Mukund SundararajanNeurIPS 2020 · 784 citations
- What Neural Networks Memorize and Why: Discovering the Long Tail via Influence EstimationVitaly Feldman, Chiyuan ZhangNeurIPS 2020 · 674 citations
Related papers
- Towards Safe Machine Unlearning: A Paradigm that Mitigates Performance DegradationShanshan Ye, Jie Lu, Guangquan ZhangWWW 2025 · 13 citations
- MUter: Machine Unlearning on Adversarially Trained ModelsJunxu Liu, Mingsheng Xue, Jian Lou, Xiaoyu Zhang et al.ICCV 2023 · 36 citations
- Machine Unlearning via Adaptive Gradient Reweighting and Multi-stage Objective OptimizationJuxin Lu, Haoyu Shi, Mengyao Wang, Huaiwen ZhangCVPR 2026
- The Right to be Forgotten in Federated Learning: An Efficient Realization with Rapid RetrainingYi Liu, Lei Xu, Xingliang Yuan, Cong Wang et al.INFOCOM 2022 · 189 citations
- Invisible Watermarks, Visible Gains: Steering Machine Unlearning with Bi-Level Watermarking DesignYuhao Sun, Yihua Zhang, Gaowen Liu, Hongtao Xie et al.ICCV 2025 · 1 citation
