<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Markovian Thinker: Architecture-Agnostic Linear Scaling of Reasoning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2510.06557/</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/2510.06557/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Markovian Thinker: Architecture-Agnostic Linear Scaling of Reasoning — mentioned by sva_</title><link>https://news.ycombinator.com/item?id=48049005</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.06557:48049005</guid><pubDate>Thu, 07 May 2026 13:11:46 GMT</pubDate><description>&lt;p&gt;So at the heart of this architecture is what they call &amp;#x27;Markovian RSA&amp;#x27;, a combination of two papers RSA[0], which generates a certain amount of reasoning traces for a prompt; and the &amp;#x27;Markovian Thinker&amp;#x27;[1] which seems to basically cut the end of those traces to keep context at a reasonable length. I feel like there&amp;#x27;s potential to improve that part of just cutting a tunable amount (τ) of tokens off the tail end of those traces, because you may potentially lose valuable insight earlier in the trace? They did train the model (in SFT) to put the relevant information into the tail (τ) of the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.06557/"&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>
