mlsanityData to 7 Oct 2026

Revisiting Generalization Across Difficulty Levels: It's Not So Easy

arXiv 2511.21692 ↗First posted 26 Nov 2025cs.CL cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

We investigate how well large language models (LLMs) generalize across different task difficulties, a key question for effective data curation and evaluation. Existing research is mixed regarding whether training on easier or harder data leads to better results, and whether those gains come on easier or harder test data. We address this question by conducting a systematic evaluation of LLMs' generalization across models, datasets, and fine-grained groups of example difficulty. We rank examples in six datasets using the outputs of thousands of different LLMs and Item Response Theory (IRT), a well-established difficulty metric in educational testing. Unlike prior work, our difficulty ratings are therefore determined solely by the abilities of many different LLMs, excluding human opinions of difficulty. With a more objective, larger-scale, and finer-grained analysis, we show that cross-difficulty generalization is often limited; training on either easy or hard data cannot achieve consistent improvements across the full range of difficulties. These results show the importance of having a range of difficulties in both training and evaluation data for LLMs, and that taking shortcuts with respect to difficulty is risky.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 23 of its 39 references that are in the map. First posted on arXiv 26 Nov 2025.

Builds on

23 of 39 references.

References · 23

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  4. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  6. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  7. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,767
  8. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,758
  9. 2025s1: Simple test-time scalingcited by 1,311
  10. 2020Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamicscited by 423
  11. 2022Complexity-Based Prompting for Multi-Step Reasoningcited by 387
  12. 2021Understanding Dataset Difficulty with V-Usable Informationcited by 288
11 more
  1. 2020Information-Theoretic Probing with Minimum Description Lengthcited by 230
  2. 2023MuSR: Testing the Limits of Chain-of-thought with Multistep Soft Reasoningcited by 195
  3. 2024Easy-to-Hard Generalization: Scalable Alignment Beyond Human Supervisioncited by 95
  4. 2024The Unreasonable Effectiveness of Easy Training Data for Hard Taskscited by 40
  5. 2025Self-Improving Transformers Overcome Easy-to-Hard and Length Generalization Challengescited by 30
  6. 2021Rissanen Data Analysis: Examining Dataset Characteristics via Description Lengthcited by 22
  7. 2022py-irt: A Scalable Item Response Theory Library for Pythoncited by 19
  8. 2022ILDAE: Instance-Level Difficulty Analysis of Evaluation Datacited by 17
  9. 2025Hard Examples Are All You Need: Maximizing GRPO Post-Training Under Annotation Budgetscited by 16
  10. 2024Take the Bull by the Horns: Hard Sample-Reweighted Continual Training Improves LLM Generalizationcited by 12
  11. 2024Can Large Language Models Always Solve Easy Problems if They Can Solve Harder Ones?cited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 5.

5 papers.