<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Neural Data Router: Adaptive Control Flow in Transformers Improves Systematic Generalization · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2110.07732/</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/2110.07732/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Neural Data Router: Adaptive Control Flow in Transformers Improves Systematic Generalization — mentioned by shawntan</title><link>https://news.ycombinator.com/item?id=45512041</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.07732:45512041</guid><pubDate>Wed, 08 Oct 2025 04:23:47 GMT</pubDate><description>&lt;p&gt;I should probably also add: It&amp;#x27;s long been known that Universal / Recursive Transformers are able to solve _simple_ synthetic tasks that vanilla transformers cannot. Just check out the original UT paper, or some of it&amp;#x27;s follow ups: Neural Data Router, https://arxiv.org/abs/2110.07732; Sparse Universal Transformers (SUT), https://arxiv.org/abs/2310.07096. There is even theoretical justification for why: https://arxiv.org/abs/2503.03961 The challenge is actually scaling them up to be useful as LLMs as well (I describe why it&amp;#x27;s a challenge in the SUT paper). It&amp;#x27;s hard to say with the way ARC-AGI…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.07732/"&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>
