paper-with-me

Papers

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

2025-12-09 · Mohammad M Maheri, Sunil Cotterill, Alex Davidson, Hamed Haddadi 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.

📄 PDF Abstract BibTeX arXiv:2512.09953

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Efficient Knowledge Graph Unlearning with Zeroth-order Information

2025-08-19 · Yang Xiao, Ruimeng Ye, Bohan Liu, Xiaolong Ma 외 arxiv

Due to regulations like the Right to be Forgotten, there is growing demand for removing training data and its influence from models. Since full retraining is costly, various machine unlearning methods have been proposed.…

Knowledge Graphs

APEX$^2$: Adaptive and Extreme Summarization for Personalized Knowledge Graphs

2024-12-23 · Zihao Li, Dongqi Fu, Mengting Ai, Jingrui He

Knowledge graphs (KGs), which store an extensive number of relational facts, serve various applications. Recently, personalized knowledge graphs (PKGs) have emerged as a solution to optimize storage costs by customizing …

Extreme SummarizationKnowledge Graphs

Verifiable Unlearning on Edge

2025-06-24 · Mohammad M Maheri, Alex Davidson, Hamed Haddadi

Machine learning providers commonly distribute global models to edge devices, which subsequently personalize these models using local data. However, issues such as copyright infringements, biases, or regulatory requireme…

Machine UnlearningPrivacy PreservingSNARKS

PPU-Bench:Real World Benchmark for Personalized Partial Unlearning in Vision Language Models

2026-05-09 · Jiahui Guang, Zexun Zhan, Zhenlin Xu, Cuiyun Gao 외 arxiv

Multimodal Large Language Models (MLLMs) may memorize sensitive cross-modal information during pretraining. However, existing MLLM unlearning benchmarks rely on synthetic knowledge injection or complete subject-level del…

COREKG: Coreset-Guided Personalized Summarization of Knowledge Graphs

2026-05-14 · Sohel Aman Khan, Raghava Mutharaju, Supratim Shit arxiv

Knowledge Graphs (KGs) are extensively used across different domains and in several applications. Often, these KGs are very large in size. Such KGs become unwieldy for tasks such as question answering and visualization. …

Question AnsweringKnowledge Graphs