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

TL;DR
This paper introduces a memory framework for sequential agents that uses a stochastic process called Bridge Diffusion, enabling continual learning with fixed memory and no neural networks, suitable for resource-constrained hardware.
Contribution
It proposes a novel stochastic process-based memory model with a Compress--Add--Smooth recursion, allowing efficient, neural network-free continual learning.
Findings
Memory retention half-life scales linearly with the number of protocol segments L.
The framework operates with $O(LKd^2)$ flops per day, no backpropagation or stored data.
It provides a mathematically precise model of forgetting and replay in continual learning.
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 , whose terminal marginal encodes the present and whose intermediate marginals encode the past. New experience is incorporated via a three-step \emph{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~ in dimensions; temporal complexity is controlled by a fixed number~ of piecewise-linear protocol segments whose nodes store Gaussian-mixture states. The entire recursion costs flops per day -- no backpropagation, no stored data, no neural networks -- making it viable for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
