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

• URL: http://arxiv.org/abs/2607.20792v1
• Date: Wed, 22 Jul 2026 23:34:56 GMT
• Title: Memoir: Should a Model Write to Its Memory While It Thinks?
• Abstract summary: Memoir combines per-sample fast memory, shared slow parameters, variable-depth latent recurrence, and a future-latent energy objective.<n>We compare a coupled arm against an otherwise identical read-only pondering arm.<n>A predicted failure in which memory rewriting corrupts the energy signal did not occur.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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

Related papers

• Clean Engineering, Unstable Measurement: A Preregistered Reliability Failure of Black-Box LLM Observers on Shared Endpoints [4.41537705949485]
  Language-model judges now gate training data, score generations, and drive leaderboards.<n>We audited that assumption in two preregistered campaigns with every threshold fixed in advance.<n>Across 52,988 audited request attempts, same-window repeat rankings agreed at Spearman 0.400 against a required 0.90.<n>We distill the evidence into a three-level snapshot-identity ladder, eight design rules, and a reporting checklist.
  arXiv  Detail & Related papers  (2026-09-03T17:59:43Z)
• Shortcut Before Circuit: Document Statistics Time In-Context Conflict Resolution [0.0]
  We train transformers on a synthetic language where recency and rarity are exactly coextensive.<n>We separate them with a minimal causal edit that inverts one cue while holding the truth, token count and answer position fixed.
  arXiv  Detail & Related papers  (2026-08-25T12:09:19Z)
• The Recall Trap: A Recall-Maximizing Retriever Configuration Reduces Issue Resolution in Fixed-Budget Code Context [45.88028371034407]
  We report a controlled case study in code repair, not a new phenomenon.<n>We toggle one flag (one-chunk-perfile deduplication) on an otherwise identical stack.<n>We map where it holds: it reverses on a lexical BM25 (3.2pp, significant cross-paradigm interaction)<n>We show that at a tight fixed budget, do not hard-deduplicate by file, and A/B packing policies against the task, not the metric flag was tuned.
  arXiv  Detail & Related papers  (2026-08-14T19:22:50Z)
• Omega-S: A Functional Resilience Index for LLM Fine-Tuning [0.0]
  Fine-tuning a large language model degrades what it previously learned.<n>We present Omega-S, a drop-in penalty computed from the weight matrix alone.<n>It is three lines in an existing training loop and adds under 4% to the cost of a step.
  arXiv  Detail & Related papers  (2026-08-04T16:22:30Z)
• Voice Memory for Agentic Speech Recognition [66.69623133635868]
  We present Voice Memory, a inference-only scheme for agentic speech recognition.<n>Asynchronously, a score-gated example revises that file through bounded edits.<n>Across ten HyPoradise domains with an open corrector, Voice Memory, weighted word error rate from 8.36% to 7.52%.
  arXiv  Detail & Related papers  (2026-07-29T02:42:56Z)
• Operational Proto-Introspection in Looped Language Models: Process-Quality Taps, Executable Branching, and the Readout-Control Boundary [0.0]
  We test two questions in a frozen 2.6B looped transformer, Ouro-RLTT.<n>Can a language model read the quality of ongoing computation, and can an external intervention turn that readout into better outcomes?<n>We build branch/carry/prune machinery over Ouro's 192-slot recurrent cache.
  arXiv  Detail & Related papers  (2026-07-20T22:40:36Z)
• Forgetful Attention: A Trainable Support-Vector Memory with Certified Selection and Exact Unlearning [0.16921396880325776]
  We introduce Support Vector Attention (SV-Attention), a memory whose weights are support coefficients of a one-class Sfp with fixed box parameter C.<n>Its active-set partition gives reserve tokens exactly zero weight, output weights; a incremental incremental solver token to recover the state produced by retraining without it under the same C.<n>We also demonstrate surgical eviction, exact editing, patient-record deletion, and a forgettable retrieval memory over real sentence embeddings.
  arXiv  Detail & Related papers  (2026-07-13T23:13:57Z)
• AgenticSTS: A Bounded-Memory Testbed for Long-Horizon LLM Agents [34.450981549319266]
  Memory for a long-horizon LLM agent is a contract about what each future decision is allowed to see.<n>We instrument an alternative bounded contract: every decision is made from a fresh user message assembled by typed retrieval.<n>We instantiate the contract in Slay the Spire 2, a closed-rule deck-building game.
  arXiv  Detail & Related papers  (2026-07-02T14:44:32Z)
• What Spatial Memory Must Store: Occlusion as the Test for Language-Agent Memory [0.0]
  Language-agent "memory palace" systems anchor each memory to a world coordinate, on the intuition that geometry adds something text cannot.<n>We make that intuition testable and report three results.
  arXiv  Detail & Related papers  (2026-06-09T01:34:18Z)
• Echo-Memory: A Controlled Study of Memory in Action World Models [58.77172260403133]
  We present a controlled study of memory mechanisms in action-conditioned world models.<n>Existing memory designs are hard to compare because gains are entangled with backbone, training, retrieval, and evaluation differences.<n>We use Echo-Memory to fix the action-to-video interface and varies only how history is stored and read by the generator.
  arXiv  Detail & Related papers  (2026-06-08T17:54:10Z)
• Distributional Energy-Based Models for Uncertainty-Aware Structured LLM Reasoning [40.342912574072024]
  Large Language Models produce structured outputs such as travel plans or code solutions.<n>Individual reasoning steps may appear correct while the output as a whole violates budgets, fails test cases, or contradicts earlier deductions.<n>We propose a learned quality scorer with deterministic analytical constraint penalties for verifying structured LLM outputs.
  arXiv  Detail & Related papers  (2026-05-15T17:08:27Z)
• KernelBenchX: A Comprehensive Benchmark for Evaluating LLM-Generated GPU Kernels [41.03500441875287]
  LLM-based Triton kernel generation has attracted significant interest, yet a fundamental empirical question remains unanswered.<n>We present KernelBenchX, a benchmark designed to answer this question through category-aware evaluation of correctness and hardware efficiency.
  arXiv  Detail & Related papers  (2026-05-06T14:18:36Z)
• ZenBrain: A Neuroscience-Inspired 7-Layer Memory Architecture for Autonomous AI Systems [51.56484100374058]
  On LongMemEval-500, ZenBrain matches a long-context oracle's binary-judge accuracy to within 4.5 pp.<n> ZenBrain is a 7-layer neuroscience-inspired memory architecture.
  arXiv  Detail & Related papers  (2026-04-26T20:39:19Z)
• When to Forget: A Memory Governance Primitive [0.0]
  Memory Worth is a two-counter per-memory signal that tracks how often a memory co-occurs with successful versus failed outcomes.<n>We prove that MW converges almost surely to the conditional success probability p+(m) = Pr[y_t = +1 | m in M_t] under a stationary retrieval regime.<n>We argue this is still a useful operational signal for memory governance, and we validate it empirically in a controlled synthetic environment.
  arXiv  Detail & Related papers  (2026-04-13T19:54:14Z)
• ImplicitMemBench: Measuring Unconscious Behavioral Adaptation in Large Language Models [60.14219417402433]
  Existing memory benchmarks for LLM agents evaluate explicit recall of facts, yet overlook implicit memory where experience becomes automated behavior without conscious retrieval.<n>We introduce ImplicitMemBench, the first systematic benchmark evaluating implicit memory through three constructs drawn from standard cognitive-science accounts of non-declarative memory.<n>Our 300-item suite employs a unified Learning/Priming-Interfere-Test protocol with first-attempt scoring.
  arXiv  Detail & Related papers  (2026-04-09T10:26:32Z)
• Sparse Regression under Correlation and Weak Signals: A Reproducible Benchmark of Classical and Bayesian Methods [1.6679662639178268]
  We benchmark six sparse regression methods on synthetic data.<n>Bayesian methods win on prediction error (MSE 72 vs. 108-267), and the Horseshoe delivers near-nominal 95% coverage (94.8%)<n>For variable selection, Lasso and Spike-and-Slab tie at F1 0.47, making Lasso the practical default when posteriors are not needed.
  arXiv  Detail & Related papers  (2026-04-04T15:46:44Z)
• Compact Memory for Continual Logistic Regression [45.6774409797545]
  We present a new method to build compact memory for logistic regression.<n>Our approach can drastically improve accuracy compared to Experience Replay.<n>Our work opens a new direction for building compact memory that can also be useful in the future for continual deep learning.
  arXiv  Detail & Related papers  (2025-11-12T10:05:06Z)
• Prune Spatio-temporal Tokens by Semantic-aware Temporal Accumulation [89.88214896713846]
  STA score considers two critical factors: temporal redundancy and semantic importance. We apply the STA module to off-the-shelf video Transformers and Videowins. Results: Kinetics-400 and Something-Something V2 achieve 30% overshelf reduction with a negligible 0.2% accuracy drop.
  arXiv  Detail & Related papers  (2023-08-08T19:38:15Z)
• Towards Certified Robustness of Distance Metric Learning [53.96113074344632]
  We advocate imposing an adversarial margin in the input space so as to improve the generalization and robustness of metric learning algorithms. We show that the enlarged margin is beneficial to the generalization ability by using the theoretical technique of algorithmic robustness.
  arXiv  Detail & Related papers  (2020-06-10T16:51:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.