Flash RNN-T: Memory-Efficient Joint Network and Transducer Loss Computation
Organizations: Tarteel AI
Abstract
The recurrent neural network transducer (RNN-T) remains a practical choice for streaming speech recognition, but training requires large intermediate tensors. We present Flash RNN-T, a joint and loss implementation combining specialized kernels with optional tiled recomputation over the full alignment space and vocabulary. Tiled and untiled Flash form the entire measured throughput-memory frontier on medium and long workloads. On H100, untiled Flash achieves 24-39% higher throughput with 26-56% less memory than the fastest baseline on these workloads wherever it fits. Tiling reduces memory further through recomputation. On medium, tiled Flash uses ninefold less memory than that baseline at 16% lower throughput when both use one backward call per batch. On long, it fits where all tested alternatives with that backward schedule run out of memory with 80 GB. These comparisons use each implementation's lowest-memory configuration reaching at least 95% of its peak throughput.
Figures & tables
| Workload | Mean duration (s) | Encoder length | Transcript length | Valid alignment positions |
|---|---|---|---|---|
| Short | 4.92 | 47–69 | 29–50 | 282,687 |
| Medium | 18.72 | 227–244 | 40–96 | 2,300,131 |
| Long | 69.62 | 851–885 | 325–458 | 41,122,726 |
| Components | Short | Medium | Long |
|---|---|---|---|
| Untiled | |||
| Compiled | 22743 / 2.80 | 3177 / 21.97 | OOM |
| Specialized joint | 21741 / 2.58 | 3205 / 20.44 | OOM |
| Specialized norm. | 26564 / 1.65 | 3878 / 11.80 | OOM |
| Both specialized | 25333 / 1.44 | 3852 / 10.27 | OOM |
| Tiled |
Memory-Efficient Training
Memory-efficient training reduces the memory needed to optimize neural networks by compressing, recomputing, or relocating training state.
See all 89 papers