-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGraph.js
More file actions
200 lines (179 loc) · 4.98 KB
/
Graph.js
File metadata and controls
200 lines (179 loc) · 4.98 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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
const { Matrix } = require('./Matrix')
const { assert } = require('./utils')
var sig = function (x) {
// helper function for computing sigmoid
return 1.0 / (1 + Math.exp(-x))
}
class Graph {
constructor (needsBackprop = true) {
this.needs_backprop = needsBackprop
// this will store a list of functions that perform backprop,
// in their forward pass order. So in backprop we will go
// backwards and evoke each one
this.backprop = []
}
backward () {
for (var i = this.backprop.length - 1; i >= 0; i--) {
this.backprop[i]() // tick!
}
}
rowPluck (m, ix) {
// pluck a row of m with index ix and return it as col vector
assert(ix >= 0 && ix < m.rows)
var d = m.columns
var out = new Matrix(d, 1)
for (var i = 0, n = d; i < n; i++) {
// copy over the data
out.w[i] = m.w[d * ix + i]
}
if (this.needs_backprop) {
var backward = function () {
for (var i = 0, n = d; i < n; i++) {
m.dw[d * ix + i] += out.dw[i]
}
}
this.backprop.push(backward)
}
return out
}
tanh (m) {
// tanh nonlinearity
var out = new Matrix(m.rows, m.columns)
var n = m.w.length
for (var i = 0; i < n; i++) {
out.w[i] = Math.tanh(m.w[i])
}
if (this.needs_backprop) {
var backward = function () {
for (var i = 0; i < n; i++) {
// grad for z = tanh(x) is (1 - z^2)
var mwi = out.w[i]
m.dw[i] += (1.0 - mwi * mwi) * out.dw[i]
}
}
this.backprop.push(backward)
}
return out
}
sigmoid (m) {
// sigmoid nonlinearity
var out = new Matrix(m.rows, m.columns)
var n = m.w.length
for (var i = 0; i < n; i++) {
out.w[i] = sig(m.w[i])
}
if (this.needs_backprop) {
var backward = function () {
for (var i = 0; i < n; i++) {
// grad for z = tanh(x) is (1 - z^2)
var mwi = out.w[i]
m.dw[i] += mwi * (1.0 - mwi) * out.dw[i]
}
}
this.backprop.push(backward)
}
return out
}
relu (m) {
var out = new Matrix(m.rows, m.columns)
var n = m.w.length
for (var i = 0; i < n; i++) {
out.w[i] = Math.max(0, m.w[i]) // relu
}
if (this.needs_backprop) {
var backward = function () {
for (var i = 0; i < n; i++) {
m.dw[i] += m.w[i] > 0 ? out.dw[i] : 0.0
}
}
this.backprop.push(backward)
}
return out
}
mul (m1, m2) {
// multiply matrices m1 * m2
assert(m1.columns === m2.rows, 'matmul dimensions misaligned')
var n = m1.rows
var d = m2.columns
var out = new Matrix(n, d)
for (var i = 0; i < m1.rows; i++) { // loop over rows of m1
for (var j = 0; j < m2.columns; j++) { // loop over cols of m2
var dot = 0.0
for (var k = 0; k < m1.columns; k++) { // dot product loop
dot += m1.w[m1.columns * i + k] * m2.w[m2.columns * k + j]
}
out.w[d * i + j] = dot
}
}
if (this.needs_backprop) {
var backward = function () {
for (var i = 0; i < m1.rows; i++) { // loop over rows of m1
for (var j = 0; j < m2.columns; j++) { // loop over cols of m2
for (var k = 0; k < m1.columns; k++) { // dot product loop
var b = out.dw[d * i + j]
m1.dw[m1.columns * i + k] += m2.w[m2.columns * k + j] * b
m2.dw[m2.columns * k + j] += m1.w[m1.columns * i + k] * b
}
}
}
}
this.backprop.push(backward)
}
return out
}
add (m1, m2) {
assert(m1.w.length === m2.w.length)
var out = new Matrix(m1.rows, m1.columns)
for (var i = 0, n = m1.w.length; i < n; i++) {
out.w[i] = m1.w[i] + m2.w[i]
}
if (this.needs_backprop) {
var backward = function () {
for (var i = 0, n = m1.w.length; i < n; i++) {
m1.dw[i] += out.dw[i]
m2.dw[i] += out.dw[i]
}
}
this.backprop.push(backward)
}
return out
}
dot (m1, m2) {
// m1 m2 are both column vectors
assert(m1.w.length === m2.w.length)
var out = new Matrix(1, 1)
var dot = 0.0
for (var i = 0, n = m1.w.length; i < n; i++) {
dot += m1.w[i] * m2.w[i]
}
out.w[0] = dot
if (this.needs_backprop) {
var backward = function () {
for (var i = 0, n = m1.w.length; i < n; i++) {
m1.dw[i] += m2.w[i] * out.dw[0]
m2.dw[i] += m1.w[i] * out.dw[0]
}
}
this.backprop.push(backward)
}
return out
}
eltmul (m1, m2) {
assert(m1.w.length === m2.w.length)
var out = new Matrix(m1.rows, m1.columns)
for (var i = 0, n = m1.w.length; i < n; i++) {
out.w[i] = m1.w[i] * m2.w[i]
}
if (this.needs_backprop) {
var backward = function () {
for (var i = 0, n = m1.w.length; i < n; i++) {
m1.dw[i] += m2.w[i] * out.dw[i]
m2.dw[i] += m1.w[i] * out.dw[i]
}
}
this.backprop.push(backward)
}
return out
}
}
module.exports = Graph