arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.01792cs.CL
收藏

Mogrifier LSTM

Mogrifier LSTM

DeepMind, London, UK(DeepMind(伦敦,英国));University of Oxford(牛津大学)

Gábor Melis, Tomáš Kočiský, Phil Blunsom

摘要:

自然语言处理的许多进展都是基于更有表现力的模型,即输入如何与它们出现的上下文交互。循环网络虽然取得了一定的成功,但仍然缺乏建模语言最终所需的概括性和系统性。在这项工作中,我们提出了一个古老的长短期记忆的形式相互门控的当前输入和先前的输出的扩展。这种机制提供了一个更丰富的输入和它们的上下文之间的相互作用空间的建模。同样,我们的模型可以被视为使LSTM给出的转换函数依赖于上下文。实验表明,显着提高泛化的语言建模范围内的3-4困惑点的Penn Treebank和Wikitext-2,和0.01-0.05 bpc的四个字符为基础的数据集。我们在所有数据集上建立了一个新的技术状态,除了Enwik 8,我们缩小了LSTM和Transformer模型之间的巨大差距。

英文摘要:

Many advances in Natural Language Processing have been based upon more expressive models for how inputs interact with the context in which they occur. Recurrent networks, which have enjoyed a modicum of success, still lack the generalization and systematicity ultimately required for modelling language. In this work, we propose an extension to the venerable Long Short-Term Memory in the form of mutual gating of the current input and the previous output. This mechanism affords the modelling of a richer space of interactions between inputs and their context. Equivalently, our model can be viewed as making the transition function given by the LSTM context-dependent. Experiments demonstrate markedly improved generalization on language modelling in the range of 3-4 perplexity points on Penn Treebank and Wikitext-2, and 0.01-0.05 bpc on four character-based datasets. We establish a new state of the art on all datasets with the exception of Enwik8, where we close a large gap between the LSTM and Transformer models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑