title: Universal approximation of extreme learning machine with adaptive growth of hidden nodes.
abstract: Extreme learning machines (ELMs) have been proposed for generalized single-hidden-layer feedforward networks which need not be neuron-like and perform well in both regression and classification applications. In this brief, we propose an ELM with adaptive growth of hidden nodes (AG-ELM), which provides a new approach for the automated design of networks. Different from other incremental ELMs (I-ELMs) whose existing hidden nodes are frozen when the new hidden nodes are added one by one, in AG-ELM the number of hidden nodes is determined in an adaptive way in the sense that the existing networks may be replaced by newly generated networks which have fewer hidden nodes and better generalization performance. We then prove that such an AG-ELM using Lebesgue p-integrable hidden activation functions can approximate any Lebesgue p-integrable function on a compact input set. Simulation results demonstrate and verify that this new approach can achieve a more compact network architecture than the I-ELM.
authors.forename: Rui
authors.initials: R
authors.lastname: Zhang
authors.forename: Yuan
authors.initials: Y
authors.lastname: Lan
authors.forename: Guang-Bin
authors.initials: GB
authors.lastname: Huang
authors.forename: Zong-Ben
authors.initials: ZB
authors.lastname: Xu
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D005246:Feedback; D015233:Models, Statistical; D016571:Neural Networks, Computer; D017711:Nonlinear Dynamics; D010363:Pattern Recognition, Automated / Q000379:methods*