Sequential RAM-based neural networks: learnability, generalisation, knowledge extraction, and grammatical inference.
A fundamental question in the field of artificial neural networks is what set of problems a given class of networks can perform (computability). Such a problem can be made less general, but no less important, by asking what these networks could learn by using a given training procedure (learnability). The basic purpose of this paper is to address the learnability problem. Specifically, it analyses the learnability of sequential RAM-based neural networks. The analytical tools used are those of Automata Theory. In this context, this paper establishes which class of problems and under what conditions such networks, together with their existing learning rules, can learn and generalize. This analysis also yields techniques for both extracting knowledge from and inserting knowledge into the networks. The results presented here, besides helping in a better understanding of the temporal behaviour of sequential RAM-based networks, could also provide useful insights for the integration of the symbolic/connectionist paradigms.
de Souto
M C
MC
Dept. of Electrical Eng.-Imperial College, London, UK. M.DESOUTO@IC.AC.UK
Adeodato
P J
PJ
Ludermir
T B
TB
D000465:Algorithms; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated