Jan 04, 2019 deep-learning, deep-learning
WHY?
Using external memory as modern computer enable neural net the use of extensible memory. This paper suggests Differentible Neural Computer(DNC) which is an advanced version of Neural Turing Machine.
WHAT?
Reading and writing in DNC are implemented with differentiable attention mechanism.
The controller of DNC is an variant of LSTM architecture that takes an input vector(
x
t
) and a set of read vectors(
r
t − 1
1
, ...,
r
t − 1
R
) as input(concatenated). Concatenated input and hidden vectors from both previous timestep(
h
t − 1
l
) and from previous layer(
h
t
l − 1
) are concatenated again to be used as input for LSTM to produce next hidden vector(
h
t
l
). Hidden vectors from all layers at a timestep are concatenated to emit an output vector(
υ
t
) and an interface vector(
ξ
t
). The output vector(
y
t
) is the sum of
υ
t
and read vectors of the current timestep.
v
t
=
W
y
[
h
t
1
; ...;
h
t
L
]
x
i
t
=
W
ξ
[
h
t
1
; ...;
h
t
L
]
y
t
=
υ
t
+
W
t
[
r
t
1
; ...;
r
t
R
]
THe interface vectors are consists of many vectors that interacts with memory: R read keys(
k
t
r, i
∈
R
W
), read strengths(
β
t
r, i
), write key(
k
t
w
∈
R
W
), write strength(
β
t
w
), erase vector(
e
t
∈
R
W
), write vector(
v
t
∈
R
W
), R free gates(
f
t
i
), the allocation gate(
g
t
a
), the write gate(
g
t
w
) and R read modes(_t^i).
m
a
t
h
b
f
ξ
t
= [
k
t
r, 1
; ...;
k
t
r, R
;
β
t
r, 1
; ...;
β
t
r, R
;
k
t
w
;
β
t
w
;
e
t
;
v
t
;
f
t
1
; ...;
f
t
R
;
g
t
a
;
g
t
w
;
π
t
1
; ...;
π
t
R
]
Read vectors are computed with read weights on memory. Memory matrix are updated with write weights, write vector and erase vector.
m
a
t
h
b
f
r
t
i
=
M
t
T
w
t
r, i
M
t
=
M
t − 1
⊙ (
E
−
w
t
w
e
t
T
) +
w
t
w
v
t
T
Memory are addressed with content-based addressing and dynamic memory allocation. Contesnt-based addressing is basically the same as attention mechanism. Dynamic memory allocation is designed to clear memory as analogous to free list memory allocation scheme.
So?
DNC showed good result on bAbI task, and Graph tasks.