ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2019
DOI: 10.1109/icassp.2019.8683620
|View full text |Cite
|
Sign up to set email alerts
|

Learning Efficient Sparse Structures in Speech Recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…Wei et al [15] further applied group Lasso regularization on LSTMs and achieved 10.59× speedup without perplexity loss. Zhang et al [10] also extended the structural sparsity learning method to LSTM models for speech recognition and removed 72.5% parameters with negligible accuracy loss.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Wei et al [15] further applied group Lasso regularization on LSTMs and achieved 10.59× speedup without perplexity loss. Zhang et al [10] also extended the structural sparsity learning method to LSTM models for speech recognition and removed 72.5% parameters with negligible accuracy loss.…”
Section: Related Workmentioning
confidence: 99%
“…However, randomly distributed zeros in models do not have benefit for execution on hardware. [10] elaborates the benefit of structural sparsity over non-structural sparsity on locality and parallelism during hardware execution. To force zero parameters to form a regular arrangement, structural sparsity [11] is proposed for CNNs to learn sparse structures like channel and filter.…”
Section: Introductionmentioning
confidence: 99%