<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning to Transduce with Unbounded Memory · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1506.02516/</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/1506.02516/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning to Transduce with Unbounded Memory — mentioned by tree_of_item</title><link>https://news.ycombinator.com/item?id=17767398</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.02516:17767398</guid><pubDate>Wed, 15 Aug 2018 16:38:59 GMT</pubDate><description>&lt;p&gt;See [0] for a way to make recurrent neural nets in to pushdown nets. [0]: https://arxiv.org/abs/1506.02516&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.02516/"&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>Learning to Transduce with Unbounded Memory — mentioned by davidad_</title><link>https://news.ycombinator.com/item?id=10828914</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.02516: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/1506.02516/"&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>Learning to Transduce with Unbounded Memory — mentioned by deepnet</title><link>https://news.ycombinator.com/item?id=10706914</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.02516:10706914</guid><pubDate>Wed, 09 Dec 2015 21:33:59 GMT</pubDate><description>&lt;p&gt;non pdf links to arxiv abstracts: Teaching Machines to Read and Comprehend by Hermann, Kočiský, Grefenstette, Espeholt, Kay, Suleyman, &amp;amp; Blunsom http://arxiv.org/abs/1506.03340 and (same group) Reasoning about Entailment with Neural Attention http://arxiv.org/abs/1509.06664 Learning to Transduce with Unbounded Memory http://arxiv.org/abs/1506.02516&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.02516/"&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>Learning to Transduce with Unbounded Memory — HN submission</title><link>https://news.ycombinator.com/item?id=9684389</link><guid isPermaLink="false">urn:hackerpapers:submission:1506.02516:9684389</guid><pubDate>Tue, 09 Jun 2015 06:45:12 GMT</pubDate><description>&lt;p&gt;Learning to Transduce with Unbounded Memory&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1506.02516/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Learning to Transduce with Unbounded Memory — HN submission</title><link>https://news.ycombinator.com/item?id=9683907</link><guid isPermaLink="false">urn:hackerpapers:submission:1506.02516:9683907</guid><pubDate>Tue, 09 Jun 2015 03:21:41 GMT</pubDate><description>&lt;p&gt;Learning to Transduce with Unbounded Memory (Google DeepMind) [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/1506.02516/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
