arXiv Machine Learning By Arnol Manuel Fokam, Fasseu Sieyondji Akpevwoghene, Edem Fiifi Dawson

How Temporal Correlations Shape Memory in Linear Recurrent Neural Networks

Read the original on arXiv Machine Learning →

The paper analyzes how temporal correlations in input sequences affect memory formation in linear recurrent neural networks (LRNNs). By solving the learning dynamics for correlated inputs, it shows that correlation introduces a cost to retaining past information, reshaping the learning trajectory and reducing the network’s memory of past inputs. Key findings include a correlation‑dependent threshold for memory retention, the influence of input similarity on memory usefulness, and the emergence of a feedthrough path when zero error is required.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Nov 6

How Finite Brains Generalize Without Bound: Spatial Memory as a Universal Computer

The paper argues that finite brains generalize to arbitrarily long inputs by using spatial memory that grows with input size while the learner’s observations remain finite. It proposes that this memory is structured as cycles—grid modules, place cells, and hippocampal indices—controlled by a prefrontal system that never directly observes the cycles. Experiments show a neural network trained on strings up to 40 symbols achieves high accuracy on longer sequences, outperforming LSTMs and Transformers on several benchmarks and correctly reversing strings up to 15,015 symbols.

By Yuhang He, Si Wu
arXiv AI
Oct 16

Learning to Read Out: Unembedding Dynamics in Language Model Pretraining

The paper investigates when a language model actually learns task information versus when its readout (unembedding matrix) learns to express that information. Using a new parameter‑trajectory cross‑coding method, the authors find that hidden states can encode task data early in training, but the readout reorganizes only in a narrow window (0.4–1.1% of Pythia’s pretraining). By varying the readout learning rate, they show that faster readout learning reduces the gap between hidden‑state encoding and output expression without affecting final performance.

By Matteo He, William F. Shen, Alex Iacob, Andrej Jovanovic, Xinchi Qiu, Nicholas D. Lane
arXiv AI
Sep 1

On the Plasticity Collapse in Continual Machine Unlearning

The paper investigates continual machine unlearning, where models must forget data over time. It identifies a fundamental issue called plasticity collapse, where successive unlearning requests cause geometric constraints that saturate parameter space, leading to two failure modes: forward failure (reduced forgetting quality) and backward failure (re‑memorization). Experiments across architectures and datasets confirm that plasticity collapse is a pervasive problem in continual unlearning.

By Yingdan Shi, Xiang Xu, Kaize Ding, Alfred O. Hero, Ren Wang