Back-engineering of spiking neural networks parameters

H. Rostro; B. Cessac; J. C. Vasquez; T. Vieville

Home/Archive/arXiv

arXiv · 0905.4810

Back-engineering of spiking neural networks parameters

H. Rostro·B. Cessac·J. C. Vasquez·T. Vieville

View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the deterministic evolution of a time-discretized spiking network of neurons with connection weights having delays, modeled as a discretized neural network of the generalized integrate and fire (gIF) type. The purpose is to study a class of algorithmic methods allowing to calculate the proper parameters to reproduce exactly a given spike train generated by an hidden (unknown) neural network. This standard problem is known as NP-hard when delays are to be calculated. We propose here a reformulation, now expressed as a Linear-Programming (LP) problem, thus allowing to provide an efficient resolution. This allows us to "back-engineer" a neural network, i.e. to find out, given a set of initial conditions, which parameters (i.e., connection weights in this case), allow to simulate the network spike dynamics. More precisely we make explicit the fact that the back-engineering of a spike train, is a Linear (L) problem if the membrane potentials are observed and a LP problem if only spike times are observed, with a gIF model. Numerical robustness is discussed. We also explain how it is the use of a generalized IF neuron model instead of a leaky IF model that allows us to derive this algorithm. Furthermore, we point out how the L or LP adjustment mechanism is local to each unit and has the same structure as an "Hebbian" rule. A step further, this paradigm is easily generalizable to the design of input-output spike train transformations. This means that we have a practical method to "program" a spiking network, i.e. find a set of parameters allowing us to exactly reproduce the network output, given an input. Numerical verifications and illustrations are provided.

Explore related subjects

nlin.AO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

H. Rostro, B. Cessac, J. C. Vasquez, T. Vieville. 2009-05-29. Back-engineering of spiking neural networks parameters. https://arxiv.org/abs/0905.4810

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

KEEP EXPLORING

Related papers

arXiv2026

Frequency bursts in adaptive delay-coupled oscillators

We report on frequency bursting oscillations in a system of phase oscillators with adaptive and delayed coupling. Adaptation of the coupling strengths is considered slow and depends on the phase shift between the oscillators. We find due to the combined chain of adaptation, collective dynamics, and time delays, the system robustly achieves a state in which the oscillator's frequencies are nearly synchronized but detuned by an integer number of small adaptation frequencies. We demonstrate that this quantization of the detuning is caused by alternating slow and fast transitions. Moreover, the observed motions take the form of bursts of instantaneous frequency, and the number of spikes in each burst corresponds to the quantization level of the detuning. We provide a fast-slow analysis of this phenomenon and explain the mechanisms behind the emergence of bursts. Our findings indicate that these frequency bursting oscillations are robust and exist stably within finite parameter regions.

nlin.AO↗

arXiv2026

Discrete-time Kuramoto model with phase lag: Linear stability analysis and onset of synchronization

We investigate the discrete-time version of the Kuramoto model with phase lag, which comprises globally-coupled phase oscillators of distributed frequencies that are evolving under a nonlinear map. In the continuum limit of an infinite number of oscillators ($N\to \infty$), we derive the exact Frobenius-Perron equation for the time evolution of the single-oscillator probability density, and study linear stability of the incoherent state. Instability signals onset of synchronization. The corresponding synchronization threshold is obtained analytically for the case of a Lorentzian distribution of the oscillator frequencies. The threshold differs from that of the continuous-time Kuramoto model, reflecting the fundamentally different stability conditions for discrete-time maps and continuous-time flows. Beyond synchronization threshold, we observe several interesting nonlinear phenomena: Unlike the classical Kuramoto model, the discrete-time version exhibits periodic and chaotic states. Numerical simulations of the finite-$N$ system confirm the analytical prediction for the synchronization threshold, while highlighting breakdown of the celebrated Ott-Antonsen ansatz invoked to conveniently study the continuous-time Kuramoto model in terms of a low-dimensional description.

nlin.AO↗

arXiv2026

Deviations from global coupling in adaptive oscillator networks: a mean-field theory for the variance of coupling weights

A wide range of physical and biological systems are adaptive networks, in which the dynamics of the nodes and of the edges connecting them co-evolve. Mean-field reductions of such systems typically track only the average coupling strength, and therefore cannot determine when the coupling stays effectively homogeneous and when structured connectivity emerges. Here, we present a second-order moment closure that allows us to derive mean-field equations for the coupling-weight variance in networks of heterogeneous phase oscillators with adaptive coupling, starting from uniform coupling weights. In agreement with network simulations, we find a nonlinear, non-monotonic dependence of the relative weight variance on the oscillator heterogeneity that is mediated by the phase coherence. Moreover, we find that deviations from global coupling strongly depend on an interaction between the oscillator heterogeneity and the adaptation rule. Whereas symmetric adaptation causes a strongly coupled core of coherent oscillators to emerge and creates a bistable regime that is absent without adaptation, antisymmetric adaptation leads to antisymmetric coupling within the same core, thereby destabilizing it. Our equations therefore delineate the regimes in which adaptive networks behave like globally coupled systems from those in which more complex coupling patterns form.

nlin.AO↗