mlsanityData to 14 Oct 2026

ZK-APEX: Zero-Knowledge Approximate Personalized Unlearning with Executable Proofs

arXiv 2512.09953 ↗First posted 9 Dec 2025cs.CR cs.AI cs.LGcited by 2

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

Machine unlearning aims to remove the influence of specific data points from a trained model to satisfy privacy, copyright, and safety requirements. In real deployments, providers distribute a global model to many edge devices, where each client personalizes the model using private data. When a deletion request is issued, clients may ignore it or falsely claim compliance, and providers cannot check their parameters or data. This makes verification difficult, especially because personalized models must forget the targeted samples while preserving local utility, and verification must remain lightweight on edge devices. We introduce ZK APEX, a zero-shot personalized unlearning method that operates directly on the personalized model without retraining. ZK APEX combines sparse masking on the provider side with a small Group OBS compensation step on the client side, using a blockwise empirical Fisher matrix to create a curvature-aware update designed for low overhead. Paired with Halo2 zero-knowledge proofs, it enables the provider to verify that the correct unlearning transformation was applied without revealing any private data or personalized parameters. On Vision Transformer classification tasks, ZK APEX recovers nearly all personalization accuracy while effectively removing the targeted information. Applied to the OPT125M generative model trained on code data, it recovers around seventy percent of the original accuracy. Proof generation for the ViT case completes in about two hours, more than ten million times faster than retraining-based checks, with less than one gigabyte of memory use and proof sizes around four hundred megabytes. These results show the first practical framework for verifiable personalized unlearning on edge devices.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 49 of its 74 references that are in the map. First posted on arXiv 9 Dec 2025.

Builds on

49 of 74 references.

Closest ancestors · 20

Same direction, newest first

  1. 2025WARP: Weight Teleportation for Attack-Resilient Unlearning Protocols29 Nov
  2. 2024Edge Unlearning is Not "on Edge"! An Adaptive Exact Unlearning System on Resource-Constrained Devices14 Oct
  3. 2024Dissecting Fine-Tuning Unlearning in Large Language Models9 Oct
  4. 2024TruVRF: Towards Triple-Granularity Verification on Machine Unlearning12 Aug
  5. 2024Verification of Machine Unlearning is Fragile1 Aug
  6. 2024Revisiting Machine Unlearning with Dimensional Alignment25 Jul
  7. 2024Machine Unlearning: Taxonomy, Metrics, Applications, Challenges, and Prospects13 Mar
  8. 2024Challenging Forgets: Unveiling the Worst-Case Forget Sets in Machine Unlearning12 Mar
  9. 2024Dissecting Language Models: Machine Unlearning via Selective Pruning2 Mar
  10. 2023SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation19 Oct
  11. 2023Split Unlearning21 Aug
  12. 2023Model Sparsity Can Simplify Machine Unlearning11 Apr
8 more
  1. 2023Towards Unbounded Machine Unlearning20 Feb
  2. 2022Proof of Unlearning: Definitions and Instantiation20 Oct
  3. 2022Verifiable and Provably Secure Machine Unlearning17 Oct
  4. 2022A Survey of Machine Unlearning6 Sep
  5. 2022Can Bad Teaching Induce Forgetting? Unlearning in Deep Networks using an Incompetent Teacher17 May
  6. 2022Zero-Shot Machine Unlearning14 Jan
  7. 2021On the Necessity of Auditable Algorithmic Definitions for Machine Unlearning22 Oct
  8. 2021Unrolling SGD: Understanding Factors Influencing Machine Unlearning27 Sep

Other references · 29

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  4. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  5. 2019Machine Unlearningcited by 1,061
  6. 2022AdaptFormer: Adapting Vision Transformers for Scalable Visual Recognitioncited by 719
  7. 2018Federated Learning for Mobile Keyboard Predictioncited by 572
  8. 2020Amnesiac Machine Learningcited by 319
  9. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
  10. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 221
  11. 2020Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observationscited by 180
  12. 2019Stolen Memories: Leveraging Model Memorization for Calibrated White-Box Membership Inferencecited by 175
17 more
  1. 2022Reconstructing Training Data with Informed Adversariescited by 148
  2. 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
  3. 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
  4. 2020Neuron Shapley: Discovering the Responsible Neuronscited by 98
  5. 2021Federated Reconstruction: Partially Local Federated Learningcited by 79
  6. 2019The Generalization-Stability Tradeoff In Neural Network Pruningcited by 54
  7. 2024zkLLM: Zero Knowledge Proofs for Large Language Modelscited by 51
  8. 2022VeriFi: Towards Verifiable Federated Unlearningcited by 46
  9. 2022Scaling up Trustless DNN Inference with Zero-Knowledge Proofscited by 31
  10. 2025Apple Intelligence Foundation Language Models: Tech Report 2025cited by 28
  11. 2022pvCNN: Privacy-Preserving and Verifiable Convolutional Neural Network Testingcited by 20
  12. 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Modelscited by 20
  13. 2023zkDL: Efficient Zero-Knowledge Proofs of Deep Learning Trainingcited by 20
  14. 2024Trustless Audits without Revealing Data or Modelscited by 15
  15. 2025TeleSparse: Practical Privacy-Preserving Verification of Deep Neural Networkscited by 9
  16. 2024Communication-Efficient Personalized Federated Learning for Speech-to-Text Taskscited by 8
  17. 2025Confidential Guardian: Cryptographically Prohibiting the Abuse of Model Abstentioncited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Verifiable Unlearning on Edge
  2. 2025zkUnlearner: A Zero-Knowledge Framework for Verifiable Unlearning with Multi-Granularity and Forgery-Resistance
  3. 2026Models Designed to Forget: Machine Unlearning via Key Deletion
  4. 2025NOVO: Unlearning-Compliant Vision Transformers
  5. 2026EVE: Efficient Verification of Data Erasure through Customized Perturbation in Approximate Unlearning
  6. 2024Machine Unlearning with Minimal Gradient Dependence for High Unlearning Ratios
  7. 2026Reference-Guided Machine Unlearning
  8. 2025LetheViT: Selective Machine Unlearning for Vision Transformers via Attention-Guided Contrastive Learning