<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Universal Transformers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1807.03819/</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/1807.03819/feed.xml" rel="self" type="application/rss+xml" /><item><title>Universal Transformers — mentioned by omneity</title><link>https://news.ycombinator.com/item?id=46364942</link><guid isPermaLink="false">urn:hackerpapers:mention:1807.03819:46364942</guid><pubDate>Tue, 23 Dec 2025 12:51:46 GMT</pubDate><description>&lt;p&gt;Thanks, this was helpful! Reading the seminal paper[0] on Universal Transformers also gave some insights: &amp;gt; UTs combine the parallelizability and global receptive field of feed-forward sequence models like the Transformer with the recurrent inductive bias of RNNs. Very interesting, it seems to be an “old” architecture that is only now being leveraged to a promising extent. Curious what made it an active area (with the works of Samsung and Sapient and now this one), perhaps diminishing returns on regular transformers? 0: https://arxiv.org/abs/1807.03819&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1807.03819/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Universal Transformers — mentioned by atrudeau</title><link>https://news.ycombinator.com/item?id=45517307</link><guid isPermaLink="false">urn:hackerpapers:mention:1807.03819:45517307</guid><pubDate>Wed, 08 Oct 2025 15:33:34 GMT</pubDate><description>&lt;p&gt;Very cool to see the effectiveness of recurrence on ARC. For those interested in recurrence, here are other works that leverage a similar approach for other types of problems: Language modeling: Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach https://arxiv.org/pdf/2502.05171 Puzzle solving: A Simple Loss Function for Convergent Algorithm Synthesis using RNNs https://openreview.net/pdf?id=WaAJ883AqiY End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking https://arxiv.org/abs/2202.05826 Can You Learn an Algorithm?…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1807.03819/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Universal Transformers — mentioned by shawntan</title><link>https://news.ycombinator.com/item?id=45508175</link><guid isPermaLink="false">urn:hackerpapers:mention:1807.03819:45508175</guid><pubDate>Tue, 07 Oct 2025 20:08:31 GMT</pubDate><description>&lt;p&gt;Right. There should really be a vanilla Transformer baseline. With recurrence: The idea has been around: https://arxiv.org/abs/1807.03819 There are reasons why it hasn&amp;#x27;t really been picked up at scale, and the method tends to do well on synthetic tasks.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1807.03819/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Universal Transformers — mentioned by ed</title><link>https://news.ycombinator.com/item?id=44927879</link><guid isPermaLink="false">urn:hackerpapers:mention:1807.03819:44927879</guid><pubDate>Sun, 17 Aug 2025 00:10:15 GMT</pubDate><description>&lt;p&gt;TL;DR the “high” “low” level modules don’t matter much, and the rest of the architecture is similar to Universal Transformers https://arxiv.org/abs/1807.03819&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1807.03819/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Universal Transformers — mentioned by lucidrains</title><link>https://news.ycombinator.com/item?id=23891532</link><guid isPermaLink="false">urn:hackerpapers:mention:1807.03819:23891532</guid><pubDate>Sun, 19 Jul 2020 19:00:26 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/1807.03819&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1807.03819/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Universal Transformers — mentioned by kuu</title><link>https://news.ycombinator.com/item?id=20983526</link><guid isPermaLink="false">urn:hackerpapers:mention:1807.03819:20983526</guid><pubDate>Mon, 16 Sep 2019 12:55:14 GMT</pubDate><description>&lt;p&gt;In case you find Attention (and specially transformers) interesting I have some saved links introducing the topic: http://www.peterbloem.nl/blog/transformers https://nostalgebraist.tumblr.com/post/185326092369/the-tran... https://papers.nips.cc/paper/7181-attention-is-all-you-need.... http://jalammar.github.io/illustrated-transformer/ https://arxiv.org/pdf/1807.03819.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1807.03819/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Universal Transformers — mentioned by solomatov</title><link>https://news.ycombinator.com/item?id=18423066</link><guid isPermaLink="false">urn:hackerpapers:mention:1807.03819:18423066</guid><pubDate>Sat, 10 Nov 2018 19:37:37 GMT</pubDate><description>&lt;p&gt;- Neural turing machines: https://arxiv.org/abs/1410.5401 - Universal transformers: https://arxiv.org/abs/1807.03819 These are just 2 of most well known.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1807.03819/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
