paper-with-me

Papers

DeepMath-103K: A Large-Scale, Challenging, Decontaminated, and Verifiable Mathematical Dataset for Advancing Reasoning

2025-04-15 · Zhiwei He, Tian Liang, Jiahao Xu, Qiuzhi Liu, Xingyu Chen, Yue Wang, Linfeng Song, Dian Yu, Zhenwen Liang, Wenxuan Wang, Zhuosheng Zhang, Rui Wang, Zhaopeng Tu, Haitao Mi, Dong Yu

The capacity for complex mathematical reasoning is a key benchmark for artificial intelligence. While reinforcement learning (RL) applied to LLMs shows promise, progress is significantly hindered by the lack of large-scale training data that is sufficiently challenging, possesses verifiable answer formats suitable for RL, and is free from contamination with evaluation benchmarks. To address these limitations, we introduce DeepMath-103K, a new, large-scale dataset comprising approximately 103K mathematical problems, specifically designed to train advanced reasoning models via RL. DeepMath-103K is curated through a rigorous pipeline involving source analysis, stringent decontamination against numerous benchmarks, and filtering for high difficulty (primarily Levels 5-9), significantly exceeding existing open resources in challenge. Each problem includes a verifiable final answer, enabling rule-based RL, and three distinct R1-generated solutions suitable for diverse training paradigms like supervised fine-tuning or distillation. Spanning a wide range of mathematical topics, DeepMath-103K promotes the development of generalizable reasoning. We demonstrate that models trained on DeepMath-103K achieve significant improvements on challenging mathematical benchmarks, validating its effectiveness. We release DeepMath-103K publicly to facilitate community progress in building more capable AI reasoning systems: https://github.com/zwhe99/DeepMath.

📄 PDF Abstract BibTeX arXiv:2504.11456

Code (1)

zwhe99/deepmath 공식 구현 pytorch

Tasks

Mathematical ReasoningReinforcement Learning (RL)

Similar Papers 제목 키워드 기반

DeepMath - Deep Sequence Models for Premise Selection

2016-06-14 · NeurIPS 2016 12 · Alex A. Alemi, Francois Chollet, Niklas Een, Geoffrey Irving 외

We study the effectiveness of neural sequence models for premise selection in automated theorem proving, one of the main bottlenecks in the formalization of mathematics. We propose a two stage approach for this task that…

Automated Theorem Proving

Aletheia: What Makes RLVR For Code Verifiers Tick?

2026-01-17 · Vatsal Venkatkrishna, Indraneil Paul, Iryna Gurevych arxiv

Multi-domain thinking verifiers trained via Reinforcement Learning with Verifiable Rewards (RLVR) are a cornerstone of modern post-training. However, their adoption in code generation has lagged behind that of execution …

Reinforcement LearningCode Generation

DeepMath-Creative: A Benchmark for Evaluating Mathematical Creativity of Large Language Models

2025-05-13 · Xiaoyang Chen, Xinan Dai, Yu Du, Qian Feng 외

To advance the mathematical proficiency of large language models (LLMs), the DeepMath team has launched an open-source initiative aimed at developing an open mathematical LLM and systematically evaluating its mathematica…

GanitLLM: Difficulty-Aware Bengali Mathematical Reasoning through Curriculum-GRPO

2026-01-11 · Shubhashis Roy Dipta, Khairul Mahbub, Nadia Najjar arxiv

We present a Bengali mathematical reasoning model called GanitLLM (named after the Bangla word for mathematics, Ganit), together with a new difficulty-aware Bengali math corpus and a curriculum-based GRPO pipeline. Benga…

Reinforcement LearningMathematical Reasoning

Agon: Competitive Cross-Model RL with Implicit Rival Grading of Reasoning

2026-07-08 · Vladislav Beliaev arxiv

Reinforcement learning from verifiable rewards (e.g. GRPO) is the engine behind today's reasoning models, yet it grades only the final answer. On hard problems this trains models to write more rather than to think better…

Reinforcement Learning