arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.03474cs.LGcs.CLcs.NE

Recurrent Highway Networks

ETH Zürich(苏黎世联邦理工学院);The Swiss AI Lab IDSIA (USI-SUPSI)(瑞士人工智能实验室IDSIA(卢加诺大学-瑞士南部应用科学与艺术大学));NNAISENSE

Julian Georg Zilly, Rupesh Kumar Srivastava, Jan Koutník, Jürgen Schmidhuber

英文摘要:

Many sequential processing tasks require complex nonlinear transition functions from one step to the next. However, recurrent neural networks with 'deep' transition functions remain difficult to train, even when using Long Short-Term Memory (LSTM) networks. We introduce a novel theoretical analysis of recurrent networks based on Gersgorin's circle theorem that illuminates several modeling and optimization issues and improves our understanding of the LSTM cell. Based on this analysis we propose Recurrent Highway Networks, which extend the LSTM architecture to allow step-to-step transition depths larger than one. Several language modeling experiments demonstrate that the proposed architecture results in powerful and efficient models. On the Penn Treebank corpus, solely increasing the transition depth from 1 to 10 improves word-level perplexity from 90.6 to 65.4 using the same number of parameters. On the larger Wikipedia datasets for character prediction (text8 and enwik8), RHNs outperform all previous results and achieve an entropy of 1.27 bits per character.

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

↑