<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>word2vec Parameter Learning Explained · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1411.2738/</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/1411.2738/feed.xml" rel="self" type="application/rss+xml" /><item><title>word2vec Parameter Learning Explained — mentioned by eternalban</title><link>https://news.ycombinator.com/item?id=34789556</link><guid isPermaLink="false">urn:hackerpapers:mention:1411.2738:34789556</guid><pubDate>Tue, 14 Feb 2023 14:15:11 GMT</pubDate><description>&lt;p&gt;Related: word2vec Parameter Learning Explained, Xin Rong, 2015 https://arxiv.org/abs/1411.2738v2 * LAMVI-2: A Visual Tool for Comparing and Tuning Word Embedding Models*, Xin Rong et al, 2018 https://arxiv.org/abs/1810.11367&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1411.2738/"&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 Parameter Learning Explained — mentioned by faizshah</title><link>https://news.ycombinator.com/item?id=15698139</link><guid isPermaLink="false">urn:hackerpapers:mention:1411.2738: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/1411.2738/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
