<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Thought Anchors: Which LLM Reasoning Steps Matter? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2506.19143/</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/2506.19143/feed.xml" rel="self" type="application/rss+xml" /><item><title>Thought Anchors: Which LLM Reasoning Steps Matter? — mentioned by krackers</title><link>https://news.ycombinator.com/item?id=44475057</link><guid isPermaLink="false">urn:hackerpapers:mention:2506.19143:44475057</guid><pubDate>Sat, 05 Jul 2025 19:49:20 GMT</pubDate><description>&lt;p&gt;There are several such papers, off the top of my head one is https://arxiv.org/abs/2404.15758 It&amp;#x27;s a bit more subtle though, if I understand correctly this only works for parallelizable problems. Which makes intuitive sense since the model cannot pass information along with each dot. So in that sense COT can be seen as some form of sampling, which also tracks with findings that COT doesn&amp;#x27;t boost the &amp;quot;raw intelligence&amp;quot; but rather uncovers latent intelligence, converting pass@k to maj@k. Antirez touches upon this in [1]. On the other hand, I think problems with serial dependencies require…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2506.19143/"&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>Thought Anchors: Which LLM Reasoning Steps Matter? — HN submission</title><link>https://news.ycombinator.com/item?id=44381834</link><guid isPermaLink="false">urn:hackerpapers:submission:2506.19143:44381834</guid><pubDate>Wed, 25 Jun 2025 21:06:00 GMT</pubDate><description>&lt;p&gt;Thought Anchors: Which LLM Reasoning Steps Matter?&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/2506.19143/"&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>
