Table of Content

Open Access iconOpen Access


An Improved End-to-End Memory Network for QA Tasks

Aziguli Wulamu1,2, Zhenqi Sun1,2, Yonghong Xie1,2,*, Cong Xu1,2, Alan Yang3

School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, 100083, China.
Beijing Key Laboratory of Knowledge Engineering for Materials Science, Beijing, 100083, China.
Amphenol Assemble Tech, Houston, TX 77070, US.

* Corresponding Author: Yonghong Xie. Email: email.

Computers, Materials & Continua 2019, 60(3), 1283-1295.


At present, End-to-End trainable Memory Networks (MemN2N) has proven to be promising in many deep learning fields, especially on simple natural language-based reasoning question and answer (QA) tasks. However, when solving some subtasks such as basic induction, path finding or time reasoning tasks, it remains challenging because of limited ability to learn useful information between memory and query. In this paper, we propose a novel gated linear units (GLU) and local-attention based end-to-end memory networks (MemN2N-GL) motivated by the success of attention mechanism theory in the field of neural machine translation, it shows an improved possibility to develop the ability of capturing complex memory-query relations and works better on some subtasks. It is an improved end-to-end memory network for QA tasks. We demonstrate the effectiveness of these approaches on the 20 bAbI dataset which includes 20 challenging tasks, without the use of any domain knowledge. Our project is open source on github4.


Cite This Article

APA Style
Wulamu, A., Sun, Z., Xie, Y., Xu, C., Yang, A. (2019). An improved end-to-end memory network for QA tasks. Computers, Materials & Continua, 60(3), 1283-1295.
Vancouver Style
Wulamu A, Sun Z, Xie Y, Xu C, Yang A. An improved end-to-end memory network for QA tasks. Comput Mater Contin. 2019;60(3):1283-1295
IEEE Style
A. Wulamu, Z. Sun, Y. Xie, C. Xu, and A. Yang "An Improved End-to-End Memory Network for QA Tasks," Comput. Mater. Contin., vol. 60, no. 3, pp. 1283-1295. 2019.


cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2408


  • 1832


  • 0


Related articles

Share Link