-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMLP.java
More file actions
executable file
·162 lines (124 loc) · 3.68 KB
/
Copy pathMLP.java
File metadata and controls
executable file
·162 lines (124 loc) · 3.68 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
import java.util.ArrayList;
import java.util.Random;
import java.io.*;
/**
* Main MLP
* */
public class MLP {
int ni; // number of input
int nh; // number of hidden unit
int no; // number of output
double[] o; // output
private ArrayList<Layer> layers; // array to hold all the arrays
private ArrayList<double[][]> dW;
private ArrayList<double[]> grad;
/***
* Construct the MLP
* */
public MLP(int inputN, int hiddenUnit, int outputN)
{
this.ni = inputN;
this.nh =hiddenUnit;
this.no = outputN;
randomise();
}
/**
* initalize the variables
* */
private void randomise(){
Random rand = new Random();
layers = new ArrayList<Layer>();
layers.add(new Layer(ni,ni,rand));
layers.add(new Layer(ni,nh,rand));
layers.add(new Layer(nh,no,rand));
dW = new ArrayList<double[][]>();
for (int i = 0; i < 3; ++i)
dW.add(new double
[layers.get(i).size()]
[layers.get(i).getWeights(0).length]
);
grad = new ArrayList<double[]>();
for (int i = 0; i < 3; ++i)
grad.add(new double[layers.get(i).size()]);
}
public double[] forward(double[] inputs) {
double outputs[] = new double[inputs.length];
for( int i = 0; i < layers.size(); ++i ) {
outputs = layers.get(i).calOutput(inputs);
inputs = outputs;
}
return outputs;
}
/**
*
* */
private double evaluateError(double output[], double target[]) {
double d[];
// add bias to input if necessary
if (target.length != output.length)
d = Layer.addBias(target);
else
d = target;
assert(output.length == d.length);
double e = 0;
for (int i = 0; i < output.length; ++i)
e += (output[i] - d[i]) * (output[i] - d[i]);
return e;
}
public double backwards(double[] output ,double[] targets) {
// for each neuron in each layer
for (int c = layers.size()-1; c >= 0; --c) {
for (int i = 0; i < layers.get(c).size(); ++i) {
// if it's output layer neuron
if (c == layers.size()-1) {
grad.get(c)[i] =
2 * (layers.get(c).getOutput(i) - targets[0])
* layers.get(c).getActivationDerivative(i);
}
else { // if it's neuron of the previous layers
double sum = 0;
for (int k = 1; k < layers.get(c+1).size(); ++k)
sum += layers.get(c+1).getWeight(k, i) * grad.get(c+1)[k];
grad.get(c)[i] = layers.get(c).getActivationDerivative(i) * sum;
}
}
}
calculateWeightsDelta();
return evaluateError(output,targets);
}
private void resetWeightsDelta()
{
// reset delta values for each weight
for (int c = 0; c < layers.size(); ++c) {
for (int i = 0; i < layers.get(c).size(); ++i) {
double weights[] = layers.get(c).getWeights(i);
for (int j = 0; j < weights.length; ++j)
dW.get(c)[i][j] = 0;
}
}
}
private void calculateWeightsDelta()
{
// forward delta values for each weight
for (int c = 1; c < layers.size(); ++c) {
for (int i = 0; i < layers.get(c).size(); ++i) {
double weights[] = layers.get(c).getWeights(i);
for (int j = 0; j < weights.length; ++j)
dW.get(c)[i][j] += grad.get(c)[i]
* layers.get(c-1).getOutput(j);
}
}
}
public void updateWeights(double learning_rate)
{
for (int c = 0; c < layers.size(); ++c) {
for (int i = 0; i < layers.get(c).size(); ++i) {
double weights[] = layers.get(c).getWeights(i);
for (int j = 0; j < weights.length; ++j)
layers.get(c).setWeight(i, j, layers.get(c).getWeight(i, j)
- (learning_rate * dW.get(c)[i][j]));
}
}
resetWeightsDelta();
}
}