Can an AI Assistant Really Forget? Auditable Deletion from Addressable Memory
Not on the map. Why?
Abstract (arXiv)
An assistant can stop repeating a fact without removing it from memory. To study this difference, we install a support-vector gate in frozen Gemma 3 and record which stored keys and values belong to each exchange. A deletion request excludes the exchange's rows from the long-range readout and recalculates the gate on what remains. We check this operation against an independent refit, then compare it with running the model again on the conversation without the exchange. This second comparison matters because the exchange may already have influenced surviving memory rows. At 4B, the gated model passed checks for recall and feasible deletion on the same six of eight records admitted by the base model, at a perplexity cost under 2%. Admission fell at the smaller and larger checkpoints with the same configuration. The edited memory agreed closely with the local refit on the registered probes, and the model disclosed fewer deleted answers than when simply instructed to forget. However, an attack evaluated separately for each record could still distinguish edited memory from memory that never stored the record. Excluding an exchange's own rows therefore provides a way to edit and audit conversation memory, while leaving a measurable difference from rebuilding it without that exchange. Additional paired studies found no update-speed advantage for the current FP32 proxy and retained-answer matching below half in every tested condition.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 17 of its 23 references that are in the map. First posted on arXiv 30 Jul 2026.
Builds on
17 of 23 references.
References · 17
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
- 2019Machine Unlearningcited by 1,061
- 2021Membership Inference Attacks From First Principlescited by 878
- 2024LongMemEval: Benchmarking Chat Assistants on Long-Term Interactive Memorycited by 707
- 2024TOFU: A Task of Fictitious Unlearning for LLMscited by 533
- 2024The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearningcited by 509
- 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearningcited by 504
- 2024MUSE: Machine Unlearning Six-Way Evaluation for Language Modelscited by 261
- 2023In-Context Unlearning: Language Models as Few Shot Unlearnerscited by 224
- 2024Eight Methods to Evaluate Robust Unlearning in LLMscited by 163
- 2024Unlearning or Obfuscating? Jogging the Memory of Unlearned LLMs via Benign Relearningcited by 84
- 2024Position: LLM Unlearning Benchmarks are Weak Measures of Progresscited by 63
5 more
- 2025Unlearning Isn't Deletion: Investigating Reversibility of Machine Unlearning in LLMscited by 42
- 2025Leak@k: Unlearning Does Not Make LLMs Forget Under Probabilistic Decodingcited by 9
- 2025Unlearned but Not Forgotten: Data Extraction after Exact Unlearning in LLMcited by 5
- 2026Models Designed to Forget: Machine Unlearning via Key Deletioncited by 3
- 2026What a Deletion Certificate Covers, and Where It Expires: Auditable Removal from a Support-Vector Memorycited by 2
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Aborted but Not Forgotten: KV-Cache Retention Breaks Rollback Consistency in Language Agentscited by 0
- 2026Exact Record Omission in Delta Attention: A Transport Criterion, Its Cost, and a Replay Certificatecited by 0
- 2026Memory as a cache: Exact context reuse and deletion by constructioncited by 0
- 2026Memory as a cache: Exact context reuse and deletion by construction26 Sep 2026
- 2026Exact Record Omission in Delta Attention: A Transport Criterion, Its Cost, and a Replay Certificate6 Sep 2026
- 2026Aborted but Not Forgotten: KV-Cache Retention Breaks Rollback Consistency in Language Agents16 Aug 2026