Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 7

The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.

TruVRF: Toward Triple-Granularity Verification on Machine Unlearning

Zhou, Chunyi, Gao, Yansong, Fu, Anmin, Chen, Kai, Zhang, Zhi, Xue, Minhui, Dai, Zhiyang, Ji, Shouling, Zhang, Yuqing·2025·IEEE Transactions on Information Forensics and Security

Abstract

The right to be forgotten has incentivized machine unlearning, but a key challenge persists: the lack of reliable methods to verify unlearning conducted by model providers. This gap facilitates dishonest model providers to deceive data contributors. Current approaches often rely on invasive methods like backdoor injection. However, it poses security concerns and is also inapplicable to legacy data—already released data. To tackle this challenge, this work initializes the first non-invasive unlearning verification framework which operates at triple-granularity (class-, volume-, sample-level) to assess the data facticity and volume integrity of machine unlearning. In this paper, we propose a framework, named TruVRF, encompasses three Unlearning-Metrics, each tailored to counter different types of dishonest model providers or servers (Neglecting Server, Lazy Server, Deceiving Server). TruVRF leverages non-invasive model sensitivity to enable multi-granularity verification of unlearning. Specifically, Unlearning-Metric-I checks if the removed class matches the data contributor’s unlearning request, Unlearning-Metric-II measures the amount of unlearned data, and Unlearning-Metric-III validates the correspondence of a specific unlearned sample with the requested deletion. We conducted extensive evaluations of TruVRF efficacy across three datasets, and notably, we also evaluated the effectiveness and computational overhead of TruVRF in real-world applications for the face recognition dataset. Our experimental results demonstrate that TruVRF achieves robust verification performance: Unlearning-Metric-I and -III achieve over 90% verification accuracy on average against dishonest servers, while Unlearning-Metric-II maintains an inference deviation within 4.8% to 8.2%. Additionally, TruVRF demonstrates generalizability across diverse conditions, including varying numbers of unlearned classes and sample volumes. Significantly, TruVRF is applied to two state-of-theart unlearning frameworks: SISA [3] (presented at Oakland’21) and Amnesiac Unlearning [18], representing exact and approximate unlearning methods, respectively, which affirm TruVRF’s practicality. In addition, we conducted extensive evaluations around TruVRF, including ablation experiments, trade-offs in computational overhead, and the robustness of model sensitivity, among others.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tifs.2025.3565991

Cites

36 of 36 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 36 references

Research works printed but not linked: 20

  1. 2019, Personal Information Protection and Electronic Documents Act
  2. Du, 2024, SoK: Dataset copyright auditing in machine learning systems, arXiv:2410.16618 · arXiv
  3. Du, SoK: Dataset copyright auditing in machine learning systems, 25
  4. Eisenhofer, Verifiable and provably secure machine unlearning
  5. Gao, 2020, Backdoor attacks and countermeasures on deep learning: A comprehensive review, arXiv:2007.10760 · arXiv
  6. Guo, Certified data removal from machine learning models, 3832
  7. Izzo, Approximate data deletion from machine learning models, 2008
  8. 2025, Kaggle Datasets
  9. Li, Anti-backdoor learning: Training clean models on poisoned data, 34, 14900
  10. Neel, Descent-to-delete: Gradient-based methods for machine unlearning, 931
  11. General Data Protection Regulation
  12. 2025, Amazon Data Exchange
  13. Shumailov, Manipulating SGD with data ordering attacks, 18021
  14. 2020, California Privacy Rights Act
  15. Tang, Demon in the variant: Statistical analysis of DNNs for robust backdoor contamination detection, 1541
  16. Wang, Training with more confidence: Mitigating injected and natural backdoors during training, 35, 36396
  17. Wu, DeltaGrad: Rapid retraining of machine learning models, 10355
  18. Xiao, 2017, Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms, arXiv:1708.07747 · arXiv
  19. Zhang, Verification of machine unlearning is fragile
  20. Zhang, Prompt certified machine unlearning with randomized gradient smoothing and quantization, 13433

Cited by

See all 7

Metadata

Authors
Zhou, C., Gao, Y., Fu, A., Chen, K., Zhang, Z., Xue, M., Dai, Z., Ji, S., & Zhang, Y.
Affiliations
  • College of Computer Science and Technology, Zhejiang University, Hangzhou, China
  • School of Computer Science and Software Engineering, The University of Western Australia, Perth, WA, Australia
  • College of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, China
  • Chinese Academy of Sciences, Beijing, China
  • Data61, CSIRO, Sydney, NSW, Australia
  • School of Cyber Science and Engineering, Nanjing University of Science and Technology, Nanjing, China
  • National Computer Network Intrusion Protection Center, University of Chinese Academy of Sciences, Beijing, China
Venue
IEEE Transactions on Information Forensics and Security
Published
2025
Volume
20
Pages
4844-4859
ISSN
  • 1556-6013
  • 1556-6021
Cited by
7
References
36
Funders
  • National Natural Science Foundation of China (2022YFB3102100, U24A20336, 62372236, 62172243, 62402425, 62402418)
  • NSFC-Yeqisun Science Foundation (U244120033)
  • China Postdoctoral Science Foundation (2024M762829)
  • Open Foundation of the State~Key Laboratory of Integrated Services Networks (ISN24-15)
  • Qing Lan Project of Jiangsu Province
  • Natural Science Foundation of Zhejiang Province (LD24F020002)
  • Zhejiang Provincial Priority- Funded Postdoctoral Research Project (ZJ2024001)

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.

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: TruVRF: Toward Triple-Granularity Verification on Machine Unlearning. https://app.cochat.ai/papers/10.1109/tifs.2025.3565991
The paper
Zhou, C., Gao, Y., Fu, A., Chen, K., Zhang, Z., Xue, M., Dai, Z., Ji, S., & Zhang, Y. (2025). TruVRF: Toward Triple-Granularity Verification on Machine Unlearning. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2025.3565991

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.