Linear Time Complexity Conformers with SummaryMixing for Streaming Speech Recognition

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Parcollet, Titouan, van Dalen, Rogier, Zhang, Shucong, Batthacharya, Sourav
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913497000968192
author Parcollet, Titouan
van Dalen, Rogier
Zhang, Shucong
Batthacharya, Sourav
author_facet Parcollet, Titouan
van Dalen, Rogier
Zhang, Shucong
Batthacharya, Sourav
contents Automatic speech recognition (ASR) with an encoder equipped with self-attention, whether streaming or non-streaming, takes quadratic time in the length of the speech utterance. This slows down training and decoding, increase their cost, and limit the deployment of the ASR in constrained devices. SummaryMixing is a promising linear-time complexity alternative to self-attention for non-streaming speech recognition that, for the first time, preserves or outperforms the accuracy of self-attention models. Unfortunately, the original definition of SummaryMixing is not suited to streaming speech recognition. Hence, this work extends SummaryMixing to a Conformer Transducer that works in both a streaming and an offline mode. It shows that this new linear-time complexity speech encoder outperforms self-attention in both scenarios while requiring less compute and memory during training and decoding.
format Preprint
id arxiv_https___arxiv_org_abs_2409_07165
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Linear Time Complexity Conformers with SummaryMixing for Streaming Speech Recognition
Parcollet, Titouan
van Dalen, Rogier
Zhang, Shucong
Batthacharya, Sourav
Sound
Artificial Intelligence
Audio and Speech Processing
Automatic speech recognition (ASR) with an encoder equipped with self-attention, whether streaming or non-streaming, takes quadratic time in the length of the speech utterance. This slows down training and decoding, increase their cost, and limit the deployment of the ASR in constrained devices. SummaryMixing is a promising linear-time complexity alternative to self-attention for non-streaming speech recognition that, for the first time, preserves or outperforms the accuracy of self-attention models. Unfortunately, the original definition of SummaryMixing is not suited to streaming speech recognition. Hence, this work extends SummaryMixing to a Conformer Transducer that works in both a streaming and an offline mode. It shows that this new linear-time complexity speech encoder outperforms self-attention in both scenarios while requiring less compute and memory during training and decoding.
title Linear Time Complexity Conformers with SummaryMixing for Streaming Speech Recognition
topic Sound
Artificial Intelligence
Audio and Speech Processing
url https://arxiv.org/abs/2409.07165