← all papers · overview

Limits Of Difficulty Scaling: Hard Samples Yield Diminishing Returns In Grpo-tuned Slms

Abstract

Recent alignment work on Large Language Models (LLMs) suggests preference optimization can improve reasoning by shifting probability mass toward better solutions. We test this claim in a resource-constrained setting by applying GRPO with LoRA to SLMs (up to 3B) for math reasoning on GSM8K and MATH datasets with difficulty-stratified analyses. As problem difficulty increases, accuracy plateaus, rev

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).