<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bag of Tricks for Efficient Text Classification · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1607.01759/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1607.01759/feed.xml" rel="self" type="application/rss+xml" /><item><title>Bag of Tricks for Efficient Text Classification — mentioned by braza</title><link>https://news.ycombinator.com/item?id=40799867</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.01759:40799867</guid><pubDate>Wed, 26 Jun 2024 13:34:02 GMT</pubDate><description>&lt;p&gt;A lot of great takes in this thread, but let me give more perspective being a MLE/MLOps Engineer myself around the math. For me mathematics and statistics represent (a) unemployment insurance since it give me a lot of transitivity around roles in the space,(b) give me a good toolbox to talk as an equal with DS, and (c) for all implementation made by the Research Engineers/Data Scientists I can chime in and give insights and avoid waste of time and resources. One example: When BERT was released (ca. 2018) I was working in a place where several Research Engineers and DSs wanted to use it in…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.01759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Bag of Tricks for Efficient Text Classification — mentioned by wenc</title><link>https://news.ycombinator.com/item?id=16501760</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.01759:16501760</guid><pubDate>Fri, 02 Mar 2018 14:50:40 GMT</pubDate><description>&lt;p&gt;The cognoscenti already know this, but word vectors are a game changer in the multi-class text classification game. Finding the correct representation of text makes the classification task so much easier. For my problem (1000+ total classes, 1 class per input), I experimented with Naive Bayes + TFIDF (~50% accuracy, &amp;lt; 1 sec training), then Word2vec + CNN model on GPU (~70% accuracy, 6 hrs training), and finally FastText (99% accuracy, 10 minutes training). FastText [0] in particular is quite impressive. It is essentially a variant of Word2Vec that also supports n-grams, and there is a default…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.01759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Bag of Tricks for Efficient Text Classification — mentioned by pasbesoin</title><link>https://news.ycombinator.com/item?id=12333139</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.01759:12333139</guid><pubDate>Sun, 21 Aug 2016 23:03:31 GMT</pubDate><description>&lt;p&gt;That FB hand-off page has an annoying auto refresh with NoScript enabled. So, here&amp;#x27;s the PDF it points to. I guess I&amp;#x27;ll change it from linking the PDF document to a link to its abstract page, while I&amp;#x27;m at it. http://arxiv.org/abs/1607.01759v3&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.01759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Bag of Tricks for Efficient Text Classification — mentioned by kough</title><link>https://news.ycombinator.com/item?id=12228216</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.01759:12228216</guid><pubDate>Thu, 04 Aug 2016 20:29:27 GMT</pubDate><description>&lt;p&gt;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&amp;#x27;t aware, Mikolov also helped create word2vec. One curious thing: this seems to use heirarchal softmax instead of the &amp;quot;negative sampling&amp;quot; described in their earlier paper http://arxiv.org/abs/1310.4546, despite that paper reporting that &amp;quot;negative sampling&amp;quot; is more computationally efficient and of similar quality. Anyone know why that might be?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.01759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Bag of Tricks for Efficient Text Classification — mentioned by Smerity</title><link>https://news.ycombinator.com/item?id=12228070</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.01759:12228070</guid><pubDate>Thu, 04 Aug 2016 20:04:20 GMT</pubDate><description>&lt;p&gt;Just to mirror what was said on the thread a month ago when the paper came out[1], if you&amp;#x27;re interested in FastText I&amp;#x27;d strongly recommend checking out Vowpal Wabbit[2] and BIDMach[3]. My main issue is that the FastText paper [7] only compares to other intensive deep methods and not to comparable performance focused systems like Vowpal Wabbit or BIDMach. Many of the features implemented in FastText have been existing in Vowpal Wabbit (VW) for many years. Vowpal Wabbit also serves as a test bed for many other interesting, but all highly performant, ideas, and has reasonable strong…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.01759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Bag of Tricks for Efficient Text Classification — mentioned by smhx</title><link>https://news.ycombinator.com/item?id=12227683</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.01759:12227683</guid><pubDate>Thu, 04 Aug 2016 18:57:26 GMT</pubDate><description>&lt;p&gt;Link to the paper: https://arxiv.org/abs/1607.01759 Quotes from the paper: Both char-CNN and VDCNN are trained on a NVIDIA Tesla K40 GPU, while our models are trained on a CPU using 20 threads. Table2 shows that methods using convolutions are several orders of magnitude slower than fastText. Our speed-up compared to CNN based methods increases with the size of the dataset, going up to atleast a 15, 000× speed-up. Table 2 shows the speedups of: ConvNets: 2 to 5 days on GPUs FastText: 52 seconds on CPU&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.01759/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Bag of Tricks for Efficient Text Classification — HN submission</title><link>https://news.ycombinator.com/item?id=12061115</link><guid isPermaLink="false">urn:hackerpapers:submission:1607.01759:12061115</guid><pubDate>Sat, 09 Jul 2016 12:38:49 GMT</pubDate><description>&lt;p&gt;Bag of Tricks for Efficient Text Classification&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;169 points; 15 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1607.01759/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Bag of Tricks for Efficient Text Classification — HN submission</title><link>https://news.ycombinator.com/item?id=12050067</link><guid isPermaLink="false">urn:hackerpapers:submission:1607.01759:12050067</guid><pubDate>Thu, 07 Jul 2016 15:50:41 GMT</pubDate><description>&lt;p&gt;FastText: Training text classifiers on 1b words in less than 10 minutes&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1607.01759/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
