|
Journal of Zhejiang University SCIENCE C
ISSN 1869-1951(Print), 1869-196x(Online), Monthly
2014 Vol.15 No.2 P.119-125
A pruning algorithm with L1/2 regularizer for extreme learning machine
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 L1/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 by L1/2 regularization has fewer hidden nodes but provides better performance than both the original network and the network pruned by L2 regularization.
Key words: Extreme learning machine (ELM), L1/2 regularizer, Network pruning
创新要点:将L1/2正则化方法与极端学习机结合,利用L1/2正则化较好的稀疏性,修剪极端学习机的网络结构。
方法提亮:极小化的目标函数中含有L1/2范数,当权值变得较小时,其导数值会较大。为了阻止权值过快增长,提出一个可变学习率。
重要结论:数据实验表明,相比于原始的极端学习机算法和带L2正则化的极端学习机算法,带L1/2正则化的极端学习机算法不仅拥有较少隐节点,并且拥有更好泛化能力。
关键词组:
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
DOI:
10.1631/jzus.C1300197
CLC number:
TP312
Download Full Text:
Downloaded:
3828
Download summary:
<Click Here>Downloaded:
2414Clicked:
8895
Cited:
3
On-line Access:
2024-08-27
Received:
2023-10-17
Revision Accepted:
2024-05-08
Crosschecked:
2014-01-15