<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1503.01007/</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/1503.01007/feed.xml" rel="self" type="application/rss+xml" /><item><title>Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets — mentioned by jsenn</title><link>https://news.ycombinator.com/item?id=34492768</link><guid isPermaLink="false">urn:hackerpapers:mention:1503.01007:34492768</guid><pubDate>Mon, 23 Jan 2023 18:21:03 GMT</pubDate><description>&lt;p&gt;Here&amp;#x27;s a paper that shows how to augment a recurrent NN with a stack: http://arxiv.org/abs/1503.01007. I&amp;#x27;m not an expert, so some or all of this may be wrong, but my understanding of how it works is this. You have a stack memory, which is just a list of numbers (or maybe a list of N-dimensional vectors). You add the contents of the stack at time t-1 to the input of the network at time t. The hidden layer contains a special number that controls whether to push or pop from the stack (or leave it alone). The values in the stack are determined from the values in the hidden layer at the time they…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1503.01007/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets — mentioned by davidad_</title><link>https://news.ycombinator.com/item?id=10828914</link><guid isPermaLink="false">urn:hackerpapers:mention:1503.01007:10828914</guid><pubDate>Sun, 03 Jan 2016 00:53:26 GMT</pubDate><description>&lt;p&gt;Here&amp;#x27;s the differentiable stack/queue/deque paper: http://arxiv.org/abs/1506.02516 It is indeed similar to some work from FAIR, where one of the tasks was binary addition: http://arxiv.org/abs/1503.01007&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1503.01007/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=10175740</link><guid isPermaLink="false">urn:hackerpapers:mention:1503.01007:10175740</guid><pubDate>Sat, 05 Sep 2015 19:10:27 GMT</pubDate><description>&lt;p&gt;I have shivers going down my spine at the idea of feeding, say, skip-thought vectors representing sentences[1] into stack-augmented recurrent neural nets as proposed in Facebook&amp;#x27;s paper[2], for all sorts of interesting tasks. -- [1] http://arxiv.org/pdf/1506.06726v1.pdf [2] http://arxiv.org/pdf/1503.01007.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1503.01007/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets — mentioned by andrewtbham</title><link>https://news.ycombinator.com/item?id=10175220</link><guid isPermaLink="false">urn:hackerpapers:mention:1503.01007:10175220</guid><pubDate>Sat, 05 Sep 2015 16:21:56 GMT</pubDate><description>&lt;p&gt;Reasons this high has probability of credibility: Research probably used on Facebook digital assistant M. Tomas Mikolov, the author of word2vec. Paper with source code. http://arxiv.org/pdf/1503.01007.pdf https://github.com/facebook/Stack-RNN&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1503.01007/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets — mentioned by exgrv</title><link>https://news.ycombinator.com/item?id=9585563</link><guid isPermaLink="false">urn:hackerpapers:mention:1503.01007:9585563</guid><pubDate>Thu, 21 May 2015 21:45:43 GMT</pubDate><description>&lt;p&gt;There is this paper by Joulin &amp;amp; Mikolov: Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets (http://arxiv.org/abs/1503.01007). In this case, the memory of the RNN is an ensemble of differentiable stacks.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1503.01007/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
