Conclusions	In this paper, we presented the Transformer Transducer model, embedding Transformer based self-attention for audio and label encoding within the RNN-T architecture, resulting in an end-to-end model that can be optimized using a loss function that efficiently marginalizes over all possible alignments and that is well-suited to time-synchronous decoding. This model achieves a new state-of-the-art accuracy on the LibriSpeech benchmark, and can easily be used for streaming speech recognition by limiting the audio and label context used in self-attention. Transformer Transducer models train significantly faster than LSTM based RNN-T models, and they allow us to trade recognition accuracy and latency in a flexible manner.

In tandem with the RNN-T architecture described in the previous section, the attention mechanism here only operates within $\mathrm {AudioEncoder}$ or $\mathrm {LabelEncoder}$, contrary to the standard practice for Transformer-based systems. In addition, so as to model sequential order, we use the relative positional encoding proposed in . With relative positional encoding, the encoding only affects the attention score instead of the $\mathrm {Value}$s being summed. This allows us to reuse previously computed states rather than recomputing all previous states and getting the last state in an overlapping inference manner when the number of frames or labels that $\mathrm {AudioEncoder}$ or $\mathrm {LabelEncoder}$ processed is larger than the maximum length used during training (which would again be intractable for streaming applications). More specifically, the complexity of running one-step inference to get activations at time $t$ is $\mathrm {O}(t)$, which is the computation cost of attending to $t$ states and of the feed-forward process for the current step when using relative positional encoding.

Introduction	In the past few years, models employing self-attention  have achieved state-of-art results for many tasks, such as machine translation, language modeling, and language understanding , . In particular, large Transformer-based language models have brought gains in speech recognition tasks when used for second-pass re-scoring and in first-pass shallow fusion . As typically used in sequence-to-sequence transduction tasks , , , , , Transformer-based models attend over encoder features using decoder features, implying that the decoding has to be done in a label-synchronous way, thereby posing a challenge for streaming speech recognition applications. An additional challenge for streaming speech recognition with these models is that the number of computations for self-attention increases quadratically with input sequence size. For streaming to be computationally practical, it is highly desirable that the time it takes to process each frame remains constant relative to the length of the input. Transformer-based alternatives to RNNs have recently been explored for use in ASR , , , . For streaming speech recognition models, recurrent neural networks (RNNs) have been the de facto choice since they can model the temporal dependencies in the audio features effectively  while maintaining a constant computational requirement for each frame.

Transformer Transducer: A Streamable Speech Recognition Model with Transformer Encoders and RNN-T Loss	In this paper we present an end-to-end speech recognition model with Transformer encoders that can be used in a streaming speech recognition system. Transformer computation blocks based on self-attention are used to encode both audio and label sequences independently. The activations from both audio and label encoders are combined with a feed-forward layer to compute a probability distribution over the label space for every combination of acoustic frame position and label history. This is similar to the Recurrent Neural Network Transducer (RNN-T) model, which uses RNNs for information encoding instead of Transformer encoders. The model is trained with the RNN-T loss well-suited to streaming decoding. We present results on the LibriSpeech dataset showing that limiting the left context for self-attention in the Transformer layers makes decoding computationally tractable for streaming, with only a slight degradation in accuracy. We also show that the full attention version of our model beats the-state-of-the art accuracy on the LibriSpeech benchmarks. Our results also show that we can bridge the gap between full attention and limited attention versions of our model by attending to a limited number of future frames.

To explore the right context impact for modeling, we did comparisons with fixed 512 frames left context per layer to compared with full attention T-T model. As we can see from Table TABREF18, with right context of 6 frames per layer (around 3.2 secs of latency), the performance is around 16% worse than full attention model. Compared with streamable T-T model, 2 frames right context per layer (around 1 sec of latency) brings around 30% improvements. In addition, we evaluated how the left context used in the T-T $\mathrm {LabelEncoder}$ affects performance. In Table TABREF19, we show that constraining each layer to only use three previous label states yields the similar accuracy with the model using 20 states per layer. It shows very limited left context for label encoder is good engough for T-T model. We see a similar trend when limiting left label states while using a full attention T-T audio encoder.

The results are shown in Table TABREF12 in the “With LM” column. The shallow fusion result for the T-T system is competitive with corresponding results for top-performing existing systems. Next, we ran training and decoding experiments using T-T models with limited attention windows over audio and text, with a view to building online streaming speech recognition systems with low latency. Similarly to the use of unidirectional RNN audio encoders in online models, where activations for time $t$ are computed with conditioning only on audio frames before $t$, here we constrain the $\mathrm {AudioEncoder}$ to attend to the left of the current frame by masking the attention scores to the right of the current frame. In order to make one-step inference for $\mathrm {AudioEncoder}$ tractable (i.e. to have constant time complexity), we further limit the attention for $\mathrm {AudioEncoder}$ to a fixed window of previous states by again masking the attention score. Due to limited computation resources, we used the same mask for different Transformer layers, but the use of different contexts (masks) for different layers is worth exploring.

Transformer Transducer ::: Transformer	The Transformer  is composed of a stack of multiple identical layers. Each layer has two sub-layers, a multi-headed attention layer and a feed-forward layer. Our multi-headed attention layer first applies $\mathrm {LayerNorm}$, then projects the input to $\mathrm {Query}$, $\mathrm {Key}$, and $\mathrm {Value}$ for all the heads . The attention mechanism is applied separately for different attention heads. The attention mechanism provides a flexible way to control the context that the model uses. For example, we can mask the attention score to the left of the current frame to produce output conditioned only on the previous state history. The weight-averaged $\mathrm {Value}$s for all heads are concatenated and passed to a dense layer. We then employ a residual connection on the normalized input and the output of the dense layer to form the final output of the multi-headed attention sub-layer (i.e. $\mathrm {LayerNorm}(x) + \mathrm {AttentionLayer}(\mathrm {LayerNorm}(x))$, where $x$ is the input to the multi-headed attention sub-layer). We also apply dropout on the output of the dense layer to prevent overfitting.

As in the original RNN-T model, the joint network combines the audio encoder output at $t_i$ and the label encoder output given the previous non-blank output label sequence $\mathrm {Labels}(z_{1:(i-1)})$ using a feed-forward neural network with a softmax layer, inducing a distribution over the labels. The model defines $P(z_i|{\mathbf {x}}, t_i, \mathrm {Labels}(z_{1:(i-1)}))$ as follows: where each $\mathrm {Linear}$ function is a different single-layer feed-forward neural network, $\mathrm {AudioEncoder}_{t_{i}}({\mathbf {x}})$ is the audio encoder output at time $t_i$, and $\mathrm {LabelEncoder}(\mathrm {Labels}(z_{1:(i-1)}))$ is the label encoder output given the previous non-blank label sequence. To compute Eq. (DISPLAY_FORM3) by summing all valid alignments naively is computationally intractable. Therefore, we define the forward variable $\alpha (t,u)$ as the sum of probabilities for all paths ending at time-frame $t$ and label position $u$.

On the other hand, with absolute positional encoding, the encoding added to the input should be shifted by one when $t$ is larger than the maximum length used during training, which precludes re-use of the states, and makes the complexity $\mathrm {O}(t^2)$. However, even if we can reduce the complexity from $\mathrm {O}(t^2)$ to $\mathrm {O}(t)$ with relative positional encoding, there is still the issue of latency growing over time. One intuitive solution is to limit the model to attend to a moving window $W$ of states, making the one-step inference complexity constant. Note that training or inference with attention to limited context is not possible for Transformer-based models that have attention from $\mathrm {Decoder}$ to $\mathrm {Encoder}$, as such a setup is itself trying to learn the alignment. In contrast, the separation of $\mathrm {AudioEncoder}$ and $\mathrm {LabelEncoder}$, and the fact that the alignment is handled by a separate forward-backward process, within the RNN-T architecture, makes it possible to train with attention over an explicitly specified, limited context.

But unlike CTC, this label distribution is also conditioned on the previous label history. The RNN-T model defines a conditional distribution $P({\mathbf {z}}|{\mathbf {x}})$ over all the possible alignments, where is a sequence of $(z_i, t_i)$ pairs of length $\overline{U}$, and $(z_i, t_i)$ represents an alignment between output label $z_i$ and the encoded feature at time $t_i$. The labels $z_i$ can optionally be blank labels (null predictions). Removing the blank labels gives the actual output label sequence ${\mathbf {y}}$, of length $U$. We can marginalize $P({\mathbf {z}}|{\mathbf {x}})$ over all possible alignments ${\mathbf {z}}$ to obtain the probability of the target label sequence ${\mathbf {y}}$ given the input sequence ${\mathbf {x}}$, where ${\cal Z}({\mathbf {y}},T)$ is the set of valid alignments of length $T$ for the label sequence.

Our feed-forward sub-layer applies $\mathrm {LayerNorm}$ on the input first, then applies two dense layers. We use $\mathrm {ReLu}$ as the activation for the first dense layer. Again, dropout to both dense layers for regularization, and a residual connection of normalized input and the output of the second dense layer (i.e. $\mathrm {LayerNorm}(x) + \mathrm {FeedForwardLayer}(\mathrm {LayerNorm}(x))$, where $x$ is the input to the feed-forward sub-layer) are applied. See Figure FIGREF10 for more details. Note that $\mathrm {LabelEncoder}$ states do not attend to $\mathrm {AudioEncoder}$ states, in contrast to the architecture in . As discussed in the Introduction, doing so poses a challenge for streaming applications. Instead, we implement $\mathrm {AudioEncoder}$ and $\mathrm {LabelEncoder}$ in Eq. (DISPLAY_FORM6), which are LSTMs in conventional RNN-T architectures , , , using the Transformers described above.

Transformer Transducer ::: RNN-T Architecture and Loss	In this paper, we present all experimental results with the RNN-T loss  for consistency, which performs similarly to the monotonic RNN-T loss  in our experiments. The probability of an alignment $P({\mathbf {z}}|{\mathbf {x}})$ can be factorized as where $\mathrm {Labels}(z_{1:(i-1)})$ is the sequence of non-blank labels in $z_{1:(i-1)}$. The RNN-T architecture parameterizes $P({\mathbf {z}}|{\mathbf {x}})$ with an audio encoder, a label encoder, and a joint network. The encoders are two neural networks that encode the input sequence and the target output sequence, respectively. Previous work  has employed Long Short-term Memory models (LSTMs) as the encoders, giving the RNN-T its name. However, this framework is not restricted to RNNs. In this paper, we are particularly interested in replacing the LSTM encoders with Transformers , . In the following, we refer to this new architecture as the Transformer Transducer (T-T).

Streamable end-to-end modeling architectures such as the Recurrent Neural Network Transducer (RNN-T) , , , Recurrent Neural Aligner (RNA) , and Neural Transducer  utilize an encoder-decoder based framework where both encoder and decoder are layers of RNNs that generate features from audio and labels respectively. In particular, the RNN-T and RNA models are trained to learn alignments between the acoustic encoder features and the label encoder features, and so lend themselves naturally to frame-synchronous decoding. Several optimization techniques have been evaluated to enable running RNN-T on device . In addition, extensive architecture and modeling unit exploration has been done for RNN-T . In this paper, we explore the possibility of replacing RNN-based audio and label encoders in the conventional RNN-T architecture with Transformer encoders. With a view to preserving model streamability, we show that Transformer-based models can be trained with self-attention on a fixed number of past input frames and previous labels. This results in a degradation of performance (compared to attending to all past input frames and labels), but then the model satisfies a constant computational requirement for processing each frame, making it suitable for streaming.

The results are shown in Table TABREF15, where N in the first two columns indicates the number of states that the model uses to the left or right of the current frame. As we can see, using more audio history gives the lower WER, but considering a streamable model with reasonable time complexity for inference, we experimented with a left context of up to 10 frames per layer. Similarly, we explored the use of limited right context to allow the model to see some future audio frames, in the hope of bridging the gap between a streamable T-T model (left = 10, right = 0) and a full attention T-T model (left = 512, right = 512). Since we apply the same mask for every layer, the latency introduced by using right context is aggregated over all the layers. For example, in Figure FIGREF17, to produce $y_7$ from a 3-layer Transformer with one frame of right context, it actually needs to wait for $x_{10}$ to arrive, which is 90 ms latency in our case.

Experiments and Results ::: Results	We first compared the performance of Transformer Transducer (T-T) models with full attention on audio to an RNN-T model using a bidirectional LSTM audio encoder. As shown in Table TABREF12, the T-T model significantly outperforms the LSTM-based RNN-T baseline. We also observed that T-T models can achieve competitive recognition accuracy with existing wordpiece-based end-to-end models with similar model size. To compare with systems using shallow fusion ,  with separately trained LMs, we also trained a Transformer-based LM with the same architecture as the label encoder used in T-T, using the full 810M word token dataset. This Transformer LM (6 layers; 57M parameters) had a perplexity of $2.49$ on the dev-clean set; the use of dropout, and of larger models, did not improve either perplexity or WER. Shallow fusion was then performed using that LM and both the trained T-T system and the trained bidirectional LSTM-based RNN-T baseline, with scaling factors on the LM output and on the non-blank symbol sequence length tuned on the LibriSpeech dev sets.

Experiments and Results ::: Transformer Transducer	Our Transformer Transducer model architecture has 18 audio and 2 label encoder layers. Every layer is identical for both audio and label encoders. The details of computations in a layer are shown in Figure FIGREF10 and Table TABREF11. All the models for experiments presented in this paper are trained on 8x8 TPU with a per-core batch size of 16 (effective batch size of 2048). The learning rate schedule is ramped up linearly from 0 to $2.5\mathrm {e}{-4}$ during first 4K steps, it is then held constant till 30K steps and then decays exponentially to $2.5\mathrm {e}{-6}$ till 200K steps. During training we also added a gaussian noise($\mu =0,\sigma =0.01$) to model weights  starting at 10K steps. We train this model to output grapheme units in all our experiments. We found that the Transformer Transducer models trained much faster ($\approx 1$ day) compared to the an LSTM-based RNN-T model ($\approx 3.5$ days), with a similar number of parameters.

Experiments and Results ::: Data	We evaluated the proposed model using the publicly available LibriSpeech ASR corpus . The LibriSpeech dataset consists of 970 hours of audio data with corresponding text transcripts (around 10M word tokens) and an additional 800M word token text only dataset. The paired audio/transcript dataset was used to train T-T models and an LSTM-based baseline. The full 810M word tokens text dataset was used for standalone language model (LM) training. We extracted 128-channel logmel energy values from a 32 ms window, stacked every 4 frames, and sub-sampled every 3 frames, to produce a 512-dimensional acoustic feature vector with a stride of 30 ms. Feature augmentation  was applied during model training to prevent overfitting and to improve generalization, with only frequency masking ($\mathrm {F}=50$, $\mathrm {mF}=2$) and time masking ($\mathrm {T}=30$, $\mathrm {mT}=10$).

Given the simple architecture and parallelizable nature of self-attention computations, we observe large improvements in training time and training resource utilization compared to RNN-T models that employ RNNs. The RNN-T architecture (as depicted in Figure FIGREF1) is a neural network architecture that can be trained end-to-end with the RNN-T loss to map input sequences (e.g. audio feature vectors) to target sequences (e.g. phonemes, graphemes). Given an input sequence of real-valued vectors of length $T$, ${\mathbf {x}}= (x_1, x_2, ..., x_T)$, the RNN-T model tries to predict the target sequence of labels ${\mathbf {y}}= (y_1, y_2, ..., y_U)$ of length $U$. Unlike a typical attention-based sequence-to-sequence model, which attends over the entire input for every prediction in the output sequence, the RNN-T model gives a probability distribution over the label space at every time step, and the output label space includes an additional null label to indicate the lack of output for that time step — similar to the Connectionist Temporal Classification (CTC) framework .

Finally, Table TABREF20 reports the results when using a limited left context of 10 frames, which reduces the time complexity for one-step inference to a constant, with look-ahead to future frames, as a way of bridging the gap between the performance of left-only attention and full attention models.

We then use the forward algorithm ,  to compute the last alpha variable $\alpha ({T, U})$, which corresponds to $P({\mathbf {y}}|{\mathbf {x}})$ defined in Eq. (DISPLAY_FORM3). Efficient computation of $P({\mathbf {y}}|{\mathbf {x}})$ using the forward algorithm is enabled by the fact that the local probability estimate (Eq. (DISPLAY_FORM7)) at any given label position and any given time-frame is not dependent on the alignment . The training loss for the model is then the sum of the negative log probabilities defined in Eq. (DISPLAY_FORM3) over all the training examples, where $T_i$ and $U_i$ are the lengths of the input sequence and the output target label sequence of the $i$-th training example, respectively.

Question: What was previous state of the art model?
Answer: LSTM-based RNN-T