pith. sign in

arxiv: 1607.00036 · v2 · pith:DOIZZO4Pnew · submitted 2016-06-30 · 💻 cs.LG · cs.NE

Dynamic Neural Turing Machine with Soft and Hard Addressing Schemes

classification 💻 cs.LG cs.NE
keywords addressingd-ntmbabimachinememoryneuraltasksturing
0
0 comments X
read the original abstract

We extend neural Turing machine (NTM) model into a dynamic neural Turing machine (D-NTM) by introducing a trainable memory addressing scheme. This addressing scheme maintains for each memory cell two separate vectors, content and address vectors. This allows the D-NTM to learn a wide variety of location-based addressing strategies including both linear and nonlinear ones. We implement the D-NTM with both continuous, differentiable and discrete, non-differentiable read/write mechanisms. We investigate the mechanisms and effects of learning to read and write into a memory through experiments on Facebook bAbI tasks using both a feedforward and GRUcontroller. The D-NTM is evaluated on a set of Facebook bAbI tasks and shown to outperform NTM and LSTM baselines. We have done extensive analysis of our model and different variations of NTM on bAbI task. We also provide further experimental results on sequential pMNIST, Stanford Natural Language Inference, associative recall and copy tasks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. DragNUWA: Fine-grained Control in Video Generation by Integrating Text, Image, and Trajectory

    cs.CV 2023-08 unverdicted novelty 6.0

    DragNUWA integrates text, image, and trajectory controls into a diffusion video model using a Trajectory Sampler, Multiscale Fusion, and Adaptive Training to enable fine-grained open-domain video generation.

  2. Understanding Memory Modules on Learning Simple Algorithms

    cs.LG 2019-07 unverdicted novelty 5.0

    NTM and stack-augmented networks both generalize on sequence reversal but only the stack model succeeds on arithmetic expressions by monitoring different input categories and applying distinct memory-update policies.