Abstract
In this paper we give under an appropriate theoretical frame-work a characterization about neural networks which admit an energy. We prove that a neural network admits an energy if and only if the weight matrix verifies two conditions: the diagonal elements are non-negative and the associated incidence graph does not admit non-quasi-symmetric circuits.
Support by the EC Working Group NeuroCOLT and French-Chile cooperation (ECOS-94)is aknowledged.
Partially supported by FONDECYT-94, EC-Chile project in applied mathematics and French-Chile cooperation (ECOS-94).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Fogelman-Soulié, F., Goles, E., Weisbuch, G.: Transient length in sequential iteration of threshold functions. Disc. Appl. Math. 6, (1983) 95–98
Goles, E., Fogelman-Soulié, F., Pellegrin, D.: Decreasing energy functions as a tool for studying threshold netwoks. Disc. Appl. Math. 12, (1985) 261–277
Goles, E., Martinez, S.: Neural and automata networks. Math. and Applications, 58, Kluwer Acad. Pub., (1990)
Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci., USA, 79, (1982) 2554–2558
Kobuchi, Y.: State evaluation functions and Lyapunov functions for neural networks. Neural Networks, 4, (1991) 505–510
X. Xu W.T. Tsai, Construction associative memories using neural networks. Neural Networks, 3, (1990) 301–309
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cosnard, M., Goles, E. (1995). A characterization of the existence of energies for neural networks. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_106
Download citation
DOI: https://doi.org/10.1007/3-540-60084-1_106
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60084-8
Online ISBN: 978-3-540-49425-6
eBook Packages: Springer Book Archive