Skip to content

URCHIN: A Horizontal Spiking Language Model for Data-Constrained Pretraining

Sep 2026 · 0 citations · 30 references
Biology Computer Science

TL;DR

URCHIN (Unified Recurrent Connectome with Horizontal Integrate-and-fire Neurons), which applies the Parallelized Hierarchical Connectome Spiking State-space Model (PHCSSM) to language modeling and offers a biologically plausible, efficient, and directly deployable reference point.

Abstract

The BabyLM challenge measures how much language a model can learn from developmentally-plausible, child-scale data rather than internet-scale corpora, yet prior language models forgo the biological constraints of the neural circuitry that acquires human language: spiking neurons separated into excitatory and inhibitory populations wired by a recurrent lateral connectome. This paper presents URCHIN (Unified Recurrent Connectome with Horizontal Integrate-and-fire Neurons), which applies the Parallelized Hierarchical Connectome Spiking State-space Model (PHCSSM) to language modeling: leaky integrate-and-fire neurons coupled by a Dale's-law lateral connectome resolve each token through a multi-transmission loop that recirculates activity to a fixed point. The instantiation is deliberately minimal: a single horizontal layer of 128 neurons, no attention, and 4.23M parameters. Two implementations share one set of weights and produce identical benchmark scores, so URCHIN is trained once and deployed either way with no conversion step: a parallel state-space model (SSM) scan that is GPU-efficient for training, or an event-driven recurrent spiking neural network (RSNN) with constant-cost inference for CPU or neuromorphic edge deployment. Across all three BabyLM tracks (Strict-100M, Strict-Small, and Multilingual), URCHIN offers a biologically plausible, efficient, and directly deployable reference point.

View source

Similar papers

#natural language process... Preprint Sep 2026

Large Language Models with At Most One Spike per Neuron

This work constructs a fully TTFS-based SNN architecture and train it end-to-end, and introduces a reference-based strategy specifically to encode the four core LLM components: embedding layers, layer normalization, attention-related operations and dropout.

Zhuo-Ya Zhao, Parsa Omidi, A. Jafari et al. · 0 citations
Review Sep 2026

From silicon to synapse: Why the artificial unit is not a kind of neuron.

The computational units of large language models (LLMs)-artificial neurons, attention heads, and weight matrices-differ from biological neurons not merely in degree but in kind. This paper develops that empirical argument across three levels of biological organization: the single neuron, the local circuit, and whole-br...

Madhur Mangalam · 0 citations
Open access Oct 2026

A dual-time-scale cooperative memory mechanism for spiking neural networks.

Spiking neural networks (SNNs), as core models of brain-inspired computing, simulate the computational mechanisms of biological neural systems. However, existing models lack the division of labor and collaboration mechanisms found in biological fast and slow neural populations, making it difficult for single-timescale...

Jun-Xiu Liu, Zhao-Xin Zhang, Qiang Fu et al. · 0 citations
#small language model Preprint Aug 2026

The Von-Neumann State-Space Transformer for neural decoding

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 ac...

Morteza Sarafyazd · 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.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

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