Convergence analysis of BP neural networks via sparse response regularization
Authors:
- Jian WangJian Wang
- Yanqing WenYWYanqing Wen
- Zhenyun YeZYZhenyun Ye
- Ling JianLJLing Jian
- Hua ChenHCHua Chen
- 1 December 2017
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 61, 354-363
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61305075)
- China Postdoctoral Science Foundation (2012M520624)
- Natural Science Foundation of Shandong Province (ZR2013FQ004, ZR2013DM015)
- Specialized Research Fund for the Doctoral Program of Higher Education of China (20130133120014)
- Fundamental Research Funds for the Central Universities (13CX05016A, 14CX05042A, 15CX05053A, 15CX08011A)
This publication has 24 references indexed in Scilit:
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- A new pruning heuristic based on variance analysis of sensitivity informationIEEE Transactions on Neural Networks, 2001
- Constructive neural-network learning algorithms for pattern classificationIEEE Transactions on Neural Networks, 2000
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998
- Perturbation method for deleting redundant inputs of perceptron networksNeurocomputing, 1997
- A Penalty-Function Approach for Pruning Feedforward Neural NetworksNeural Computation, 1997
- The dependence identification neural network construction algorithmIEEE Transactions on Neural Networks, 1996
- Bayesian Regularization and Pruning Using a Laplace PriorNeural Computation, 1995
- Pruning algorithms-a surveyIEEE Transactions on Neural Networks, 1993
- Simplifying Neural Networks by Soft Weight-SharingNeural Computation, 1992