<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Using Fast Weights to Attend to the Recent Past · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1610.06258/</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/1610.06258/feed.xml" rel="self" type="application/rss+xml" /><item><title>Using Fast Weights to Attend to the Recent Past — mentioned by albertzeyer</title><link>https://news.ycombinator.com/item?id=23414268</link><guid isPermaLink="false">urn:hackerpapers:mention:1610.06258:23414268</guid><pubDate>Thu, 04 Jun 2020 08:54:28 GMT</pubDate><description>&lt;p&gt;For updating its own weights, there is the idea of fast weights (https://arxiv.org/abs/1610.06258). This idea of updating its own weights is not new. Schmidhuber has done some work on this (http://people.idsia.ch/~juergen/deep-learning-miraculous-yea...). The main idea is also that the model can modify even itself (so not having two separate nets) (see Schmidhuber, &amp;quot;Steps towards `self-referential&amp;#x27; learning&amp;quot;). Online learning / continual learning is yet another (orthogonal) topic. This is the setting where new (training) data becomes available all the time, and the model should use that data…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1610.06258/"&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>Using Fast Weights to Attend to the Recent Past — HN submission</title><link>https://news.ycombinator.com/item?id=14243569</link><guid isPermaLink="false">urn:hackerpapers:submission:1610.06258:14243569</guid><pubDate>Tue, 02 May 2017 02:39:50 GMT</pubDate><description>&lt;p&gt;Using Fast Weights to Attend to the Recent Past&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/1610.06258/"&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>Using Fast Weights to Attend to the Recent Past — HN submission</title><link>https://news.ycombinator.com/item?id=12787637</link><guid isPermaLink="false">urn:hackerpapers:submission:1610.06258:12787637</guid><pubDate>Tue, 25 Oct 2016 13:13:20 GMT</pubDate><description>&lt;p&gt;Using Fast Weights to Attend to the Recent 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/1610.06258/"&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>
