<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Beyond Binary Rewards: Training LMs to Reason About Their Uncertainty · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2507.16806/</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/2507.16806/feed.xml" rel="self" type="application/rss+xml" /><item><title>Beyond Binary Rewards: Training LMs to Reason About Their Uncertainty — mentioned by memhuilong</title><link>https://news.ycombinator.com/item?id=50204715</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.16806:50204715</guid><pubDate>Fri, 23 Oct 2026 05:05:44 GMT</pubDate><description>&lt;p&gt;The correctness term matters here, especially once training can change the answer as well as its confidence. If an answer is correct with probability p and reports q, the expected RLCR reward is p^2 - (q-p)^2. At q=p, the reward is p^2, so a more accurate answer still pays. With only the negative Brier loss, the optimum would instead be -p(1-p): being reliably wrong and reporting zero confidence would score just as well as being reliably right. The joint objective avoids that trap. Section 3 of the paper discusses this distinction: https://arxiv.org/html/2507.16806v2#S3 That describes the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.16806/"&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>Beyond Binary Rewards: Training LMs to Reason About Their Uncertainty — mentioned by danielmarkbruce</title><link>https://news.ycombinator.com/item?id=49802964</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.16806:49802964</guid><pubDate>Tue, 22 Sep 2026 15:31:23 GMT</pubDate><description>&lt;p&gt;No, you don&amp;#x27;t. You do RLCR, similar to that proposed here: https://arxiv.org/pdf/2507.16806&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.16806/"&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>
