A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.
A common way of designing feed forward networks is to obtain a large network and then to prune less useful hidden units. Here, two non-heuristic pruning algorithms are derived from the Schmidt procedure. In both, orthonormal systems of basis functions are found, ordered, pruned, and mapped back to the original network. In the first algorithm, the orthonormal basis functions are found and ordered one at a time. In optimal pruning, the best subset of orthonormal basis functions is found for each size network. Simulation results are shown.doi:10.1109/acssc.2002.1196939 fatcat:6xafl6zqlfgyzj33hkahr44pue