vix.ing · top · new · best · stats

UnICORNN: A recurrent model for learning very long time dependencies

2021/03/09 by T. Konstantin Rusch, Siddhartha Mishra, Rusch, T. Konstantin +1 · 10 citations
Computer Science · Mathematics · #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #cs.LG #math.DS #stat.ML

paper · pdf · doi:10.48550/arxiv.2103.05487

arxiv created 2021/06/10 · arxiv updated 2021/08/19

Abstract

The design of recurrent neural networks (RNNs) to accurately process sequential inputs with long-time dependencies is very challenging on account of the exploding and vanishing gradient problem. To overcome this, we propose a novel RNN architecture which is based on a structure preserving discretization of a Hamiltonian system of second-order ordinary differential equations that models networks of oscillators. The resulting RNN is fast, invertible (in time), memory efficient and we derive rigorous bounds on the hidden state gradients to prove the mitigation of the exploding and vanishing gradient problem. A suite of experiments are presented to demonstrate that the proposed RNN provides state of the art performance on a variety of learning tasks with (very) long-time dependencies.

Cited by

Related