Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Propagation of Action Potentials

Propagation of Action Potentials

The propagation of an action potential refers to the process by which a nerve impulse, or "action potential," travels along a neuron.
Neurons (nerve cells) have a resting membrane potential, with a slightly negative charge inside compared to outside. This is maintained by ion channels, such as sodium (Na+) and potassium (K+) channels, which control the flow of ions. When a stimulus, like a touch or a signal from another neuron, triggers the neuron, sodium channels open, allowing sodium ions to...

Neural Circuits

Neural Circuits

Neural circuits and neuronal pools are two of the main structures found in the nervous system. Neural circuits are networks of neurons that work together to carry out a specific task or process. They consist of interconnected neurons and glial cells, which provide structural and metabolic support.
Neuronal pools are collections of nerve cells with similar functions and interact through chemical and electrical signals. These pools include both interneurons (the central neural circuit nodes that...

Newton’s Method

Newton’s Method

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.

SFG Algebra

SFG Algebra

In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...

Multi-input and Multi-variable systems

Multi-input and Multi-variable systems

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...

Associative Learning

Associative Learning

Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Accelerated Iterative Learning Control Using Fractional High-Order Update Rule for LTI Systems.

IEEE transactions on cybernetics·2026

Same author

Estimator-Based Second-Order Sliding Mode Control Design for Nonlinear Systems With Unknown Input Delay.

IEEE transactions on cybernetics·2025

Same author

Fractional-Proportional-Type Iterative Learning Control With a Novel Gain Selection Rule.

IEEE transactions on cybernetics·2025

Same author

Noisy Error-Adaptive Weighting Strategy for Accelerating ILC in Discrete-Time Systems.

IEEE transactions on cybernetics·2025

Same author

Event-Triggered Nonsingular Terminal Sliding-Mode Control.

IEEE transactions on cybernetics·2025

Same author

Iterative Learning Control for Pareto Optimal Tracking in Incompatible Multisensor Systems.

IEEE transactions on cybernetics·2025

Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013

Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011

Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011

Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011

Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011

Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011

See all related articles

Search research articles

Related Experiment Videos

A general backpropagation algorithm for feedforward neural networks learning.

Xinghuo Yu¹, M O Efe, O Kaynak

¹Fac. of Informatics and Commun., Central Queensland Univ., Rockhampton, Qld.

IEEE Transactions on Neural Networks

|February 5, 2008

Summary

This summary is machine-generated.

A novel general backpropagation algorithm enhances feedforward neural network learning for time-varying inputs. This method rigorously proves weight convergence, encompassing existing algorithms as special cases.

Related Experiment Videos

Area of Science:

Artificial Intelligence
Machine Learning
Neural Networks

Background:

Backpropagation is a cornerstone algorithm for training feedforward neural networks.
Existing backpropagation algorithms often face limitations with time-varying input data.
Ensuring convergence of network weights is critical for reliable learning.

Purpose of the Study:

To propose a generalized backpropagation algorithm applicable to feedforward neural networks with time-varying inputs.
To provide a rigorous mathematical analysis of the proposed algorithm's convergence properties.
To demonstrate that common backpropagation algorithms are specific instances of this general framework.

Main Methods:

Development of a general backpropagation algorithm.
Utilization of the Lyapunov function approach for convergence analysis.
Derivation of sufficient conditions for guaranteed weight convergence with time-varying inputs.

Main Results:

A general backpropagation algorithm for feedforward neural networks with time-varying inputs has been formulated.
The Lyapunov stability theory confirms the convergence of weights towards error function minima.
Sufficient conditions for convergence under time-varying inputs are established.
Commonly used backpropagation algorithms are identified as special cases of the proposed general algorithm.

Conclusions:

The developed general backpropagation algorithm offers a robust framework for neural network training with dynamic data.
The rigorous analysis ensures reliable convergence, enhancing the stability of neural network learning.
This generalization unifies and extends existing backpropagation techniques, providing broader applicability.