Accelerating Transducers through Adjacent Token Merging
원문 초록
Recent end-to-end automatic speech recognition (ASR) systems often utilize a Transformer-based acoustic encoder that generates embedding at a high frame rate. However, this design is inefficient, particularly for long speech signals due to the quadratic computation of self-attention. To address this, we propose a new method, Adjacent Token Merging (A-ToMe), which gradually combines adjacent tokens with high similarity scores between their key values. In this way, the total time step could be reduced, and the inference of both the encoder and joint network is accelerated. Experiments on LibriSpeech show that our method can reduce 57% of tokens and improve the inference speed on GPU by 70% without any notable loss of accuracy. Additionally, we demonstrate that A-ToMe is also an effective solution to reduce tokens in long-form ASR, where the input speech consists of multiple utterances.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
NGPU-LM: GPU-Accelerated N-Gram Language Model for Context-Biasing in Greedy ASR Decoding
Addressing Pitfalls in Auditing Practices of Automatic Speech Recognition Technologies: A Case Study of People with Aphasia
Unsupervised Rhythm and Voice Conversion to Improve ASR on Dysarthric Speech
Towards Temporally Explainable Dysarthric Speech Clarity Assessment
Vedavani: A Benchmark Corpus for ASR on Vedic Sanskrit Poetry
BeaverTalk: Oregon State University's IWSLT 2025 Simultaneous Speech Translation System
토론
이 논문과 연결된 포럼 글이 아직 없습니다.