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

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

Maximizing the Directional Derivative

Maximizing the Directional Derivative

The directional derivative is a central concept in multivariable calculus that describes how a function changes at a given point when moving in a specified direction. This direction is represented by a unit vector, ensuring that only the orientation influences the rate of change. By varying the direction, different rates of change can be observed, demonstrating that the directional derivative depends strongly on the chosen direction.The directional derivative is computed using the gradient...

Methods of Medium Optimization

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

Lagrange Multipliers: Two Constraints

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.

Neural Regulation

Neural Regulation

Digestion begins with a cephalic phase that prepares the digestive system to receive food. When our brain processes visual or olfactory information about food, it triggers impulses in the cranial nerves innervating the salivary glands and stomach to prepare for food.

Lagrange Multipliers: Problem Solving

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...

You might also read

Related Articles

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

Sort by

Same author

Online sequential fuzzy extreme learning machine for function approximation and classification problems.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2009

Same author

Neural adaptive control for vibration suppression in composite fin-tip of aircraft.

International journal of neural systems·2008

Same author

Performance evaluation of a sequential minimal radial basis function (RBF) neural network learning algorithm.

IEEE transactions on neural networks·2008

Same author

A complex valued radial basis function network for equalization of fast time varying channels.

IEEE transactions on neural networks·2008

Same author

Nonlinear magnetic storage channel equalization using minimal resource allocation network (MRAN).

IEEE transactions on neural networks·2008

Same author

Communication channel equalization using complex-valued minimal radial basis function neural networks.

IEEE transactions on neural networks·2008

Search research articles

Related Experiment Videos

Dynamic programming approach to optimal weight selection in multilayer neural networks.

P Saratchandran¹

¹Sch. of Electr. and Electron. Eng., Nanyang Technol. Inst.

IEEE Transactions on Neural Networks

|January 1, 1991

Summary

This summary is machine-generated.

A new dynamic programming algorithm optimizes multilayer neural network weights layer by layer. This method provides layer-specific error functions for efficient weight minimization.

Related Experiment Videos

Area of Science:

Computer Science
Artificial Intelligence
Machine Learning

Background:

Multilayer neural networks (MNNs) are fundamental to deep learning.
Efficient weight adjustment is crucial for MNN performance.
Existing methods may lack layer-specific optimization strategies.

Purpose of the Study:

To introduce a novel algorithm for weight adjustments in MNNs.
To leverage dynamic programming principles for optimal weight computation.
To develop a method providing explicit error functions for hidden layers.

Main Methods:

Derivation of a new algorithm based on dynamic programming principles.
Layer-by-layer computation of optimal weights, starting from the output layer.
Formulation of layer-specific error functions dependent only on hidden layer weights and outputs.

Main Results:

The algorithm successfully computes optimal weights for each layer.
An explicit error function is provided for every hidden layer.
Minimization of these error functions leads to optimal hidden layer weights.

Conclusions:

The proposed dynamic programming algorithm offers an effective approach for MNN weight optimization.
The layer-specific error functions facilitate efficient and targeted weight adjustments.
This method enhances the training process and performance of multilayer neural networks.