{"work":{"id":"da7fe877-735e-4436-9e53-837121a0b2d0","openalex_id":"https://openalex.org/W4391766676","doi":"10.48550/arxiv.2402.06332","arxiv_id":"2402.06332","raw_key":null,"title":"InternLM-Math: Open Math Large Language Models Toward Verifiable Reasoning","authors":null,"authors_text":"H","year":2024,"venue":"cs.CL","abstract":"The math abilities of large language models can represent their abstract reasoning ability. In this paper, we introduce and open-source our math reasoning LLMs InternLM-Math which is continue pre-trained from InternLM2. We unify chain-of-thought reasoning, reward modeling, formal reasoning, data augmentation, and code interpreter in a unified seq2seq format and supervise our model to be a versatile math reasoner, verifier, prover, and augmenter. These abilities can be used to develop the next math LLMs or self-iteration. InternLM-Math obtains open-sourced state-of-the-art performance under the setting of in-context learning, supervised fine-tuning, and code-assisted reasoning in various informal and formal benchmarks including GSM8K, MATH, Hungary math exam, MathBench-ZH, and MiniF2F. Our pre-trained model achieves 30.3 on the MiniF2F test set without fine-tuning. We further explore how to use LEAN to solve math problems and study its performance under the setting of multi-task learning which shows the possibility of using LEAN as a unified platform for solving and proving in math. Our models, codes, and data are released at \\url{https://github.com/InternLM/InternLM-Math}.","external_url":"https://arxiv.org/abs/2402.06332","cited_by_count":3,"metadata_source":"pith","metadata_fetched_at":"2026-08-05T02:28:24.338817+00:00","pith_arxiv_id":"2402.06332","created_at":"2026-05-13T07:37:29.884200+00:00","updated_at":"2026-08-05T02:28:24.338817+00:00","title_quality_ok":true,"display_title":"Internlm-math: Open math large language models toward verifiable reasoning","render_title":"Internlm-math: Open math large language models toward verifiable reasoning"},"hub":{"state":{"work_id":"da7fe877-735e-4436-9e53-837121a0b2d0","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":12,"external_cited_by_count":null,"distinct_field_count":4,"first_pith_cited_at":"2024-06-26T17:43:06+00:00","last_pith_cited_at":"2026-06-09T21:59:37+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-30T13:19:57.003748+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":2}],"polarity_counts":[{"context_polarity":"background","n":2}],"runs":{},"summary":{},"graph":{},"authors":[]}}