cs.LGMar 31, 2026

Temporal Memory for Resource-Constrained Agents: Continual Learning via Stochastic Compress-Add-Smooth

Authors: Michael Chertkov

Organizations: Graduate Inter-Disciplinary Program in Applied Mathematics, & Department of Mathematics, University Arizona, Tucson, AZ 85721

Abstract

An agent that operates sequentially must incorporate new experience without forgetting old experience, under a fixed memory budget. We propose a framework in which memory is not a parameter vector but a stochastic process: a Bridge Diffusion on a replay interval [0,1][0,1], whose terminal marginal encodes the present and whose intermediate marginals encode the past. New experience is incorporated via a three-step Compress--Add--Smooth (CAS) recursion. We test the framework on the class of models with marginal probability densities modeled via Gaussian mixtures of fixed number of components~KK in dd dimensions; temporal complexity is controlled by a fixed number~LL of piecewise-linear protocol segments whose nodes store Gaussian-mixture states. The entire recursion costs O(LKd2)O(LKd^2) flops per day -- no backpropagation, no stored data, no neural networks -- making it viable for controller-light hardware. Forgetting in this framework arises not from parameter interference but from lossy temporal compression: the re-approximation of a finer protocol by a coarser one under a fixed segment budget. We find that the retention half-life scales linearly as a1/2≈c La_{1/2}\approx c\,L with a constant c>1c>1 that depends on the dynamics but not on the mixture complexity~KK, the dimension~dd, or the geometry of the target family. The constant~cc admits an information-theoretic interpretation analogous to the Shannon channel capacity. The stochastic process underlying the bridge provides temporally coherent movie'' replay -- compressed narratives of the agent's history, demonstrated visually on an MNIST latent-space illustration. 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.

Figures & tables

Explore similar work

CardsList
  1. Drift and Dependence: Layer-wise Information-Theoretic Bounds for Replay-Based Continual Learning

    Aug 12, 2026Tieliang Gong, Zhongbo Zhang, Wen Wen +1Information-Theoretic Generalization BoundsReplay-Based Continual Learning

  2. Position: Modular Memory is the Key to Continual Learning Agents

    Mar 2, 2026Vaggelis Dorovatas, Malte Schwerin, Andrew D. Bagdanov +21Continual Learning for LLM AgentsMemory-Augmented Agents

  3. Adaptive Memory Crystallization for Autonomous AI Agent Learning in Dynamic Environments

    Apr 2, 2026Rajat Khanda, Mohammad Baqar, Sambuddha Chakrabarti +1Continual LearningMemory-Augmented Agents