-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathValue.py
More file actions
97 lines (72 loc) · 2.62 KB
/
Value.py
File metadata and controls
97 lines (72 loc) · 2.62 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
import math
class Value:
def __init__(self, data, _children = (), _op = ''):
self.data = data
self.grad = 0.0
self._prev = set(_children)
self._backward = lambda : None
self._op = _op
def __repr__(self):
return f"Value(data={self.data})"
def __add__(self, other):
other = other if isinstance(other, Value) else Value(other)
out = Value(self.data + other.data, (self, other), '+')
def _backward():
self.grad += 1.0 * out.grad
other.grad += 1.0 * out.grad
out._backward = _backward
return out
def __radd__(self, other):
return self.__add__(other)
def __neg__(self):
return self * -1
def __sub__(self, other):
return self + (-other)
def __mul__(self, other):
other = other if isinstance(other, Value) else Value(other)
out = Value(self.data * other.data, (self, other), '*')
def _backward():
self.grad += other.data * out.grad
other.grad += self.data * out.grad
out._backward = _backward
return out
def __rmul__(self, other):
return self * other
def __pow__(self, other):
assert isinstance(other, (int, float)), "only int or float powers"
out = Value(self.data**other, (self, ), f"**{other}")
def _backward():
self.grad += other * self.data ** (other-1) * out.grad
out._backward = _backward
return out
def __truediv__(self, other):
return self * other**-1
def exp(self):
x = self.data
out = Value(math.exp(x), (self, ), 'exp')
def _backward():
self.grad += out.data * out.grad
out._backward = _backward
return out
def tanh(self):
n = self.data
tanh = (math.exp(2*n) - 1)/(math.exp(2*n) + 1)
out = Value(tanh, (self, ), 'tanh')
def _backward():
#out.grad will always start at 0
self.grad += 4 / (math.exp(2*n) + math.exp(-2*n) + 2) * out.grad
out._backward = _backward
return out
def backward(self):
topo = []
visited = set()
def build_topo(v):
if v not in visited:
visited.add(v)
topo.append(v)
for child in v._prev:
build_topo(child)
build_topo(self)
self.grad = 1.0
for node in topo:
node._backward()