# Robust and Scalable Differentiable Neural Computer for Question Answering

arXiv: https://arxiv.org/abs/1807.02658 · HTML: https://mlsanity.com/paper/1807.02658/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Jul 2018.

## Built on by (most cited first, 3 of 3)

- [A Brain-inspired Memory Transformation based Differentiable Neural Computer for Reasoning-based Question Answering](https://mlsanity.com/paper/2301.02809/) (2023)
- [State-Space Constraints Can Improve the Generalisation of the Differentiable Neural Computer to Input Sequences With Unseen Length](https://mlsanity.com/paper/2110.09138/) (2021)
- [DNCs Require More Planning Steps](https://mlsanity.com/paper/2406.02187/) (2024)

## Abstract (arXiv)

Deep learning models are often not easily adaptable to new tasks and require task-specific adjustments. The differentiable neural computer (DNC), a memory-augmented neural network, is designed as a general problem solver which can be used in a wide range of tasks. But in reality, it is hard to apply this model to new tasks. We analyze the DNC and identify possible improvements within the application of question answering. This motivates a more robust and scalable DNC (rsDNC). The objective precondition is to keep the general character of this model intact while making its application more reliable and speeding up its required training time. The rsDNC is distinguished by a more robust training, a slim memory unit and a bidirectional architecture. We not only achieve new state-of-the-art performance on the bAbI task, but also minimize the performance variance between different initializations. Furthermore, we demonstrate the simplified applicability of the rsDNC to new tasks with passable results on the CNN RC task without adaptions.
