<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1703.01253/</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/1703.01253/feed.xml" rel="self" type="application/rss+xml" /><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — mentioned by eternalban</title><link>https://news.ycombinator.com/item?id=13992135</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.01253:13992135</guid><pubDate>Thu, 30 Mar 2017 01:19:05 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/pdf/1703.01253.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — HN submission</title><link>https://news.ycombinator.com/item?id=13989830</link><guid isPermaLink="false">urn:hackerpapers:submission:1703.01253:13989830</guid><pubDate>Wed, 29 Mar 2017 19:36:57 GMT</pubDate><description>&lt;p&gt;Machine Learning on Sequential Data Using a Recurrent Weighted Average&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/1703.01253/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — HN submission</title><link>https://news.ycombinator.com/item?id=13978490</link><guid isPermaLink="false">urn:hackerpapers:submission:1703.01253:13978490</guid><pubDate>Tue, 28 Mar 2017 17:16:45 GMT</pubDate><description>&lt;p&gt;Recurrent attention efficiently reaches into the deep past&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/1703.01253/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — HN submission</title><link>https://news.ycombinator.com/item?id=13925067</link><guid isPermaLink="false">urn:hackerpapers:submission:1703.01253:13925067</guid><pubDate>Tue, 21 Mar 2017 18:55:00 GMT</pubDate><description>&lt;p&gt;Recurrent attention mechanism using moving average&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/1703.01253/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — HN submission</title><link>https://news.ycombinator.com/item?id=13911081</link><guid isPermaLink="false">urn:hackerpapers:submission:1703.01253:13911081</guid><pubDate>Mon, 20 Mar 2017 01:44:03 GMT</pubDate><description>&lt;p&gt;Recurrent Neural Networks with Deep Memory Access&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — mentioned by jostmey</title><link>https://news.ycombinator.com/item?id=13841423</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.01253:13841423</guid><pubDate>Fri, 10 Mar 2017 19:39:47 GMT</pubDate><description>&lt;p&gt;First comparison of the RWA model (paper: https://arxiv.org/abs/1703.01253) against a LSTM model on a natural language processing problem!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — mentioned by deepnet</title><link>https://news.ycombinator.com/item?id=13819264</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.01253:13819264</guid><pubDate>Wed, 08 Mar 2017 10:14:54 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/1703.01253 link to the abstract&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — mentioned by iraphael</title><link>https://news.ycombinator.com/item?id=13818063</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.01253:13818063</guid><pubDate>Wed, 08 Mar 2017 05:10:11 GMT</pubDate><description>&lt;p&gt;Link to the actual paper: https://arxiv.org/pdf/1703.01253.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — mentioned by jostmey</title><link>https://news.ycombinator.com/item?id=13817685</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.01253:13817685</guid><pubDate>Wed, 08 Mar 2017 03:39:26 GMT</pubDate><description>&lt;p&gt;Yes, I do save the numerator and denominator. The model I used is: h_t = f( (numerator_(t-1) + z x e^a) / (denominator_(t-1) + e^a) ) Equations (7) in the arxiv link (here it is again: https://arxiv.org/pdf/1703.01253.pdf) provide the update equations. When implementing the equations, you sometimes have to scale both the numerator and denominator back by a constant factor to avoid an overflow error&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — mentioned by jostmey</title><link>https://news.ycombinator.com/item?id=13817534</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.01253:13817534</guid><pubDate>Wed, 08 Mar 2017 03:07:39 GMT</pubDate><description>&lt;p&gt;The RWA model is described in equations (7) of this paper: https://arxiv.org/pdf/1703.01253.pdf I think you will see that the cost per training set is just as cheap if not cheaper than a LSTM model. On my machine, the RWA model completes each training step faster than a LSTM model. I don&amp;#x27;t know if that will hold for GPUs.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — mentioned by jostmey</title><link>https://news.ycombinator.com/item?id=13817488</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.01253:13817488</guid><pubDate>Wed, 08 Mar 2017 02:54:34 GMT</pubDate><description>&lt;p&gt;The RWA model requires fewer training steps than a LSTM model on the tasks I tested (https://arxiv.org/pdf/1703.01253.pdf). Even better, the RWA model uses over 25% fewer parameters (because it doesn&amp;#x27;t have lots of gates like a LSTM model). So the RWA uses less computer memory than a LSTM model. To answer your second question: Yes I do plan on testing it on more challenging problems! I just need enough time and the GPU rig.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — mentioned by jostmey</title><link>https://news.ycombinator.com/item?id=13817452</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.01253:13817452</guid><pubDate>Wed, 08 Mar 2017 02:49:22 GMT</pubDate><description>&lt;p&gt;I will try to update the README. The results are described in the arXiv link. I hope the paper is clear. Here&amp;#x27;s the link: https://arxiv.org/pdf/1703.01253.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Machine Learning on Sequential Data Using a Recurrent Weighted Average — HN submission</title><link>https://news.ycombinator.com/item?id=13802590</link><guid isPermaLink="false">urn:hackerpapers:submission:1703.01253:13802590</guid><pubDate>Mon, 06 Mar 2017 13:51:03 GMT</pubDate><description>&lt;p&gt;New kind of RNN connects every step with recurrent weighted average&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1703.01253/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
