News for hackers. Stuff that matters.
Re:FastText – Library for fast text representation and class... by kough on Thursday August 04, 2016 @04:29PM (#12228216)
Links to the relevant papers:

Bag of Tricks for Efficient Text Classification: https://arxiv.org/abs/1607.01759v2

Enriching Word Vectors with Subword Information: https://arxiv.org/abs/1607.04606

Both fantastic papers. For those who aren't aware, Mikolov also helped create word2vec.

One curious thing: this seems to use heirarchal softmax instead of the "negative sampling" described in their earlier paper http://arxiv.org/abs/1310.4546, despite that paper reporting that "negative sampling" is more computationally efficient and of similar quality. Anyone know why that might be?

Re:FastText – Library for fast text representation and class... by exgrv on Thursday August 04, 2016 @04:40PM (#12228304)
It is possible to chose between negative sampling (ns), softmax or hierarchical softmax (hs) by using the -loss option.
Re:FastText – Library for fast text representation and class... by kough on Thursday August 04, 2016 @05:08PM (#12228497)
Cool, thank you!