paper-with-me

홈 › Papers

Kathleen Remembers: Length-Invariant One-Shot Recall Without Attention

2026-08-31 · George Fountzoulas arxiv

Recurrent, attention-free sequence models share a structural weakness: a fading state cannot perform exact recall of something seen once, far in the past. We add to the Kathleen trunk a second memory layer -- a "notebook": a fixed-key holographic (HRR) associative store with a learned local write gate, a self-gating raw read, and write-triggered forgetting -- 25K parameters that attach to the logits of any trunk. (1) Mechanism: on a controlled needle-in-haystack task the notebook reaches 80-82% one-shot recall at 4x the training length, where the bare trunk scores ~4% and a parameter-matched attention head scores 100% inside its training length and 0% beyond it. Addressing is length-invariant by construction; the untrained memory alone recalls at 90% accuracy identically at 512, 2048 and 4096 bytes. Because the store is a linear superposition, two capabilities follow from arithmetic alone: selective unlearning (one subtraction erases one fact to chance, retained facts unharmed) and per-token attribution (counterfactual erasure names the source fact of every correct byte, 100% provenance). (2) Real text: on WikiText-2 bytes the notebook improves prediction of repeated rare words by +0.15-0.27 bits/byte, the gain growing with the distance between mentions and holding zero-shot at 4x training length; write-triggered forgetting eliminates memory pollution at 8x length (first-mention cost +0.33 -> -0.004). (3) Scope and scale: a parameter-matched attention head does generalize on natural-text repetition, so the notebook's claim is exact recall at O(L); on a WikiText-103 ladder (8 to 512 MB) the zero-shot repeat gain rises monotonically. All experiments are pre-registered, seeds reported, and reproducible on a single free-tier GPU.

📄 PDF Abstract BibTeX arXiv:2608.30376

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Kathleen: Oscillator-Based Byte-Level Text Classification Without Tokenization or Attention

2026-04-09 · George Fountzoulas arxiv

We present Kathleen, a text classification architecture that operates directly on raw UTF-8 bytes using frequency-domain processing -- requiring no tokenizer, no attention mechanism, and under 470K parameters. Kathleen i…

Text Classification

Random Tree Model of Meaningful Memory

2024-12-02 · Weishun Zhong, Tankut Can, Antonis Georgiou, Ilya Shnayderman 외

Traditional studies of memory for meaningful narratives focus on specific stories and their semantic structures but do not address common quantitative features of recall across different narratives. We introduce a statis…

modelSentence

How LoRA Remembers? A Parametric Memory Law for LLM Finetuning

2026-05-28 · Ziwen Xu, Haiwen Hong, Linsong Yu, Benglei Cui 외 arxiv

Large Language Models (LLMs) must continuously learn and update knowledge to remain effective in dynamic real-world environments. While Low-Rank Adaptation (LoRA) is widely used for such memory updates, existing studies …

Operationalizing Linguistic Methods through Prompt-Engineering Skills: An Automatic Chinese Web Neologism Detection Pipeline

2026-06-07 · Yufeng Wu, Meichun Liu arxiv

We present a method for automatic Chinese web neologism detection that operationalizes traditional linguistic identification principles as prompt-engineering skills. The method has four stages: tokenizer-independent char…

Samba: Simple Hybrid State Space Models for Efficient Unlimited Context Language Modeling

2024-06-11 · Liliang Ren, Yang Liu, Yadong Lu, Yelong Shen 외

Efficiently modeling sequences with infinite context length has long been a challenging problem. Previous approaches have either suffered from quadratic computational complexity or limited extrapolation ability in length…

4kLanguage ModelingLanguage ModellingMamba+2