Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.21692 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914171997650944 |
|---|---|
| author | Kordi, Yeganeh Nayak, Nihal V. Zuo, Max Nguyen, Ilana Bach, Stephen H. |
| author_facet | Kordi, Yeganeh Nayak, Nihal V. Zuo, Max Nguyen, Ilana Bach, Stephen H. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_21692 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Revisiting Generalization Across Difficulty Levels: It's Not So Easy Kordi, Yeganeh Nayak, Nihal V. Zuo, Max Nguyen, Ilana Bach, Stephen H. Computation and Language Artificial Intelligence 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. |
| title | Revisiting Generalization Across Difficulty Levels: It's Not So Easy |
| topic | Computation and Language Artificial Intelligence |
| url | https://arxiv.org/abs/2511.21692 |