<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1402.3722/</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/1402.3722/feed.xml" rel="self" type="application/rss+xml" /><item><title>word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method — mentioned by faizshah</title><link>https://news.ycombinator.com/item?id=15698139</link><guid isPermaLink="false">urn:hackerpapers:mention:1402.3722:15698139</guid><pubDate>Tue, 14 Nov 2017 19:07:30 GMT</pubDate><description>&lt;p&gt;I like Pugh&amp;#x27;s paper on skip lists [1], Shannon&amp;#x27;s &amp;quot;Mathematical Theory of Communication&amp;quot; [2], and these two might be a stretch but I also like Rong&amp;#x27;s &amp;quot;Word2vec Parameter Learning Explained&amp;quot; [3] and Levy &amp;amp; Goldberg&amp;#x27;s &amp;quot;Word2vec Explained&amp;quot; [4]. In any case use the recommended papers to learn paper reading skills e.g look at references when you don&amp;#x27;t understand a concept, find an introductory textbook to clarify a proof method, write a summary to make your understanding concrete. Good Luck! [1]: http://courses.cs.vt.edu/cs2604/fall05/wmcquain/Notes/Supple... [2]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1402.3722/"&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>word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method — mentioned by jventura</title><link>https://news.ycombinator.com/item?id=15237982</link><guid isPermaLink="false">urn:hackerpapers:mention:1402.3722:15237982</guid><pubDate>Wed, 13 Sep 2017 13:24:54 GMT</pubDate><description>&lt;p&gt;Neural networks are all the rage these days. As my knowledge on NNs is quite limited, what I could grasp from the wikipedia article [0] and the original paper [1] is that word2vec uses a vector to represent words in a n-dimensional space. This seems quite similar to LSA (Latent Semantic Analysis). In LSA, a word is represented by a vector (list / array) of values which represent the number of occurrences of the word in a document. For instance, the list [0, 5, 9, 10] for the word &amp;quot;aeroplane&amp;quot; means than &amp;quot;aeroplane&amp;quot; occurs zero times in D1 (document #1), 5 times in D2, etc. Unlike LSA, word2vec…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1402.3722/"&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>word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method — mentioned by denzil_correa</title><link>https://news.ycombinator.com/item?id=13772978</link><guid isPermaLink="false">urn:hackerpapers:mention:1402.3722:13772978</guid><pubDate>Thu, 02 Mar 2017 10:10:23 GMT</pubDate><description>&lt;p&gt;&amp;gt; Words with similar vectors have similar meanings. Can you explain WHY this is the case with word2vec? I have come across a paper which says &amp;quot;we don&amp;#x27;t know really&amp;quot;. Is this true? https://arxiv.org/abs/1402.3722&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1402.3722/"&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>word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method — mentioned by denzil_correa</title><link>https://news.ycombinator.com/item?id=13772967</link><guid isPermaLink="false">urn:hackerpapers:mention:1402.3722:13772967</guid><pubDate>Thu, 02 Mar 2017 10:08:24 GMT</pubDate><description>&lt;p&gt;Can someone explain WHY do word vectors with similar contexts club together and are good? One of the papers suggest that &amp;quot;we don&amp;#x27;t really know&amp;quot; (Section 4) [0] https://arxiv.org/abs/1402.3722&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1402.3722/"&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>word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method — mentioned by vonnik</title><link>https://news.ycombinator.com/item?id=10325077</link><guid isPermaLink="false">urn:hackerpapers:mention:1402.3722:10325077</guid><pubDate>Sat, 03 Oct 2015 19:40:07 GMT</pubDate><description>&lt;p&gt;Yoav is one of the smartest guys in this space. He and Omer Levy also wrote a great explanation of word2vec: http://arxiv.org/pdf/1402.3722v1.pdf https://levyomer.wordpress.com/2014/04/25/word2vec-explained...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1402.3722/"&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>word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method — mentioned by syllogism</title><link>https://news.ycombinator.com/item?id=9653391</link><guid isPermaLink="false">urn:hackerpapers:mention:1402.3722:9653391</guid><pubDate>Wed, 03 Jun 2015 15:45:00 GMT</pubDate><description>&lt;p&gt;You might be interested to read this: http://arxiv.org/pdf/1402.3722v1.pdf word2vec Explained: Deriving Mikolov et al.’s Negative-Sampling Word-Embedding Method. Yoav Goldberg and Omer Levy. arXiv 2014. [pdf] The word2vec software of Tomas Mikolov and colleagues has gained a lot of traction lately, and provides state-of-the-art word embeddings. The learning models behind the software are described in two research papers. We found the description of the models in these papers to be somewhat cryptic and hard to follow. While the motivations and presentation may be obvious to the neural-networks…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1402.3722/"&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>word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method — HN submission</title><link>https://news.ycombinator.com/item?id=8983111</link><guid isPermaLink="false">urn:hackerpapers:submission:1402.3722:8983111</guid><pubDate>Mon, 02 Feb 2015 07:32:50 GMT</pubDate><description>&lt;p&gt;Word2Vec Explained [pdf]&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/1402.3722/"&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>
