Asynchronous updating of threshold-coupled chaotic neurons

Similar documents
Construction of a reconfigurable dynamic logic cell

CONTROLLING CHAOS. Sudeshna Sinha. The Institute of Mathematical Sciences Chennai

arxiv: v1 [nlin.cd] 5 Jul 2008

in a Chaotic Neural Network distributed randomness of the input in each neuron or the weight in the

Controlling chaos in random Boolean networks

Evolutionary Games and Computer Simulations

Effects of Interactive Function Forms in a Self-Organized Critical Model Based on Neural Networks

Analysis of Neural Networks with Chaotic Dynamics

Dynamical Systems and Deep Learning: Overview. Abbas Edalat

Cellular Automata. ,C ) (t ) ,..., C i +[ K / 2] Cellular Automata. x > N : C x ! N. = C x. x < 1: C x. = C N+ x.

Self-organized Criticality and Synchronization in a Pulse-coupled Integrate-and-Fire Neuron Model Based on Small World Networks

Cellular Automata. and beyond. The World of Simple Programs. Christian Jacob

DESYNCHRONIZATION TRANSITIONS IN RINGS OF COUPLED CHAOTIC OSCILLATORS

Influence of Criticality on 1/f α Spectral Characteristics of Cortical Neuron Populations

arxiv: v1 [cond-mat.stat-mech] 6 Mar 2008

Dynamics and Chaos. Melanie Mitchell. Santa Fe Institute and Portland State University

Hopfield Neural Network and Associative Memory. Typical Myelinated Vertebrate Motoneuron (Wikipedia) Topic 3 Polymers and Neurons Lecture 5

Effects of Interactive Function Forms and Refractoryperiod in a Self-Organized Critical Model Based on Neural Networks

7 Recurrent Networks of Threshold (Binary) Neurons: Basis for Associative Memory

PULSE-COUPLED networks (PCNs) of integrate-and-fire

Stochastic Model for Adaptation Using Basin Hopping Dynamics

THIELE CENTRE. Disordered chaotic strings. Mirko Schäfer and Martin Greiner. for applied mathematics in natural science

Ricepiles: Experiment and Models

IDENTIFICATION OF TARGET IMAGE REGIONS BASED ON BIFURCATIONS OF A FIXED POINT IN A DISCRETE-TIME OSCILLATOR NETWORK

IMPLEMENTATION OF PROGRAMMABLE LOGIC DEVICES IN QUANTUM CELLULAR AUTOMATA TECHNOLOGY

Clock-Gating and Its Application to Low Power Design of Sequential Circuits

Learning and Memory in Neural Networks

Learning Cellular Automaton Dynamics with Neural Networks

7 Rate-Based Recurrent Networks of Threshold Neurons: Basis for Associative Memory

Spatial and Temporal Behaviors in a Modified Evolution Model Based on Small World Network

Causality and communities in neural networks

An efficient parallel pseudorandom bit generator based on an asymmetric coupled chaotic map lattice

SELF-ORGANIZATION IN NONRECURRENT COMPLEX SYSTEMS

arxiv:chao-dyn/ v1 5 Mar 1996

Collective behavior in networks of biological neurons: mathematical modeling and software development

Noise-enhanced propagation in a dissipative chain of triggers

Synchronization of a General Delayed Complex Dynamical Network via Adaptive Feedback

CHAOTIC MEAN FIELD DYNAMICS OF A BOOLEAN NETWORK WITH RANDOM CONNECTIVITY

STUDY OF SYNCHRONIZED MOTIONS IN A ONE-DIMENSIONAL ARRAY OF COUPLED CHAOTIC CIRCUITS

Nonsmooth systems: synchronization, sliding and other open problems

arxiv: v1 [nlin.ao] 4 Nov 2009

The projects listed on the following pages are suitable for MSc/MSci or PhD students. An MSc/MSci project normally requires a review of the

Optimal Shape and Topology of Structure Searched by Ants Foraging Behavior

Neural Networks. Xiaojin Zhu Computer Sciences Department University of Wisconsin, Madison. slide 1

Nature-inspired Analog Computing on Silicon

19 th INTERNATIONAL CONGRESS ON ACOUSTICS MADRID, 2-7 SEPTEMBER 2007 NONLINEAR DYNAMICS IN PARAMETRIC SOUND GENERATION

An Introductory Course in Computational Neuroscience

SINGLE-ELECTRON CIRCUITS PERFORMING DENDRITIC PATTERN FORMATION WITH NATURE-INSPIRED CELLULAR AUTOMATA

Several ways to solve the MSO problem

Synchronization and suppression of chaos in non-locally coupled map lattices

Synchronous Sequential Circuit

Toward a Better Understanding of Complexity

On Elementary and Algebraic Cellular Automata

Bubbling and bistability in two parameter discrete systems

Behaviour of simple population models under ecological processes

Nonlinear Dynamical Behavior in BS Evolution Model Based on Small-World Network Added with Nonlinear Preference

arxiv: v1 [nlin.ao] 19 May 2017

Shigetaka Fujita. Rokkodai, Nada, Kobe 657, Japan. Haruhiko Nishimura. Yashiro-cho, Kato-gun, Hyogo , Japan. Abstract

Neural Networks, Computation Graphs. CMSC 470 Marine Carpuat

SPSS, University of Texas at Arlington. Topics in Machine Learning-EE 5359 Neural Networks

Complex networks and evolutionary games

898 IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 17, NO. 6, DECEMBER X/01$ IEEE

arxiv: v2 [cond-mat.stat-mech] 6 Jun 2010

Modelling biological oscillations

Learning Cycle Linear Hybrid Automata for Excitable Cells

Multiobjective Optimization of an Extremal Evolution Model

Artificial Neural Networks. Edward Gatt

Self-organized criticality and the self-organizing map

A SYSTEMATIC PROCEDURE FOR SYNCHRONIZING HYPERCHAOS VIA OBSERVER DESIGN

Neural Networks and the Back-propagation Algorithm

Spiking Neural P Systems with Anti-Spikes as Transducers

Multilayer Perceptron Tutorial

Analysis of torus breakdown into chaos in a constraint Duffing. van der Pol oscillator

K. Pyragas* Semiconductor Physics Institute, LT-2600 Vilnius, Lithuania Received 19 March 1998

Mechanisms of Emergent Computation in Cellular Automata

arxiv:cond-mat/ v2 [cond-mat.stat-mech] 8 Sep 1999

Phase Synchronization of Coupled Rossler Oscillators: Amplitude Effect

Neural Networks. Bishop PRML Ch. 5. Alireza Ghane. Feed-forward Networks Network Training Error Backpropagation Applications

λ-universe: Introduction and Preliminary Study

Artificial Intelligence

From time series to superstatistics

Two Decades of Search for Chaos in Brain.

!"#$%&'()*"+,-./*($-"#+"0+'*"12%3+ (#3+4"#&'*"12%3+5'6+6)17-$%1$/)%8*

Traffic Flow Simulation using Cellular automata under Non-equilibrium Environment

Phase Transitions in the Computational Complexity of "Elementary'' Cellular Automata

Introduction to Neural Networks

Neural Networks. CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington

Complete Synchronization, Anti-synchronization and Hybrid Synchronization Between Two Different 4D Nonlinear Dynamical Systems

The Mixed States of Associative Memories Realize Unimodal Distribution of Dominance Durations in Multistable Perception

Dynamical Embodiments of Computation in Cognitive Processes James P. Crutcheld Physics Department, University of California, Berkeley, CA a

STUDY AND IMPLEMENTATION OF MUX BASED FPGA IN QCA TECHNOLOGY

Coalescing Cellular Automata

arxiv:cond-mat/ v2 [cond-mat.dis-nn] 11 Apr 2004

Modelling and design of complete photonic band gaps in two-dimensional photonic crystals

On the Design of Adaptive Supervisors for Discrete Event Systems

Design of Optimized Quantum-dot Cellular Automata RS Flip Flops

COGS Q250 Fall Homework 7: Learning in Neural Networks Due: 9:00am, Friday 2nd November.

Synchronization and Bifurcation Analysis in Coupled Networks of Discrete-Time Systems

4. Multilayer Perceptrons

Lyapunov exponents in random Boolean networks

Transcription:

PRAMANA c Indian Academy of Sciences Vol. 70, No. 6 journal of June 2008 physics pp. 1127 1134 Asynchronous updating of threshold-coupled chaotic neurons MANISH DEV SHRIMALI 1,2,3,, SUDESHNA SINHA 4 and KAZUYUKI AIHARA 1,2 1 Aihara Complexity Modelling Project, ERATO, JST, Tokyo 151 0064, Japan 2 Institute of Industrial Science, The University of Tokyo, Tokyo 153 8505, Japan 3 Department of Physics, Dayanand College, Ajmer 305 001, India 4 The Institute of Mathematical Sciences, CIT Campus, Taramani, Chennai 600 113, India Corresponding author. E-mail: m.shrimali@gmail.com Abstract. We study a network of chaotic model neurons incorporating thresholdactivated coupling. We obtain a wide range of spatiotemporal patterns under varying degrees of asynchronicity in the evolution of the neuronal components. For instance, we find that sequential updating of threshold-coupled chaotic neurons can yield dynamical switching of the individual neurons between two states. So varying the asynchronicity in the updating scheme can serve as a control mechanism to extract different responses, and this can have possible applications in computation and information processing. Keywords. Asynchronous updating; chaos control. PACS No. 05.45.-a 1. Introduction Studies of dynamical systems most commonly use parallel (or synchronous) updating schemes, where the individual local maps are iterated forward simultaneously. Here we focus on an alternate updating scheme, namely we consider asynchronous evolution, where the updates are not concurrent [1 4]. In certain situations asynchronous updating can be closer to physical reality than synchronous evolution [1]. For instance, there exist specific physical situations where an extended system is comprised of a collection of elemental dynamical units which evolve asynchronously, as there is no global clock, like in neuromorphology where the neurons, neuronal groups and functional layers of the brain, are believed to be usually asynchronous [5]. Interestingly, it has been shown that the asynchronous updating often leads to more ordered behaviour than simultaneous updating [3,4]. In this paper we study a network of chaotic model neurons, incorporating threshold-activated coupling, and investigate the range of pattern formation obtained under varying degrees of synchronicity in its dynamical updating scheme. The details of the model and results are described in the sections below. 1127

Manish Dev Shrimali, Sudeshna Sinha and Kazuyuki Aihara Figure 1. Bifurcation diagrams of the single chaotic neuron map with no thresholding (top left), and under different values of threshold y = 0.75 (top right), 0.5 (bottom left) and 0.25 (bottom right). 2. Adaptive dynamics of the chaotic neuron We use the chaotic model neuron, proposed by Aihara et al [6], as the building block of our network. The dynamics of the neuron is given in discrete time n by the map: y n+1 = ky n αf(y n ) + a, x n+1 = f(y n+1 ), (1) where f(x) = 1/[1 + exp( x/ε)]. The internal state of the neuron is y n and the output of the neuron is x n at time n. The decay parameter of the refractoriness is k, and α is the refractory scaling parameter. The sigmoid function, f( ), is the output function of the neuron, and ɛ is the steepness parameter of the sigmoid function. On this nonlinear function a threshold activated response is incorporated [7,8], namely, if the internal state of the neuron takes value more than the threshold y, it is relaxed to y. y n y if y n > y. (2) 1128 Pramana J. Phys., Vol. 70, No. 6, June 2008

Asynchronous updating of threshold-coupled chaotic neurons 100 1 80 0.8 0.6 60 0.4 space 0.2 40 0 20 20 40 60 80 100 time Figure 2. Space-time density plots of an array of threshold-coupled neurons (with α = 1.4) for synchronous updating, i.e. with n sync = N = 100 (i.e. p sync = 1). Here threshold value y = 0.5, size N = 100 and relaxation time r = 1000. All sites are synchronized and take values 0 and 1 alternatively. The bifurcation diagrams of the uncontrolled neuron map and the thresholdcontrolled neuron map for threshold values y = 0.75, 0.5 and 0.25 are shown in figure 1. There are two chaotic bands in the uncontrolled neuron map. Under large threshold values, the chaotic dynamics around α = 1.4 is transformed to a fixed point, while for lower values of threshold both chaotic regions disappear and one obtains complete regularity. 3. Threshold coupled neuron maps Now we study a network of such model neurons. Using label i as the site/node index in the lattice/network, with i [1, N], where N is the size of the system, the local dynamics is given specifically as follows: y n+1 (i) = ky n (i) αf(y n (i)) + a, x n+1 (i) = f(y n+1 (i)), (3) where f(x) = 1/[1 + exp( x/ε)]. On this network of local neuronal dynamics a threshold activated coupling is incorporated [7,8]. The coupling is triggered when the internal state of neuron Pramana J. Phys., Vol. 70, No. 6, June 2008 1129

Manish Dev Shrimali, Sudeshna Sinha and Kazuyuki Aihara 100 1 80 0.8 0.6 60 0.4 space 0.2 40 0 20 20 40 60 80 100 time Figure 3. Space-time density plots of an array of threshold-coupled neurons for sequential updating with n sync = 1 (i.e. p sync = 0.01). Here threshold value y = 0.5, size N = 100 and relaxation time r = 1000. Alternate sites shifts from 0 to 1 (or in reverse order) at different times. at certain site in the lattice exceeds the critical value y, i.e. y n (i) > y. The supercritical site then relaxes (or topples ) by transporting the excess δ = (y n (i) y ) to its neighbour: y n (i) y, y n (i + 1) y n (i + 1) + δ. (4) The above process occurs in parallel, i.e. all supercritical sites at any instant relax simultaneously, according to eqs (4), and this constitutes one relaxation time step. After r such relaxation steps, the system undergoes the next chaotic update. In some sense then, time n associated with the chaotic dynamics is measured in units of r. The relaxation of a site may initiate an avalanche of relaxation activity, as neighbouring sites can exceed the threshold limit after receiving the excess from a supercritical site, thus starting a domino effect. This induces a uni-directional transport to the open boundary of the array. The excess is transported out of the system. After r relaxation steps the next dynamical update of the sites occurs. The dynamical outcome of the system crucially depends on the relaxation time r, i.e. on the time-scales for autonomously updating each site and propagating the threshold-activated coupling between sites. When r, the system is fully relaxed before the subsequent dynamical update and so the time-scales of the two 1130 Pramana J. Phys., Vol. 70, No. 6, June 2008

Asynchronous updating of threshold-coupled chaotic neurons 100 1 80 0.8 0.6 60 0.4 space 0.2 40 0 20 20 40 60 80 100 time Figure 4. Space-time density plots of an array of threshold-coupled neurons for sequential updating with n sync = N/2 = 50 (i.e. p sync = 0.5). Here threshold value y = 0.5, size N = 100 and relaxation time r = 1000. processes, the intrinsic chaotic dynamics of each site and the threshold-activated relaxation, are separable. At the other end of the spectrum is the limit of very small r where the local dynamics and the coupling take place simultaneously. The system is driven to spatiotemporal chaos for the short relaxation time [9]. In our previous study on the effect of asynchronous updating on a system with short relaxation time (i.e. very small r), it has been shown that the asynchronous updating induces more order in the system [4]. In the present study, we focus on the asynchronous updating of threshold coupled systems at the other limit, namely, r. We show in the following section, that asynchronous evolution of thresholdcoupled chaotic neurons, yields a rich variety of spatiotemporal patterns and binary sequences. 4. Spatiotemporal patterns obtained under varying asynchronicity in the updating In order to effectively study the influence of varying degrees of synchronicity we investigate the following dynamics: We break the network into subsets, and update the sites belonging to each subset simultaneously, while updating the different subsets sequentially. We denote the number of sites (nodes) updated together as n sync. Pramana J. Phys., Vol. 70, No. 6, June 2008 1131

Manish Dev Shrimali, Sudeshna Sinha and Kazuyuki Aihara 100 1 80 0.8 0.6 60 0.4 space 0.2 40 0 20 20 40 60 80 100 time Figure 5. Space-time density plots of an array of threshold-coupled neurons for sequential updating with n sync = 3 4 N = 75 (i.e. p sync = 0.75). Here threshold value y = 0.5, size N = 100 and relaxation time r = 1000. So the fraction p sync = n sync /N serves as an effective parameter for synchronicity. The limiting case of p sync = n sync /N = 1, namely n sync = N, corresponds to the usual parallel updates. On the other hand, n sync = 1/N, which tends to 0 as N corresponds to the completely asynchronous update. So, as n sync /N takes values from 0 to 1 (i.e. n sync takes values 1 to N), one has decreasing degrees of synchronicity in the evolution. Here we study sequential asynchronous updating, where the subsets consist of contiguous elements. That is, the first subset consists of elements i = 1,..., n sync, the second subset consists of elements i = n sync + 1,..., 2n sync., etc. In our system, the local parameter values are in the chaotic regime: k = 0.5, α = 1.4, a = 1.0 and ε = 0.04. Note again that the relaxation time r is large here, i.e., we update the chaotic neurons asynchronously and allow the whole network to relax by threshold-activated transport, for sufficiently long time. First we study the network of threshold-coupled chaotic neurons under synchronous updating, namely the p sync = 1 limit. For y = 0.5, this yields a state where all neurons are synchronized and evolve in period 2 cycles, with the sites taking values 0 and 1 alternatively. In figure 2 the space-time density plot of x n (i) for this case is shown. As one varies p sync, we find that sequential updating yields different regular spatiotemporal patterns depending upon the degree of synchronicity. For instance, in the limiting case of sequential updating with n sync = 1, where one site at a time is 1132 Pramana J. Phys., Vol. 70, No. 6, June 2008

Asynchronous updating of threshold-coupled chaotic neurons updated down the chain ( typewriter mode ), the state of the sites shift from value 1 to 0 (or the reverse). This binary switching is clearly evident in the space-time density plot of figure 3. When we update more than one site at a time (i.e. n sync > 1) the pattern of the output x n (i) changes with the degree of synchronicity p sync = n sync /N. Representative examples of this behaviour, for p sync = 0.5 and 0.75, are shown in figures 4 and 5. These results are independent of the threshold value for y < 0.8. Further, note that for y 0.9, the network of threshold-coupled neurons is chaotic under synchronous updating, while sequential updating induces order in the system. 5. Conclusion In this work we have shown how coupled chaotic neuron maps under different updating schemes give wide-ranging spatiotemporal patterns. So varying the updating rules provides us with a library of binary patterns, with the degree of synchronicity p sync having a one-to-one correspondence with a particular pattern. This variety of controlled switching and shifting binary sequences might prove useful for information processing applications [10]. Further changing updating rules may also serve as a control strategy for extracting different controlled spatiotemporal patterns from extended complex systems [11]. Note that one can get different spatiotemporal patterns of 0 s and 1 s in a network of threshold-coupled chaotic systems by varying the thresholding level at different network sites. However, we have shown here that one can also get the desired patterns under fixed threshold levels, by just varying the degree of synchronicity in the updating. In certain electronic devices it is much easier to change the degree of synchronicity of the sequential updating schemes, rather than manipulate the individual levels [12]. Our results are thus very relevant in such situations. Lastly, since various dynamical binary responses are generated by thresholdcontrolled chaotic neural networks under sequential updating, it may be possible to use such networks to obtain different logic operations as a function of time, without changing the system parameters. Thus this system has potential to be used as dynamical switching gates, which have direct bearing on the construction of reconfigurable computer architectures [13]. References [1] There are cases where synchronous updates can lead to complicated spatial structures in cellular automata (Ref: M Nowak and R M May, Nature (London) 359, 826 (1992)) which disappear under asynchronous updating (B A Huberman and N Glance, Proc. Natl. Acad. Sci. USA 90, 7716 (1993)) and are therefore considered unphysical in the absence of an external clock [2] E D Lumer and G Nicolis, Physica D71, 440 (1994) [3] M Mehta and S Sinha, Chaos 10, 350 (2000) [4] M D Shrimali, S Sinha and K Aihara, Phys. Rev. E76, 046212 (2007) Pramana J. Phys., Vol. 70, No. 6, June 2008 1133

Manish Dev Shrimali, Sudeshna Sinha and Kazuyuki Aihara [5] J Hertz, A Krogh and R G Palmer, Introduction to the theory of neural computation (Addison-Wesley, Reading, 1991) [6] K Aihara, T Takebe and M Toyoda, Phys. Lett. A144, 333 (1990) [7] S Sinha and D Biswas, Phys. Rev. Lett. 71, 2010 (1993). Certain models in this class display self organized critical (SOC-type) behaviour [8] S Sinha, Phys. Rev. E49, 4832 (1994); Int. J. Mod. Phys. B9, 875 (1995) [9] A Mondal and S Sinha, Phys. Rev. E73, 026215 (2006) [10] S Sinha, T Munakata and W L Ditto, Phys. Rev. E65, 36214 (2002); Phys. Rev. E65, 36216 (2002) [11] We also find that random asynchronous updating can generate different random spatio-temporal patterns. So sequential asynchronous updating is better than the random asynchronous updating in generating controlled spatio-temporal patterns [12] D Atuti, T Morie and K Aihara, 15th IEEE Int. Workshop on Nonlinear Dynamics of Electronic Systems (NDES 2007), Tokushima, Japan, July 23 26 (2007) pp. 145 148 [13] D Atuti, M D Shrimali, T Morie, S Sinha and K Aihara, in preparation 1134 Pramana J. Phys., Vol. 70, No. 6, June 2008