-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathneural_network.cpp
More file actions
66 lines (58 loc) · 2.06 KB
/
Copy pathneural_network.cpp
File metadata and controls
66 lines (58 loc) · 2.06 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
#include "neural_network.hpp"
#include "utils.hpp"
#include <algorithm>
#include <cassert>
#include <random>
#include <utility>
vector neural_network::forward_propagate(vector &input) {
for (int i = 0; i < layers[0].n; ++i) {
layers[0][i] = input[i];
}
for (int l = 1; l < num_layers; ++l) {
for (int r = 0; r < layers[l-1].n; ++r) {
for (int c = 0; c < layers[l].n; ++c) {
layers[l][c] += weights[l-1][r][c] * layers[l-1][r];
}
}
for (int i = 0; i < layers[l].n; ++i) {
layers[l][i] = sigmoid(layers[l][i]);
}
}
return layers[num_layers-1];
}
void neural_network::backward_propagate(vector &targets) {
for (int i = 0; i < targets.n; ++i) {
errors[num_layers-1][i] = targets[i] - layers[num_layers-1][i];
}
for (int l = num_layers-1; l > 0; --l) {
for (int c = 0; c < layers[l-1].n; ++c) {
errors[l-1][c] = 0;
for (int r = 0; r < layers[l].n; ++r) {
errors[l-1][c] += weights[l-1][c][r] * errors[l][r];
}
for (int r = 0; r < layers[l].n; ++r) {
weights[l-1][c][r] += learning_rate
* layers[l][r] * (1 - layers[l][r])
* errors[l][r] * layers[l-1][c];
}
}
}
}
vector neural_network::query(vector &input) {
return forward_propagate(input);
}
void neural_network::train(std::vector<std::pair<vector, vector>> &data, int epochs = 10) {
// printf("%d %d %d\n", weights[0].c, weights[1].c, weights[2].c);
// const long max = epochs * data.size();
for (int e = 0; e < epochs; ++e) {
// std::shuffle(data.begin(), data.end(), std::random_device());
printf("\r Epoch %d / %d completed", e, epochs);
for (std::size_t n = 0; n < data.size(); ++n) {
forward_propagate(data[n].first);
backward_propagate(data[n].second);
// printf("\r %ld / %ld completed", e * data.size() + n, max);
}
learning_rate *= momentum;
}
printf("\n");
}