IEEE International Conference on Neural Networks
DOI: 10.1109/icnn.1993.298623
|View full text |Cite
|
Sign up to set email alerts
|

A direct adaptive method for faster backpropagation learning: the RPROP algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
1,792
0
90

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 2,999 publications
(1,886 citation statements)
references
References 3 publications
4
1,792
0
90
Order By: Relevance
“…This approach reduces the variance of the estimation. All runs were done using the RPROP training algorithm Riedmiller & Braun, 1993 using the squared error function and the parameters + = 1 : 1, , = 0 : 5, 0 2 0:05 : : : 0 : 2 randomly per weight, max = 50, min = 0, initial weights ,0:5 : : : 0 : 5 randomly. RPROP is a fast backpropagation variant similar in spirit to quickprop Fahlman, 1988 .…”
Section: Methodsmentioning
confidence: 99%
“…This approach reduces the variance of the estimation. All runs were done using the RPROP training algorithm Riedmiller & Braun, 1993 using the squared error function and the parameters + = 1 : 1, , = 0 : 5, 0 2 0:05 : : : 0 : 2 randomly per weight, max = 50, min = 0, initial weights ,0:5 : : : 0 : 5 randomly. RPROP is a fast backpropagation variant similar in spirit to quickprop Fahlman, 1988 .…”
Section: Methodsmentioning
confidence: 99%
“…1. This gradient was accelerated by RPROP (Riedmiller and Braun, 1993) before each weight update was finally made. After 800 iterations, the average trajectory cost per time step along the whole trajectory was calculated and noted in Table 1, in the first row (without sta-bilization matrix).…”
Section: Training the Neural Controllermentioning
confidence: 99%
“…Neural networks had five hidden neurons and were trained for 100 epochs with a resilient backpropagation algorithm. 36 The requirement for the partitioning algorithm was to provide sufficiently accurate partitioning in a reasonable time. Because OLS proved to be the fastest prediction method with overall prediction accuracy close to the other two methods, it was chosen for specialized predictors in the partitioning algorithm.…”
Section: Choice Of Specialized Predictorsmentioning
confidence: 99%