paper-with-me

홈 › Papers

Memoir: Should a Model Write to Its Memory While It Thinks?

2026-07-22 · Jaber Jaber, Osama Jaber arxiv

Memoir combines per-sample fast memory, shared slow parameters, variable-depth latent recurrence, and a future-latent energy objective. We test its riskiest coupling: each pondering iteration may rewrite the fast tier that the same iteration reads. On procedural associative recall with key interference, we compare a coupled arm against an otherwise identical read-only pondering arm. Both arms contain 81,738 parameters, including 76,362 trainable parameters, and use matched declared forward multiply-accumulate counts, data, optimizer, schedule, and seeds. After 240 training steps across 12 seeds, coupled recall is 0.5203 with a 95 percent interval of [0.4522, 0.5883], while read-only recall is 0.6557 with [0.5953, 0.7160]. The arms are paired per seed, and the read-only lead of 0.1354 gives a paired t of 3.23 on 11 degrees of freedom with a 95 percent interval of [0.0431, 0.2277] on the difference, winning on 10 of 12 seeds. After 960 steps across 8 seeds, both arms reach 1.0000, so the measured effect is a learning-speed penalty at a fixed budget, not a demonstrated capability penalty. That longer control is ceiling limited, leaving convergence on a non-saturating task unmeasured. A predicted failure in which memory rewriting corrupts the energy signal did not occur: the energy margin grew and held. Kernel restructuring also reduced delta-rule forward time from 0.907 ms to 0.351 ms on the stated device. Code and evidence are available at https://github.com/RightNow-AI/Memoir

📄 PDF Abstract BibTeX arXiv:2607.20792

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

MEMOIR: Lifelong Model Editing with Minimal Overwrite and Informed Retention for LLMs

2025-06-09 · Ke Wang, Yiming Qin, Nikolaos Dimitriadis, Alessandro Favero 외

Language models deployed in real-world systems often require post-hoc updates to incorporate new or corrected knowledge. However, editing such models efficiently and reliably - without retraining or forgetting previous i…

HallucinationModel EditingOut-of-Distribution GeneralizationQuestion Answering

Memory-Guided Tree Search with Cross-Branch Knowledge Transfer for LLM Solver Synthesis

2026-05-17 · Fatemeh Haji, Javier Delarosa Quiros, Peyman Najafirad arxiv

Combinatorial optimization (CO) underlies decision-making from logistics to chip design, where infeasible solutions are operationally unusable and small quality gains translate into substantial economic value. Recent wor…

Erase-then-Delta Attention: Decoupling Erase and Write Addresses in Delta-Rule Linear Attention

2026-06-25 · Xiao Li, Chengruidong Zhang, Hao Luo, Xi Lin 외 arxiv

Delta-rule linear attention improves recurrent memory updates by correcting what is already stored at the current write address before writing new content. However, the active correction is still anchored to that same wr…

MeMoir: A Software-Driven Covert Channel based on Memory Usage

2024-09-20 · Jeferson Gonzalez-Gomez, Jose Alejandro Ibarra-Campos, Jesus Yamir Sandoval-Morales, Lars Bauer 외

Covert channel attacks have been continuously studied as severe threats to modern computing systems. Software-based covert channels are a typically hard-to-detect branch of these attacks, since they leverage virtual reso…

Dream to Recall: Imagination-Guided Experience Retrieval for Memory-Persistent Vision-and-Language Navigation

2025-10-09 · Yunzhe Xu, Yiyuan Pan, Zhe Liu arxiv

Vision-and-Language Navigation (VLN) requires agents to follow natural language instructions through environments, with memory-persistent variants demanding progressive improvement through accumulated experience. Existin…