Fast Pruning Using Principal Components

We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)", is based on principal component analysis of the node activations of successive layers of the network. It is simple, cheap to implement, and e ective. It requires no network retraining, and does not involve calculating the full Hessian of the cost function. Only the weight and the node activity correlation matrices for each layer of nodes are required. We demonstrate the e cacy of the method on a regression problem using polynomial basis functions, and on an economic time series prediction problem using a two-layer, feedforward network.

• Type: Conference
• Year: 1993
• Where: NIPS
• Authors: Asriel U. Levin, Todd K. Leen, John E. Moody
• Keywords: Network Generalization, NIPS 1993, NIPS 2007, Node Activity Correlation, Principal Component Analysis