Skip to content

The Von-Neumann State-Space Transformer for neural decoding

Aug 2026 · 0 citations · 13 references
Computer Science Biology

TL;DR

A von-Neumann inspired hypothesis of efficient computation as an alternative for neural decoding, a memory-augmented Transformer whose feed-forward block is a low-rank instruction bank: a shared base operator plus a small set of learned low-rank instructions, from which a per-token code synthesizes the weight matrix actually used at that token.

Abstract

Cortical computation is strikingly low-dimensional: a handful of latent variables, carried in a neural population's activity, steer the higher-dimensional responses of individual neurons. Our aim is sample efficiency-models that decode well from limited data and at small parameter budgets. In a standard Transformer layer, the feed-forward block applies the same operator to every token. We suggest a von-Neumann inspired hypothesis of efficient computation as an alternative for neural decoding: a controller decodes an instruction and then executes a token-specific operator; the usual realization-a soft mixture of experts-only blends their outputs, not operators. We introduce a von-Neumann State-Space Transformer (VN-SST), a memory-augmented Transformer whose feed-forward block is a low-rank instruction bank: a shared base operator plus a small set of learned low-rank instructions, from which a per-token code synthesizes the weight matrix actually used at that token. The code is read from a low- dimensional projection of a carried state-space memory, so a slow latent trajectory acts as an instruction pointer-mirroring how low-dimensional dynamics may route cortical computation. On three motor-cortex neural-decoding benchmarks, VN-SST is far more data-efficient than a modern Transformer, each jointly predicting spikes and decoding behavior. This model wins by a wide margin on the scarcest benchmark, leads on the other two, and turns longer context into rising rather than falling accuracy. We evaluated that the network compresses a large instruction bank to a few bits per token, so program capacity acts as a control channel, not an accuracy lever. The same model is also more parameter-efficient on two small text benchmarks used for language modeling (LLMs), suggesting a generic mechanism.

View source

Similar papers

Preprint Aug 2026

Low-Complexity Recurrent Neural Network Detector for Faster-than-Nyquist Signaling

This study proposes a low-complexity, bidirectional, single-pass Elman recurrent neural network detector for binary phase-shift keying signals transmitted with faster-than-Nyquist signaling. Since the faster-than-Nyquist intersymbol interference has a short, finite memory, the classical Elman recurrent neural network,...

Nurettin Safak, Osman Tokluoğlu, E. Çavuş · 0 citations
Jul 2026

The Art of Not Forgetting

We introduce CMP (Cognitive Memory Primitive), an architecture that represents inputs as sparse relational codes, stores them in a two-tier competitive memory, and learns entirely through local, gradient-free updates, with no backpropagation anywhere in the network. We use this architecture to test a specific hypothesi...

Ashmith Atmuri, Akshay Kumar, Yashaswini Rao Bhogarajula · 0 citations
Jul 2026

Sparse Inter-Layer Dependencies of Transformer FFN Neurons

A training-free attribution method that estimates the relative influence of upstream neurons and attention outputs on a target neuron's activation and identifies candidate sparse pathways with potential implications for efficient inference is introduced.

Johannes Knittel, Hanspeter Pfister · 0 citations
Preprint Aug 2026

BASC : Behavior-Aligned Quantization and Pruning for Low-Bit Spiking Neural Networks

Extensive experiments on static and neuromorphic benchmarks show that lower-bit BASC models match or outperform higher-bit baselines and retain this accuracy advantage after structured pruning, while further reducing model storage and synaptic operations.

Linliang Chen, Yan Zhong, Xin Liu et al. · 0 citations
Preprint Aug 2026

An Embedded RISC-V Evaluation of Kolmogorov--Arnold Networks in Hard-Constrained Recurrent Physics-Informed Models

Results indicate that the parameter efficiency reported for KANs does not transfer to deployment cost on scalar embedded cores, and that an MLP residual branch is the more dependable default for embedded HRPINN deployment unless specific quantization co-design is used.

Enzo Nicolás Spotorno, J. Leal · 0 citations
Open access Aug 2026

Artificial neural manifolds

An artificial neural manifold based on Mott memristors is constructed, enabling accurate and robust prediction while reducing the number of required samples, and a memory factor is introduced to modify the STI equation, which improves prediction accuracy and robustness.

Rui Wang, Guo-Lei Liu, Sai-Sai Wang et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.