Neural Network Toolbox | Search  Help Desk |
traingda | See Also |
Gradient descent with adaptive lr backpropagation
[net,tr] = traingda(net,Pd,Tl,Ai,Q,TS,VV)
info = traingda(code)
traingda
is a network training function that updates weight and bias values according to gradient descent with adaptive learning rate.
traingda(NET,Pd,Tl,Ai,Q,TS,VV)
takes these inputs,
Ai -
Initial input delay conditions.
VV -
Either empty matrix []
or structure of validation vectors.
TR -
Training record of various values over each epoch:
traingda
's training parameters, shown here with their default values:
net.trainParam.epochs 10
Maximum number of epochs to train
net.trainParam.goal 0
Performance goal
net.trainParam.lr 0.01
Learning rate
net.trainParam.lr_inc 1.05
Ratio to increase learning rate
net.trainParam.lr_dec 0.7
Ratio to decrease learning rate
net.trainParam.max_fail 5
Maximum validation failures
net.trainParam.max_perf_inc 1.04
Maximum performance increase
net.trainParam.min_grad 1e-10
Minimum performance gradient
net.trainParam.show 25
Epochs between showing progress
net.trainParam.time inf
Maximum time to train in seconds
Pd - No
x Ni
x TS
cell array, each element P{i,j,ts}
is a Dij
x Q
matrix.
Tl - Nl
x TS
cell array, each element P{i,ts}
is a Vi
x Q
matrix.
Ai - Nl
x LD
cell array, each element Ai{i,k}
is an Si
x Q
matrix.
Dij = Ri * length(net.inputWeights{i,j}.delays)
VV
is not []
, it must be a structure of validation vectors,
VV.PD -
Validation delayed inputs.
VV.Tl -
Validation layer targets.
VV.Ai -
Validation initial input conditions.
VV.TS -
Validation time steps.
max_fail
epochs in a row.
traingda(code)
return useful information for each code
string:
You can create a standard network that uses traingda
with newff
, newcf
, or newelm
.
To prepare a custom network to be trained with traingda
:
.net.trainFcn
to 'traingda
'. This will set net.trainParam
to traingda
's
default parameters.
.net.trainParam
properties to desired values.
train
with the resulting network will train the network with traingda
.
See newff
, newcf
, and newelm
for examples.
traingda
can train any network as long as its weight, net input, and transfer functions have derivative functions.
Backpropagation is used to calculate derivatives of performance dperf
with respect to the weight and bias variables X
. Each variable is adjusted according to gradient descent:
dX = lr*dperf/dXAt each epoch, if performance decreases toward the goal, then the learning rate is increased by the factor
lr_inc
. If performance increases by more than the factor max_perf_inc
, the learning rate is adjusted by the factor lr_dec
and the change, which increased the performance, is not made.
Training stops when any of these conditions occurs:
.epochs
(repetitions) is reached.
.time
has been exceeded.
.goal
.
.mingrad
.
.max_fail
times since the
last time it decreased (when using validation).
newff
,
newcf
,
traingd
,
traingdm
,
traingdx
,
trainlm