Related Experiment Video
Updated: Apr 12, 2026

13:19
Deep Neural Networks for Image-Based Dietary Assessment
Published on: March 13, 2021
10.2K
Deterministic convergence of chaos injection-based gradient method for training feedforward neural networks.
Huisheng Zhang1, Ying Zhang2, Dongpo Xu3
1Department of Mathematics, Dalian Maritime University, Dalian, 116026 People's Republic of China ; Research Center of Information and Control, Dalian University of Technology, Dalian, 116024 People's Republic of China.
Cognitive Neurodynamics
|May 15, 2015
Summary
Chaos injection-based gradient method (CIBGM) improves neural network training over standard backpropagation. This study proves CIBGM
Area of Science:
- Artificial Intelligence
- Machine Learning
- Computational Neuroscience
Background:
- Standard backpropagation algorithm faces limitations in neural network training.
- Chaos injection offers a novel approach to enhance gradient-based learning methods.
Purpose of the Study:
- To provide a theoretical convergence analysis of the chaos injection-based gradient method (CIBGM).
- To evaluate CIBGM for both batch and online learning scenarios in feedforward neural networks.
Main Methods:
- Theoretical convergence analysis of CIBGM.
- Mathematical proofs for weak and strong convergence under specified conditions.
- Simulation example to validate theoretical findings.
Main Results:
- Weak convergence of CIBGM is proven, showing training error stabilization and gradient minimization.
- Strong convergence is achieved with an additional condition.
- CIBGM demonstrates superior performance compared to standard backpropagation.
Conclusions:
- CIBGM offers a theoretically sound and effective method for training feedforward neural networks.
- The convergence properties of CIBGM are well-defined for both batch and online learning.
- Chaos injection is a promising technique for improving neural network training efficiency and stability.
Related Concept Videos
Newton’s Method
181
Newton’s Method is a powerful iterative technique for approximating the roots of real-valued, differentiable functions, particularly when analytical solutions are impractical. This approach is widely used in scientific computing, engineering, and finance, where equations may be too complex for traditional algebraic methods to handle. The method relies on an iterative process that refines an initial estimate using the function’s derivative to approach the true solution progressively.
181
Survival Tree
497
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
Building a Survival Tree
Constructing a...
Building a Survival Tree
Constructing a...
497
Multi-input and Multi-variable systems
507
Cruise control systems in cars are designed as multi-input systems to maintain a driver's desired speed while compensating for external disturbances such as changes in terrain. The block diagram for a cruise control system typically includes two main inputs: the desired speed set by the driver and any external disturbances, such as the incline of the road. By adjusting the engine throttle, the system maintains the vehicle's speed as close to the desired value as possible.
In the absence of...
In the absence of...
507
Fast Decoupled and DC Powerflow
858
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
858