Optimal Brain Surgeon and general network pruning
| Autor: | Babak Hassibi, David G. Stork, Gregory J. Wolff |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Hessian matrix
Artificial neural network Computer science business.industry Generalization Recursion (computer science) Machine learning computer.software_genre Backpropagation Set (abstract data type) symbols.namesake Error function symbols Artificial intelligence Pruning (decision trees) business computer Algorithm |
| Zdroj: | ICNN |
| DOI: | 10.1109/icnn.1993.298572 |
| Popis: | The use of information from all second-order derivatives of the error function to perform network pruning (i.e., removing unimportant weights from a trained network) in order to improve generalization, simplify networks, reduce hardware or storage requirements, increase the speed of further training, and, in some cases, enable rule extraction, is investigated. The method, Optimal Brain Surgeon (OBS), is significantly better than magnitude-based methods and Optimal Brain Damage, which often remove the wrong weights. OBS, permits pruning of more weights than other methods (for the same error on the training set), and thus yields better generalization on test data. Crucial to OBS is a recursion relation for calculating the inverse Hessian matrix H^-1 from training data and structural information of the set. OBS permits a 76%, a 62%, and a 90% reduction in weights over backpropagation with weight decay on three benchmark MONK'S problems. Of OBS, Optimal Brain Damage, and a magnitude-based method, only OBS deletes the correct weights from a trained XOR network in every case. Finally, whereas Sejnowski and Rosenberg used 18,000 weights in their NETtalk network, we used OBS to prune a network to just 1,560 weights, yielding better generalization. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|