Skip to content

Advertisement

  • Poster presentation
  • Open Access

The Hopfield-like neural network with governed ground state

BMC Neuroscience201314 (Suppl 1) :P257

https://doi.org/10.1186/1471-2202-14-S1-P257

  • Published:

Keywords

  • Neural Network
  • Animal Model
  • Computer Simulation
  • Local Minimum
  • Scalar Product

Using a vector u = ( u 1 , . . . , u p ) let us construct a matrix M i j = ( 1 - δ i j ) u i u j , i , j = 1 , . . , p , where δ i j is the Kronecker delta, u i R 1 and u 2 = p . We define a Hopfield-like neural network with a connection matrix J i j = ( 1 - 2 x ) M i j proportional to M = M i j and threshold T i = q ( 1 - x ) u i proportional to coordinates u i . Real quantities x and q are our free parameters. The dynamics of the network is defined by the equation s i ( τ + 1 ) = sgn j = 1 p J i j s i ( τ ) + T i , where s i ( τ ) = ± 1 are binary coordinates of the configuration vector s ( τ ) = ( s 1 ( τ ) , . . . , s p ( τ ) ) describing the state of the network at the given time τ . Fixed points of the network are local minima of the energy. The configurations providing for the global minimum are called the ground state. Just the ground state is usually associated with the memory of the network. It turns out that to a considerable extent the ground state of our network can be governed by the parameters x , q and u . The point is that in full the energy E ( s ) is defined by the scalar product of vectors s and u : E ( s ) ~ - ( 1 - 2 x ) ( u , s ) 2 - 2 ( 1 - x ) q ( u , s ) . Then the number of different values of the energy is equal to the number of different values of the cosine cos w = s , u / p when s ranges over all 2 p configurations. Let us arrange different values of cosines in the decreasing order starting the numeration from 0: cos w 0 > cos w 1 > ...> cos w t . The set of all the configurations for which the cosine is equal to cos w k we define as the class Σ k : Σ k = s : s , u = p cos w k . It is easy to see that for each k the equalities Σ t - k = - Σ k and cos w t - k = - cos w k are fulfilled. The following statement is true:

Theorem. As x increases beginning from the initial value equals to 0, the ground state of the network coincides in consecutive order with the classes Σ k : Σ 0 Σ 1 Σ 2 . . . Σ k max . The transition from Σ k - 1 Σ k takes place in the critical point x k = q / p + cos w k - 1 + cos w k / 2 q / p + cos w k - 1 + cos w k , k = 1 , 2 , . . k max , and while x x k , x k + 1 the ground state of the network is the class Σ k . The transitions Σ k - 1 Σ k ceases when the denominator of the expression for x k becomes negative. If q / p > 2 , then k max = t .

In large part this theorem allows one to regulate the ground state of the network. Let us examine p -dimensional hypercube whose side length is 2 and the center is in the origin of coordinates. The configurations s coincide with vertices of the hypercube. Possible symmetric directions of the hypercube have to be chosen as vectors u . For each choice of u the configurations s are distributed symmetrically around this vector. Each such symmetrical set of configurations is one of the classes Σ k , and using the theorem one can do it the ground state of the network. In particular, we can construct the ground state with very large number (~ C p k ) of configurations. If nonzero components of the vector u equal in moduli, for each x the only fixed points of the network are its ground state. The classification of all possible applications of this Theorem is not yet finished.

Computer simulations show that basins of attraction of such fixed points are very small. It is not surprising, since the number of the fixed points is very large, and the volume of each basin of attraction is of the order of the volume of the unit hypersphere divided by the number of fixed points.

Declarations

Acknowledgements

The work was supported by Russian Basic Research Foundation (grant 12-07-00259).

Authors’ Affiliations

(1)
Scientific Research Institute for System Analysis Russian Academy of Sciences, Moscow, 119333, Russia

Copyright

© Litinskii and Malsagov; licensee BioMed Central Ltd. 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Advertisement