def test_construc(self):
g = gt.Graph()
g.add_vertex(4)
g.add_edge(g.vertex(0), g.vertex(1))
g.add_edge(g.vertex(0), g.vertex(2))
g.add_edge(g.vertex(1), g.vertex(3))
g.add_edge(g.vertex(2), g.vertex(3))
g.add_vertex(1)
g.add_edge(g.vertex(4), g.vertex(0))
n = Net(1, 1, g)
for e in g.edges():
n.weightProp[e] = 1
for v in g.vertices():
n.activation[v] = LogSigmoid(-1, 1)
n.prepare()
n.backward([1])
n.forward([1])
n.backward([2])
def test_backwardFork(self):
g = gt.Graph()
g.add_vertex(3)
g.add_edge(g.vertex(0), g.vertex(1))
g.add_edge(g.vertex(0), g.vertex(2))
n = Net(1, 2, g)
# Init activation functions
for v in n.g.vertices():
n.activation[v] = Identity()
# All weights == 0
assert_allclose(n.errorProp.a, [0, 0, 0])
n.backward([1, 1])
assert_allclose(n.errorProp.a, [0, 1, 1])
n.backward([-100, -100])
assert_allclose(n.errorProp.a, [0, -100, -100])
# Init weights
for e in n.g.edges():
n.weightProp[e] = 1.0
# Tests
n.backward([1, 1])
assert_allclose(n.errorProp.a, [2, 1, 1])
n.backward([30, 30])
assert_allclose(n.errorProp.a, [60, 30, 30])
n.backward([0, 0])
assert_allclose(n.errorProp.a, [0, 0, 0])
n.backward([-10, -8])
assert_allclose(n.errorProp.a, [-18, -8, -10])
n.backward([3, 57])
assert_allclose(n.errorProp.a, [60, 57, 3])
