~/talk

Neural Turing Machines: Perils and Promise

Talkat MLconf SF 2016 · on Friday, 2016-11-11· [machine-learning]
links:none on file
slides:none on file

Neural Turing Machines (NTMs) are differentiable controllers plus external memory that learn algorithms like copying and balanced-parentheses; implemented in Theano/Lasagne and Go, they copy sequences up to 100 and generalize beyond training lengths. Extensions in the Nature paper produce the Dynamic Neural Computer with temporal links and allocate/deallocate memory, yielding near state-of-the-art on bAbI and passes 95% of bAbI tasks in many categories. They work but require huge parameter counts, are numerically unstable, and need tricks (gradient clipping, Graves’ RMSProp variant, Adam, curriculum learning) to train.

AI-written summary · about

  1. 0:00Intro
  2. 0:53What's a Turing Machine?
  3. 1:20What's a Neural Turing Machine? Neural Network Controller
  4. 3:11Neural Turing Machines can... Learn simple algorithms (Copy, repeat, recognize simple formal languages...)
  5. 4:59Balanced Parenthesis
  6. 7:11Problems Architecture dependent
  7. 8:02Hard to train Numerical Instability
  8. 9:08Gradient clipping Limits training speed of parameters
  9. 11:27Attention to initialization Memory initialization extremely important
  10. 13:47Dynamic Neural Computers
  11. 14:58Architecture updates(1)
  12. 18:35Performance on Inference Tasks
  13. 20:06References
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.