<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Scalable Power Sampling: Unlocking Efficient, Training-Free Reasoning for LLMs via Distribution Sharpening · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2601.21590/</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/2601.21590/feed.xml" rel="self" type="application/rss+xml" /><item><title>Scalable Power Sampling: Unlocking Efficient, Training-Free Reasoning for LLMs via Distribution Sharpening — mentioned by verdverm</title><link>https://news.ycombinator.com/item?id=46843308</link><guid isPermaLink="false">urn:hackerpapers:mention:2601.21590:46843308</guid><pubDate>Sun, 01 Feb 2026 03:17:14 GMT</pubDate><description>&lt;p&gt;Submission title matches the paper linked in the blog post: https://www.arxiv.org/abs/2601.21590 Submitted the blog post because it has the more digestible and intuitive explanations&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2601.21590/"&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>
