Skip to content
Review

Can an AI Assistant Really Forget? Auditable Deletion from Addressable Memory

Jul 2026 · 4 citations · 23 references
Computer Science

TL;DR

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, as well as evaluating separately for each record.

Abstract

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.

View source

Similar papers

#machine learning Preprint Sep 2026

Positions Are Not Facts: The Mismatch Between KV Caches and Memory

This work identifies what must be preserved beyond the replaced value when using a KV cache as updatable memory and recovers distinctions missed by fixed cache similarities on synthetic record pairs.

Chang-Hai Zhou, Yu-Hua Zhou, Shi-Yang Zhang et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Knowing the Store: What a Memory Backend Must Write Down Before an Agent Can Read It

An agent with long-term memory can answer from a record it should no longer use, such as a plan the user later cancelled. We ask what a memory store must expose for an agent to know this before retrieving anything, and we score that judgment on its own, as metamemory monitoring. Readers see only a value-free summary: r...

Ansuman Mullick, Eray Tüzün · 0 citations
#artificial intelligence Preprint Sep 2026

Does Your Agent's Memory Survive a Model Upgrade? A Controlled Study of Memory Portability

Model upgrades are routine; memory migrations are not. An agent can keep the same memory store and still forget: a new model may interpret old notes differently, mixed embedding versions may break retrieval, and repair may fail without the original evidence. We compare memory as the same history is preserved verbatim f...

Ankit Goyal, Jaideep Ray · 1 citation
Preprint Aug 2026

Total Recall at What Cost? Benchmarking the Serving Cost of Agentic Memory Systems

A break-even analysis shows that whether -- and when -- a memory system becomes cheaper to serve than the full transcript is highly sensitive to the system and the backbone, from the first tens of turns for the cheapest to never within 400 turns for the most expensive.

Natchanon Pollertlam, Witchayut Kornsuwannawit · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.