Machine Unlearning: A Survey
Open accessThe DOI matches its Crossref record; 132 of the 132 references it cites were found in a registry or an index; 140 of the 233 sources its claims cite were checked for support.
Abstract
This survey captures the key concepts of unlearning techniques and highlights outstanding issues with unlearning techniques, along with feasible directions for new research opportunities.
Overview
CoChat Summary
TL;DR
This survey reviews machine unlearning, proposing a taxonomy that divides existing techniques into data reorganization and model manipulation, with verification mechanisms reviewed alongside each category. It summarizes advantages, limitations, and open issues, including universality, security, verification, and applications.
Key findings
- The paper proposes a taxonomy of unlearning methods: data reorganization (data obfuscation, data pruning, data replacement) and model manipulation (model shifting, model pruning, model replacement). Verification methods are categorized as empirical (retraining-based, attack-based, relearn time-based, accuracy-based) or theoretical (theory-based, information bound-based).
- Data reorganization schemes often retain intermediate parameters and use the original training dataset; they can support complex models and strong unlearning but may affect consistency and accuracy and require additional storage. Data obfuscation seldom completely unlearns information; data pruning can reduce accuracy as sub-models train on partial data; data replacement struggles to retain all original dataset information.
- Model manipulation schemes directly adjust model parameters, reducing intermediate storage, but most focus on simple models or special assumptions; removing information from standard deep networks remains an open problem. They may affect consistency or prediction accuracy, and theory-based or information-bound verification is more convincing but complex and limited to specified models.
- Open questions include universality of unlearning solutions, security risks where unlearning can increase privacy leakage, user-friendly verification, and broader applications. Future directions include information synchronization, federated unlearning, disturbance techniques, feature-based unlearning, and game-theory-based balance.
Methods
- Design: a comprehensive survey that proposes a novel taxonomy based on unlearning rationale and strategy, summarizes state-of-the-art methods, reviews verification methods, and discusses open issues and future directions.
- Data or sample: existing machine unlearning literature; the paper does not state a systematic search protocol, inclusion criteria, or quantitative synthesis.
- Analysis: qualitative classification and comparison across dimensions such as whether original training data is required, whether intermediate data is cached, supported classes and models, unlearning targets, and verification methods.
Limitations
- The paper states limitations of existing unlearning schemes: exact unlearning can only be achieved for simple and well-structured models; many schemes lack theoretical verification; data reorganization can incur storage and accuracy costs; model manipulation is often limited to simple models or special assumptions; and many verification methods are one-sided or not user-friendly.
- The paper does not explicitly state limitations of the survey itself. Evident from the text: it does not report a systematic review protocol or quantitative meta-analysis, and its coverage reflects the literature cited up to the publication date.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
104 Valid · 10 Not valid · 55 Not checked · 91 Own results and interpretations
At least one cited source doesn’t support this claim or points to a different paper, and none confirmed it — see the verdicts below.
In the paper
“However, since the summation form comes from statistical query (SQ) learning, and only a few machine learning algorithms can be implemented as SQ learning, such as naïve bayes classifiers [83], support vector machines [84], and k-means clustering [85], this scheme has low applicability.”
What the sources say
- Disputedcites [29] [29] Yinzhi Cao and Junfeng Yang. 2015. Towards making systems forget with machine unlearning. In IEEE Symposium on Security and Privacy . IEEE Computer Society, 463-480. DOI: http://dx.doi.org/10.1109/SP.2015.35 - sourceExperimental — accuracy not yet measured
The Machine Unlearning section says many algorithms—including naïve Bayes classifiers, support vector machines, and k-means clustering—can be implemented as SQ learning and describes the approach as general. The Adaptive SQ Learning section says very few practical learning algorithms cannot be converted to its adaptive SQ form. These passages contradict the claim that only a few can be implemented and that this makes the scheme minimally applicable. (LLM, conf=0.92)
Checked by a reasoning model — may be wrong.
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Disputed
At least one cited source doesn’t support this claim or points to a different paper, and none confirmed it — see the verdicts below.
In the paper
“However, this solution will result in a significant reduction in accuracy when dealing with complex models.”
What the sources say
- Disputedcites [93] [93] Yi Liu, Lei Xu, Xingliang Yuan, Cong Wang, and Bo Li. 2022. The right to be forgotten in federated learning: An efficient realization with rapid retraining. In IEEE Conference on Computer Communications . IEEE, 1749-1758. DOI: http://dx.doi.org/10.1109/INFOCOM48880.2022.9796721 - sourceExperimental — accuracy not yet measured
The Evaluation (p. 9) reports that Liu et al.’s algorithm achieves accuracy comparable to retraining from scratch and says momentum compensates for the model-utility loss from its approximation. The Introduction (p. 2) describes the solution as model agnostic and reports only a small accuracy loss on CelebA, contrary to the claimed significant reduction for complex models. (LLM, conf=0.87)
Checked by a reasoning model — may be wrong.
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Disputed
At least one cited source doesn’t support this claim or points to a different paper, and none confirmed it — see the verdicts below.
In the paper
“The other studies [49, 50] did not provide a method for verifying the unlearning process.”
What the sources say
- Disputedcites [49] [49] [Varun Gupta, Christopher Jung, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi, and Chris Waites. 2021. Adaptive machine unlearning. In Advances in Neural Information Processing Systems: Annual Conference on Neural Information Processing Systems . 16319-16330. Retrieved from https://proceedings.neurips.cc/paper/2021/hash/ 87f7ee4fdb57bdfd52179947211b7ebb-Abstract.html.](https://proceedings.neurips.cc/paper/2021/hash/87f7ee4fdb57bdfd52179947211b7ebb-Abstract.html) - sourceExperimental — accuracy not yet measured
Section C.2 (pp. 21–22) describes a method for testing an unlearning guarantee: compare outcomes after deletion with outcomes after full retraining and use confidence intervals to assess the difference. The paper uses that method to reject a perfect-unlearning guarantee for the tested SISA algorithms. This contradicts the unqualified claim that it provides no method for verifying unlearning, although the test is not a certificate for an individual deletion request. (LLM, conf=0.86)
Checked by a reasoning model — may be wrong.
- Could not verifycites [50] [50] Seth Neel, Aaron Roth, and Saeed Sharifi-Malvajerdi. 2021. Descent-to-delete: Gradient-based methods for machine unlearning. In Algorithmic Learning Theory (Proceedings of Machine Learning Research , Vol. 132). PMLR, 931-962. Retrieved from http://proceedings.mlr.press/v132/neel21a.html. - sourceExperimental — accuracy not yet measured
The paper defines an indistinguishability-based unlearning guarantee (Model and Preliminaries, pp. 6–7) and proves that its algorithms satisfy it (Theorem 3.2, p. 11). Those passages do not establish whether it provides a method for verifying that an unlearning process was carried out; a search for verification and auditing found no passage that settles that point. (LLM, conf=0.69)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Disputed
Some cited sources support this claim and some don’t — read each source’s verdict below.
In the paper
“The unlearning schemes proposed in References [29, 30, 33, 47, 68, 69] are essentially based on a retraining mechanism that naturally has a verifiability property.”
What the sources say
- Disputedcites [29] [29] Yinzhi Cao and Junfeng Yang. 2015. Towards making systems forget with machine unlearning. In IEEE Symposium on Security and Privacy . IEEE Computer Society, 463-480. DOI: http://dx.doi.org/10.1109/SP.2015.35 - sourceExperimental — accuracy not yet measured
The “B. Machine Unlearning” section explicitly describes the proposed approach as unlearning “without retraining from scratch”: it subtracts the forgotten data from stored summations and updates the model. The “C. Empirical Results” section compares unlearning with retraining to evaluate completeness, but that does not make retraining the mechanism on which the scheme is based. No page numbers are available in our copy. (LLM, conf=0.88)
Checked by a reasoning model — may be wrong.
- Not checked — no full text of the sourcecites [30] [30] Lucas Bourtoule, Varun Chandrasekaran, Christopher A. Choquette-Choo, Hengrui Jia, Adelin Travers, Baiwu Zhang, David Lie, and Nicolas Papernot. 2021. Machine unlearning. In 42nd IEEE Symposium on Security and Privacy . IEEE, 141-159. DOI: http://dx.doi.org/10.1109/SP40001.2021.00019 - source
- Partly supportedcites [33] [33] Chong Chen, Fei Sun, Min Zhang, and Bolin Ding. 2022. Recommendation unlearning. In ACMWebConference . ACM, 2768-2777. DOI: http://dx.doi.org/10.1145/3485447.3511997 - sourceExperimental — accuracy not yet measured
Section 4.1 (page unavailable) says RecEraser unlearns data by retraining the affected submodel and aggregation component. The discussion of exact unlearning says its aim is complete removal of the requested data, but our copy does not say that this retraining mechanism naturally has a verifiability property. (LLM, conf=0.83)
- Partly supportedcites [47] [47] [Min Chen, Zhikun Zhang, Tianhao Wang, Michael Backes, Mathias Humbert, and Yang Zhang. 2022. Graph unlearning. In ACM SIGSAC Conference on Computer and Communications Security . ACM, 499-513. DOI: http://dx.doi.org/ 10.1145/3548606.3559352](http://dx.doi.org/10.1145/3548606.3559352) - sourceExperimental — accuracy not yet measured
Section 2.2 (pp. 2–3) describes retraining as an unlearning method, and says GraphEraser removes a requested node and retrains its shard model. The cited paper does not establish the claimed verifiability property; its description of retraining as easy to enforce is not a statement that the result can be verified. (LLM, conf=0.83)
- Not checked — no full text of the sourcecites [68] [68] Wei Qian, Chenxu Zhao, Huajie Shao, Minghan Chen, Fei Wang, and Mengdi Huai. 2022. Patient similarity learning with selective forgetting. In IEEE International Conference on Bioinformatics and Biomedicine . IEEE, 529-534. DOI: http://dx.doi.org/10.1109/BIBM55620.2022.9995016 - source
- Partly supportedcites [69] [69] Haonan Yan, Xiaoguang Li, Ziyao Guo, Hui Li, Fenghua Li, and Xiaodong Lin. 2022. ARCANE: An efficient architecture for exact machine unlearning. In 31st International Joint Conference on Artificial Intelligence . ijcai.org, 4006-4013. DOI: http://dx.doi.org/10.24963/ijcai.2022/556 - sourceExperimental — accuracy not yet measured
Section 1.2 describes exact unlearning as removing data and retraining, and calls that approach naturally reliable. The Discussion also says exact unlearning is based on retraining at the algorithmic level. Neither passage establishes the distinct claim that these schemes naturally have a verifiability property. (LLM, conf=0.83)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Disputed
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Significantly, model manipulation methods usually give a verifiability guarantee using theory-based and information bound-based methods [40, 41, 43].”
What the sources say
- Partly supportedcites [40] [40] Aditya Golatkar, Alessandro Achille, and Stefano Soatto. 2020. Eternal sunshine of the spotless net: Selective forgetting in deep networks. In IEEE/CVF Conference on Computer Vision and Pattern Recognition . Computer Vision Foundation/IEEE, 9301-9309. DOI: http://dx.doi.org/10.1109/CVPR42600.2020.00932 - sourceExperimental — accuracy not yet measured
Section 2 derives a KL-divergence bound that guarantees robustness to any readout function, and Section 5.2 says the authors’ proposed methods provide an upper bound on remaining information. The paper supports a theory- and information-bound-based guarantee for its own forgetting methods, but does not establish that model manipulation methods usually provide such guarantees. (LLM, conf=0.84)
- Partly supportedcites [41] [41] Chuan Guo, Tom Goldstein, Awni Y. Hannun, and Laurens van der Maaten. 2020. Certified data removal from machine learning models. In 37th International Conference on Machine Learning (Proceedings of Machine Learning Research , Vol. 119). PMLR, 3832-3842. Retrieved from http://proceedings.mlr.press/v119/guo20c.html. - sourceExperimental — accuracy not yet measured
The Introduction (p. 1) describes a theoretical guarantee for the paper’s certified-removal mechanism, and Section 3.1 (p. 3) derives it using bounds on the gradient residual and max-divergence. The paper does not establish that model-manipulation methods *usually* provide such guarantees, nor does it characterize them generally as verifiability guarantees. (LLM, conf=0.85)
- Not checked — no full text of the sourcecites [43] [43] Aditya Golatkar, Alessandro Achille, and Stefano Soatto. 2020. Forgetting outside the box: Scrubbing deep networks of information accessible from input-output observations. In 16th European Conference on Computer Vision (Lecture Notes in Computer Science , Vol. 12374). Springer, 383-398. DOI: http://dx.doi.org/10.1007/978-3-030-58526-6\_23 - source
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
86 more claims · 36 with their cited sources checked
Create a free account to see all 260 claims and to verify the 12 references still open.
- Probably not a substantial claim. 128
- It may state two separate claims as one. 68
- The quote only partly states this claim. 1
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3.1 Unlearning Taxonomy · p. 10
“| Model Pruning [54-56] | Replaces partial parameters with pre-calculated parameters”
§ 3.1 Unlearning Taxonomy · p. 9
“Model pruning: In model pruning, the model provider prunes some parameters from the trained models to unlearn the given samples”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3.1 Unlearning Taxonomy · p. 9
“D i , 0 < i < m are the sub-datasets”
§ 3.1 Unlearning Taxonomy · p. 9
“D → D 1 ∪ D 2 ∪ · · · ∪ D m”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3.1 Unlearning Taxonomy · p. 10
“| Model Replacement [57-60] | Prunes some parameters from already-trained models”
§ 3.1 Unlearning Taxonomy · p. 9
“Model replacement: In model replacement, the model provider directly replaces some parameters with pre-calculated parameters”
Citations
Cites
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000 · cited 1×
“To analyze the rich information in these graphs, graph neural networks (GNNs) have shown unprecedented advantages [74, 75].”
BackgroundSelf-citationMachine learning: Trends, perspectives, and prospects
Jordan, M. I., & Mitchell, T. M. (2015) · Science · doi:10.1126/science.aaa8415 · Cited by 9,955 · cited 1×
“In recent years, machine learning has seen remarkable progress and wide exploration across every field of artificial intelligence (AI) [1].”
BackgroundFederated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322
Mosaic organization of DNA nucleotides
Peng, C.-K., Buldyrev, S. V., Havlin, S., Simons, M., Stanley, H. E., & Goldberger, A. L. (1994) · Physical Review E · doi:10.1103/physreve.49.1685 · Cited by 4,985 · cited 1×
“They irst introduce a process called detrended luctuation analysis [81], which quantiies the inluence of the unlearned data on the model parameters, termed temporal residual memory.”
BackgroundMembership Inference Attacks Against Machine Learning Models
Shokri, R., Stronati, M., Song, C., & Shmatikov, V. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.41 · Cited by 4,754
Model Inversion Attacks that Exploit Confidence Information and Basic Countermeasures
Fredrikson, M., Jha, S., & Ristenpart, T. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813677 · Cited by 2,961 · cited 2×
“This is because membership inference attacks [5] and model inversion attacks [6] can reveal information about the speciic contents of a training dataset.”
BackgroundMethodFederated Learning in Mobile Edge Networks: A Comprehensive Survey
Lim, W. Y. B., Luong, N. C., Hoang, D. T., Jiao, Y., Liang, Y.-C., Yang, Q., Niyato, D., & Miao, C. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2986024 · Cited by 2,565
Adaptive Federated Learning in Resource Constrained Edge Computing Systems
Wang, S., Tuor, T., Salonidis, T., Leung, K. K., Makaya, C., He, T., & Chan, K. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2904348 · Cited by 2,232
Understanding Black-box Predictions via Influence Functions
Koh, P. W., & Liang, P. (2017) · arXiv · doi:10.48550/arxiv.1703.04730 · Cited by 1,514 · cited 4×
“The model manipulation methods calculate the influence of each sample and offset that influence using a range of techniques [38], while data reorganization schemes usually reorganize the training dataset to simplify the unlearning process.”
BackgroundMethodInfluentialThe 26th USENIX Security Symposium 2017
Αλεξόπουλος, Ν., Kiayias, A., Zacharias, T., & Talviste, R. (2017) · USENIX Security Symposium · Cited by 1,168
Research works printed but not linked: 5
- Sebastian Schelter. 2020. “Amnesia’—Towards machine learning models that can forget user data very fast. In 10th Conference on Innovative Data Systems Research. Retrieved from http://cidrdb.org/cidr2020/papers/p32-schelter-cidr20.pdf.
- Pei-Hung Chen, Wei Wei, Cho-Jui Hsieh, and Bo Dai. 2021. Overcoming catastrophic forgetting by Bayesian generative regularization. In 38th International Conference on Machine Learning(Proceedings of Machine Learning Research, Vol. 139). PMLR, 1760–1770. Retrieved from http://proceedings.mlr.press/v139/chen21v.html.
- Zachary Izzo, Mary Anne Smart, Kamalika Chaudhuri, and James Zou. 2021. Approximate data deletion from machine learning models. In 24th International Conference on Artificial Intelligence and Statistics(Proceedings of Machine Learning Research, Vol. 130). PMLR, 2008–2016. Retrieved from http://proceedings.mlr.press/v130/izzo21a.html.
- Yinjun Wu, Edgar Dobriban, and Susan B. Davidson. 2020. DeltaGrad: Rapid retraining of machine learning models. In 37th International Conference on Machine Learning(Proceedings of Machine Learning Research, Vol. 119). PMLR, 10355–10366. Retrieved from http://proceedings.mlr.press/v119/wu20b.html.
- 10.5555/1953048.2021036 · doi:10.5555/1953048.2021036
Cited by
Vulnerability of Machine Learning Approaches Applied in IoT-Based Smart Grid: A Review
Zhang, Z., Liu, M., Sun, M., Deng, R., Cheng, P., Niyato, D. T., Chow, M., & Chen, J. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3349381 · Cited by 202
A Survey on Federated Unlearning: Challenges, Methods, and Future Directions
Liu, Z., Jiang, Y., Shen, J., Peng, M., Lam, K., Yuan, X., & Liu, X. (2024) · ACM Computing Surveys · doi:10.1145/3679014 · Cited by 233
Machine Unlearning: Solutions and Challenges
Xu, J., Wu, Z., Wang, C., & Jia, X. (2024) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2024.3379240 · Cited by 234
Toward Generalist Anomaly Detection via In-Context Residual Learning with Few-Shot Sample Prompts
Zhu, J., & Pang, G. (2024) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52733.2024.01688 · Cited by 189
A Survey on Semantic Communication Networks: Architecture, Security, and Privacy
Guo, S., Wang, Y., Zhang, N., Su, Z., Luan, T. H., Tian, Z., & Shen, X. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3516819 · Cited by 167
Federated Unlearning: A Survey on Methods, Design Guidelines, and Evaluation Metrics
Romandini, N., Mora, A., Mazzocca, C., Montanari, R., & Bellavista, P. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3478334 · Cited by 134
Exploring the Landscape of Machine Unlearning: A Comprehensive Survey and Taxonomy
Shaik, T., Tao, X., Xie, H., Li, L., Zhu, X., & Li, Q. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3486109 · Cited by 159
Verifying in the Dark: Verifiable Machine Unlearning by Using Invisible Backdoor Triggers
Guo, Y., Zhao, Y., Hou, S., Wang, C., & Jia, X. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3328269 · Cited by 70
Pradhan, A., Das, S., Piran, M. J., & Han, Z. (2024) · IEEE Access · doi:10.1109/access.2024.3429285 · Cited by 55
Li, H., Yang, R., Xu, S., Xiao, Y., & Zhao, H. (2024) · Buildings · doi:10.3390/buildings14082502 · Cited by 43
Threats, Attacks, and Defenses in Machine Unlearning: A Survey
Liu, Z., Ye, H., Chen, C., Zheng, Y., & Lam, K. (2025) · IEEE Open Journal of the Computer Society · doi:10.1109/ojcs.2025.3543483 · Cited by 102
Machine Unlearning: Taxonomy, Metrics, Applications, Challenges, and Prospects
Li, N., Zhou, C., Gao, Y., Chen, H., Zhang, Z., Kuang, B., & Fu, A. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3530988 · Cited by 132
Digital forgetting in large language models: a survey of unlearning methods
Blanco-Justicia, A., Jebreel, N., Manzanares-Salor, B., Sánchez, D., Domingo-Ferrer, J., Collell, G., & Eeik Tan, K. (2025) · Artificial Intelligence Review · doi:10.1007/s10462-024-11078-6 · Cited by 31
Feature-Based Machine Unlearning for Vertical Federated Learning in IoT Networks
Pan, Z., Ying, Z., Wang, Y., Zhang, C., Zhang, W., Zhou, W., & Zhu, L. (2025) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2025.3530529 · Cited by 40
Self-citationA Duty to Forget, a Right to be Assured? Exposing Vulnerabilities in Machine Unlearning Services
Hu, H., Wang, S., Chang, J., Zhong, H., Sun, R., Hao, S., Zhu, H., & Xue, M. (2024) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2024.24252 · Cited by 63
Backdoor Attacks via Machine Unlearning
Liu, Z., Wang, T., Huai, M., & Miao, C. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i13.29321 · Cited by 63
Federated Learning With Blockchain-Enhanced Machine Unlearning: A Trustworthy Approach
Zuo, X., Wang, M., Zhu, T., Zhang, L., Yu, S., & Zhou, W. (2025) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2025.3553709 · Cited by 39
Self-citationUpdate Selective Parameters: Federated Machine Unlearning Based on Model Explanation
Xu, H. Y., Zhu, T., Zhang, L., Zhou, W., & Yu, P. S. (2024) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2024.3409947 · Cited by 26
Self-citationA survey on machine unlearning: Techniques and new emerged privacy risks
Liu, H., Xiong, P., Zhu, T., & Yu, P. S. (2025) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2025.104010 · Cited by 45
Self-citationOn the Effectiveness of Unlearning in Session-Based Recommendation
Xin, X., Yang, L., Zhao, Z., Ren, P., Chen, Z., Ma, J., & Ren, Z. (2024) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3616855.3635823 · Cited by 26
IDEA: A Flexible Framework of Certified Unlearning for Graph Neural Networks
Dong, Y., Zhang, B., Lei, Z., Zou, N., & Li, J. (2024) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3637528.3671744 · Cited by 50
Privacy-Preserving Federated Unlearning With Certified Client Removal
Liu, Z., Ye, H., Jiang, Y., Shen, J., Guo, J., Tjuawinata, I., & Lam, K. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3555868 · Cited by 40
Multi-Objective Unlearning in Recommender Systems via Preference Guided Pareto Exploration
Li, Y., Zhang, Y., Liu, W., Feng, X., Han, Z., Chen, C., & Yan, C. C. (2025) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2025.3593906 · Cited by 51
Guaranteeing Data Privacy in Federated Unlearning With Dynamic User Participation
Liu, Z., Jiang, Y., Jiang, W., Guo, J., Zhao, J., & Lam, K. (2024) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2024.3476533 · Cited by 31
Learning to Unlearn for Robust Machine Unlearning
Huang, H., Foo, L. G., & Liu, J. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-72943-0_12 · Cited by 46
Xia, X., Wang, Z., Sun, R., Liu, B., Khalil, I., & Xue, M. (2025) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp61157.2025.00095 · Cited by 24
“Approximate unlearning is the process of eliminating or mitigating the impact of specific data subsets to be “forgotten” from a model that has already been trained, without necessitating a complete retraining of the model scratch [52].”
Dang, Y., Liu, Y., Yang, E., Guo, G., Jiang, L., Zhao, J., & Wang, X. (2024) · ACM Transactions on Information Systems · doi:10.1145/3706633 · Cited by 23
Vertical Federated Unlearning via Backdoor Certification
Han, M., Zhu, T., Zhang, L., Huo, H., & Zhou, W. (2025) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2025.3536312 · Cited by 15
Self-citationThe Price of Unlearning: Identifying Unlearning Risk in Edge Computing
Zhang, L., Zhu, T., Xiong, P., & Zhou, W. (2024) · ACM Transactions on Multimedia Computing Communications and Applications · doi:10.1145/3662184 · Cited by 11
Self-citationUaaS-SFL: Unlearning as a Service for Safeguarding Federated Learning
Daluwatta, W., Khalil, I., Edirimannage, S., & Atiquzzaman, M. (2024) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2024.3520109 · Cited by 12
Generative Adversarial Networks Unlearning
Sun, H., Zhu, T., Chang, W., & Zhou, W. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3564992 · Cited by 23
Self-citationExact and Efficient Unlearning for Large Language Model-Based Recommendation
Hu, Z., Zhang, Y., Xiao, M., Wang, W., Feng, F., & He, X. (2025) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2025.3594687 · Cited by 37
Decoupled Distillation to Erase: A General Unlearning Method for Any Class-centric Tasks
Zhou, Y., Zheng, D., Mo, Q., Lu, R., Lin, K.-Y., & Zheng, W. (2025) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52734.2025.01895 · Cited by 50
Towards Community-Driven Generative AI
Dautov, R., Husom, E. J., Sen, S., & Song, H. (2023) · Annals of Computer Science and Information Systems · doi:10.15439/2023f5494 · Cited by 8
Machine Unlearning: An Overview of the Paradigm Shift in the Evolution of AI
Jaman, L., Alsharabi, R., & Elkafrawy, P. (2024) · Learning and Technology Conference (L&T) · doi:10.1109/lt60077.2024.10469232 · Cited by 7
Don't Forget Too Much: Towards Machine Unlearning on Feature Level
Xu, H. Y., Zhu, T., Zhou, W., & Zhao, W. (2024) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2024.3432169 · Cited by 16
Self-citationZero-Shot Class Unlearning in CLIP with Synthetic Samples
Kravets, A., & Namboodiri, V. P. (2025) · IEEE Winter Conference on Applications of Computer Vision · doi:10.1109/wacv61041.2025.00629 · Cited by 7
“Motivation Machine unlearning [20] is becoming an important research area as the need to remove specific learned information from models grows.”
Machine unlearning in brain-inspired neural network paradigms
Wang, C., Ying, Z., & Pan, Z. (2024) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2024.1361577 · Cited by 8
Position: LLM Unlearning Benchmarks are Weak Measures of Progress
Thaker, P., Hu, S., Kale, N., Maurya, Y., Wu, Z. S., & Smith, V. (2025) · IEEE Conference on Secure and Trustworthy Machine Learning (SaTML) · doi:10.1109/satml64287.2025.00035 · Cited by 77
“We point the reader to a number of comprehensive surveys on unlearning for further background, including [18, 19, 20, 21, 22, 23, 24, 25, 26, 27].”
FeaUn: Feature unlearning in vertical federated learning for IIoT against feature inference attacks
Lu, Z., Zhang, X., Li, T., Wang, Y., Li, G., & Liu, Z. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.131110 · Cited by 8
When Machine Unlearning Meets Retrieval-Augmented Generation (RAG): Keep Secret or Forget Knowledge?
Wang, S., Zhu, T., Ye, D., & Zhou, W. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3620832 · Cited by 44
Self-citationFast-NTK: Parameter-Efficient Unlearning for Large-Scale Models
LiM, G., Hsu, H., Chen, C.-F. R., & Mărculescu, R. (2024) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw63382.2024.00027 · Cited by 6
“The objective of machine unlearning is to eliminate the knowledge from the forget samples in D f of a model trained with D , while minimizing the performance degradation of the retain samples in D r [16].”
Deep Unlearn: Benchmarking Machine Unlearning for Image Classification
Cadet, X. F., Borovykh, A., Malekzadeh, M., Ahmadi‐Abhari, S., & Haddadi, H. (2025) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp63326.2025.00058 · Cited by 27
“For a recent overview of MU, we refer to the survey from Xu et al. [23], which provides a taxonomy of common unlearning methods.”
InfluentialPosition Papers of the 18th Conference on Computer Science and Intelligence Systems
(2023) · Annals of Computer Science and Information Systems · doi:10.15439/978-83-969601-1-5 · Cited by 5
Comparison of Model Adaptation Techniques with Machine Unlearning
Mansi, Reddy, S. R. N., & Anand, R. (2024) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt61001.2024.10723921 · Cited by 4
Cheng, Y., Zhang, W., Zheng, T., Cui, E., Ma, X., & Zhang, H. (2025) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2025.3637775 · Cited by 9
Federated Unlearning: Techniques, Trends, and Future Directions
AbdelRaouf, H., & Ibrahem, M. I. (2025) · IEEE International Conference on Computing and Machine Intelligence (ICMI) · doi:10.1109/icmi65310.2025.11141148 · Cited by 4
FedART: A neural model integrating federated learning and adaptive resonance theory
Pateria, S., Subagdja, B., & Tan, A. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106845 · Cited by 5
Unlearning Attacks for Regression Learning
Chen, J., Shi, W., Lin, W., Wang, C., Liu, W., Sun, H., & Liu, G. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3553821 · Cited by 4
Enhancing AI safety of machine unlearning for ensembled models
Ye, H., Guo, J., Liu, Z., Jiang, Y., & Lam, K. (2025) · Applied Soft Computing · doi:10.1016/j.asoc.2025.113011 · Cited by 3
SSFU: Selective Semantic Feature Unlearning for Federated Learning in 6G Internet of Things Systems
Daluwatta, W., Khalil, I., Edirimannage, S., Elvitigala, C., Ng, J. S., & Niyato, D. T. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3625756 · Cited by 4
Federated Unlearning in the Internet of Vehicles
Li, G., Feng, X., Wang, L., Wu, H., & Düdder, B. (2024) · IEEE/IFIP International Conference on Dependable Systems and Networks - Supplemental Volume (DSN-S) · doi:10.1109/dsn-s60304.2024.00034 · Cited by 6
Defending Against AI Threats with a User-Centric Trustworthiness Assessment Framework
Kafali, E., Preuveneers, D., Semertzidis, T., & Daras, P. (2024) · Big Data and Cognitive Computing · doi:10.3390/bdcc8110142 · Cited by 7
Toward Efficient Target-Level Machine Unlearning Based on Essential Graph
Xu, H. Y., Zhu, T., Zhang, L., Zhou, W., & Zhao, W. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3514607 · Cited by 6
Self-citationShao, R., Tang, Y., Yang, L., & Wang, F. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.128612 · Cited by 6
AGU: Adaptive gradient unlearning for efficient machine unlearning
Ghannam, N. E., & Mahareek, E. A. (2025) · Intelligent Systems with Applications · doi:10.1016/j.iswa.2025.200592 · Cited by 3
Federated Knowledge Graph Embedding Unlearning via Diffusion Model
Liu, B., Fang, Y., Wang, X., & Li, X. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-7235-3_18 · Cited by 6
A Novel Scheme for Recommendation Unlearning Verification (RUV) Using Non-Influential Trigger Data
Dang, X., Nanda, P., Xu, H., Mohanty, M., & Deng, H. (2025) · IEEE Consumer Communications and Networking Conference · doi:10.1109/ccnc54725.2025.10976014 · Cited by 2
“Machine unlearning consists of two main methods: data reorganization and model manipulation [18].”
Self-citationAn Efficient Two-Stage Machine Unlearning Framework for Poisoned Specific Emitter Identification
Li, X., Liu, C., Sun, S., Zhou, Z., Zhang, Y., & Li, G. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3583362 · Cited by 5
Vidal, À. P., Nasrollahi, K., Moeslund, T. B., & Escalera, S. (2025) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw67362.2025.00152 · Cited by 2
“While early research focused primarily on classification tasks [28], the rapid growth of generative AI has expanded the scope of MU to concept removal [5, 9, 16].”
Really Unlearned? Verifying Machine Unlearning via Influential Sample Pairs
Xu, H., Zhu, T., Zhang, L., & Zhou, W. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3620308 · Cited by 16
Self-citationGame-Theoretic Machine Unlearning: Mitigating Extra Privacy Leakage
Liu, H., Zhu, T., Zhang, L., & Xiong, P. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3623364 · Cited by 6
Self-citationMachine Unlearning for Speaker-Agnostic Detection of Gender-Based Violence Condition in Speech
Reyner-Fuentes, E., Rituerto-González, E., & Peláez-Moreno, C. (2025) · Applied Sciences · doi:10.3390/app152212270 · Cited by 4
“This direction aligns with emerging trends in ML such as "Machine Unlearning", which aims to erase irrelevant or potentially biased information from model representations [32].”
The Many Faces of Data Deletion: On the Significance and Implications of Deleting Data
Marco-Pérez, I., Pérez, B., Rubio, Á. L., & Zapata, M. A. (2025) · ACM Computing Surveys · doi:10.1145/3779299 · Cited by 5
Detecting Training Data For Large Language Models: A Survey
Yang, C., Li, J., Shulin, L. A. N., Wang, Y., Du, H., Gong, C., Yao, X., Niyato, D. T., & Zhu, L. (2026) · ACM Computing Surveys · doi:10.1145/3779430 · Cited by 3
Graph unlearning: Efficient node removal in graph neural networks
Guan, F., Zhu, T., Wang, Z., Ren, W., & Zhou, W. (2026) · Knowledge-Based Systems · doi:10.1016/j.knosys.2026.116024 · Cited by 3
Self-citationDynaMind: A dynamic learned index for update-intensive workloads
Cheng, J., Wang, Y., Zhu, T., Yang, X., Cui, N., & Li, J. (2026) · Knowledge-Based Systems · doi:10.1016/j.knosys.2026.116357 · Cited by 2
Self-citationRUE: Realising Unlearning from the Perspective of Economics
Tang, M., Wang, W., Zhang, C., & Yu, S. (2023) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom60117.2023.00159 · Cited by 2
“Xu et al. [5] suggested that a balance between the performance of the unlearned model and customers’ privacy is an open question and would benefit both players in the game.”
BackgroundRefining of Learning in Human Decision Making Models: A Simple Step towards Machine Unlearning
Shrivastava, A., & Ahirwal, M. K. (2024) · doi:10.1109/icic3s61846.2024.10603026 · Cited by 2
“Machine unlearning aims to regenerate a model’s behavior as if it were trained without exposure to the unlearned data, while minimizing the time required for this process [17].”
BackgroundMethodInfluentialFUNU: Boosting Machine Unlearning Efficiency by Filtering Unnecessary Unlearning
Li, Z., Ye, Q., & Hu, H. (2025) · International World Wide Web Conference (WWW) · doi:10.1145/3696410.3714711 · Cited by 11
Wen, Y., Zhou, X., Liu, X., Xue, Y., & Bin, C. (2025) · Chinese Journal of Electronics · doi:10.23919/cje.2024.00.219 · Cited by 2
Federated Unlearning With Reinforcement Learning: Adaptive Privacy Preservation for Clients
Gao, K., Zhu, T., Ye, D., Gao, L., & Zhou, W. (2025) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2025.104164 · Cited by 7
Self-citationEFU: Enforcing Federated Unlearning via Functional Encryption
Mohammadi, S., Tsouvalas, V., Symeonidis, I., Balador, A., Özçelebi, T., Flammini, F., & Meratnia, N. (2025) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3746252.3761091 · Cited by 3
When Contrastive Learning Meets Graph Unlearning: Graph Contrastive Unlearning for Link Prediction
Yang, T.-H., & Li, C. (2023) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata59044.2023.10386624 · Cited by 9
“Machine unlearning refers to the systematic process through which a machine learning model forgets or removes specific data or knowledge [15], [20].”
BackgroundFAST: Feature Aware Similarity Thresholding for Weak Unlearning in Black-Box Generative Models
Panda, S., & Prathosh, A. P. (2024) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2024.3499939 · Cited by 7
Simbolon, J. S. O. N., & Gambetta, W. (2024) · IEEE International Conference on Data and Software Engineering (ICoDSE) · doi:10.1109/icodse63307.2024.10829916 · Cited by 1
Enhancing Generative Class Incremental Learning Performance With a Model Forgetting Approach
Togo, T., Togo, R., Maeda, K., Ogawa, T., & Haseyama, M. (2025) · IEEE Open Journal of Signal Processing · doi:10.1109/ojsp.2025.3528900 · Cited by 2
Patient-Centered and Practical Privacy to Support AI for Healthcare
Liu, R., Lee, H. K., Bhavani, S. V., Jiang, X., Lucila Ohno-machado, A., & Xiong, L. (2024) · IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) · doi:10.1109/tps-isa62245.2024.00038 · Cited by 6
Modeling Unlearning and Relearning with Multi-Agent Q-Learning Systems
Solaiman, M., Mui, T., Wang, Q., & Mui, P. (2024) · IEEE International Conference on Cybernetics, Cognition and Machine Learning Applications (ICCCMLA) · doi:10.1109/icccmla63077.2024.10871690 · Cited by 1
“Recently, more attention has been placed in researching how AI models can forget information, which is important in cases such as when AI needs to temporarily use and then forget private data, especially in LLMs [11].”
Selective Forgetting in Task-Progressive Learning Through Machine Unlearning
Karn, R. R., Knechtel, J., & Sinanoglu, O. (2024) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc63072.2024.10935063 · Cited by 2
“Machine unlearning emerges as a key enabler for this selective forgetting capability [8].”
Mitigating Backdoor Attacks Using Activation-Guided Model Editing
Hsieh, F., Nguyen, H. H., MaungMaung, A., Usynin, D., & Echizen, I. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-2641-0_21 · Cited by 2
Trojan Attack on Machine Unlearning: Security Risk of the Right to be Forgotten
Zhang, L., Zhu, T., Xiong, P., & Zhou, W. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3567848 · Cited by 1
Self-citationSurvey on generative visual media detection and security
Duan, J., Liu, S., Guan, J., Jie, C. A. O., & He, R. (2025) · Scientia Sinica Informationis · doi:10.1360/ssi-2024-0354 · Cited by 1
Machine Unlearning: A Comprehensive Framework for Efficient Data Removal in Deep Learning Systems
Rajwade, D., Bhardwaj, V., Vishwakarma, R., Pandey, A. K., Hashmi, S. A. A., & Hashmi, N. A. (2025) · doi:10.38124/ijisrt/25oct892 · Cited by 4
MaxDiv: Zero-Shot Machine Unlearning via Distributionally Divergent Erasing Samples
Shokrolahi, S., & Kim, I.-M. (2025) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2025.3627517 · Cited by 2
FUBA: Backdoor Federated Learning via Federated Unlearning
Sheng, X., Bao, W., Guo, Y., & Fu, S. (2025) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2025.3630110 · Cited by 2
Tackling Sequential Entanglement in Split Unlearning
Etheridge, A., Zhu, M., Liu, X., & Huang, C. (2025) · IEEE International Conference on Multimedia Information Processing and Retrieval (MIPR) · doi:10.1109/mipr67560.2025.00053 · Cited by 2
Hou, J., Finke, A., & Cosma, G. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3639808 · Cited by 2
Selective Forgetting in Machine Learning and Beyond: A Survey
Sha, A. S., Nunes, B. P., & Haller, A. (2026) · ACM Computing Surveys · doi:10.1145/3796542 · Cited by 18
Federated Unlearning via Distilled Data
Mora, A., Valerio, L., & Bellavista, P. (2026) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2026.3666356 · Cited by 4
From Forgetting to Future: A Survey of Machine Unlearning Approaches
Sehgal, S., Verma, A., & Bansal, H. (2026) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.70082 · Cited by 5
Foundation Models for Autonomous Driving Systems: An Initial Roadmap
Wu, X., Cheng, M., Ren, X., Hu, Q., Chen, J., Huang, Y., Cordy, M., Zhang, Y., Xie, X., Ma, L., et al. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3807455 · Cited by 18
CSC: Turning the Adversary’s Poison Against Itself
Shi, Y., Guo, X., Chen, H., Zhu, T., Liu, B., & Zhou, W. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-3015-0_14 · Cited by 1
Self-citationLi, H., & Ping, Y. (2024) · Journal of Cases on Information Technology · doi:10.4018/jcit.335945 · Cited by 1
“As explored by H. Xu et al. (2023), these neighboring data points and labels play a role in adjusting the decision boundary and generating noise to help the target model forget specific data points for privacy protection.”
BackgroundRed-Teaming Segment Anything Model
Jankowski, K., Sobieski, B., Kwiatkowski, M., Szulc, J., Janik, M., Baniecki, H., & Biecek, P. (2024) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw63382.2024.00300 · Cited by 1
Luo, H., Sun, Z., Sun, Y., Li, A., Wang, B., Cao, J. P., & Niu, B. (2024) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2024.3501276 · Cited by 1
A Survey on Privacy Attacks and Defenses in Graph Neural Networks
Luo, L., Wang, R., Huang, H., & Wang, F. (2024) · Information Technology And Control · doi:10.5755/j01.itc.53.4.37737 · Cited by 3
Enhancing Privacy in Machine Unlearning: Posterior Perturbation Against Membership Inference Attack
Chen, C., Liu, H., Chi, H., & Xiong, P. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-1551-3_16 · Cited by 1
A Survey of Challenges and Opportunities in Vertical Federated Unlearning
Tae, H. X., & Chan, C. S. (2025) · IEEE Access · doi:10.1109/access.2025.3600884 · Cited by 4
Digital Privacy Under Attack: Challenges and Enablers
Song, B., Pokhrel, S. R., Deng, M., Lan, Q., Doss, R., Zhu, T., & Li, G. (2025) · ACM Computing Surveys · doi:10.1145/3770853 · Cited by 11
Self-citation
Metadata
- Authors
- Xu, H., Zhu, T., Zhang, L., Zhou, W., & Yu, P. S.
- Affiliations
- University of Technology Sydney (AU)
- City University of Macau (MO)
- University of Illinois Chicago (US)
- Venue
- ACM Computing Surveys
- Published
- 2023-08-28
- Volume
- 56
- Issue
- 1
- Pages
- 1-36
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W4379652910
- Semantic Scholar
- 0813793c140adf6f55b5fcb95ddfb12b8a924121
- Cited by
- 164
- References
- 122
- Citations by year
- 2026: 35 · 2025: 77 · 2024: 46 · 2023: 6
- FWCI
- 14.51
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- ACM Computing Surveys (publishedVersion, other-oa)
- arXiv (Cornell University) (submittedVersion, cc-by)
- arXiv (Cornell University) (cc-by)
- Funders
- Australian Research Council Discovery (DP200100946 and DP230100246)
- NSF (III-1763325, III-1909323, III-2106758, and SaTC-1930941)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Keywords
- machine unlearning, right to be forgotten, privacy, model retraining, privacy-preserving machine learning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-12, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-12 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.