Global convergence and suppression of spurious states of the Hopfield neural networks

Assuming that the output function of neurons is monotonic and differentiable at any interior point in the output range, the condition necessary for a vertex of a hypercube to become a local minimum of the Hopfield neural networks and the form of the convergence region to that minimum are clarified. Based on this, a method for analyzing and suppressing spurious states in the networks is derived. It is shown that all the spurious states of the traveling salesman problem (TSP) for the Hopfield original energy function can be suppressed by the method, and the validity of the method is demonstrated by computer simulations. >

[1]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[2]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[3]  H. Szu.  Fast simulated annealing , 1987 .

[4]  Richard P. Lippmann,et al.  An introduction to computing with neural nets , 1987 .

[5]  H. Szu,et al.  Fast TSP algorithm based on binary neuron output and analog neuron input using the zero-diagonal interconnect matrix and necessary and sufficient constraints of the permutation matrix , 1988, IEEE 1988 International Conference on Neural Networks.

[6]  Sweet.  Determination of parameters in a Hopfield/Tank computational network , 1988 .

[7]  Sanjit K. Mitra,et al.  Alternative networks for solving the traveling salesman problem and the list-matching problem , 1988, IEEE 1988 International Conference on Neural Networks.

[8]  B. W. Lee,et al.  An investigation on local minima of a Hopfield network for optimization circuits , 1988, IEEE 1988 International Conference on Neural Networks.

[9]  P. Sadayappan,et al.  Optimization by neural networks , 1988, IEEE 1988 International Conference on Neural Networks.

[10]  D. J. Burr,et al.  An improved elastic net method for the traveling salesman problem , 1988, IEEE 1988 International Conference on Neural Networks.

[11]  Yoshiyasu Takefuji,et al.  Integer linear programming neural networks for job-shop scheduling , 1988, IEEE 1988 International Conference on Neural Networks.

[12]  David E. van den Bout,et al.  A traveling salesman objective function that works , 1988, IEEE 1988 International Conference on Neural Networks.

[13]  G. J. Hueter.  Solution of the traveling salesman problem with an adaptive ring , 1988, IEEE 1988 International Conference on Neural Networks.

[14]  R. C. Mann,et al.  An extension of the Hopfield-Tank model for solution of the multiple traveling salesmen problem , 1988, IEEE 1988 International Conference on Neural Networks.

[15]  A. Michel,et al.  Analysis and synthesis of a class of neural networks: linear systems operating on a closed hypercube , 1989 .

[16]  Behrooz Kamgar-Parsi,et al.  On problem solving with Hopfield neural networks , 1990, International 1989 Joint Conference on Neural Networks.

[17]  C.R.K. Marrian,et al.  A neural net approach to discrete Hartley and Fourier transforms , 1989 .

[18]  S. Abe.  Theories on the Hopfield neural networks , 1989, International 1989 Joint Conference on Neural Networks.

[19]  Y. Akiyama,et al.  Combinatorial optimization with Gaussian machines , 1989, International 1989 Joint Conference on Neural Networks.

[20]  H. Date,et al.  LSI module placement methods using neural computation networks , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[21]  Mahesan Niranjan,et al.  A theoretical investigation into the performance of the Hopfield model , 1990, IEEE Trans. Neural Networks.

[22]  X. Xu,et al.  Effective neural algorithms for the traveling salesman problem , 1991, Neural Networks.