Searcharxiv⌕ Search

arXiv · 2610.25424

Small-scale neural simulation of Caenorhabditis elegans on Loihi-2 using NeuroML2Loihi

Abstract

Neural simulation is an essential methodology for studying biological nervous systems, but it remains limited by the computational costs of repeatedly updating neural and synaptic states over many timesteps. Neuromorphic hardware is a promising substrate for this class of workloads because such devices combine event-driven execution, localized memory, and spike-based communication. However, neuromorphic \textit{software} remains comparatively fragmented and difficult to integrate with the model-description standards used by the computational neuroscience community. This disconnect limits reproducible experimentation and makes direct comparison between conventional and neuromorphic simulation workflows difficult. This paper introduces ``NeuroML2Loihi'', an open-source framework for translating NeuroML model descriptions into Loihi~2-deployable Lava primitives, enabling standardized biological models to be executed on Intel's Loihi~2 neuromorphic chip. We evaluate our framework using c302-derived \textit{C. elegans} neural models across three connectome-scale configurations. Cross-platform similarity is assessed using spike-train and voltage-trace metrics, while latency, power, and energy consumption are benchmarked against the conventional reference workflow. Across the evaluated models, Loihi~2 execution enabled through NeuroML2Loihi achieves 514--1211$\times$ lower latency and a 1.8--1.9$\times$ reduction in mean wattage relative to the NEURON reference, producing substantially lower total energy consumption primarily through reduced execution time. These results demonstrate that standards-based neuromorphic neural simulation is feasible on Loihi~2 and can support meaningful comparison against established computational neuroscience workflows.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Danny Rosen, Ramashish Gaurav, Yang Yi. 2026-10-18. Small-scale neural simulation of Caenorhabditis elegans on Loihi-2 using NeuroML2Loihi. https://arxiv.org/abs/2610.25424

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

One-shot learning of paired association navigation with biologically plausible schemas

After learning a multiple paired-association (MPA) navigation task, rodents can rapidly learn new cue-location associations after a single exposure, a phenomenon proposed to be facilitated by cognitive schemas. However, it remains unclear what schemas support this behavior and how they could be implemented in biological neural circuits. Here, we identify a set of schemas sufficient for gradual then one-shot paired-association navigation, and implement them in a fully neural agent using biologically plausible plasticity rules. The agent gradually acquires a low-dimensional spatial metric representation using a path-integration based temporal-difference error, enabling self-localization across different environments. It also contains a memory network that forms one-shot associations between sensory cues and goal locations, implemented using reward-modulated exploratory Hebbian (EH) plasticity. A third network performs vector subtraction between the agent's current and goal location to compute goal-directed actions. Supplementing these schemas with an actor-critic enables one-shot navigation past obstacles. Lastly, learning a working-memory gating mechanism using the temporal-difference error enables one-shot learning even with brief cue and distractor presentation. The model reproduces key behavioral features of rodent learning in the MPA task and generates testable predictions about the neural mechanisms underlying schema-based one-shot learning.

cs.NE↗

Reinforced Linear Genetic Programming

Linear Genetic Programming (LGP) is a powerful technique that allows for a variety of problems to be solved using a linear representation of programs. However, there still exists some limitations to the technique, such as the need for humans to explicitly map registers to actions. This thesis proposes a novel approach that uses Q-Learning on top of LGP, Reinforced Linear Genetic Programming (RLGP) to learn the optimal register-action assignments. In doing so, we introduce a new framework "linear-gp" written in memory-safe Rust that allows for extensive experimentation for future works.

cs.NE↗

Predator-Prey Model: Driven Hunt for Accelerated Grokking

A machine learning method is proposed using two agents (representing two coupled replicas of the model parameters) that simulate the biological behavior of a predator and a prey. In this method, the two agents interact with each other via a pair of potentials that simulate the dynamics when the predator chases the prey while the prey runs away from the predator - to perform an optimization on the landscape. This method allows, for optimization landscapes with narrow ravines with gentle slope or even flat bottoms, to avoid optimization getting stuck in a ravine. For some examples of grokking (i.e., delayed generalization) problems we show that this method allows for achieving up to a hundred times faster learning in gradient evaluations and up to 60 times in the wall-clock time compared to the standard learning procedure.

cs.NE↗