Some afterthoughts on hopfield networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1725, Issue , 1999, Pages 459-469

  Šíma, Jiří ^a   Orponen, Pekka ^b   Antti Poika, Teemu ^b  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE; POLYNOMIAL APPROXIMATION;

APPROXIMATE ALGORITHMS; COMPUTATIONAL ASPECTS; COMPUTATIONAL EQUIVALENCE; CONVERGENCE TIME; HOPFIELD NETWORKS; MINIMUM ENERGY PROBLEMS; POLYNOMIAL-TIME; TURING UNIVERSALITY;

COMPUTATION THEORY;

EID: 22444452776     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47849-3_34     Document Type: Conference Paper

References (34)

1. Aarts, E., Korst, J. Simulated Annealing and Boltzmann Machines. Wiley and Sons, 1989.
2. Balcázar, J. L., Gavaldà, R., Siegelmann, H. T. Computational power of neural networks: A characterization in terms of Kolmogorov complexity. IEEE Transactions of Information Theory, 43, 1175-1183, 1997.
3. Barahona, F. On the computational complexity of Ising spin glass models. Journal of Physics A, 15, 3241-3253, 1982.
4. Bertoni, A., Compadelli, P. On the approximability of the energy function. In Proceedings of the ICANN’94 conference, 1157-1160, Springer-Verlag, 1994.
5. Bertoni, A., Campadelli, P., Gangai, C., Posenato, R. Approximability of the ground state problem for certain Ising spin glasses. Journal of Complexity, 13, 323-339, 1997.
6. Bieche, I., Maynard, R., Rammal, R., Uhry, J. P. On the ground states of the frustration model of a spin glass by a matching method of graph theory. Journal of Physics A, 13, 2553-2576, 1980.
7. Farhat, N. H., Psaltis, D., Prata, A., Paek, E. Optical implementation of the Hopfield model. Applied Optics, 24, 1469-1475, 1985.
8. Floreen, P. Worst-case convergence times for Hopfield memories. IEEE Transactions on Neural Networks, 2, 533-535, 1991.
9. Floreen, P., Orponen, P. Complexity issues in discrete Hopfield networks. Research Report A-1994-4, Department of Computer Science, University of Helsinki, 1994.
10. Goemans, M. X., Williamson, D. P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42, 1115-1145, 1995.
11. Goles, E., Martínez, S. Exponential transient classes of symmetric neural networks for synchronous and sequential updating. Complex Systems, 3, 589-597, 1989.
12. Hopfield, J. J. Neural networks and physical systems with emergent collective computational abilities. In Proceedings of the National Academy of Sciences, vol. 79, 2554-2558, 1982.
13. Hopfield, J. J. Neurons with graded response have collective computational properties like those of two-state neurons. In Proceedings of the National Academy of Sciences, vol. 81, 3088-3092, 1984.
14. Hopfield, J. J., Tank, D. W. “Neural” computation of decisions in optimization problems. Biological Cybernetics, 52, 141-152, 1985.
15. Horne, B. G., Hush, D. R. Bounds on the complexity of recurrent neural network implementations of finite state machines. Neural Networks, 9, 243-252, 1996.
16. Indyk, P. Optimal simulation of automata by neural nets. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, vol. 900 of LNCS, 337-348, Springer-Verlag, 1995.
17. Koiran, P. Dynamics of discrete time, continuous state Hopfield networks. Neural Computation, 6, 459-468, 1994.
18. Komlos, P., Paturi, R. Convergence results in an associative memory model. Neural Networks, 1, 239-250, 1988.
19. Maass, W., Orponen, P. On the effect of analog noise in discrete-time analog computations. Neural Computation, 10, 1071-1095, 1998.
20. Mahajan, S., Ramesh, H. Derandomizing semidefinite programming based approximation algorithms. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science., 162-163, IEEE, Los Alamitos, California, 1995.
21. Orponen, P. The computational power of discrete Hopfield nets with hidden units. Neural Computation, 8, 403-415, 1996.
22. Parberry, I. A primer on the complexity theory of neural networks. In Formal Techniques in Artificial Intelligence: A Sourcebook, editor R. B. Banerji, 217-268, Elsevier, North-Holland, 1990.
23. Poljak, S., Sura, M. On periodical behaviour in societies with symmetric influences. Combinatorica, 3, 119-121, 1983.
24. Rojas, R. Neural Networks: A Systematic Introduction. Springer Verlag, 1996.
25. Siegelmann, H. T., Sontag, E. D. Analog computation via neural networks. Theoretical Computer Science, 131, 331-360, 1994.
26. Siegelmann, H. T., Sontag, E. D. Computational power of neural networks. Journal of Computer System Science, 50, 132-150, 1995.
27. Šíma, J. Hopfield languages. In Proceedings of the SOFSEM Seminar on Current Trends in Theory and Practice of Informatics, LNCS 1012, 461-468, Springer- Verlag, 1995.
28. Šíma, J. Analog stable simulation of discrete neural networks. Neural Network World, 7, 679-686, 1997.
29. Šíma, J., Orponen, P. A continuous-time Hopfield net simulation of discrete neural networks. Technical report V-773, ICS ASCR, Prague, January, 1999.
30. Šíma, J., Orponen, P., Antti-Poika, T. Some afterthoughts on Hopfield networks. Technical report V-781, ICS ASCR, Prague, May, 1999.
31. Šíma, J., Wiedermann, J. Theory of neuromata. Journal of the ACM, 45, 155-178, 1998.
32. Sheu, B., Lee, B., Chang, C.-F. Hardware annealing for fast-retrieval of optimal solutions in Hopfield neural networks. In Proceedings of the IEEE International Joint Conference on Neural Networks, Seattle, Vol. 2, 327-332, 1991.
33. Wegener, I. The Complexity of Boolean Functions. Wiley/Teubner, 1987.
34. Wiedermann, J. Complexity issues in discrete neurocomputing. Neural Network World, 4, 99-119, 1994.