Persistent Memory Through Triple-Loop Consolidation in a Non-Gradient Dissipative Cognitive Architecture

• URL: http://arxiv.org/abs/2603.27188v1
• Date: Sat, 28 Mar 2026 08:29:48 GMT
• Title: Persistent Memory Through Triple-Loop Consolidation in a Non-Gradient Dissipative Cognitive Architecture
• Abstract summary: We introduce Deep Memory, a non-gradient persistent memory mechanism operating through a triple-loop consolidation cycle.<n>We demonstrate that discrete expert routing via Mixture-of-Experts (MoE) gating is a causal prerequisite for DM.<n>These results establish DM as a falsifiable mechanism for persistent memory in non-gradient cognitive systems, with functional parallels to hippocampal consolidation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dissipative cognitive architectures maintain computation through continuous energy expenditure, where units that exhaust their energy are stochastically replaced with fresh random state. This creates a fundamental challenge: how can persistent, context-specific memory survive when all learnable state is periodically destroyed? Existing memory mechanisms -- including elastic weight consolidation, synaptic intelligence, and surprise-driven gating -- rely on gradient computation and are inapplicable to non-gradient dissipative systems. We introduce Deep Memory (DM), a non-gradient persistent memory mechanism operating through a triple-loop consolidation cycle: (1) recording of expert-specific content centroids, (2) seeding of replaced units with stored representations, and (3) stabilization through continuous re-entry. We demonstrate that discrete expert routing via Mixture-of-Experts (MoE) gating is a causal prerequisite for DM, preventing centroid convergence that would render stored memories identical. Across ${\sim}970$ simulation runs spanning thirteen experimental blocks: (i) discrete routing is causally necessary for specialization ($\text{MI}=1.10$ vs. $0.001$; $n=91$); (ii) DM achieves $R=0.984$ vs. $0.385$ without memory ($n=16$); (iii) continuous seeding reconstructs representations after interference ($R_\mathrm{recon}=0.978$; one-shot fails; $n=30$); (iv) the mechanism operates within a characterized $(K,p)$ envelope ($n=350$); (v) recording $\times$ seeding is the minimal critical dyad ($n=40$); (vi) DM outperforms non-gradient baselines (Hopfield, ESN) under matched turnover ($n=370$). These results establish DM as a falsifiable mechanism for persistent memory in non-gradient cognitive systems, with functional parallels to hippocampal consolidation.

Related papers

• SANE: State Anomaly Neutralization for Stable Extreme-Context Delta-Rule Models [53.86918766240095]
  Delta-Rule recurrent models maintain a fixed-size state, enabling $O(1)$ inference memory but potentially becoming unstable under extreme-context extrapolation.<n>We propose textbfState Anomaly Neutralization (SANE), which applies adaptive $tanh$ compression at chunk boundaries while preserving the intra-chunk parallel structure.
  arXiv  Detail & Related papers  (2026-08-23T10:41:07Z)
• Thermodynamics of Learning: A Typed Four-Component Accounting of Memory, Fit, and Value [0.0]
  We show that what a finite learning device has recorded and what will hold value for it on future tasks are not the same quantity.<n>We develop a typed accounting for finite-state learning devices that separates four components: a training-side fit functional $_mathrmfit$, the record-correlation stock $J_D=I(M;D)$, an update-side search ledger $_M$, and an operational capital value $V(M;T,b)$.
  arXiv  Detail & Related papers  (2026-08-13T03:52:23Z)
• Caching for the Future: Scrub Jay Episodic Memory Principles for Agent Memory Systems [5.321970297768025]
  Existing memory architectures treat all memories as equally persistent and systematically contaminate retrieved context with outdated facts.<n>We show that per-memory, type-conditioned temporal decay, can be operationalized as an auto-classified coefficient $_i$ in an external LLM-agent memory store.<n>We introduce the Temporal Generalization Test (TGT), a benchmark with held-out retention intervals and a Generalization Gap (GenGap) metric.
  arXiv  Detail & Related papers  (2026-08-05T12:12:44Z)
• Robust Dreamer: Deviation-Aware Latent Gaussian Memory for Action-Controlled AR Video Generation [89.70897512515477]
  Action-controlled image-to-video generation is a promising paradigm for interactive world simulation, where each control signal should elicit an immediate visual response.<n>Maintaining visual fidelity and 3D consistency over long autoregressive rollouts remains challenging.<n>Existing 3D-aware methods often suffer from catastrophic drift due to two impediments: information loss from textitLatent--RGB Cycling, and the training--inference gap induced by the textiterror-free hypothesis.<n>We present textbfRobust Dreamer, a memory-augmented framework built around how to
  arXiv  Detail & Related papers  (2026-05-29T05:21:33Z)
• 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)
• Temporal Memory for Resource-Constrained Agents: Continual Learning via Stochastic Compress-Add-Smooth [0.0]
  An agent that operates sequentially must incorporate new experience without forgetting old experience, under a fixed memory budget.<n>We propose a framework in which memory is not a parameter vector but a process: a Diffusion Bridge on a replay interval.<n>The framework provides a fully analytical Ising model'' of continual learning in which the mechanism, rate, and form of forgetting can be studied with mathematical precision.
  arXiv  Detail & Related papers  (2026-03-31T12:04:11Z)
• Inhibitory Cross-Talk Enables Functional Lateralization in Attention-Coupled Latent Memory [0.0]
  We present a memory-augmented transformer in which attention serves simultaneously as a retrieval, consolidation, and write-back operator.<n>We partition the memory into lateralized left and right banks coupled through a sign-controlled cross-talk matrix $W_s$, and show that the sign of this coupling is decisive for specialization.
  arXiv  Detail & Related papers  (2026-02-27T08:58:51Z)
• Body-Reservoir Governance in Repeated Games: Embodied Decision-Making, Dynamic Sentinel Adaptation, and Complexity-Regularized Optimization [0.0]
  We propose a three-layer Body-Reservoir Governance architecture.<n> Strategy complexity cost is defined as the KL divergence between the reservoir's state distribution and its habituated baseline.<n>Body governance reduces this cost, with action variance decreasing up to $1600times$ with dimension $d$.<n>Overriding the body incurs thermodynamic cost proportional to internal state distortion.
  arXiv  Detail & Related papers  (2026-02-24T12:36:41Z)
• Dynamic Large Concept Models: Latent Reasoning in an Adaptive Semantic Space [56.37266873329401]
  Large Language Models (LLMs) apply uniform computation to all tokens, despite language exhibiting highly non-uniform information density.<n>We propose $textbfDynamic Large Concept Models (DLCM)$, a hierarchical language modeling framework that learns semantic boundaries from latent representations and shifts from tokens to a compressed concept space where reasoning is more efficient.
  arXiv  Detail & Related papers  (2025-12-31T04:19:33Z)
• Remember Me, Refine Me: A Dynamic Procedural Memory Framework for Experience-Driven Agent Evolution [52.76038908826961]
  We propose $textbfReMe$ ($textitRemember Me, Refine Me$) to bridge the gap between static storage and dynamic reasoning.<n>ReMe innovates across the memory lifecycle via three mechanisms: $textitmulti-faceted distillation$, which extracts fine-grained experiences.<n>Experiments on BFCL-V3 and AppWorld demonstrate that ReMe establishes a new state-of-the-art in agent memory system.
  arXiv  Detail & Related papers  (2025-12-11T14:40:01Z)
• INC: An Indirect Neural Corrector for Auto-Regressive Hybrid PDE Solvers [61.84396402100827]
  We propose the Indirect Neural Corrector ($mathrmINC$), which integrates learned corrections into the governing equations.<n>$mathrmINC$ reduces the error amplification on the order of $t-1 + L$, where $t$ is the timestep and $L$ the Lipschitz constant.<n>We test $mathrmINC$ in extensive benchmarks, covering numerous differentiable solvers, neural backbones, and test cases ranging from a 1D chaotic system to 3D turbulence.
  arXiv  Detail & Related papers  (2025-11-16T20:14:28Z)
• Comprehensive Validation of Replica Symmetry Breaking via Quantum Annealing: From Ground States to Topological Collapse [0.0]
  We extend Giorgio Parisi's exact solution of the Sherrington-Kirkpatrick spin glass to 4000 spins.<n>We probe both the emergence and breakdown of replica symmetry breaking.<n>This comprehensive validation establishes quantum advantage for probing fundamental statistical mechanics in complex systems.
  arXiv  Detail & Related papers  (2025-11-09T14:33:22Z)
• The Reflexive Integrated Information Unit: A Differentiable Primitive for Artificial Consciousness [0.0]
  We introduce the Reflexive Integrated Information Unit (RIIU), a recurrent cell that augments its hidden state $h$ with two additional vectors.<n>A sliding-window covariance and a differentiable Auto-$Phi$ surrogate let each RIIU maximize local information integration online.<n>In an eight-way Grid-world, a four-layer RIIU agent restores $>90%$ reward within 13 steps after actuator failure, twice as fast as a parameter-matched GRU.
  arXiv  Detail & Related papers  (2025-06-15T14:07:59Z)
• Topology-aware Embedding Memory for Continual Learning on Expanding Networks [63.35819388164267]
  We present a framework to tackle the memory explosion problem using memory replay techniques. PDGNNs with Topology-aware Embedding Memory (TEM) significantly outperform state-of-the-art techniques.
  arXiv  Detail & Related papers  (2024-01-24T03:03:17Z)

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.