An Interpretable Constructive Algorithm for Incremental Random Weight Neural Networks and Its Application

In this article, we aim to offer an interpretable learning paradigm for incremental random weight neural networks (IRWNNs). IRWNNs have become a hot research direction of neural network algorithms due to their ease of deployment and fast learning speed. However, existing IRWNNs have difficulty expla...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on industrial informatics Ročník 20; číslo 12; s. 13622 - 13632
Hlavní autoři: Nan, Jing, Dai, Wei, Yuan, Guan, Zhou, Ping
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.12.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Artificial neural networks
Convergence
Data modeling
Datasets
Geometry
Informatics
interpretable constructive algorithm
Machine learning
Mathematical models
Network architecture
Neural networks
neural networks (NNs)
Parameters
random algorithms
Reviews
spatial geometric information
Task complexity
ISSN:1551-3203, 1941-0050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this article, we aim to offer an interpretable learning paradigm for incremental random weight neural networks (IRWNNs). IRWNNs have become a hot research direction of neural network algorithms due to their ease of deployment and fast learning speed. However, existing IRWNNs have difficulty explaining how hidden nodes (parameters) affect the convergence of network residuals. To address this gap, this article proposes an interpretable construction algorithm (ICA). Specifically, we first conduct a spatial geometric analysis of the network construction process and establish the spatial geometric relationship between the network residuals and hidden parameters to visualize the influence of hidden parameters on the convergence of the network residuals. Second, based on the spatial geometric relationship and node pool strategy, an interpretable control strategy with spatial geometry information is established to obtain hidden parameters conducive to the convergence of network residuals. In addition, to facilitate ICA to handle complex tasks of big data, this article proposes a lightweight ICA with low complexity, namely ICA+. Finally, it is proved theoretically that the ICA and ICA+ proposed in this article have universal approximation properties. The experimental results on two real-world datasets and seven benchmark datasets demonstrate the advantages of the proposed ICA and ICA+ in terms of fast learning, good generalization, and compactness of network structure.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1551-3203
1941-0050
DOI:10.1109/TII.2024.3423487