SearcharxivSearch

arXiv subjects

D. Bolle'

Publications and source records attributed to D. Bolle'.

14 recordsLinked to original sources

Synchronous versus sequential updating in the three-state Ising neural network with variable dilution

The three-state Ising neural network with synchronous updating and variable dilution is discussed starting from the appropriate Hamiltonians. The thermodynamic and retrieval properties are examined using replica mean-field theory. Capacity-temperature phase diagrams are derived for several values of the pattern activity and different gradations of dilution, and the information content is calculated. The results are compared with those for sequential updating. The effect of self-coupling is established. Also the dynamics is studied using the generating function technique for both synchronous and sequential updating. Typical flow diagrams for the overlap order parameter are presented. The differences with the signal-to-noise approach are outlined.

cond-mat.dis-nn

Self-control dynamics for sparsely coded networks with synaptic noise

For the retrieval dynamics of sparsely coded attractor associative memory models with synaptic noise the inclusion of a macroscopic time-dependent threshold is studied. It is shown that if the threshold is chosen appropriately as a function of the cross-talk noise and of the activity of the memorized patterns, adapting itself automatically in the course of the time evolution, an autonomous functioning of the model is guaranteed. This self-control mechanism considerably improves the quality of the fixed-point retrieval dynamics, in particular the storage capacity, the basins of attraction and the mutual information content.

cond-mat.dis-nn

Gardner optimal capacity of the diluted Blume-Emery-Griffiths neural network

The optimal capacity of a diluted Blume-Emery-Griffiths neural network is studied as a function of the pattern activity and the embedding stability using the Gardner entropy approach. Annealed dilution is considered, cutting some of the couplings referring to the ternary patterns themselves and some of the couplings related to the active patterns, both simultaneously (synchronous dilution) or independently (asynchronous dilution). Through the de Almeida-Thouless criterion it is found that the replica-symmetric solution is locally unstable as soon as there is dilution. The distribution of the couplings shows the typical gap with a width depending on the amount of dilution, but this gap persists even in cases where a particular type of coupling plays no role in the learning process.

cond-mat.dis-nn

Time evolution of the extremely diluted Blume-Emery-Griffiths neural network

The time evolution of the extremely diluted Blume-Emery-Griffiths neural network model is studied, and a detailed equilibrium phase diagram is obtained exhibiting pattern retrieval, fluctuation retrieval and self-sustained activity phases. It is shown that saddle-point solutions associated with fluctuation overlaps slow down considerably the flow of the network states towards the retrieval fixed points. A comparison of the performance with other three-state networks is also presented.

cond-mat.stat-mech

On-line learning and generalisation in coupled perceptrons

We study supervised learning and generalisation in coupled perceptrons trained on-line using two learning scenarios. In the first scenario the teacher and the student are independent networks and both are represented by an Ashkin-Teller perceptron. In the second scenario the student and the teacher are simple perceptrons but are coupled by an Ashkin-Teller type four-neuron interaction term. Expressions for the generalisation error and the learning curves are derived for various learning algorithms. The analytic results find excellent confirmation in numerical simulations.

cond-mat.dis-nn

Local field dynamics in symmetric Q-Ising neural networks

The time evolution of the local field in symmetric Q-Ising neural networks is studied for arbitrary Q. In particular, the structure of the noise and the appearance of gaps in the probability distribution are discussed. Results are presented for several values of Q and compared with numerical simulations.

cond-mat.dis-nn

Optimal coloured perceptrons

Ashkin-Teller type perceptron models are introduced. Their maximal capacity per number of couplings is calculated within a first-step replica-symmetry-breaking Gardner approach. The results are compared with extensive numerical simulations using several algorithms.

cond-mat.dis-nn

Mutual Information of Three-State Low Activity Diluted Neural Networks with Self-Control

The influence of a macroscopic time-dependent threshold on the retrieval process of three-state extremely diluted neural networks is examined. If the threshold is chosen appropriately in function of the noise and the pattern activity of the network, adapting itself in the course of the time evolution, it guarantees an autonomous functioning of the network. It is found that this self-control mechanism considerably improves the retrieval quality, especially in the limit of low activity, including the storage capacity, the basins of attraction and the information content. The mutual information is shown to be the relevant parameter to study the retrieval quality of such low activity models. Numerical results confirm these observations.

cond-mat.stat-mech

Thermodynamic properties of extremely diluted symmetric Q-Ising neural networks

Using the replica-symmetric mean-field theory approach the thermodynamic and retrieval properties of extremely diluted {\it symmetric} $Q$-Ising neural networks are studied. In particular, capacity-gain parameter and capacity-temperature phase diagrams are derived for $Q=3, 4$ and $Q=\infty$. The zero-temperature results are compared with those obtained from a study of the dynamics of the model. Furthermore, the de Almeida-Thouless line is determined. Where appropriate, the difference with other $Q$-Ising architectures is outlined.

cond-mat.dis-nn

Mutual information and self-control of a fully-connected low-activity neural network

A self-control mechanism for the dynamics of a three-state fully-connected neural network is studied through the introduction of a time-dependent threshold. The self-adapting threshold is a function of both the neural and the pattern activity in the network. The time evolution of the order parameters is obtained on the basis of a recently developed dynamical recursive scheme. In the limit of low activity the mutual information is shown to be the relevant parameter in order to determine the retrieval quality. Due to self-control an improvement of this mutual information content as well as an increase of the storage capacity and an enlargement of the basins of attraction are found. These results are compared with numerical simulations.

cond-mat.dis-nn

Parallel dynamics of the asymmetric extremely diluted Ashkin-Teller neural network

The parallel dynamics of the asymmetric extremely diluted Ashkin-Teller neural network is studied using signal-to-noise analysis techniques. Evolution equations for the order parameters are derived, both at zero and finite temperature. The retrieval properties of the network are discussed in terms of the four-spin coupling strength and the temperature. It is shown that the presence of a four-spin coupling enhances the retrieval quality.

cond-mat.dis-nn

Thresholds in layered neural networks with variable activity

The inclusion of a threshold in the dynamics of layered neural networks with variable activity is studied at arbitrary temperature. In particular, the effects on the retrieval quality of a self-controlled threshold obtained by forcing the neural activity to stay equal to the activity of the stored paterns during the whole retrieval process, are compared with those of a threshold chosen externally for every loading and every temperature through optimisation of the mutual information content of the network. Numerical results, mostly concerning low activity networks are discussed.

cond-mat.dis-nn

Phase Transition in a Noise Reduction Model: Shrinking or Percolation?

A model of noise reduction (NR) for signal processing is introduced. Each noise source puts a symmetric constraint on the space of the signal vector within a tolerable overlap. When the number of noise sources increases, sequences of transitions take place, causing the solution space to vanish. We found that the transition from an extended solution space to a shrunk space is retarded because of the symmetry of the constraints, in contrast to the analogous problem of pattern storage. For low tolerance, the solution space vanishes by volume reduction, whereas for high tolerance, the vanishing becomes more and more like percolation. The model is studied in the replica symmetric, first step and full replica symmetry breaking schemes.

cond-mat.dis-nn