Related Experiment Video
Updated: May 4, 2026

Deep Neural Networks for Image-Based Dietary Assessment
Published on: March 13, 2021
Boundedness and convergence analysis of weight elimination for cyclic training of neural networks
Jian Wang1, Zhenyun Ye2, Weifeng Gao3
1College of Science, China University of Petroleum, Qingdao, 266580, China; Department of Electrical and Computer Engineering, University of Louisville, Louisville, KY, 40292, USA.
Abstract:
Weight elimination offers a simple and efficient improvement of training algorithm of feedforward neural networks. It is a general regularization technique in terms of the flexible scaling parameters. Actually, the weight elimination technique also contains the weight decay regularization for a large scaling parameter. Many applications of this technique and its improvements have been reported. However, there is little research concentrated on its convergence behavior. In this paper, we theoretically analyze the weight elimination for cyclic learning method and determine the conditions for the uniform boundedness of weight sequence, and weak and strong convergence. Based on the assumed network parameters, the optimal choice for the scaling parameter can also be determined. Moreover, two illustrative simulations have been done to support the theoretical explorations as well.
Related Concept Videos
Weighted Mean
For example, consider the number of goals scored in the matches of a tournament. While computing the average number of goals scored in the tournament, it may be more important to...
Reducing Line Loss
With a step-up transformer at the source, the voltage is increased, thereby reducing the current in the transmission lines since power loss in...
Survival Tree
Building a Survival Tree
Constructing a...
Linearization and Approximation
Application of Linearization and Approximation
Area Problem