<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Chain-of-Thought Reasoning Without Prompting · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2402.10200/</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/2402.10200/feed.xml" rel="self" type="application/rss+xml" /><item><title>Chain-of-Thought Reasoning Without Prompting — mentioned by activatedgeek</title><link>https://news.ycombinator.com/item?id=42921027</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.10200: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/2402.10200/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Chain-of-Thought Reasoning Without Prompting — HN submission</title><link>https://news.ycombinator.com/item?id=41633241</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.10200:41633241</guid><pubDate>Tue, 24 Sep 2024 05:06:37 GMT</pubDate><description>&lt;p&gt;Cot Decoding – Eliciting Reasoning from LLMs&lt;/p&gt;&lt;p&gt;A recent talk (https://dennyzhou.github.io/LLM-Reasoning-Berkeley.pdf) from Denny Zhou covered a number of techniques that improve LLM reasoning. In the talk he a recent paper from Google Deepmind on &amp;quot;Chain-of-Thought Reasoning without Prompting&amp;quot; (https://arxiv.org/abs/2402.10200). The key idea in the paper is that existing models are capable of doing CoT style step-by-step reasoning via a new decoding strategy. I implemented their approach in optillm - https://github.com/codelion/optillm/blob/main/optillm/cot_decoding.py as I couldn&amp;#x27;t find any decent open-source implementation. I have also…&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.10200/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Chain-of-Thought Reasoning Without Prompting — mentioned by activatedgeek</title><link>https://news.ycombinator.com/item?id=39792608</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.10200:39792608</guid><pubDate>Fri, 22 Mar 2024 16:58:32 GMT</pubDate><description>&lt;p&gt;I hesitate to the use description as &amp;quot;think,&amp;quot; just biasing correlations for subsequent generations. In any case, there is at least one work that shows that CoT may not be necessary and biasing the decoding path via logit probabilities is also promising. [1] One could argue it still doesn&amp;#x27;t contradict the benefits of CoT, but I suspect there is nothing fundamental about CoT, except that we happened to have been pre-training on sequences that use certain prompts that were easy to conceive from a human&amp;#x27;s perspective. [1]: https://arxiv.org/abs/2402.10200&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.10200/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Chain-of-Thought Reasoning Without Prompting — mentioned by XenophileJKO</title><link>https://news.ycombinator.com/item?id=39661716</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.10200:39661716</guid><pubDate>Sun, 10 Mar 2024 19:14:29 GMT</pubDate><description>&lt;p&gt;Actually you can get a very good proxy by looking at the probability distrobution of the &amp;quot;answer&amp;quot; tokens. The key here is you have to be able to identify the &amp;quot;answer&amp;quot; tokens. https://arxiv.org/abs/2402.10200&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.10200/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Chain-of-Thought Reasoning Without Prompting — HN submission</title><link>https://news.ycombinator.com/item?id=39410669</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.10200:39410669</guid><pubDate>Sat, 17 Feb 2024 16:06:40 GMT</pubDate><description>&lt;p&gt;Chain-of-Thought Reasoning Without Prompting&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;94 points; 25 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.10200/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
