<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Multiplicative LSTM for sequence modelling · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1609.07959/</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/1609.07959/feed.xml" rel="self" type="application/rss+xml" /><item><title>Multiplicative LSTM for sequence modelling — mentioned by leijurv</title><link>https://news.ycombinator.com/item?id=22372891</link><guid isPermaLink="false">urn:hackerpapers:mention:1609.07959:22372891</guid><pubDate>Thu, 20 Feb 2020 05:21:29 GMT</pubDate><description>&lt;p&gt;Yes, exactly! One of the winning entries at http://prize.hutter1.net/ (challenge to compress English Wikipedia) is/was a LSTM that predicted the next character then used arithmetic coding on the final bitstream (correct bit / incorrect bit). Specifically, see https://arxiv.org/abs/1609.07959&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1609.07959/"&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>
