Local minima and generalization
Sandra A. Lawrence, Ah Chung Tsoi, Clyde Lee Giles · 2002
We consider a number of popular beliefs within the neural network community on the training and generalization behavior of multilayer perceptrons, and to some extent recurrent networks that: 1) the solution found is often close to the global minimum in terms of the magnitude of the error; 2) smaller networks generalize better than larger networks; and 3) the number of parameters in the network should be less than the number of data points in order to provide good generalization. For the tasks and methodology we consider, we show that: 1) the solution found is often significantly worse than the global minimum; 2) oversize networks can provide improved generalization due to their ability to find better solutions; and 3) the optimal number of parameters with respect to generalization error can be much larger than the number of data points.