Natural Language Processing (Almost) from Scratch

Collobert et al., 2011, Natural Language Processing (Almost) from Scratch (Journal of Machine Learning Research)

Subscriber deck — free during early access

2 cards in “4.3 Training Language Models” · whole deck

4.3 Training Language Models

  1. How were the large ranking language models trained?
    On Wikipedia (631M words) and then Wikipedia plus Reuters RCV1 (852M words), with window size 11 and 100 hidden units, using a curriculum of growing dictionaries (5k up to 100k words), each initialized from the previous network. LM1 took about four weeks, LM2 three more. Hyperparameters were chosen by “breeding”.
  2. What is “breeding” in Collobert et al.’s model selection?
    Without enough compute for grid search, train \(k\) parameter settings in parallel for some days, keep the best by validation ranking loss, and start the next round from slight variations of the winners, initialized with their parents’ embeddings so training continues online.

Source

  • Ronan Collobert, Jason Weston, Léon Bottou, Michael Karlen, Koray Kavukcuoglu and Pavel Kuksa. 2011. Natural Language Processing (Almost) from Scratch. In Journal of Machine Learning Research, pp. 2493–2537. https://www.jmlr.org/papers/v12/collobert11a.html