Accurate, fast, cheap: Choose three. Replacing Multi-Head-Attention with Bidirectional Recurrent Attention for Long-Form ASR

Martin Ratajczak, Jean-Philippe Robichaud, Jennifer Drexler Fox
6/24/2025
cs.CL

No official code found. Best implementation: revdotcom/paper_accurate_fast_cheap (10 stars, Apache-2.0, last commit 2025-08-19).

Abstract

Long-form speech recognition is an application area of increasing research focus. ASR models based on multi-head attention (MHA) are ill-suited to long-form ASR because of their quadratic complexity in sequence length. We build on recent work that has investigated linear complexity recurrent attention (RA) layers for ASR. We find that bidirectional RA layers can match the accuracy of MHA for both short- and long-form applications. We present a strong limited-context attention (LCA) baseline, and show that RA layers are just as accurate while being more efficient. We develop a long-form training paradigm which further improves RA performance, leading to better accuracy than LCA with 44% higher throughput. We also present Direction Dropout, a novel regularization method that improves accuracy, provides fine-grained control of the accuracy/throughput trade-off of bidirectional RA, and enables a new alternating directions decoding mode with even higher throughput.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Repository for code behind the Interspeech 2025 paper : Accurate, fast, cheap: Choose three. Replacing Multi-Head-Attention with Bidirectional Recurrent Attention for Long-Form ASR

101C++, CudaMay 29, 20251 years agoApache-2.0

Cite this paper

@article{ratajczak2025accurate,
  title  = {Accurate, fast, cheap: Choose three. Replacing Multi-Head-Attention with Bidirectional Recurrent Attention for Long-Form ASR},
  author = {Martin Ratajczak and Jean-Philippe Robichaud and Jennifer Drexler Fox},
  year   = {2025},
  eprint = {2506.19761},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.19761v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.19761.svg)](https://codeofpaper.com/paper/2506.19761)

Discussion