Sensorimotor behaviour from an untrained brain-and-nerve-cord connectome

John R. Minnick; Jesus Gonzalez-Ferrer; Jinghui Geng; Jason K. Eshraghian; Mohammed A. Mostajo-Radji; David Haussler; Mircea Teodorescu

arXiv · 2610.33881

Sensorimotor behaviour from an untrained brain-and-nerve-cord connectome

John R. Minnick·Jesus Gonzalez-Ferrer·Jinghui Geng·Jason K. Eshraghian·Mohammed A. Mostajo-Radji·David Haussler·Mircea Teodorescu

View original source ↗Read source document ↗Export metadata ↓

Abstract

Connectomes now map the neurons and synapses of an adult fly's brain and nerve cord, but how much of behaviour follows from the wiring is unknown. Here we turn one such connectome into a spiking network of 172,433 neurons with a published brain model's untuned parameters, and run it alone and inside a simulated body. Two fixed rules join them: odours and looming objects drive sensory neurons, and motor neurons move the legs. Alone, the network passes a signal to the motor neurons it is known to drive when the pathway supplies about 2% or more of their input. In the body, the fly navigates around obstacles to 95% of the odour sources. A rewiring that keeps each neuron's connection counts and signs reaches 18%, and the fly's leg commands replayed with the senses off reach almost none, so navigation needs the measured wiring and sensory feedback. Dopamine-gated weakening of the mushroom body's output synapses turns approach to an odour into avoidance, which requires the pairing and is odour-specific once one olfactory synapse class is scaled. An untrained connectome thus supports a behaviour and its learned reversal, and the pathways it cannot drive mark what the diagram leaves out.

Explore related subjects

q-bio.NC cs.NE

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

John R. Minnick, Jesus Gonzalez-Ferrer, Jinghui Geng, Jason K. Eshraghian, Mohammed A. Mostajo-Radji, David Haussler, Mircea Teodorescu. 2026-10-24. Sensorimotor behaviour from an untrained brain-and-nerve-cord connectome. https://arxiv.org/abs/2610.33881

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

KEEP EXPLORING

Related papers

arXiv2026

Retrieval-Augmented Parkinson's Disease Classification from Resting-State Functional Connectivity

Altered resting-state functional connectivity (FC) is a candidate marker for the diagnosis of Parkinson's disease (PD). Publicly available PD datasets, however, are small and fragmented across sites, scanners and clinical criteria. Transfer learning mitigates data scarcity by reusing a model trained on larger cohorts, but represents their knowledge primarily through a single set of weights shared by all individuals. Motivated by precision neuroimaging, we propose a retrieval-augmented classification (RAC) framework that additionally places each target individual in the context of similar individuals from external cohorts. A graph convolutional autoencoder (GAE), trained on external PD and control cohorts, encodes these cohorts into a neuro-knowledge base. Each target individual is encoded using the pretrained GAE, and its nearest neighbors are retrieved from the external knowledge base. Their embeddings are combined with the target embedding using mean aggregation or attention for classification. A systematic comparison on the TaoWu cohort separated the contributions of encoder pretraining, retrieval, attention and partial fine-tuning. Pretraining improved mean classification accuracy from 60.5% to 66.0%. However, retrieval and attention did not consistently improve performance over the pretrained-only variants. Several retrieval-based configurations nevertheless showed modestly higher ROC-AUC than the randomly initialized baseline. Varying the number of retrieved neighbors and partially fine-tuning the encoder provided no consistent additional gains. Retrieval-neighborhood analysis further showed diagnostically mixed neighborhoods. These findings provide initial evidence that population-learned representations can be complemented by individual-specific retrieval in neuroimaging, although larger datasets are needed to determine when such contextual information improves classification.

q-bio.NC↗

arXiv2026

Phase response approach to networked neural activity models with delays

Networks of delay-coupled neural mass models alternate between synchrony and anti-phase locking as the delay between brain regions increases. The origin of these delay-dependent bands has remained unclear. Here, we show that a single function, the phase interaction function $H$ of an isolated node, predicts where the bands occur and explains why they repeat. For a Wilson--Cowan model with intra-nodal delay $τ$ and inter-nodal delay $ρ$, we compute the limit cycle and phase response, and hence $H$, by harmonic balance. Each band boundary is a zero of $H'$ shifted by the phase lag $Ωρ$, so the bands repeat in $ρ$ with the oscillation period. Simulations of the full delay-differential networks confirm these predictions, from two nodes, where predicted frequencies agree to second order in the coupling strength, to rings, where the theory also identifies coexisting stable twisted states that random initial conditions rarely reach. At weak coupling, the delays at which synchrony gains or loses stability are set by the node dynamics alone, whereas stable anti-phase states require a bipartite network. For a macaque connectome, metastability peaks at the edges of the synchrony bands, where the stability margin of phase-locking vanishes. The reduction is accurate for coupling strengths well below the slowest Floquet exponent of the node, beyond which a phase--amplitude description is needed. More broadly, vanishing phase-locking stability provides a simple route to metastability in delay-coupled oscillator networks and a candidate mechanism for the flexible coordination of brain dynamics.

q-bio.NC↗

arXiv2026

On the stability of learning

Learning algorithms are usually analyzed under the assumption that informative gradients are continuously available. But this is not always true---learning signals in biological neural networks, for example, may be sparse, local, and only intermittently available at any given synapse. In this work, we show that if gradient information is noisy and only intermittently available, learning may be unstable. In particular, even if average learning dynamics converge to the correct optimum, variance in learning may be asymptotically infinite. We explore this point in a number of analytically tractable settings, including single-layer and multi-layer linear networks, and derive explicit conditions under which learning is stable. These conditions complement, but are conceptually distinct from, existing conditions related to the stability of stochastic gradient descent. Our work demonstrates that unbiased credit assignment is not enough for reliable learning; sufficiently frequent and informative feedback is also required, which yields an additional constraint on models of biologically plausible learning.

q-bio.NC↗