Flat Minimum Search, a regularizer algorithm for finding low-complexity networks describable by few bits of information, is employed to train autocoders. Flat minima are regions in weight space where there is tolerable small error and the weights can be perturbed without greatly affecting the network's output. The procedure reveals an important connection between regularization and independent component analysis. This connection may represent a first step towards unification of regularization and unsupervised learning.
|Original language||English (US)|
|Journal||Proceedings - IEEE International Symposium on Circuits and Systems|
|State||Published - Jan 1 1999|