Levenberg-Marquardt algorithm for Mackey-Glass chaotic time series prediction (Q2320690)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7097563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Levenberg-Marquardt algorithm for Mackey-Glass chaotic time series prediction |
scientific article; zbMATH DE number 7097563 |
Statements
Levenberg-Marquardt algorithm for Mackey-Glass chaotic time series prediction (English)
0 references
23 August 2019
0 references
Summary: For decades, Mackey-Glass chaotic time series prediction has attracted more and more attention. When the multilayer perceptron is used to predict the Mackey-Glass chaotic time series, what we should do is to minimize the loss function. As is well known, the convergence speed of the loss function is rapid in the beginning of the learning process, while the convergence speed is very slow when the parameter is near to the minimum point. In order to overcome these problems, we introduce the Levenberg-Marquardt algorithm (LMA). Firstly, a rough introduction is given to the multilayer perceptron, including the structure and the model approximation method. Secondly, we introduce the LMA and discuss how to implement the LMA. Lastly, an illustrative example is carried out to show the prediction efficiency of the LMA. Simulations show that the LMA can give more accurate prediction than the gradient descent method.
0 references
0 references
0.93525016
0 references
0.88879085
0 references
0 references
0.8677959
0 references
0.86724925
0 references
0.8663998
0 references