Analytic formulation of intelligent machines as neural nets

The design of the organization level of the intelligent machine as a Boltzmann machine, as described in current neural network literature, is discussed. Since this level is responsible for planning the actions of the machine, the problem at this tier is formulated as the construction of the right se...

Full description

Saved in:
Bibliographic Details
Published inProceedings IEEE International Symposium on Intelligent Control 1988 pp. 22 - 27
Main Authors Saridis, G.N., Moed, M.C.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1988
Subjects
Online AccessGet full text
ISBN9780818620126
0818620129
ISSN2158-9860
DOI10.1109/ISIC.1988.65399

Cover

More Information
Summary:The design of the organization level of the intelligent machine as a Boltzmann machine, as described in current neural network literature, is discussed. Since this level is responsible for planning the actions of the machine, the problem at this tier is formulated as the construction of the right sequence of tasks or events which minimizes the entropy for the desired action. Two search techniques, simulated annealing (SA) and expanding subinterval random search (ESRS), are described. These techniques are used to find the global minimum entropy of a Boltzmann machine. Simulations using these search techniques were conducted using energy as a cost function, and results indicate that ESRS converges faster than SA to a global minimum if the topology contains narrow and deep cost wells.< >
ISBN:9780818620126
0818620129
ISSN:2158-9860
DOI:10.1109/ISIC.1988.65399