<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Neural Transducer · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1511.04868/</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/1511.04868/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Neural Transducer — mentioned by kastnerkyle</title><link>https://news.ycombinator.com/item?id=11912139</link><guid isPermaLink="false">urn:hackerpapers:mention:1511.04868:11912139</guid><pubDate>Wed, 15 Jun 2016 21:05:40 GMT</pubDate><description>&lt;p&gt;Sure, there are a lot of potential things to do - either by enumerating towards the full &amp;quot;brute force&amp;quot; loss partway as I think you are hinting toward, or treating as a subsequences, or something else [0, 1, 2]. The point is, IMO RNNs do need some kind of structured loss (more than per step likelihood) to be competitive with HMM approaches using Viterbi decoding, in addition to some sequence smarts (such as beam search) in decoding. At least in NMT, enumerating the possible decisions as 3n + 1 is almost impossible since the softmax size is generally the memory bottleneck in training - and a…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1511.04868/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
