Title: LANGUAGE MODELING TEACHES YOU MORE SYNTAX THAN TRANSLATION DOES

Abstract: Recent work using auxiliary prediction task classifiers to investigate the properties of LSTM representations has begun to shed light on why pretrained representations, like ELMo (Peters et al., 2018) and CoVe (McCann et al., 2017), are so beneficial for neural language understanding models. We still, though, do not yet have a clear understanding of how the choice of pretraining objective affects the type of linguistic information that models learn. With this in mind, we compare four objectives-language modeling, translation, skip-thought, and autoencoding-on their ability to induce syntactic and part-of-speech information. We make a fair comparison between the tasks by holding constant the quantity and genre of the training data, as well as the LSTM architecture. We find that representations from language models consistently perform best on our syntactic auxiliary prediction tasks, even when trained on relatively small amounts of data. These results suggest that language modeling may be the best data-rich pretraining task for transfer learning applications requiring syntactic information. We also find that the representations from randomly-initialized, frozen LSTMs perform strikingly well on our syntactic auxiliary tasks, but this effect disappears when the amount of training data for the auxiliary tasks is reduced.

1. INTRODUCTION:

Representation learning with deep recurrent neural networks has revolutionized natural language processing and replaced many of the expert-designed, linguistic features used previously. Recently, researchers have begun to investigate the properties of learned representations by training auxiliary classifiers that use the hidden states of frozen, pretrained models to perform other tasks. These investigations have shown that when deep LSTMs (Hochreiter & Schmidhuber, 1997) are trained on tasks like translation, they learn substantial syntactic and semantic information about their input sentences, including part-of-speech (Shi et al., 2016; Belinkov et al., 2017a; b; Blevins et al., 2018) .

These intriguing findings lead us to ask the following questions:

1. How does the training task affect how well models learn syntactic properties? Which tasks are better at inducing these properties? 2. How does the amount of data the model is trained on affect these results? When does training on more data help?

We investigate these questions by holding the data source and model architecture constant, while varying both the training task and the amount of training data. Specifically, we examine models trained on English-German (En-De) translation, language modeling, skip-thought (Kiros et al., 2015) , and autoencoding, and also compare to an untrained LSTM model as a baseline. We control for the data domain by exclusively training on datasets from the 2016 Conference on Machine Translation (WMT; Bojar et al., 2016) . We train models on all tasks using the parallel En-De corpus, which allows us to make fair comparisons across tasks. We also train models on a subset of the this corpus to examine the effect of training data volume on learned representations. Additionally, we augment the parallel dataset with a large monolingual corpus from WMT to examine how the performance of the unsupervised tasks (all but translation) scale with more data.

Throughout our work, we focus on the syntactic evaluation tasks of part-of-speech (POS) tagging and Combinatorial Categorical Grammar (CCG) supertagging. Supertagging is considered a build-ing block for parsing as these tags constrain the ways in which words can compose, largely determining the parse of the sentence. CCG supertagging thus allows us to measure the degree to which models learn syntactic structure above the word. We focus our analysis on representations learned by language models and by the encoders of sequence-to-sequence models, as translation encoders have been found to learn richer representations of POS and morphological information than translation decoders (Belinkov et al., 2017a) .

We find that for POS and CCG tagging, bidirectional language models (BiLMs)-created by separately training forward and backward language models, and concatenating their hidden statesoutperform models trained on all other tasks. Even BiLMs trained on relatively small amounts of data (1 million sentences) outperform translation and skip-thought models trained on larger datasets (5 million and 63 million sentences respectively).

Our inclusion of an untrained LSTM baseline allows us to study the effect of training on hidden state representations of LSTMs. We find, surprisingly, that when we use all of the available labeled tag data to train our auxiliary task classifiers, our best trained models (BiLMs) only outperform the randomly initialized, untrained LSTMs by a few percentage points. When we reduce the amount of classifier training data though, the performance of the randomly initialized LSTM model drops far below those of trained models. We hypothesize that this occurs because training the classifiers on large amounts of auxiliary task data allows them to memorize configurations of words seen in the training set and their associated tags. We test this hypothesis by training classifiers to predict the identity of neighboring words from a given hidden state, and find that randomly initialized models outperform all trained models on this task. Our findings demonstrate that our best trained models do well on the tagging tasks because they are truly learning representations that conform to our notions of POS and CCG tagging, and not simply because the classifiers we train are able to recover neighboring word identity information.

2. RELATED WORK:

Evaluating Learned Representations Adi et al. (2016) introduce the idea of examining sentence vector representations by training auxiliary classifiers to take sentence encodings and predict attributes like word order. Belinkov et al. (2017a) build on this work by examining the hidden states of LSTMs trained on translation and find that they learn substantial POS and morphological information without direct supervision for these linguistic properties. Beyond translation, Blevins et al. (2018) find that deep LSTMs learn hierarchical syntax when trained on a variety of tasks-including semantic role labeling, language modeling, and dependency parsing. However, the models examined by Blevins et al. (2018) were also trained on different datasets, so it's unclear if the differences in syntactic task performance are due to the training objectives or simply differences in the training data. By controlling for model size and the quantity and genre of the training data, we we are able to make direct comparisons between tasks on their ability to induce syntactic information.

Transfer Learning of Representations Much of the work on sentence-level pretraining has focused on sentence-to-vector models and evaluating learned representations on how well they can be used to perform sentence-level classification tasks. A prominent early success in this area with unlabeled data is skip-thought (Kiros et al., 2015) , the technique of training a sequence-to-sequence model to predict the sentence preceding and following each sentence in a running text. InferSent (Conneau et al., 2017) -the technique of pretraining encoders on natural language inference datayields strikingly better performance when such labeled data is available.

Work in transfer learning of representations has recently moved beyond strict sentence-to-vector mappings. Newer models that incorporate LSTMs or Transformer networks pretrained on datarich tasks, like translation and language modeling, have achieved state-of-the-art results on many tasks-including semantic role labeling, natural language inference, and coreference resolution (Peters et al., 2018; McCann et al., 2017; Howard & Ruder, 2018; Radford et al., 2018) . Although comparisons have previously been made between translation and language modeling as pretraining tasks (Peters et al., 2018; Wang et al., 2018) , we investigate this issue more thoroughly by controlling for the quantity and content of the training data. 2018) use randomly initialized LSTMs as a baseline when studying sentence-to-vector embedding models. They find that untrained models outperform many trained models on several auxiliary tasks, including predicting word content. Similarly in vision, untrained convolutional networks have been shown to capture many low-level image statistics and can be used for image denoising (Ulyanov et al., 2017) . Our method of training auxiliary classifiers on randomly initialized RNNs builds on the tradition of reservoir computing, in which randomly initialized networks or "reservoirs" are fixed and only "read-out" classifier networks are trained (Lukoševičius & Jaeger, 2009) . Echo state networks-reservoir computing with recurrent models-have been used for tasks like speech recognition, language modeling, and time series prediction (Verstraeten et al., 2006; Tong et al., 2007; Sun et al., 2017) .

3. METHODS:



3.1. MAIN TRAINING DATA:

We use the parallel English-German (En-De) dataset from the 2016 ACL Conference on Machine Translation (WMT) shared task on news translation (Bojar et al., 2016) . This dataset contains 5 million ordered sentence translation pairs. We also use the 2015 English monolingual news discussion dataset from the same WMT shared task, which contains approximately 58 million ordered sentences. To examine how the volume of training data affects learned representations, we use four corpus sizes: 1, 5, 15, and 63 million sentences (translation is only trained on the smaller two sizes).

We create the 1 million sentence corpora from the 5 million sentence dataset by sampling (i) sentence pairs for translation, (ii) English sentences for autoencoders, and (iii) ordered English sentence pairs for skip-thought and language models1 . Similarly, we create the 15 million sentence corpora for the unsupervised tasks by sampling sentences from the entire corpus of 63 million sentences.

We use word-level representations throughout and use the Moses package (Koehn et al., 2007) to tokenize and truecase our data. Finally, we limit both the English and German vocabularies to the 50k most frequent tokens in the training set. 

3.2. MODEL ARCHITECTURE AND TRAINING:

We train all our models using OpenNMT-py (Klein et al., 2017) and use the default options for model sizes, hyperparameters, and training procedure-except we increase the size of the LSTMs, make the encoders bidirectional, and use validation-based learning rate decay instead of a fixed schedule. Specifically, all our models (except language models) are 1000D, two-layer encoder-decoder LSTMs with bidirectional encoders (500D per direction) and 500D embeddings. We train models both with and without attention (Bahdanau et al., 2015) . For language models, we train a 1000D forward language model and a bidirectional language model-two 500D language models (forward and backward) trained separately, whose hidden states are concatenated. All models, including our untrained baseline, are initialized from a uniform distribution (-0.1, 0.1), the default in OpenNMT.

We use the same training procedure for all our models. We evaluate on the validation set every epoch when training on the 1 and 5 million sentence datasets, and evaluate approximately every 5 million sentences when training on the larger datasets. We use SGD with an initial learning rate of 1. Whenever a model's validation loss increases relative to the previous evaluation, we halve the learning rate and stop training when the learning rate reaches 0.5 15 . For each training task and dataset size, we select the model with the lowest validation perplexity to perform auxiliary task evaluations on. We report model performance in terms of perplexity and BLEU (Papineni et al., 2002) in Table 1 . For translation we use beam search (B = 5) when decoding.

3.3. CLASSIFIER DATA AND ARCHITECTURE:

POS and CCG For Part-of-Speech (POS) tagging evaluation, we use the Wall Street Journal (WSJ) portion of the Penn Treebank (PTB; Marcus et al., 1993) We follow the standard WSJ split (train 2-21; dev 22; test 23). The dataset contains approximately 50k sentences and 45 tag types.

For CCG supertagging, we use CCG Bank (Hockenmaier & Steedman, 2007) , which is based on PTB WSJ. CCG supertagging provides fine-grained information about the role of each word in its larger syntactic context and is considered almost parsing, since sequences of tags map sentences to small subsets of possible parses. The entire dataset contains approximately 50k sentences and 1327 tag types. We display POS and CCG tags for an example sentence in Figure 1 .

To study the impact of auxiliary task training data volume, for both datasets we create smaller classifier training sets by sampling 10% and 1% of the sentences. We truecase both datasets using the same truecase model trained on WMT and restrict the vocabularies to the 50k tokens used in pretraining our LSTM models. In addition to the untrained LSTM baseline, we also compare to the word-conditional most frequent class (WC-MFC)-the most frequently assigned tag class for each distinct word in the training set. For this baseline we restrict the vocabulary to that of our LSTM models and map all out-of-vocabulary words to a single UNK token. Note that while PTB and WMT are both drawn from news text, there is slight genre mismatch.

Word Identity For this task, the classifier takes a single LSTM hidden state as input and predicts the identity of the word at a different time step. For example, for the sentence "I love NLP" and a time step shift of -2, we would train the classifier to take the hidden state for "NLP" and predict the word "I". We use the WSJ dataset for this task. Following Conneau et al. (2018) , we take all words that occur between 100 and 1000 times (about 1000 words total) as the possible targets for neighboring word prediction. 

4. COMPARING PRETRAINING TASKS:

In this section we discuss the main POS and CCG tagging results displayed in Figure 2 . Overall, POS and CCG tagging accuracies tend to increase with the amount of data the LSTM encoders are trained on, but the marginal improvement decreases as the amount of training data increases.

Language Modeling and Translation:

For all pretraining dataset sizes, bidirectional language model (BiLM) and translation encoder representations perform best on both POS and CCG tagging. Translation encoders, however, slightly underperform BiLMs, even when both models are trained on the same amount of data. In fact, even BiLMs trained on the smallest amount of data (1 million sentences) outperform models trained on all other tasks and dataset sizes (up to 5 million sentences for translation, and 63 million sentences for skip-thought and autoencoding). Especially since BiLMs do not require aligned data to train, the superior performance of BiLM representations on these tasks suggests that BiLMs (like ELMo; Peters et al., 2018) are better than translation encoders (like CoVe; McCann et al., 2017) for transfer learning of syntactic information. One reason BiLMs perform relatively well on these syntactic tasks could be that in contrast to the encoders for the other tasks, LM encoders have a per-token loss. Note also that since our evaluation tasks also predict a single label for each token, this could be one reason that BiLMs perform so well on these tasks in particular.

For all amounts of training data, the BiLMs significantly outperform the 1000D forward-only language models. The gap in performance between bidirectional and forward language models is greater for CCG supertagging than for POS tagging. When using all available auxiliary training data, there is a 2 and 8 percentage point performance gap in POS and CCG tagging respectively. This difference in relative performance suggests that bidirectional context information is more important for identifying syntactic structure than for identifying part of speech.

Figure 2 illustrates how the best performing BiLMs and translation models tend to be more robust to decreases in classifier data than models trained on other tasks. Also, when training on less auxiliary task data, POS tagging performance tends to drop less than CCG supertagging performance. For the best model (BiLM trained on 63 million sentences), when using 1% rather than all of the auxiliary task training data, CCG accuracy drops 9 percentage points, while POS accuracy only drops 2 points. Further examinations of the effect of classifier data volume are displayed in Figure 3 .

Skip-Thought Although skip-thought encoders consistently underperform both BiLMs and translation encoders in all data regimes we examine, skip-thought models improve the most when increasing the amount of pretraining data, and are the only models whose performance does not seem to have plateaued by 63 million training sentences. Since we train our language models on ordered sentences, as we do for skip-thought, our language models can be interpreted as a regularized versions of skip-thought, in which the weights of the encoder and decoder are shared. The increased model capacity of skip-thought, compared to language models, could explain the difference in learned representation quality-especially when these models are trained on smaller amounts of data.

Random Initialization For our randomly initialized, untrained LSTM encoders, we use the default weight initialization technique in OpenNMT-py, a uniform distribution between -0.1 and 0.1; the only change we make is to set all biases to zero. We find that this baseline performs quite well when using all auxiliary data, and is only 3 and 8 percentage points behind the BiLM on POS and CCG tagging, respectively. We find that decreasing the amount of classifier data leads to a significantly greater drop in the untrained encoder performance compared to trained models. In the 1% classifier data regime, the performance of untrained encoders on both tasks drops below that of all trained models and below even the word-conditional most-frequent class baseline. We hypothesize that the randomly initialized baseline is able to perform well on tagging tasks with large amounts of auxiliary task training data, because the classifier can learn the identity of neighboring words from a given time step's hidden state, and simply memorize word configurations and their associated tags from the training data. We test this hypothesis directly in Section 6 and find that untrained LSTM representations are in fact better at capturing neighboring word identity information than any trained model.

Autoencoder Models trained on autoencoding are the only ones that do not consistently improve with the amount of training data, which is unsurprising as unregularized autoencoders are prone to learning identity mappings (Vincent et al., 2008) . When training on 10% and 1% of the auxiliary task data, autoencoders outperform randomly initialized encoders and match the word-conditional most frequent class baseline. When training on all the auxiliary data though, untrained encoders outperform autoencoders. These results suggest that autoencoders learn some useful structure that is useful in the low auxiliary data regime. However, the representations autoencoders learn do not capture syntactically rich features, since random encoders outperform them in the high auxiliary data regime. This conclusion is further supported by the extremely poor performance of the second layer of an autoencoder without attention on POS tagging (almost 10 percentage points below the most frequent class baseline), as seen in Figure 4a .

5. COMPARING LAYERS:

Embeddings (Layer 0) We find that randomly initialized embeddings consistently perform as well as the word-conditional most frequent class baseline on POS and CCG tagging, which serves as an upper bound on performance for the embedding layer. As these embeddings are untrained, the auxiliary classifiers are learning to memorize and classify the random vectors. When using all the auxiliary classifier data, there is no significant difference in the performance of trained and untrained embeddings on the tagging tasks. Only for smaller amounts of classifier data do trained embeddings consistently outperform randomly initialized ones.

Upper Layers Belinkov et al. (2017a) find that, for translation models, the first layer consistently outperforms the second on POS tagging. We find that this pattern holds for all our models, except in BiLMs, for which the first and second layers perform equivalently. The pattern holds even for untrained models, suggesting that POS information is stored on the lower layer, not necessarily because the training task encourages this, but because of properties of the deep LSTM architecture.

We also find that for CCG supertagging, the first layer also outperforms the second layer on untrained models. For the trained models though, the second layer performs better than the first in some cases. Which layer performs best appears to be independent of absolute performance on the supertagging task. Our layer analysis results are displayed in Figure 4 .

Figure 5 : Performance of classifiers trained to predict the identity of the word a fixed number of timesteps away. Note, the forward LM has asymmetrical access to this information in its input.

6. WORD IDENTITY PREDICTION:

Our results on word identity prediction are summarized in Figure 5 and given in more detail in Appendix A. While trained encoders outperform untrained ones on both POS and CCG tagging, we find that all trained LSTMs underperform untrained ones on word identity prediction. This finding confirms that trained encoders genuinely capture substantial syntactic features, beyond mere word identity, that the auxiliary classifiers can use.

We find that for both trained and untrained models, the first layer outperforms the second layer when predicting the identity of the immediate neighbors of a word. However, the second layer tends to outperform the first at predicting the identity of more distant neighboring words. This effect is especially apparent for the randomly initialized encoders. Our finding suggests that, as is the case for convolutional neural networks, depth in recurrent neural networks has the effect of increasing the receptive field and allows the upper layers to have representations that capture a larger context. These results reflect the findings of Blevins et al. (2018) that for trained models, upper levels of LSTMs encode more abstract syntactic information, since more abstract information generally requires larger context information.

7. CONCLUSION:

By controlling for the genre and quantity of the training data, we make fair comparisons between several data-rich training tasks in their ability to induce syntactic information. We find that bidirectional language models (BiLMs) do better than translation and skip-thought encoders at extracting useful features for POS tagging and CCG supertagging. Moreover, this improvement holds even when the BiLMs are trained on substantially less data than competing models. Our results suggest that for transfer learning, BiLMs like ELMo (Peters et al., 2018) capture more useful features than translation encoders-and that this holds even on genres for which data is not abundant.

We also find that randomly initialized encoders extract usable features for POS and CCG taggingat least when the auxiliary POS and CCG classifiers are themselves trained on reasonably large amounts of data. The performance of untrained models drops sharply relative to trained ones when using smaller amounts of the classifier data. We investigate further and find that untrained models outperform trained ones on the task of neighboring word identity prediction, which confirms that trained encoders do not perform well on tagging tasks because the classifiers are simply memorizing word identity information. We also find that both trained and untrained LSTMs store more local neighboring word identity information in lower layers and more distant word identity information in upper layers, which suggests that depth in LSTMs allow them to capture larger context information. 

:

Note, in training we initialize the language model LSTM hidden states with the final state after reading the previous sentence.

Figures and Tables:

A CCG parse, with supertags shown immediately below the words.

Figure 1: An annotated PTB example sentence.

Figure 2: POS and CCG tagging accuracies for different amounts of LSTM encoder and classifier training data. We show results for the best performing layer of each model. Note, BiLMs are displayed with the attention models and forward LMs are displayed with the models without attention.

(a) WC-MFC baselines for different amounts of PTB training data: 1% PTB: 81.8%; 10% PTB: 88.6%; 100% PTB: 89.9%. (b) WC-MFC baselines for different amounts of CCG training data: 1% CCG: 62.3%; 10% CCG: 68.3%; 100% CCG: 71.6%.

Figure 3: POS and CCG tagging accuracies for different amounts of classifier training data in terms of percentage points over the word-conditional most frequent class (WC-MFC) baseline. We show results for the best performing layer and model for each task.

Figure 4: POS and CCG tagging accuracies in terms of percentage points over the word-conditional most frequent class baseline. We display results for the best performing models for each task.

Here we display results for training on all of auxiliary task data. Word-conditional most frequent class baselines for this amount of training data are 89.9% for POS tagging and 71.6% for CCG supertagging. For each task, we underline the best performance for each training dataset size and bold the best overall performance.

Table content: <table><tr><td colspan="6">B POS AND CCG EVALUATION FULL RESULTS</td><td/><td/><td/></tr><tr><td colspan="4">B.1 TRAINING CLASSIFIERS ON ALL DATA</td><td/><td/><td/><td/><td/></tr><tr><td>Training task</td><td>Data</td><td colspan="7">Attention POS L2 POS L1 POS L0 CCG L2 CCG L1 CCG L0</td></tr><tr><td colspan="3">Random Init 1 None N/A</td><td>90.5</td><td>93.7</td><td>90.2</td><td>83.5</td><td>85.4</td><td>71.6</td></tr><tr><td colspan="3">Random Init 2 None N/A</td><td>90.3</td><td>93.8</td><td>90.1</td><td>83.3</td><td>85.3</td><td>71.5</td></tr><tr><td>Translation</td><td>1M</td><td>Yes</td><td>95.6</td><td>95.7</td><td>90.0</td><td>91.4</td><td>91.2</td><td>71.5</td></tr><tr><td>Translation</td><td>1M</td><td>No</td><td>92.5</td><td>95.0</td><td>90.0</td><td>88.2</td><td>90.1</td><td>71.3</td></tr><tr><td>LM (Bidir)</td><td>1M</td><td>No</td><td>96.4</td><td>96.1</td><td>90.2</td><td>92.5</td><td>92.0</td><td>71.6</td></tr><tr><td colspan="2">LM (Forward) 1M</td><td>No</td><td>94.3</td><td>94.5</td><td>90.1</td><td>83.5</td><td>83.1</td><td>71.5</td></tr><tr><td>Skip-thought</td><td>1M</td><td>Yes</td><td>44.3</td><td>88.6</td><td>89.9</td><td>45.3</td><td>81.0</td><td>71.1</td></tr><tr><td>Skip-thought</td><td>1M</td><td>No</td><td>78.1</td><td>90.8</td><td>89.9</td><td>74.5</td><td>84.4</td><td>71.1</td></tr><tr><td>Autoencoder</td><td>1M</td><td>Yes</td><td>80.8</td><td>92.4</td><td>89.6</td><td>73.6</td><td>83.7</td><td>71.2</td></tr><tr><td>Autoencoder</td><td>1M</td><td>No</td><td>79.8</td><td>90.8</td><td>89.9</td><td>79.2</td><td>84.0</td><td>71.1</td></tr><tr><td>Translation</td><td>5M</td><td>Yes</td><td>96.0</td><td>95.9</td><td>90.2</td><td>92.2</td><td>91.6</td><td>71.5</td></tr><tr><td>Translation</td><td>5M</td><td>No</td><td>92.9</td><td>95.8</td><td>90.2</td><td>89.6</td><td>91.2</td><td>71.5</td></tr><tr><td>LM (Bidir)</td><td>5M</td><td>No</td><td>96.6</td><td>96.2</td><td>90.3</td><td>92.6</td><td>92.4</td><td>71.6</td></tr><tr><td colspan="2">LM (Forward) 5M</td><td>No</td><td>94.6</td><td>94.7</td><td>90.2</td><td>84.0</td><td>83.5</td><td>71.5</td></tr><tr><td>Skip-thought</td><td>5M</td><td>Yes</td><td>76.4</td><td>92.2</td><td>90.0</td><td>68.4</td><td>86.4</td><td>71.1</td></tr><tr><td>Skip-thought</td><td>5M</td><td>No</td><td>86.1</td><td>94.3</td><td>90.0</td><td>81.2</td><td>88.6</td><td>71.2</td></tr><tr><td>Autoencoder</td><td>5M</td><td>Yes</td><td>88.1</td><td>91.8</td><td>89.6</td><td>76.5</td><td>82.5</td><td>70.8</td></tr><tr><td>Autoencoder</td><td>5M</td><td>No</td><td>70.7</td><td>92.1</td><td>89.8</td><td>72.7</td><td>83.7</td><td>71.0</td></tr><tr><td>LM (Bidir)</td><td>15M</td><td>No</td><td>97.0</td><td>96.8</td><td>90.6</td><td>93.1</td><td>92.9</td><td>72.0</td></tr><tr><td colspan="2">LM (Forward) 15M</td><td>No</td><td>95.3</td><td>95.3</td><td>90.6</td><td>84.9</td><td>84.5</td><td>72.0</td></tr><tr><td>Skip-thought</td><td>15M</td><td>Yes</td><td>82.3</td><td>93.8</td><td>90.2</td><td>70.4</td><td>87.6</td><td>71.6</td></tr><tr><td>Skip-thought</td><td>15M</td><td>No</td><td>90.1</td><td>95.1</td><td>90.3</td><td>85.8</td><td>89.8</td><td>71.5</td></tr><tr><td>Autoencoder</td><td>15M</td><td>Yes</td><td>91.9</td><td>93.1</td><td>90.1</td><td>82.6</td><td>84.5</td><td>71.4</td></tr><tr><td>Autoencoder</td><td>15M</td><td>No</td><td>71.6</td><td>92.0</td><td>89.8</td><td>71.0</td><td>83.7</td><td>71.2</td></tr><tr><td>LM (Bidir)</td><td>63M</td><td>No</td><td>96.9</td><td>96.7</td><td>90.6</td><td>93.1</td><td>93.0</td><td>72.0</td></tr><tr><td colspan="2">LM (Forward) 63M</td><td>No</td><td>95.3</td><td>95.4</td><td>90.6</td><td>84.9</td><td>84.5</td><td>72.0</td></tr><tr><td>Skip-thought</td><td>63M</td><td>Yes</td><td>90.6</td><td>95.5</td><td>90.3</td><td>80.9</td><td>90.1</td><td>71.6</td></tr><tr><td>Skip-thought</td><td>63M</td><td>No</td><td>91.6</td><td>95.6</td><td>90.3</td><td>86.8</td><td>90.3</td><td>71.6</td></tr><tr><td>Autoencoder</td><td>63M</td><td>Yes</td><td>89.4</td><td>91.8</td><td>89.6</td><td>78.4</td><td>83.2</td><td>71.2</td></tr><tr><td>Autoencoder</td><td>63M</td><td>No</td><td>70.2</td><td>91.7</td><td>89.9</td><td>70.5</td><td>83.1</td><td>71.3</td></tr></table>

Here we display results for training on 10% of auxiliary task data. Word-conditional most frequent class baselines for this amount of training data are 88.6% for POS tagging and 68.3% for CCG supertagging. For each task, we underline the best performance for each training dataset size and bold the best overall performance. Under review as a conference paper at ICLR 2019 B.3 TRAINING CLASSIFIERS ON 1% OF DATA

Table content: <table><tr><td>Training task</td><td>Data</td><td colspan="7">Attn. POS L2 POS L1 POS L0 CCG L2 CCG L1 CCG L0</td></tr><tr><td colspan="3">Random Init 1 None N/A</td><td>68.7</td><td>74.5</td><td>79.1</td><td>54.4</td><td>60.9</td><td>59.3</td></tr><tr><td colspan="3">Random Init 2 None N/A</td><td>68.8</td><td>74.5</td><td>79.5</td><td>55.5</td><td>62.0</td><td>58.8</td></tr><tr><td>Translation</td><td>1M</td><td>Yes</td><td>90.8</td><td>91.7</td><td>87.2</td><td>79.1</td><td>81.0</td><td>65.4</td></tr><tr><td>Translation</td><td>1M</td><td>No</td><td>82.5</td><td>89.9</td><td>86.9</td><td>69.0</td><td>78.3</td><td>65.0</td></tr><tr><td>LM (Bidir)</td><td>1M</td><td>No</td><td>93.5</td><td>93.8</td><td>89.0</td><td>82.8</td><td>81.6</td><td>67.1</td></tr><tr><td>LM Forward</td><td>1M</td><td>No</td><td>90.8</td><td>91.8</td><td>88.5</td><td>74.3</td><td>74.1</td><td>66.5</td></tr><tr><td>Skip-thought</td><td>1M</td><td>Yes</td><td>27.2</td><td>73.2</td><td>81.4</td><td>28.7</td><td>63.3</td><td>60.7</td></tr><tr><td>Skip-thought</td><td>1M</td><td>No</td><td>57.8</td><td>77.5</td><td>81.3</td><td>47.4</td><td>67.9</td><td>61.0</td></tr><tr><td>Autoencoder</td><td>1M</td><td>Yes</td><td>71.2</td><td>81.4</td><td>81.8</td><td>59.0</td><td>67.4</td><td>61.9</td></tr><tr><td>Autoencoder</td><td>1M</td><td>No</td><td>62.2</td><td>78.7</td><td>84.2</td><td>60.2</td><td>69.4</td><td>63.5</td></tr><tr><td>Translation</td><td>5M</td><td>Yes</td><td>92.1</td><td>92.9</td><td>88.2</td><td>77.3</td><td>81.2</td><td>65.7</td></tr><tr><td>Translation</td><td>5M</td><td>No</td><td>82.7</td><td>91.7</td><td>88.0</td><td>73.5</td><td>80.7</td><td>65.9</td></tr><tr><td>LM (Bidir)</td><td>5M</td><td>No</td><td>93.7</td><td>94.0</td><td>89.1</td><td>83.0</td><td>82.4</td><td>67.1</td></tr><tr><td>LM Forward</td><td>5M</td><td>No</td><td>90.7</td><td>92.1</td><td>88.8</td><td>74.3</td><td>74.3</td><td>66.7</td></tr><tr><td>Skip-thought</td><td>5M</td><td>Yes</td><td>55.3</td><td>83.4</td><td>84.8</td><td>44.5</td><td>72.4</td><td>63.0</td></tr><tr><td>Skip-thought</td><td>5M</td><td>No</td><td>69.6</td><td>86.0</td><td>84.4</td><td>53.5</td><td>75.1</td><td>62.7</td></tr><tr><td>Autoencoder</td><td>5M</td><td>Yes</td><td>67.6</td><td>79.5</td><td>80.8</td><td>58.8</td><td>64.6</td><td>61.0</td></tr><tr><td>Autoencoder</td><td>5M</td><td>No</td><td>60.7</td><td>81.1</td><td>82.6</td><td>56.0</td><td>68.7</td><td>61.8</td></tr><tr><td>LM (Bidir)</td><td>15M</td><td>No</td><td>94.4</td><td>94.7</td><td>89.6</td><td>82.8</td><td>83.7</td><td>67.5</td></tr><tr><td>LM Forward</td><td>15M</td><td>No</td><td>91.7</td><td>93.1</td><td>89.3</td><td>74.8</td><td>75.8</td><td>67.3</td></tr><tr><td>Skip-thought</td><td>15M</td><td>Yes</td><td>50.7</td><td>85.4</td><td>84.9</td><td>29.6</td><td>73.8</td><td>63.5</td></tr><tr><td>Skip-thought</td><td>15M</td><td>No</td><td>75.2</td><td>88.1</td><td>84.9</td><td>63.5</td><td>77.4</td><td>63.7</td></tr><tr><td>Autoencoder</td><td>15M</td><td>Yes</td><td>77.9</td><td>82.3</td><td>81.9</td><td>66.9</td><td>68.7</td><td>62.6</td></tr><tr><td>Autoencoder</td><td>15M</td><td>No</td><td>61.2</td><td>80.4</td><td>82.3</td><td>56.6</td><td>69.8</td><td>62.0</td></tr><tr><td>LM (Bidir)</td><td>63M</td><td>No</td><td>94.3</td><td>94.8</td><td>89.7</td><td>82.9</td><td>83.9</td><td>67.5</td></tr><tr><td>LM Forward</td><td>63M</td><td>No</td><td>92.1</td><td>93.3</td><td>89.4</td><td>74.9</td><td>76.2</td><td>67.6</td></tr><tr><td>Skip-thought</td><td>63M</td><td>Yes</td><td>69.8</td><td>90.2</td><td>86.3</td><td>55.4</td><td>78.1</td><td>64.4</td></tr><tr><td>Skip-thought</td><td>63M</td><td>No</td><td>77.9</td><td>89.6</td><td>86.1</td><td>64.8</td><td>78.4</td><td>64.0</td></tr><tr><td>Autoencoder</td><td>63M</td><td>Yes</td><td>72.1</td><td>80.1</td><td>81.5</td><td>58.7</td><td>66.8</td><td>61.3</td></tr><tr><td>Autoencoder</td><td>63M</td><td>No</td><td>60.6</td><td>80.6</td><td>82.3</td><td>55.7</td><td>68.6</td><td>61.7</td></tr></table>

Here we display results for training on 1% of auxiliary task data. Word-conditional most frequent class baselines for this amount of training data are 81.8% for POS tagging and 62.3% for CCG supertagging. For each task, we underline the best performance for each training dataset size and bold the best overall performance.

Table content: <table/>

Peer review (iclr2019):
 I have mixed feelings about this paper. On one hand, it’s a thorough and well-written experimental paper, something which is really important but is also clearly underappreciated in the machine learning community. On the other, it was not really obvious to me why some of objectives tested here are interesting: LM objectives like ELMo have seen a lot of uptake in the NLP community (and this is definitely an NLP paper), but most of the others—like skip-thought, MT, and autoencoders—have not. So the basic research question doesn’t seem like an especially burning one. The trends in Fig. 2 show that these alternatives underperform an LM objective, which suggests that the NLP community can keep using that objective without worry—and everything else in the figure seems as we would expect. In short, I think the paper is a well-done study on a hypothesis of perhaps minor interest. The results are sensible but confirm what we already strongly suspected, and they seem unlikely to strongly influence other research, since they confirm that everyone has been the right thing all along. I’m not entirely sure what I learned from this. To me, the most interesting experiment is the final one in Section 6. This experiment seems like it could be the germ for a far more interesting paper getting at how these pretraining objectives help with downstream tasks. As it stands, it feels like an interesting nugget tacked on to an otherwise complete (and much less interesting) paper. Presentational comments: Fig.1: really nitpicky, but the typography of the POS tags and CCG categories is all wrong. These aren’t mathematical symbols! Fig 2. Slightly confused why these are broken up into two separate plots. Fig 4. is hard to read due to the lurid colors and patterns, which require a lot of cross-referencing with the legend. I wonder if this would be better as simply a table. I also found it very confusing at first since the y-axes are out of sync between the two figures—initially it looked as if the legend was overlaid on a set of bars in the left figure that had the same baseline as the right figure.