Semi-tied Units for Efficient Gating in LSTM and Highway Networks

被引:4
作者
Zhang, C. [1 ]
Woodland, P. C. [1 ]
机构
[1] Univ Cambridge, Dept Engn, Trumpington St, Cambridge CB2 1PZ, England
来源
19TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION (INTERSPEECH 2018), VOLS 1-6: SPEECH RESEARCH FOR EMERGING MARKETS IN MULTILINGUAL SOCIETIES | 2018年
关键词
LSTM; highway network; gating; parameterised activation function; speech recognition;
D O I
10.21437/Interspeech.2018-2158
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Gating is a key technique used for integrating information from multiple sources by long short-term memory (LSTM) models and has recently also been applied to other models such as the highway network. Although gating is powerful, it is rather expensive in terms of both computation and storage as each gating unit uses a separate full weight matrix. This issue can be severe since several gates can be used together in e.g. an LSTM cell. This paper proposes a semi-tied unit (STU) approach to solve this efficiency issue, which uses one shared weight matrix to replace those in all the units in the same layer. The approach is termed "semi-tied" since extra parameters are used to separately scale each of the shared output values. These extra scaling factors are associated with the network activation functions and result in the use of parameterised sigmoid, hyperbolic tangent, and rectified linear unit functions. Speech recognition experiments using British English multi-genre broadcast data showed that using STUs can reduce the calculation and storage cost by a factor of three for highway networks and four for LSTMs, while giving similar word error rates to the original models.
引用
收藏
页码:1773 / 1777
页数:5
相关论文
共 41 条
[1]  
[Anonymous], P ASRU SCOTTSD
[2]  
[Anonymous], P ICASSP
[3]  
[Anonymous], P INTERSPEECH
[4]  
[Anonymous], 2014, 14123555 ARXIV
[5]  
[Anonymous], 2014, P INTERSPEECH
[6]  
[Anonymous], P ICASSP
[7]  
[Anonymous], 2015, P ICCV
[8]  
[Anonymous], 2017, THESIS
[9]  
[Anonymous], 2016, P INTERSPEECH
[10]  
[Anonymous], 2013, ICASSP