The Von-Neumann State-Space Transformer for neural decoding
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 13 references that are in the map. First posted on arXiv 25 Aug 2026.
Builds on
11 of 13 references.
References · 11
- 2017Attention Is All You Needcited by 60,361
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
- 2020GLU Variants Improve Transformercited by 1,804
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2021Neural Latents Benchmark '21: Evaluating latent variable models of neural population activitycited by 60
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Generalizable, real-time neural decoding with hybrid state-space models
- 2025Change of Thought: Adaptive Test-Time Computation
- 2026Neural Spectral Capacity: Measuring and Designing Architectures from Network Specification Alone
- 2025Compressed Computation: Dense Circuits in a Toy Model of the Universal-AND Problem
- 2026The Recurrent Transformer: Greater Effective Depth and Efficient Decoding
- 2026Sparse Transformer: a Controlled Testbed for Mechanistic Interpretability
- 2025Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding
- 2026An explicit operator explains end-to-end computation in the modern neural networks used for sequence and language modeling