<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Saturated Transformers are Constant-Depth Threshold Circuits · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2106.16213/</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/2106.16213/feed.xml" rel="self" type="application/rss+xml" /><item><title>Saturated Transformers are Constant-Depth Threshold Circuits — mentioned by bmc7505</title><link>https://news.ycombinator.com/item?id=36371201</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.16213:36371201</guid><pubDate>Sat, 17 Jun 2023 15:44:53 GMT</pubDate><description>&lt;p&gt;The current generation of LLMs will never generalize on problems whose expected complexity is significantly harder than the training set. One way to think of why this is the case is because transformers are learning shortcuts to multistep reasoning tasks [1, 2], but do not learn to reason systematically and unsurprisingly fail to generalize when presented with more challenging tasks. The proper way to evaluate systematic reasoning is by training on a curriculum of problems of increasing average-case complexity. Think random k-SAT in the critical region, bisimulation games, or interpolation in…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.16213/"&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>Saturated Transformers are Constant-Depth Threshold Circuits — mentioned by shawntan</title><link>https://news.ycombinator.com/item?id=35610361</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.16213:35610361</guid><pubDate>Tue, 18 Apr 2023 05:41:13 GMT</pubDate><description>&lt;p&gt;There&amp;#x27;s more detailed examination of Transformers from circuit complexity in this paper: https://arxiv.org/abs/2106.16213 There are a few references also in the blog post.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.16213/"&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>
