Grafting constructive algorithm in feedforward neural network learning

被引:0
作者
Siyuan Zhang
Linbo Xie
机构
[1] Jiangnan University,School of Internet of Things Engineering
来源
Applied Intelligence | 2023年 / 53卷
关键词
Constructive algorithm; Grafting mechanism; Ultra-wide network; Feedforward neural network learning;
D O I
暂无
中图分类号
学科分类号
摘要
Constructive algorithm provides a gradually building mechanism by increasing nodes from zero. By this means, the neural network can independently and efficiently determine its structure. However, this mechanism has an essential issue: the algorithm that adds nodes one by one is too greedy to keep an efficient construction way and the global optimal solution may be missed. Therefore, this paper proposes a novel grafting mechanism to add block nodes of any number by training a sub-network during the construction. Then, a fast-training approach of the added block neurons is presented by selecting a small sub-network from the large initialized network and the corresponding grafting constructive algorithm (GCA) is established. To obtain a compact network structure, a fine-tuning scheme is developed according to GCA to adjust all parameters as a hybrid fashion and the hidden weights are extended to deal with matrix input in image classification. The experimental results on regression and classification tasks demonstrate that the proposed GCA can achieve a more compact network than other constructive algorithms and a faster error convergence rate than traditional gradient-based optimization algorithms.
引用
收藏
页码:11553 / 11570
页数:17
相关论文
共 63 条
  • [11] Muzhou H(2017)A new learning paradigm for random vector functional-link network: RVFL+ Neural Netw 122 94-178
  • [12] Taohua L(2017)Insights into randomized algorithms for neural networks: practical issues and common pitfalls Inf Sci 382 170-3479
  • [13] Yunlei Y(2017)Stochastic configuration networks: fundamentals and algorithms IEEE Trans Cybern 47 3466-372
  • [14] Hao Z(2019)Wang, d.: 2-d stochastic configuration networks for image data analytics IEEE Trans Cybern 51 359-24
  • [15] Hongjuan L(2018)Broad learning system: an effective and efficient incremental learning system without the need for deep architecture IEEE Trans Neural Netw Learn Syst 29 10-1088
  • [16] Xiugui Y(2019)Reconciling modern machine-learning practice and the classical bias–variance trade-off Proc Natl Acad Sci 116 201903070-1339
  • [17] Xinge L(2012)Reweighted l1-minimization for sparse solutions to underdetermined linear systems SIAM J Optim 22 1065-2017
  • [18] Kwok TY(2022)Multi-modal convolutional dictionary learning IEEE Trans Image Process 31 1325-5046
  • [19] Yeung DY(2021)An efficient matching pursuit based compressive sensing detector for uplink grant-free noma IEEE Trans Veh 70 2012-3524
  • [20] Islam MM(2020)Signal-dependent performance analysis of orthogonal matching pursuit for exact sparse recovery IEEE Trans Signal Process 68 5031-102