Double pruning structure design for deep stochastic configuration networks based on mutual information and relevance
DOI:
Author:
Affiliation:

Faculty of Information Technology,Beijing University of Technology

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Deep stochastic configuration networks (DSCNs) produce redundant hidden nodes and connections during training, which complicates their model structures. Aiming at the above problems, this paper proposes a double pruning structure design algorithm for DSCNs based on mutual information and relevance. During the training process, the mutual information algorithm is used to calculate and sort the importance scores of the nodes in each hidden layer in a layer-by-layer manner, the node pruning rate of each layer is set according to the depth of the DSCN at the current time, the nodes that contribute little to the model are deleted, and the network-related parameters are updated. When the model completes the configuration procedure, the correlation evaluation strategy is used to sort the global connection weights and delete insignificance connections; then, the network parameters are updated after pruning is completed. The experimental results show that the proposed structure design method can effectively compress the scale of a DSCN model and improve its modeling speed; the model accuracy loss is small, and fine-tuning for accuracy restoration is not needed. The obtained DSCN model has certain application value in the field of regression analysis.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 17,2023
  • Revised:March 26,2023
  • Adopted:March 26,2023
  • Online:
  • Published:
License
  • Copyright (c) 2023 by the authors. This work is licensed under a Creative
  • Creative Commons Attribution-ShareAlike 4.0 International License.