Pruning artificial neural networks using neural complexity measures.
This paper describes a new method for pruning artificial neural networks, using a measure of the neural complexity of the neural network. This measure is used to determine the connections that should be pruned. The measure computes the information-theoretic complexity of a neural network, which is similar to, yet different from previous research on pruning. The method proposed here shows how overly large and complex networks can be reduced in size, whilst retaining learnt behaviour and fitness. The technique proposed here helps to discover a network topology that matches the complexity of the problem it is meant to solve. This novel pruning technique is tested in a robot control domain, simulating a racecar. It is shown, that the proposed pruning method is a significant improvement over the most commonly used pruning method Magnitude Based Pruning. Furthermore, some of the pruned networks prove to be faster learners than the benchmark network that they originate from. This means that this pruning method can also help to unleash hidden potential in a network, because the learning time decreases substantially for a pruned a network, due to the reduction of dimensionality of the network.
Jorgensen
Thomas D
TD
Department of Electronic and Computer Engineering, University of Portsmouth, Portsmouth, United Kingdom. Thomas.Jorgensen@port.ac.uk
Haynes
Barry P
BP
Norlund
Charlotte C F
CC
D000465:Algorithms; D001185:Artificial Intelligence; D016571:Neural Networks, Computer; D012371:Robotics / Q000379:methods*; D012984:Software; D013997:Time Factors