Pith. sign in

REVIEW 1 cited by

Accelerating RNN Transducer Inference via One-Step Constrained Beam Search

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.03577 v1 pith:BEQWZHBM submitted 2020-02-10 cs.LG eess.ASeess.SP

classification cs.LGeess.ASeess.SP
keywords searchbeamhypothesesrnn-tconstraineddecodingduplicationexpansion
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose a one-step constrained (OSC) beam search to accelerate recurrent neural network (RNN) transducer (RNN-T) inference. The original RNN-T beam search has a while-loop leading to speed down of the decoding process. The OSC beam search eliminates this while-loop by vectorizing multiple hypotheses. This vectorization is nontrivial as the expansion of the hypotheses within the original RNN-T beam search can be different from each other. However, we found that the hypotheses expanded only once at each decoding step in most cases; thus, we constrained the maximum expansion number to one, thereby allowing vectorization of the hypotheses. For further acceleration, we assign constraints to the prefixes of the hypotheses to prune the redundant search space. In addition, OSC beam search has duplication check among hypotheses during the decoding process as duplication can undesirably shrink the search space. We achieved significant speedup compared with other RNN-T beam search methods with lower phoneme and word error rate.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. WIND: Accelerated RNN-T Decoding with Windowed Inference for Non-blank Detection

    cs.LG 2025-05 conditional novelty 6.0 of 10

    WIND runs RNN-T decoding faster by evaluating windows of frames in parallel to find the first non-blank prediction, exactly matching greedy accuracy while running up to 2.4X faster.

Pith tools