English

Residual Memory Networks: Feed-forward approach to learn long temporal dependencies

Computation and Language 2018-08-07 v1 Machine Learning Machine Learning

Abstract

Training deep recurrent neural network (RNN) architectures is complicated due to the increased network complexity. This disrupts the learning of higher order abstracts using deep RNN. In case of feed-forward networks training deep structures is simple and faster while learning long-term temporal information is not possible. In this paper we propose a residual memory neural network (RMN) architecture to model short-time dependencies using deep feed-forward layers having residual and time delayed connections. The residual connection paves way to construct deeper networks by enabling unhindered flow of gradients and the time delay units capture temporal information with shared weights. The number of layers in RMN signifies both the hierarchical processing depth and temporal depth. The computational complexity in training RMN is significantly less when compared to deep recurrent networks. RMN is further extended as bi-directional RMN (BRMN) to capture both past and future information. Experimental analysis is done on AMI corpus to substantiate the capability of RMN in learning long-term information and hierarchical information. Recognition performance of RMN trained with 300 hours of Switchboard corpus is compared with various state-of-the-art LVCSR systems. The results indicate that RMN and BRMN gains 6 % and 3.8 % relative improvement over LSTM and BLSTM networks.

Keywords

Cite

@article{arxiv.1808.01916,
  title  = {Residual Memory Networks: Feed-forward approach to learn long temporal dependencies},
  author = {Murali Karthick Baskar and Martin Karafiat and Lukas Burget and Karel Vesely and Frantisek Grezl and Jan Honza Cernocky},
  journal= {arXiv preprint arXiv:1808.01916},
  year   = {2018}
}
R2 v1 2026-06-23T03:25:32.507Z