Prompt Attacks Reveal Superficial Knowledge Removal in Unlearning Methods
원문 초록
In this work, we show that some machine unlearning methods may fail when subjected to straightforward prompt attacks. We systematically evaluate eight unlearning techniques across three model families, and employ output-based, logit-based, and probe analysis to determine to what extent supposedly unlearned knowledge can be retrieved. While methods like RMU and TAR demonstrate robust unlearning, ELM remains vulnerable to specific prompt attacks (e.g., Hindi filler text in original prompt recovering 57.3% accuracy). Our logit analysis also confirms that unlearned models are generally not hiding knowledge by modifying the way the answer is formatted, as the correlation between output and logit accuracy is strong. These results challenge prevailing assumptions about unlearning effectiveness and highlight the need for evaluation frameworks that can reliably distinguish between true knowledge removal and superficial output suppression. We also publicly make available our evaluation framework to easily evaluate prompting techniques to retrieve unlearning knowledge.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Model State Arithmetic for Machine Unlearning
Rectifying Privacy and Efficacy Measurements in Machine Unlearning: A New Inference Attack Perspective
Membership Inference Attacks as Privacy Tools: Reliability, Disparity and Ensemble
Unlearning Isn't Invisible: Detecting Unlearning Traces in LLMs from Model Outputs
Robust LLM Unlearning with MUDMAN: Meta-Unlearning with Disruption Masking And Normalization
Apollo: A Posteriori Label-Only Membership Inference Attack Towards Machine Unlearning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.