Asymptotic performances of a constructive algorithm

摘要

We present a numerical study of a neural tree learning algorithm, the “triolearning≓ strategy. We study the behaviour of the algorithm as a function of the size of the training set. The results show that a limited number of examples can be used to estimate both the network performance and the network complexity that would result from running the algorithm on a large data set.