A node pruning algorithm based on a Fourier amplitude sensitivity test method.
In this paper, we propose a new pruning algorithm to obtain the optimal number of hidden units of a single layer of a fully connected neural network (NN). The technique relies on a global sensitivity analysis of model output. The relevance of the hidden nodes is determined by analysing the Fourier decomposition of the variance of the model output. Each hidden unit is assigned a ratio (the fraction of variance which the unit accounts for) that gives their ranking. This quantitative information therefore leads to a suggestion of the most favorable units to eliminate. Experimental results suggest that the method can be seen as an effective tool available to the user in controlling the complexity in NNs.
Laboratoire de Genie Industriel, Universite de la Reúnion, 97705 Saint Denis Messag 9 Réunion, France. lauret@univ-reunion.fr
Philippe
P
Lauret
Eric
E
Fock
Thierry Alex
TA
Mara
D000465:Algorithms; D003198:Computer Simulation; D005583:Fourier Analysis; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D009716:Numerical Analysis, Computer-Assisted; D012815:Signal Processing, Computer-Assisted