mlsanityData to 7 Oct 2026

Markov Chain Monte Carlo-Based Machine Unlearning: Unlearning What Needs to be Forgotten

arXiv 2202.13585 ↗First posted 28 Feb 2022cs.LG cs.CRcited by 25

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

As the use of machine learning (ML) models is becoming increasingly popular in many real-world applications, there are practical challenges that need to be addressed for model maintenance. One such challenge is to 'undo' the effect of a specific subset of dataset used for training a model. This specific subset may contain malicious or adversarial data injected by an attacker, which affects the model performance. Another reason may be the need for a service provider to remove data pertaining to a specific user to respect the user's privacy. In both cases, the problem is to 'unlearn' a specific subset of the training data from a trained model without incurring the costly procedure of retraining the whole model from scratch. Towards this goal, this paper presents a Markov chain Monte Carlo-based machine unlearning (MCU) algorithm. MCU helps to effectively and efficiently unlearn a trained model from subsets of training dataset. Furthermore, we show that with MCU, we are able to explain the effect of a subset of a training dataset on the model prediction. Thus, MCU is useful for examining subsets of data to identify the adversarial data to be removed. Similarly, MCU can be used to erase the lineage of a user's personal data from trained ML models, thus upholding a user's "right to be forgotten". We empirically evaluate the performance of our proposed MCU algorithm on real-world phishing and diabetes datasets. Results show that MCU can achieve a desirable performance by efficiently removing the effect of a subset of training dataset and outperform an existing algorithm that utilizes the remaining dataset.

Key facts. Cited by 25 papers in the map (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 21 of its 55 references that are in the map. First posted on arXiv 28 Feb 2022.

Builds on

21 of 55 references.

References · 21

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2013Intriguing properties of neural networkscited by 5,114
  3. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  4. 2019Machine Unlearningcited by 1,020
  5. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
  6. 2019Certified Data Removal from Machine Learning Modelscited by 512
  7. 2019Making AI Forget You: Data Deletion in Machine Learningcited by 447
  8. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
  9. 2017A Conceptual Introduction to Hamiltonian Monte Carlocited by 207
  10. 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
  11. 2018EMBER: An Open Dataset for Training Static PE Malware Machine Learning Modelscited by 164
  12. 2019On the Accuracy of Influence Functions for Measuring Group Effectscited by 146
9 more
  1. 2020Variational Bayesian Unlearningcited by 114
  2. 2020Scaling Hamiltonian Monte Carlo Inference for Bayesian Neural Networks with Symmetric Splittingcited by 54
  3. 2015Deep Neural Network Based Malware Detection Using Two Dimensional Binary Program Featurescited by 48
  4. 2020Formalizing Data Deletion in the Context of the Right to be Forgottencited by 46
  5. 2019GEE: A Gradient-based Explainable Variational Autoencoder for Network Anomaly Detectioncited by 36
  6. 2018URLNet: Learning a URL Representation with Deep Learning for Malicious URL Detectioncited by 34
  7. 2017MaMaDroid: Detecting Android Malware by Building Markov Chains of Behavioral Models (Extended Version)cited by 11
  8. 2021Bayesian Inference Forgettingcited by 7
  9. 2015Know Your Phish: Novel Techniques for Detecting Phishing Sites and their Targetscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 7; 2024: 7; 2025: 5; 2026: 3.

25 papers.

Sort:

By area:

  1. 2022A Survey of Machine Unlearningcited by 298
  2. 2023Machine Unlearning: Solutions and Challengescited by 85
  3. 2023Fast Model Debias with Machine Unlearningcited by 70
  4. 2024Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearningcited by 48
  5. 2023Exploring the Landscape of Machine Unlearning: A Comprehensive Survey and Taxonomycited by 44
  6. 2022Evaluating Machine Unlearning via Epistemic Uncertaintycited by 39
  7. 2024Dissecting Language Models: Machine Unlearning via Selective Pruningcited by 38
  8. 2023Learn to Unlearn for Deep Neural Networks: Minimizing Unlearning Interference with Gradient Projectioncited by 37
  9. 2024Machine Unlearning: A Comprehensive Surveycited by 33
  10. 2023Efficiently Forgetting What You Have Learned in Graph Representation Learning via Projectioncited by 20
  11. 2025Ten Challenging Problems in Federated Foundation Modelscited by 20
  12. 2024Contrastive Unlearning: A Contrastive Approach to Machine Unlearningcited by 14
13 more
  1. 2022An Introduction to Machine Unlearningcited by 13
  2. 2023Adapt then Unlearn: Exploring Parameter Space Semantics for Unlearning in Generative Adversarial Networkscited by 11
  3. 2023Audit to Forget: A Unified Method to Revoke Patients' Private Data in Intelligent Healthcarecited by 9
  4. 2025Towards Reliable Forgetting: A Survey on Machine Unlearning Verificationcited by 8
  5. 2024Partially Blinded Unlearning: Class Unlearning for Deep Networks a Bayesian Perspectivecited by 3
  6. 2024GENIU: A Restricted Data Access Unlearning for Imbalanced Datacited by 3
  7. 2025ReVeil: Unconstrained Concealed Backdoor Attack on Deep Neural Networks using Machine Unlearningcited by 3
  8. 2024"Forgetting" in Machine Learning and Beyond: A Surveycited by 2
  9. 2025SCU: An Efficient Machine Unlearning Scheme for Deep Learning Enabled Semantic Communicationscited by 0
  10. 2025SMS: Self-supervised Model Seeding for Verification of Machine Unlearningcited by 0
  11. 2026Approximate Machine Unlearning through Manifold Representation Forgetting Guided by Self Mode Connectivitycited by 0
  12. 2026How Hard Can It Be? Hardness-Aware Multi-Objective Unlearningcited by 0
  13. 2026Generated Images Are Easier to Forget: A Machine Unlearning Perspective for Synthetic Image Detectioncited by 0