<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2402.03300/</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.03300/feed.xml" rel="self" type="application/rss+xml" /><item><title>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — mentioned by thatsadude</title><link>https://news.ycombinator.com/item?id=49737058</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.03300:49737058</guid><pubDate>Thu, 17 Sep 2026 06:20:04 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/pdf/2402.03300 DeepseekMath was published many months before O1-preview.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — mentioned by nl</title><link>https://news.ycombinator.com/item?id=46701709</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.03300:46701709</guid><pubDate>Wed, 21 Jan 2026 06:03:10 GMT</pubDate><description>&lt;p&gt;Not exactly sure what you are looking for here. That GRPO works? &amp;gt; Group Relative Policy Optimization (GRPO), a variant reinforcement learning (RL) algorithm of Proximal Policy Optimization (PPO) (Schulman et al., 2017). GRPO foregoes the critic model, instead estimating the baseline from group scores, significantly reducing training resources. By solely using a subset of English instruction tuning data, GRPO obtains a substantial improvement over the strong DeepSeekMath-Instruct, including both in-domain (GSM8K: 82.9% → 88.2%, MATH: 46.8% → 51.7%) and out-of-domain mathematical tasks (e.g.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — mentioned by natrys</title><link>https://news.ycombinator.com/item?id=46073970</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.03300:46073970</guid><pubDate>Thu, 27 Nov 2025 23:05:09 GMT</pubDate><description>&lt;p&gt;Well they do that too: https://huggingface.co/deepseek-ai/DeepSeek-Prover-V2-671B But I suppose the bigger goal remains improving their language model, and this was an experimentation born from that. These works are symbiotic; the original DeepSeekMath resulted in GRPO, which eventually formed the backbone of their R1 model: https://arxiv.org/abs/2402.03300&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — mentioned by natrys</title><link>https://news.ycombinator.com/item?id=43980305</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.03300:43980305</guid><pubDate>Wed, 14 May 2025 03:02:31 GMT</pubDate><description>&lt;p&gt;You could maybe make that accusation about V3 (to the extent that it&amp;#x27;s a bad thing and not fair use, specially considering amoral origin of OpenAI&amp;#x27;s models in first place), but don&amp;#x27;t think the claim makes sense for R1 since OpenAI&amp;#x27;s o1 did not expose its CoT traces even in API. They published about GRPO (key algorithm behind R1) a full year before[1] they scaled it for R1. Given the research they do in open, it&amp;#x27;s not far-fetched to think they had the talent and technical know-how to achieve R1 on their own. [1] https://arxiv.org/abs/2402.03300&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — mentioned by layer8</title><link>https://news.ycombinator.com/item?id=43285600</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.03300:43285600</guid><pubDate>Thu, 06 Mar 2025 22:16:24 GMT</pubDate><description>&lt;p&gt;GRPO = Group Relative Policy Optimization https://arxiv.org/abs/2402.03300&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — mentioned by porridgeraisin</title><link>https://news.ycombinator.com/item?id=43198851</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.03300:43198851</guid><pubDate>Thu, 27 Feb 2025 21:45:58 GMT</pubDate><description>&lt;p&gt;It is possible to understand the mechanism once you drop the anthropomorphisms. Each token output by an LLM involves one pass through the next-word predictor neural network. Each pass is a fixed amount of computation. Complexity theory hints to us that the problems which are &amp;quot;hard&amp;quot; for an LLM will need more compute than the ones which are &amp;quot;easy&amp;quot;. Thus, the only mechanism through which an LLM can compute more and solve its &amp;quot;hard&amp;quot; problems is by outputting more tokens. You incentivise it to this end by human-grading its outputs (&amp;quot;RLHF&amp;quot;) to prefer those where it spends time calculating before…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — mentioned by highfrequency</title><link>https://news.ycombinator.com/item?id=42855531</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.03300: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/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=42854785</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.03300:42854785</guid><pubDate>Tue, 28 Jan 2025 17:06:34 GMT</pubDate><description>&lt;p&gt;DeepSeekMath: Pushing Limits of Mathematical Reasoning in Open Language Models&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/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=42831632</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.03300:42831632</guid><pubDate>Sun, 26 Jan 2025 17:09:42 GMT</pubDate><description>&lt;p&gt;DeepSeekMath&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;6 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=39448850</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.03300:39448850</guid><pubDate>Wed, 21 Feb 2024 00:39:33 GMT</pubDate><description>&lt;p&gt;DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open LLMs&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/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=39440443</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.03300:39440443</guid><pubDate>Tue, 20 Feb 2024 12:29:42 GMT</pubDate><description>&lt;p&gt;Pushing the limits of mathematical reasoning in open language models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — mentioned by mdp</title><link>https://news.ycombinator.com/item?id=39276633</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.03300:39276633</guid><pubDate>Tue, 06 Feb 2024 16:46:02 GMT</pubDate><description>&lt;p&gt;Related paper - https://arxiv.org/pdf/2402.03300.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=39276565</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.03300:39276565</guid><pubDate>Tue, 06 Feb 2024 16:41:52 GMT</pubDate><description>&lt;p&gt;Pushing the Limits of Mathematical Reasoning in Open Language Models&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.03300/"&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>DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=39270894</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.03300:39270894</guid><pubDate>Tue, 06 Feb 2024 04:45:22 GMT</pubDate><description>&lt;p&gt;Pushing the Limits of Mathematical Reasoning in Open Language Models&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/2402.03300/"&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>
