Boundedness of weight elimination for BP neural networks

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Weight elimination can be usefully interpreted as an assumption about the prior distribution of the weights trained in the backpropagation neural networks (BPNN). Weight elimination based on different scaling of weight parameters is of a general form, with the weight decay and subset selection methods as special cases. The applications of this method have been well developed, however, only few references provides more comprehensive theoretical analysis. To address this issue, we investigate the uniform boundedness of the trained weights based on a descriptive proof. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Wang, J., Zurada, J. M., Wang, Y., Wang, J., & Xie, G. (2014). Boundedness of weight elimination for BP neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8467 LNAI, pp. 155–165). Springer Verlag. https://doi.org/10.1007/978-3-319-07173-2_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free