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

1 cards in “4.2 Ranking Criterion versus Entropy Criterion” · whole deck

4.2 Ranking Criterion versus Entropy Criterion

  1. What language-model training criterion did Collobert et al. use instead of cross-entropy, and why?
    A pairwise ranking criterion: \(\sum_{x} \sum_{w \in \mathcal{D}} \max\{0, 1 - f_\theta(x) + f_\theta(x^{(w)})\}\), where \(x^{(w)}\) is the text window \(x\) with its centre word replaced by \(w\). The network should score real windows at least 1 above corrupted ones. It avoids normalizing over the vocabulary, and unlike entropy is not dominated by frequent phrases: rare but legal phrases matter for learning syntax.

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