<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2503.03961/</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/2503.03961/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers — mentioned by shawntan</title><link>https://news.ycombinator.com/item?id=49630418</link><guid isPermaLink="false">urn:hackerpapers:mention:2503.03961:49630418</guid><pubDate>Wed, 09 Sep 2026 17:49:05 GMT</pubDate><description>&lt;p&gt;For the research focused, there are some references in my blogpost here on what kinds of computational problems minimally require how much CoT to solve: https://blog.wtf.sg/posts/2023-02-03-the-new-xor-problem/ Notably Will Merrill&amp;#x27;s work: https://arxiv.org/abs/2310.07923 As for how universal transformers (looping transformers, but everyone has since forgotten prior work) will affect this, Will Merrill (again) has a paper here (https://arxiv.org/abs/2503.03961) that discusses exactly this. The original universal transformers is called &amp;quot;universal&amp;quot; because if you allow for per-token looping…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2503.03961/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers — mentioned by shawntan</title><link>https://news.ycombinator.com/item?id=45512041</link><guid isPermaLink="false">urn:hackerpapers:mention:2503.03961: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/2503.03961/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers — mentioned by NitpickLawyer</title><link>https://news.ycombinator.com/item?id=44902221</link><guid isPermaLink="false">urn:hackerpapers:mention:2503.03961:44902221</guid><pubDate>Thu, 14 Aug 2025 16:13:17 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s prior research that finds a connection between model depth and &amp;quot;reasoning&amp;quot; ability - https://arxiv.org/abs/2503.03961 A depth of 4 is very small. It is very much a toy model. It&amp;#x27;s ok to research this, and maybe someone will try it out on larger models, but it&amp;#x27;s totally not ok to lead with the conclusion, based on this toy model, IMO.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2503.03961/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=44874250</link><guid isPermaLink="false">urn:hackerpapers:mention:2503.03961:44874250</guid><pubDate>Tue, 12 Aug 2025 09:41:26 GMT</pubDate><description>&lt;p&gt;The extrapolation doesn&amp;#x27;t work if the transformer is too shallow (too few layers) relative to sequence length, because of https://arxiv.org/abs/2503.03961 . A bunch of tasks become unfeasible when the layer count is too low, and 4 layers is way too low. I.e. linearly increasing the number of layers in a model can result in a superlinear increase in performance on tasks like reasoning.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2503.03961/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=44367776</link><guid isPermaLink="false">urn:hackerpapers:mention:2503.03961:44367776</guid><pubDate>Tue, 24 Jun 2025 16:14:45 GMT</pubDate><description>&lt;p&gt;We can be sure via analysis based on computational theory, e.g. https://arxiv.org/abs/2503.03961 and https://arxiv.org/abs/2310.07923 . This lets us know what classes of problems a model is able to solve, and sufficiently deep transformers with chain of thought have been shown to be theoretically capable of solving a very large class of problems.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2503.03961/"&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>
