Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by van de Larr, P.
Right arrow Articles by Heskes, T.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by van de Larr, P.
Right arrow Articles by Heskes, T.
(Neural Computation. 1999;11:977-993.)
© 1999 The MIT Press


Letter

Pruning Using Parameter and Neuronal Metrics

Piërre van de Larr

Theoretical Foundation, Foundation for Neural Networks, Department of Medical Physics and Biophysics, University of Nijmegen, The Netherlands

Tom Heskes

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:


Home page
IEICE Trans Inf & SystHome page
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]


Home page
Neural Comput.Home page
T. Karkkainen
MLP in Layer-Wise Form with Applications to Weight Decay
Neural Comput., June 1, 2002; 14(6): 1451 - 1480.
[Abstract] [Full Text]


Home page
Neural Comput.Home page
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]


Home page
Neural Comput.Home page
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
Copyright © 1999 by The MIT Press.