DocumentCode
2752930
Title
Topological analysis of infinite learning automata. II. Training dynamics
Author
Clingman, William H. ; Friesen, Donald K.
Author_Institution
Production Systems Co., Dallas, TX, USA
fYear
1991
fDate
8-14 Jul 1991
Abstract
Summary form only given. Infinite learning automata were used to model the dynamical behavior of neural networks, where the network state space is infinite and in particular a continuum. The dynamics are described by a semigroup S´ of continuous transformations of the state space S. Three aspects of the training dynamics were considered: (1) boundedness of the training time; (2) trainability and robustness; and (3) the analysis of orbits in the state space to detect the presence of sufficient conditions for (1) and (2). These points were studied by giving the function space S´ a topology that inherits many of the topological properties of S. Compactness is related to training time boundedness. Joint continuity of the transition function is related to trainability. When joint continuity exists, S´ is a topological semigroup and orbits in S are related to the monothetic subsemigroups of S´. When S is a compact metric space, tile action of these subsemigroups on the set of orbit cluster points is isomorphic to that of a compact monothetic group
Keywords
automata theory; learning systems; neural nets; state-space methods; topology; infinite learning automata; metric space; monothetic subsemigroups; neural networks; orbit cluster points; state space; sufficient conditions; training dynamics; Computer science; Learning automata; Neural networks; Neurons; Orbits; Production systems; Robustness; State-space methods; Sufficient conditions; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1991., IJCNN-91-Seattle International Joint Conference on
Conference_Location
Seattle, WA
Print_ISBN
0-7803-0164-1
Type
conf
DOI
10.1109/IJCNN.1991.155635
Filename
155635
Link To Document