paper-with-me

홈 › Papers

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

2025-11-26 · Yeganeh Kordi, Nihal V. Nayak, Max Zuo, Ilana Nguyen, Stephen H. Bach 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.

📄 PDF Abstract BibTeX arXiv:2511.21692

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Easy2Hard-Bench: Standardized Difficulty Labels for Profiling LLM Performance and Generalization

2024-09-27 · Mucong Ding, ChengHao Deng, Jocelyn Choo, Zichu Wu 외

While generalization over tasks from easy to hard is crucial to profile language models (LLMs), the datasets with fine-grained difficulty annotations for each problem across a broad range of complexity are still blank. A…

Project Patti: Why can You Solve Diabolical Puzzles on one Sudoku Website but not Easy Puzzles on another Sudoku Website?

2025-07-22 · Arman Eisenkolb-Vaithyanathan arxiv

In this paper we try to answer the question "What constitutes Sudoku difficulty rating across different Sudoku websites?" Using two distinct methods that can both solve every Sudoku puzzle, I propose two new metrics to c…

Confidence Calibration in Large Language Models

2026-04-03 · Noam Michael, Daniel BenShushan, Jacob Bien, Don A. Moore arxiv

We investigate the calibration of large language models' (LLMs') confidence across diverse tasks. The results of our preregistered study show that the current crop of LLMs are, like people, too sure they are right: confi…

Finding Game Levels with the Right Difficulty in a Few Trials through Intelligent Trial-and-Error

2020-05-15 · Miguel González-Duque, Rasmus Berg Palm, David Ha, Sebastian Risi

Methods for dynamic difficulty adjustment allow games to be tailored to particular players to maximize their engagement. However, current methods often only modify a limited set of game features such as the difficulty of…

AI AgentBayesian Optimization

Revisiting Self-Play Preference Optimization: On the Role of Prompt Difficulty

2025-10-07 · Yao Xiao, Jung-jae Kim, Roy Ka-wei Lee, Lidong Bing arxiv

Self-play preference optimization has emerged as a prominent paradigm for aligning large language models (LLMs). It typically involves a language model to generate on-policy responses for prompts and a reward model (RM) …