Improved Conformer with Mamba-Like Linear Attention for Speech Recognition

The attention mechanism in the Conformer encoder is employed to model long-range dependencies in speech data. However, it requires global interactions across all input sequence elements to extract features, resulting in computational complexity that scales quadratically with the sequence length. In long-sequence speech recognition tasks, the high computational complexity considerably increases the model's training duration. To address this problem, we propose an end-to-end approach for speech recognition utilizing a gated linear attention mechanism. Firstly, SEFFN optimizes the channel-wise weight distribution, enhancing the efficient extraction and refinement of high-quality channel-specific features during the training process. The mechanism strengthens the model's capacity to prioritize critical channel-specific features, resulting in an improved capacity for high-quality channel feature modeling and representation. Secondly, a gated linear attention mechanism is employed to reduce the computational complexity to a linear relationship with the length of the speech sequence, thereby mitigating the computational overhead associated with the attention mechanism. Experimental results demonstrate that the character error rate of the model on the Chinese dataset Aishell-1 was reduced to 4.59%, representing a significant improvement compared to the baseline model, thereby validating the proposed method's effectiveness.

Authors

Institutions

Publication Details

Published
2024-12-27
DOI
https://doi.org/10.1145/3718491.3718560
Primary Topic
Speech and Audio Processing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved Conformer with Mamba-Like Linear Attention for Speech Recognition

Fengpei Ge, W. Ding, Chundong Xu, Changsong Lei
Speech and Audio Processing
article

Improved Conformer with Mamba-Like Linear Attention for Speech Recognition

Fengpei Ge, W. Ding, Chundong Xu, Changsong Lei
article en

Abstract

The attention mechanism in the Conformer encoder is employed to model long-range dependencies in speech data. However, it requires global interactions across all input sequence elements to extract features, resulting in computational complexity that scales quadratically with the sequence length. In long-sequence speech recognition tasks, the high computational complexity considerably increases the model's training duration. To address this problem, we propose an end-to-end approach for speech recognition utilizing a gated linear attention mechanism. Firstly, SEFFN optimizes the channel-wise weight distribution, enhancing the efficient extraction and refinement of high-quality channel-specific features during the training process. The mechanism strengthens the model's capacity to prioritize critical channel-specific features, resulting in an improved capacity for high-quality channel feature modeling and representation. Secondly, a gated linear attention mechanism is employed to reduce the computational complexity to a linear relationship with the length of the speech sequence, thereby mitigating the computational overhead associated with the attention mechanism. Experimental results demonstrate that the character error rate of the model on the Chinese dataset Aishell-1 was reduced to 4.59%, representing a significant improvement compared to the baseline model, thereby validating the proposed method's effectiveness.

Beijing University of Posts and Telecommunications (CN), Jiangxi University of Science and Technology (CN)
Openalex Percentile: Top 68%
Speech and Audio Processing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.