Regularization by Intrinsic Plasticity and Its Synergies with Recurrence for Random Projection Methods

HTML  XML Download Download as PDF (Size: 1324KB)  PP. 230-246  
DOI: 10.4236/jilsa.2012.43024    4,168 Downloads   6,972 Views  Citations

ABSTRACT

Neural networks based on high-dimensional random feature generation have become popular under the notions extreme learning machine (ELM) and reservoir computing (RC). We provide an in-depth analysis of such networks with respect to feature selection, model complexity, and regularization. Starting from an ELM, we show how recurrent connections increase the effective complexity leading to reservoir networks. On the contrary, intrinsic plasticity (IP), a biologically inspired, unsupervised learning rule, acts as a task-specific feature regularizer, which tunes the effective model complexity. Combing both mechanisms in the framework of static reservoir computing, we achieve an excellent balance of feature complexity and regularization, which provides an impressive robustness to other model selection parameters like network size, initialization ranges, or the regularization parameter of the output learning. We demonstrate the advantages on several synthetic data as well as on benchmark tasks from the UCI repository providing practical insights how to use high-dimensional random networks for data processing.

Share and Cite:

K. Neumann, C. Emmerich and J. Steil, "Regularization by Intrinsic Plasticity and Its Synergies with Recurrence for Random Projection Methods," Journal of Intelligent Learning Systems and Applications, Vol. 4 No. 3, 2012, pp. 230-246. doi: 10.4236/jilsa.2012.43024.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.