A pruning algorithm with L 1/2 regularizer for extreme learning machine

Compared with traditional learning methods such as the back propagation (BP) method, extreme learning machine provides much faster learning speed and needs less human intervention, and thus has been widely used. In this paper we combine the L (1/2) regularization method with extreme learning machine to prune extreme learning machine. A variable learning coefficient is employed to prevent too large a learning increment. A numerical experiment demonstrates that a network pruned L (1/2) regularization has fewer hidden nodes but provides better performance than both the original network and the network pruned by L (2) regularization.