arXiv Machine Learning
Jul 31
Subtract or Replay? Exact Deletion from Language-Model Memory
arXiv:2607. 27539v1 Announce Type: new Abstract: Exact deletion from persistent language-model memory depends on how that memory represents a record.
Subtract, Transport, or Replay? Auditable Deletion from Language-Model Memory
arXiv:2607. 27539v2 Announce Type: replace Abstract: Exact deletion from persistent language-model memory depends on whether a record's effect remains addressable after later computation.
Related stories
arXiv Machine Learning
Sep 10
Exact Record Omission in Delta Attention: A Transport Criterion, Its Cost, and a Replay Certificate
arXiv:2609.06872v1 Announce Type: new Abstract: When a user asks an assistant to forget a record, the test is whether the memory now matches the state it would hold if the record had never been store...
arXiv Computation and Language
Sep 23
LatentPort: Beyond KV Cache - Cross-Model Transfer of Recurrent Memory in Hybrid Language Models: A 4B-to-9B Hybrid-State Handoff Without Target Prefix Replay
The paper introduces LatentPort, a method that allows a language model to transfer its live memory to another model without requiring the receiver to reread the context. Experiments on a Qwen3.5 4B-to-9B sibling pair show that adding a Gated DeltaNet (GDN) persistent-state package reduces negative log‑likelihood by 0.747 nats/token and improves performance across 64 PG19 documents. The study also demonstrates that direct recurrent and convolution reuse outperforms learned GDN maps, and a 434,176‑parameter correction further narrows the performance gap to the native 9B model.
arXiv Machine Learning
Aug 6
Forgetful Attention: An Auditable Support-Vector Memory for Selective Retention and Verified Deletion
arXiv:2607. 12204v2 Announce Type: replace Abstract: Auditable memory requires a precise contract: which output is preserved, relative to which reference solve, and across which updates.
arXiv AI
Sep 7
Forgetting Without Restarting: Execution-State Unlearning for Stateful LLM Agents
arXiv:2609. 04875v1 Announce Type: cross Abstract: Long-running LLM agents are stateful: beyond the transcript they accrete compressed summaries, plaintext memory, pending tool plans, and, under every serving API, a KV cache.
arXiv AI
Aug 12
From Faulty Memories to Corrected Actions: Dependency-Guided Rollback Repair for Memory-Augmented Agents
arXiv:2608. 10502v1 Announce Type: new Abstract: Persistent memory lets language-model agents reuse information across sessions, but it also makes errors durable: a poisoned, stale, or misattributed record can alter reasoning, tool use, answers, and subsequent memory writes.
arXiv Machine Learning
Jul 15
Forgetful Attention: A Trainable Support-Vector Memory with Certified Selection and Exact Unlearning
arXiv:2607. 12204v1 Announce Type: new Abstract: Attention can be viewed as an online learner over context, yet existing test-time memories cannot certify that dropping a token leaves outputs unchanged or delete its influence outright.
arXiv AI
Jul 24
SR-TTT Does Not Learn Retrieval: A Correction and Mechanistic Post-Mortem of Surprisal-Aware Residual Test-Time Training
arXiv:2603. 06642v2 Announce Type: replace-cross Abstract: Test-Time Training (TTT) language models replace the KV-cache with fast weights updated during inference, achieving O(1) memory but suffering catastrophic failure on exact-recall tasks.
arXiv Machine Learning
Aug 13
MMLA: How Memory Lets the Past Shape the Future
arXiv:2606. 28876v3 Announce Type: replace-cross Abstract: Proposal.
arXiv Machine Learning
Sep 10
Can an AI Assistant Really Forget? Auditable Deletion from Addressable Memory
This paper introduces a deletion interface for a pretrained language model, measuring how effectively deleted records are removed from the model’s memory. By retrofitting a support‑vector memory gate into the global attention layers of a frozen Gemma 3, the authors show that deletions can be performed without altering weights and that the resulting state is close to a reference state that never stored the record. Experiments on 4B‑parameter models demonstrate low perplexity impact and strong evidence that deleted content is hard to recover, while larger or smaller models fail to achieve the same guarantees.
arXiv AI
Sep 1
DASC: Decay-Aware State Compression for Hybrid Linear-Attention Serving
arXiv:2608.30386v1 Announce Type: cross Abstract: Hybrid linear-attention architectures have recently scaled to large open-weight models, offering quality competitive with full attention while substa...
arXiv Machine Learning
Aug 24
Nothing Changed but the Model: CellFill -- Bounded In-Cell Learning for Bit-Identical, Revocable Updates to Quantized LLMs
arXiv:2608.20873v1 Announce Type: new Abstract: Every way of teaching a deployed language model something new -- full fine-tuning, adapter merging, model editing -- replaces the released checkpoint,...