<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Curse of Depth in Large Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2502.05795/</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/2502.05795/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Curse of Depth in Large Language Models — mentioned by imranq</title><link>https://news.ycombinator.com/item?id=47328151</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.05795:47328151</guid><pubDate>Tue, 10 Mar 2026 20:05:48 GMT</pubDate><description>&lt;p&gt;Amazing write up and i wish more people showed the process for discovery which is often even more interesting than the result itself Still the result is really interesting being able to stack abstract reasoning and get better performance and the heat maps to show the prob results The academic literature seems to be catching up: - *[SOLAR / DUS (Kim et al., 2023)](https://arxiv.org/abs/2312.15166)* — duplicated transformer layers to build a 10.7B model that outperformed 30B parameter baselines. - *[The Curse of Depth (2025)](https://arxiv.org/abs/2502.05795)* — explains why this works: Pre-LN…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.05795/"&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>The Curse of Depth in Large Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=43432182</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05795:43432182</guid><pubDate>Fri, 21 Mar 2025 05:49:48 GMT</pubDate><description>&lt;p&gt;The Curse of Depth in Large Language Models&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/2502.05795/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>The Curse of Depth in Large Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=43090350</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05795:43090350</guid><pubDate>Tue, 18 Feb 2025 15:08:24 GMT</pubDate><description>&lt;p&gt;The Curse of Depth in Large Language Models&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/2502.05795/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>The Curse of Depth in Large Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=43031298</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05795:43031298</guid><pubDate>Thu, 13 Feb 2025 00:15:24 GMT</pubDate><description>&lt;p&gt;The Curse of Depth in Large Language Models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2502.05795/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>The Curse of Depth in Large Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=43016968</link><guid isPermaLink="false">urn:hackerpapers:submission:2502.05795:43016968</guid><pubDate>Tue, 11 Feb 2025 19:12:07 GMT</pubDate><description>&lt;p&gt;The Curse of Depth in Large Language Models [pdf]&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/2502.05795/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
