<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Let's Verify Step by Step · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.20050/</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/2305.20050/feed.xml" rel="self" type="application/rss+xml" /><item><title>Let's Verify Step by Step — mentioned by dilyevsky</title><link>https://news.ycombinator.com/item?id=49730801</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.20050:49730801</guid><pubDate>Wed, 16 Sep 2026 18:11:32 GMT</pubDate><description>&lt;p&gt;there is a number of different methods. One is a separate model/classifier trained with human annotation. Here&amp;#x27;s a paper by OAI: https://arxiv.org/abs/2305.20050&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&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>Let's Verify Step by Step — mentioned by highfrequency</title><link>https://news.ycombinator.com/item?id=42855531</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.20050:42855531</guid><pubDate>Tue, 28 Jan 2025 17:53:40 GMT</pubDate><description>&lt;p&gt;First graph tells the story - below a certain model size (500m params), reinforcement learning is close to useless. Above this (task-dependent) model size threshold, reinforcement learning basically works. I suspect this is what we saw play out with math/coding reasoning models - until recently, the base models were not good enough for ~random output search to hit on a correct path with any reasonable frequency. Below this threshold of base model intelligence, the only efficient way forward was to collect plain supervised data (either through human labeled math problem solutions [1] or…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&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>Let's Verify Step by Step — HN submission</title><link>https://news.ycombinator.com/item?id=41527570</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.20050:41527570</guid><pubDate>Fri, 13 Sep 2024 02:30:53 GMT</pubDate><description>&lt;p&gt;Let&amp;#x27;s Verify Step by Step&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Let's Verify Step by Step — mentioned by llmfan</title><link>https://news.ycombinator.com/item?id=41412608</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.20050:41412608</guid><pubDate>Sat, 31 Aug 2024 22:44:32 GMT</pubDate><description>&lt;p&gt;&amp;quot;just a regular LLM except [trained on very different data].&amp;quot; I&amp;#x27;m not saying there&amp;#x27;s some big moat, anyone can read https://arxiv.org/pdf/2305.20050, but not all synthetic data is created equal. Strawberry I&amp;#x27;m sure generates beautiful, valid chain-of-thought reasoning data. Wouldn&amp;#x27;t surprise me if OpenAI is just significantly ahead of the competition.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&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>Let's Verify Step by Step — HN submission</title><link>https://news.ycombinator.com/item?id=41402738</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.20050:41402738</guid><pubDate>Fri, 30 Aug 2024 17:21:02 GMT</pubDate><description>&lt;p&gt;Let&amp;#x27;s Verify Step by Step&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Let's Verify Step by Step — HN submission</title><link>https://news.ycombinator.com/item?id=41390341</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.20050:41390341</guid><pubDate>Thu, 29 Aug 2024 12:57:54 GMT</pubDate><description>&lt;p&gt;Let&amp;#x27;s Verify Step by Step&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 2 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Let's Verify Step by Step — mentioned by rvz</title><link>https://news.ycombinator.com/item?id=38432056</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.20050:38432056</guid><pubDate>Mon, 27 Nov 2023 13:31:02 GMT</pubDate><description>&lt;p&gt;Great, a worthy competition which being first and correctness completely matter and may the best AI model win. Hopefully DeepMind doesn’t enter otherwise they would smoke everyone else other than OpenAI. Speaking of which, I’ll give you a 1% chance of winning with this paper from OpenAI: [0] with the MATH dataset: [1] EDIT: Why the downvotes? I&amp;#x27;m trying to help you here and give you a starting point to win the competition? What&amp;#x27;s wrong with helping others? [0] https://arxiv.org/abs/2305.20050 [1] https://github.com/hendrycks/math&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&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>Let's Verify Step by Step — mentioned by ratg13</title><link>https://news.ycombinator.com/item?id=38410940</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.20050:38410940</guid><pubDate>Sat, 25 Nov 2023 03:31:19 GMT</pubDate><description>&lt;p&gt;This is the one you want https://arxiv.org/pdf/2305.20050.pdf It’s different from the link the other user posted. This one is specifically about the Q* process&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&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>Let's Verify Step by Step — HN submission</title><link>https://news.ycombinator.com/item?id=36183532</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.20050:36183532</guid><pubDate>Sun, 04 Jun 2023 06:27:24 GMT</pubDate><description>&lt;p&gt;Let&amp;#x27;s Verify Step by Step&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Let's Verify Step by Step — HN submission</title><link>https://news.ycombinator.com/item?id=36175553</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.20050:36175553</guid><pubDate>Sat, 03 Jun 2023 11:01:38 GMT</pubDate><description>&lt;p&gt;OpenAI: How to Train Reasoning in LLMs&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.20050/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
