REVIEW 7 cited by
Phi-4-Mini-Reasoning: Exploring the Limits of Small Reasoning Language Models in Math
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Chain-of-Thought (CoT) significantly enhances formal reasoning capabilities in Large Language Models (LLMs) by training them to explicitly generate intermediate reasoning steps. While LLMs readily benefit from such techniques, improving reasoning in Small Language Models (SLMs) remains challenging due to their limited model capacity. Recent work by Deepseek-R1 demonstrates that distillation from LLM-generated synthetic data can substantially improve the reasoning ability of SLM. However, the detailed modeling recipe is not disclosed. In this work, we present a systematic training recipe for SLMs that consists of four steps: (1) large-scale mid-training on diverse distilled long-CoT data, (2) supervised fine-tuning on high-quality long-CoT data, (3) Rollout DPO leveraging a carefully curated preference dataset, and (4) Reinforcement Learning (RL) with Verifiable Reward. We apply our method on Phi-4-Mini, a compact 3.8B-parameter model. The resulting Phi-4-Mini-Reasoning model exceeds, on math reasoning tasks, much larger reasoning models, e.g., outperforming DeepSeek-R1-Distill-Qwen-7B by 3.2 points and DeepSeek-R1-Distill-Llama-8B by 7.7 points on Math-500. Our results validate that a carefully designed training recipe, with large-scale high-quality CoT data, is effective to unlock strong reasoning capabilities even in resource-constrained small models.
Forward citations
Cited by 7 Pith papers
-
DICE: Diffusion Large Language Models Excel at Generating CUDA Kernels
DICE, a family of diffusion LLMs trained with a bi-phase infilling-to-generation RL curriculum, achieves state-of-the-art CUDA kernel generation at data and token budgets far below prior specialized autoregressive models.
-
Reasoning Up the Instruction Ladder for Controllable Language Models
RLVR on ~7K verifiable system/user conflict examples teaches LLMs to prioritize higher-priority instructions, improving instruction-hierarchy and safety benchmarks.
-
Dissecting Clinical Reasoning in Language Models: A Comparative Study of Prompts and Model Adaptation Strategies
Prompt structure and LoRA adaptation both strongly affect F1 on NLI4CT clinical NLI, but the claimed consistent +8 to 12 point LoRA gains and over 97% validity are not supported by the reported per-configuration results.
-
VeriThinker: Learning to Verify Makes Reasoning Model Efficient
VeriThinker shows that fine-tuning a reasoning model only on a solution-verification task reduces chain-of-thought length on MATH500 and AIME by 20-45% while preserving or slightly improving accuracy.
-
Efficient Reasoning on the Edge
LoRA adapters, budget-forced GRPO, dynamic switching, parallel verification and FPTQuant enable practical chain-of-thought reasoning on quantized Qwen2.5-7B for edge devices.
-
Energy Use of AI Inference, Efficiency Pathways, and Test-Time Scaling
Bottom-up estimates give a median of 0.34 Wh per query for frontier LLMs on H100 hardware, rising 13x with test-time scaling, while combined efficiency gains could cut energy 8-20x.
-
Schema Lineage Extraction at Scale: Multilingual Pipelines, Composite Evaluation, and Language-Model Benchmarks
A new benchmark and composite metric for multilingual schema lineage extraction, with evidence that a 32B open model under chain-of-thought prompting approaches GPT-level accuracy.
Discussion (0). Continue with ORCID to comment.