|
|
||||||||
Letter |
Theoretical Foundation, Foundation for Neural Networks, Department of Medical Physics and Biophysics, University of Nijmegen, The Netherlands
Theoretical Foundation, Foundation for Neural Networks, Department of Medical Physics and Biophysics, University of Nijmegen, The Netherlands
In this article, we introduce a measure of optimality for architecture selection algorithms for neural networks: the distance from the original network to the new network in a metric defined by the probability distributions of all possible networks. We derive two pruning algorithms, one based on a metric in parameter space and the other based on a metric in neuron space, which are closely related to well-known architecture selection algorithms, such as GOBS. Our framework extends the theoretically range of validity of GOBS and therefore can explain results observed in previous experiments. In addition, we give some computational improvements for these algorithms.
This article has been cited by other articles:
![]() |
K. YAMAUCHI and J. HAYAMI Incremental Leaning and Model Selection for Radial Basis Function Network through Sleep IEICE Trans D: Information, March 1, 2007; E90-D(4): 722 - 735. [Abstract] [PDF] |
||||
![]() |
T. Karkkainen MLP in Layer-Wise Form with Applications to Weight Decay Neural Comput., June 1, 2002; 14(6): 1451 - 1480. [Abstract] [Full Text] |
||||
![]() |
D. E. Duckro, D. W. Quinn, and S. J. Gardner III Neural Network Pruning with Tukey-Kramer Multiple Comparison Procedure Neural Comput., May 1, 2002; 14(5): 1149 - 1168. [Abstract] [Full Text] |
||||
![]() |
T. Heskes On "Natural" Learning and Pruning in Multilayered Perceptrons Neural Comput., April 1, 2000; 12(4): 881 - 901. [Abstract] [Full Text] |
||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| J COGNITIVE NEUROSCIENCE | NEURAL COMPUTATION | MIT PRESS JOURNALS |