location: Current position: Home >> Scientific Research >> Paper Publications

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

Hits:

Indexed by:期刊论文

Date of Publication:2014-02-01

Journal:JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE C-COMPUTERS & ELECTRONICS

Included Journals:EI、SCIE

Volume:15

Issue:2

Page Number:119-125

ISSN No.:1869-1951

Key Words:Extreme learning machine (ELM); L-1/2 regularizer; Network pruning

Abstract: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.

Pre One:Batch gradient method with smoothing L-1/2 regularization for training of feedforward neural networks

Next One:Neural Networks with L-1 Regularizer for Sparse Representation of Input Data