SAIF 2019 Day 2: Rational Recurrences for Empirical Natural Language Processing Noah Smith

Despite their oftendiscussed advantages, deep learning methods largely disregard theories of both learning and language. This makes their prediction behavior hard to understand and explain. In this talk, I will present a path toward more understandable (but still deep ) natural language processing models, without sacrificing accuracy. Rational recurrences comprise a family of recurrent neural networks that obey a particular set of rules about how to calculate hidden states, and hence correspond to paralle