Unsupervised Learning of Sentence Embeddings Using Compositional n-Gram Features
Written for the Research library (claude-opus-5-5) from the paper text. Original — aclanthology.org/N18-1049.pdf
Summary
The paper asks whether the simple, scalable recipe behind word embeddings can also produce strong general-purpose vectors for whole sentences without labeled data. The authors propose Sent2Vec, which extends the C-BOW objective from a fixed local window to the full sentence. A sentence vector is the mean of learned source embeddings for its words and its n-grams. Each word is predicted from the rest of the sentence using negative sampling and subsampling of frequent targets. Unlike C-BOW, the model drops dynamic windows and input-side subsampling, and it stores n-grams through FastText-style hashing. Models were trained on the Toronto book corpus, Wikipedia sentences and tweets. Both training and inference cost only a constant number of vector operations per token. Across most benchmarks, Sent2Vec beats earlier unsupervised methods and often semi-supervised ones too, while running as cheaply as plain averaging. This matters because strong sentence representations can then be trained on very large corpora using CPUs.
Key points
- Tokenization used the Stanford NLP library for Wikipedia and Toronto books and the NLTK tweet tokenizer for Twitter. Training used SGD and parallelizes easily.
- Against Arora et al. (2017), the Sent2Vec tweet model (19.7B words) with unigrams and bigrams scored 0.701 on STS 2014, 0.715 on SICK 2014 and 0.835 on the supervised average. GloVe + WR scored 0.685, 0.722 and 0.815, despite using a Common Crawl corpus 42 times larger.
- On semantic similarity, supervised PSL + WR still leads (0.735 on STS 2014, 0.729 on SICK). Sent2Vec, however, outperforms it on downstream supervised tasks.
- Bigrams improve supervised classification, likely by capturing phrases such as "not good", but slightly hurt unsupervised similarity. Models trained on Toronto books set the best result on the STS 2014 images subset, ahead of the supervised Caption-Rep.
- The learned word-vector norms down-weight both very frequent and very rare tokens, which roughly matches Luhn's hypothesis. Code and models were released at github.com/epfml/sent2vec.
Cited by
- SimCSE: Simple Contrastive Learning of Sentence Embeddings
- Beyond BLEU: Training Neural Machine Translation with Semantic Similarity
Cite
@inproceedings{pagliardini2018unsupervised,
title = {{Unsupervised Learning of Sentence Embeddings Using Compositional n-Gram Features}},
author = {Pagliardini, Matteo and Gupta, Prakhar and Jaggi, Martin},
booktitle = {Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)},
year = {2018},
doi = {10.18653/v1/n18-1049},
url = {https://doi.org/10.18653/v1/n18-1049}
}References
- Eneko Agirre, Carmen Banea, Claire Cardie, Daniel Cer, Mona Diab, Aitor Gonzalez-Agirre, Weiwei Guo, Rada Mihalcea, German Rigau, and Janyce Wiebe. 2014. Semeval-2014 task 10: Multilingual semantic textual similarity. In Proceedings of the 8th international workshop on semantic evaluation (SemEval 2… find our card
- Sanjeev Arora, Yuanzhi Li, Yingyu Liang, Tengyu Ma, and Andrej Risteski. 2016. A Latent Variable Model Approach to PMI-based Word Embeddings. In Transactions of the Association for Computational Linguistics. pages 385–399. find
- Sanjeev Arora, Yingyu Liang, and Tengyu Ma. 2017. A simple but tough-to-beat baseline for sentence embeddings. In International Conference on Learning Representations (ICLR). find
- Steven Bird, Ewan Klein, and Edward Loper. 2009. Natural language processing with Python: analyzing text with the natural language toolkit. ” O’Reilly Media, Inc.”. find
- Piotr Bojanowski, Edouard Grave, Armand Joulin, and Tomas Mikolov. 2017. Enriching Word Vectors with Subword Information. Transactions of the Association for Computational Linguistics 5:135–146. \#\# Conclusion find