SearcharxivSearch

arXiv · 2509.24852

DelRec: learning delays in recurrent spiking neural networks

Abstract

Biological neurons transmit information with stereotyped electrical impulses called ``spikes'', sensitive to coincident timings. Spiking Neural Networks (SNNs), introduced in the nineties, have gained popularity in AI for their energy efficiency and competitive performance with deep learning. Among them, Recurrent SNNs (RSNNs) are particularly appealing for their ability to learn long-term dependencies and exhibit rich dynamics. In SNNs, each connection can have a weight and a transmission delay, both plastic in the brain. While theory has long suggested that trainable delays enhance a network's expressivity, practical learning methods emerged only recently and remain mostly limited to feedforward delays. Here, we introduce DelRec, the first method to jointly optimize recurrent delays with synaptic weights in RSNNs via surrogate gradient learning, compatible with any spiking neuron model. DelRec works in discrete time, leveraging differentiable interpolation to handle non-integer delays with well-defined gradients at training time. Using simple neurons, DelRec outperforms all baselines on a chaotic time-series prediction task, and achieves competitive performance on four challenging temporal datasets. Analysis of trained networks show that recurrent delay optimization builds structured, depth-dependent spatio-temporal receptive fields that the network actively exploits, with delay-weight joint optimization reshaping temporal selectivity. Beyond accuracy, we show that recurrent delay learning can reduce the memory footprint and energy consumption of a network, and shapes its robustness to temporal perturbations of its inputs. This work establishes recurrent delay optimization as a promising framework for both biological circuit modeling and neuromorphic computing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandre Queant, Ulysse Rançon, Benoit R Cottereau, Timothée Masquelier. 2025-09-29. DelRec: learning delays in recurrent spiking neural networks. https://arxiv.org/abs/2509.24852

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Breaking the Central Bias: Spatially Partitioned Experts for Coordinate-Based Neuroevolution

Evolvable-Substrate HyperNEAT (ES-HyperNEAT), a bio-inspired indirect encoding that determines neuron placement and connection weights from spatial coordinates, exhibits a failure mode on MNIST as a diagnostic benchmark. Because input pixels map to a coordinate space centered at the origin, evolved networks converge on a small central cluster of input pixels, a spatial-concentration bias; prior work observed only 21% mean accuracy in this regime. Is this bias an optimization artifact or an architectural ceiling? Inspired by Mixture-of-Experts (MoE) principles, we partition the input into non-overlapping spatial segments, each assigned to a separately evolved specialist network. With 13 such experts, this design reaches 43% mean accuracy, a 106% relative improvement over the baseline. The architectural gain does not depend on data-driven aggregation: equal-weighted averaging, which uses no validation data, already yields a 70% improvement; the gain comes from partitioning, not the weighting. Receptive-field analysis shows the mechanism: partitioning forces evolution to discover features across the entire image, expanding active pixel coverage from 4% to 79%. Absolute accuracy stays below gradient-trained baselines, but the relative gain points to central bias, not the evolutionary search. Two tools are designed to generalize beyond MNIST: a receptive-field diagnostic for silent input-coverage collapse, and a spatial-partitioning remedy that restores coverage.

cs.NE

A Bio-Plausible Visual Neural Network for Locust-Inspired Collision Perception

Locust visual systems have long served as an important biological paradigm for studying looming perception and collision avoidance. Numerous computational models have successfully reproduced the selective responses of Lobula Giant Movement Detector (LGMD) neurons to approaching objects, thereby emulating the fundamental functionality of the biological system. However, existing models remain limited in biological plausibility and robustness when operating in complex and dynamic visual environments. To address these limitations, we propose a biologically plausible neural network for locust-inspired looming detection. The proposed framework incorporates a spatially isotropic sampling strategy that mimics the ommatidial organization of the locust compound eye, a population-voting mechanism inspired by population coding in biological neural systems, and leaky integrate-and-fire neuronal dynamics to replace conventional sigmoid-based membrane activation. Systematic experiments on synthetic stimuli, laboratory sequences, and real-world driving scenarios demonstrate that the proposed model improves robustness under challenging visual conditions while preserving computational efficiency and enhancing biological fidelity. These results highlight the potential of biologically grounded neural computation for robust and efficient collision perception.

cs.NE

Structural Fusion of Bayesian Networks with Limited Treewidth Using Genetic Algorithms

This paper introduces an evolutionary computation approach for consensus in structural Bayesian Network (BN) fusion under the constraint of limited treewidth. The consensus BN aims to reconcile multiple input BNs into a single one that retains key structural features present in the original networks. Treewidth, a graph-based parameter associated with computationally tractable inference, is utilized to restrict the complexity of the resulting network. A genetic algorithm is proposed to look for a BN that codifies as much information about the unrestricted fusion as possible while ensuring the treewidth restriction. Experimental evaluation demonstrates the genetic algorithm's ability to obtain consensus BNs with limited treewidth, providing a valuable tool for aggregating information from diverse sources while returning a computationally actionable model.

cs.NE