paper-with-me

홈 › Papers

Auditing Forgetting in Limited Memory Language Models

2026-07-01 · Arya Raeesi, Hanna Roed arxiv

Limited Memory Language Models (LMLMs) externalize factual knowledge to a database to enable deletion-based unlearning without retraining. Existing evaluations measure post-deletion correctness in aggregate and cannot tell whether a deleted fact persists through residual parametric memory, alternative retrieval paths, or near-neighbor retrieval artifacts. We propose a causal auditing framework that holds the model fixed and varies the database state at inference time across three interventions: FULL, DEL-ON, and DEL-OFF. The framework decomposes post-deletion behavior into parametric leakage L(f), retrieval-mediated correctness R(f), and a retrieval artifact rate grounded in the inference-time retrieval trace. We apply it to 12,228 alias-closure deletions across thirteen databases, including four adversarial topologies (Base, Alias, Noise, Collision) we construct in three domains, and six prompt formulations. Parametric leakage is near zero in every variant and every prompt style: the model rarely returns the deleted answer in the absence of retrieval. The residual that does survive lives in the retrieval graph: retrieval-mediated correctness and the retrieval artifact rate match within rounding everywhere, so post-deletion correctness is, in our audit, predominantly reconstituted from near-neighbor retrieval. This residual ranges from 0.7% on the released LMLM database to 13.6% on the most adversarial variant, and prompt formulation does not independently control how much of a deleted fact survives. These results suggest that, for this class of LMLM and deletion procedure, the unlearning boundary is drawn primarily by the database administrator rather than by the model.

📄 PDF Abstract BibTeX arXiv:2607.00605

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Is Agent Memory a Database? Rethinking Data Foundations for Long-Term AI Agent Memory

2026-05-25 · Abdelghny Orogat, Essam Mansour arxiv

Long-running AI agents need persistent memory. Memory supports learning across sessions, reduces repeated context injection, and enables auditing of past decisions. Current agent memory systems and database paradigms tre…

SCM: Sleep-Consolidated Memory with Algorithmic Forgetting for Large Language Models

2026-04-22 · Saish Sachin Shinde arxiv

We present SCM (Sleep-Consolidated Memory), a research preview of a memory architecture for large language models that draws on neuroscientific principles to address a fundamental limitation in current systems: the absen…

MedCL-Bench: Benchmarking stability-efficiency trade-offs and scaling in biomedical continual learning

2026-03-17 · Min Zeng, Shuang Zhou, Zaifu Zhan, Rui Zhang arxiv

Medical language models must be updated as evidence and terminology evolve, yet sequential updating can trigger catastrophic forgetting. Although biomedical NLP has many static benchmarks, no unified, task-diverse benchm…

Continual Learning

SMI: Statistical Membership Inference for Reliable Unlearned Model Auditing

2026-02-01 · Jialong Sun, Zeming Wei, Jiaxuan Zou, Jiacheng Gong 외 arxiv

Machine unlearning (MU) is essential for enforcing the right to be forgotten in machine learning systems. A key challenge of MU is how to reliably audit whether a model has truly forgotten specified training data. Member…

Online Limited Memory Neural-Linear Bandits with Likelihood Matching

2021-02-07 · Ofir Nabati, Tom Zahavy, Shie Mannor

We study neural-linear bandits for solving problems where {\em both} exploration and representation learning play an important role. Neural-linear bandits harnesses the representation power of Deep Neural Networks (DNNs)…

Efficient ExplorationMulti-Armed BanditsRepresentation Learning