Chaos in neural networks with a nonmonotonic transfer function

Instabilities in attractor networks with fast synaptic fluctuations and partial updating of the neurons activity

We present and study a probabilistic neural automaton in which the fraction of simultaneously-updated neurons is a parameter, rhoin(0,1). For small rho, there is relaxation towards one of the attractors and a great sensibility to external stimuli and, for rho > or = rho(c), itinerancy among attractors. Tuning rho in this regime, oscillations may abruptly change from regular to chaotic and vice versa, which allows one to control the efficiency of the searching process. We argue on the similarity of the model behavior with recent observations, and on the possible role of chaos in neurobiology.

Chaos breeds autonomy: connectionist design between bias and baby-sitting

In connectionism and its offshoots, models acquire functionality through externally controlled learning schedules. This undermines the claim of these models to autonomy. Providing these models with intrinsic biases is not a solution, as it makes their function dependent on design assumptions. Between these two alternatives, there is room for approaches based on spontaneous self-organization. Structural reorganization in adaptation to spontaneous activity is a well-known phenomenon in neural development. It is proposed here as a way to prepare connectionist models for learning and enhance the autonomy of these models.

Chaotic hopping between attractors in neural networks

We present a neurobiologically-inspired stochastic cellular automaton whose state jumps with time between the attractors corresponding to a series of stored patterns. The jumping varies from regular to chaotic as the model parameters are modified. The resulting irregular behavior, which mimics the state of attention in which a system shows a great adaptability to changing stimulus, is a consequence in the model of short-time presynaptic noise which induces synaptic depression. We discuss results from both a mean-field analysis and Monte Carlo simulations.

Chaotic itinerancy in the oscillator neural network without Lyapunov functions

Chaotic itinerancy (CI), which is defined as an incessant spontaneous switching phenomenon among attractor ruins in deterministic dynamical systems without Lyapunov functions, is numerically studied in the case of an oscillator neural network model. The model is the pseudoinverse-matrix version of the previous model [S. Uchiyama and H. Fujisaka, Phys. Rev. E 65, 061912 (2002)] that was studied theoretically with the aid of statistical neurodynamics. It is found that CI in neural nets can be understood as the intermittent dynamics of weakly destabilized chaotic retrieval solutions.

Clustering data by inhomogeneous chaotic map lattices

A new approach to clustering, based on the physical properties of inhomogeneous coupled chaotic maps, is presented. A chaotic map is assigned to each data point and short range couplings are introduced. The stationary regime of the system corresponds to a macroscopic attractor independent of the initial conditions. The mutual information between pairs of maps serves to partition the data set in clusters, without prior assumptions about the structure of the underlying distribution of the data. Experiments on simulated and real data sets show the effectiveness of the proposed algorithm.

Phase ordering in chaotic map lattices with conserved dynamics

Dynamical scaling in a two-dimensional lattice model of chaotic maps, in contact with a thermal bath at temperature T, is numerically studied. The model here proposed is equivalent to a conserved Ising model with couplings that fluctuate over the same time scale as spin moves. When coupling fluctuations and thermal fluctuations are both important, this model does not belong to the class of universality of a Langevin equation known as model B; the scaling exponents are continuously varying with T and depend on the map used. The universal behavior of model B is recovered when thermal fluctuations are dominant.