<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Probabilistic Inference in Language Models via Twisted Sequential Monte Carlo · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2404.17546/</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/2404.17546/feed.xml" rel="self" type="application/rss+xml" /><item><title>Probabilistic Inference in Language Models via Twisted Sequential Monte Carlo — mentioned by activatedgeek</title><link>https://news.ycombinator.com/item?id=42921027</link><guid isPermaLink="false">urn:hackerpapers:mention:2404.17546:42921027</guid><pubDate>Mon, 03 Feb 2025 18:09:15 GMT</pubDate><description>&lt;p&gt;That has been my understanding too. More generally, a verifier at the end certainly helps. In our paper [1], we find that asking a follow up question like &amp;quot;Is the answer correct?&amp;quot; and taking the normalized probability of &amp;quot;Yes&amp;quot; or &amp;quot;No&amp;quot; token (or more generally any such token trained for) seems to be best bet so far to get well-calibrated probabilities out of the model. In general, the log-probability of tokens is not a good indicator of anything other than satisfying the pre-training loss function of predicting the &amp;quot;next token.&amp;quot; (it likely is very well-calibrated on that task though) Semantics…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2404.17546/"&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>
