Structure optimization of neural networks with the A*-algorithm

Abstract

A method for the construction of optimal structures for feedforward neural networks is introduced. On the basis of a construction of a graph of network structures and an evaluation value which is assigned to each of them, an heuristic search algorithm can be installed on this graph. The application of the A*-algorithm ensures, in theory, both the optimality of the solution and the optimality of the search. For several examples, a comparison between the new strategy and the well-known cascade-correlation procedure is carried out with respect to the performance of the resulting structures.