What Makes Something Hard(er)? Explaining Question Difficulty in Natural Language
cs.CL, cs.AI
Submitted: 2026-10-01
Updated: 2026-10-01
Code: https://github.com/pengcuix/explain-difficulty
License: http://creativecommons.org/licenses/by/4.0/
The gist: Difficulty is one of the most fundamental properties of a question: it determines whether the question can meaningfully discriminate between models of differing ability.
Terminology
Abstract
Difficulty is one of the most fundamental properties of a question: it determines whether the question can meaningfully discriminate between models of differing ability. Although a variety of methods can now estimate or predict difficulty automatically, they yield only a single descriptive number, with no account of the underlying factors that make a question difficult in the first place. In this work, we propose a data-driven approach that automatically generates and validates natural-language hypotheses explaining what makes one question harder than another. We first estimate each item's difficulty from the responses of a large pool of LLMs using Item Response Theory. We then sample contrasting sets of easy and hard questions and prompt an LLM to propose candidate explanations of the difference, which are subsequently validated and selected on held-out questions. Experimental results across three datasets spanning mathematical, logical, and commonsense reasoning show that our method produces interpretable and predictive hypotheses. On their own, they predict the difficulty of unseen questions competitively with, or better than, advanced black-box difficulty regressors; used as additional features, they further improve those regressors, implying that they discover difficulty signals that existing models fail to capture. Moreover, we demonstrate that editing questions according to a hypothesis can shift their measured difficulty in the expected direction, indicating that the discovered hypotheses are causally valid difficulty factors rather than post-hoc descriptions. Our approach thus turns a purely descriptive difficulty score into actionable statements.
Sources
- Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone
- Qwen Technical Report
- Training Verifiers to Solve Math Word Problems
- Domino: Discovering Systematic Errors with Cross-Modal Embeddings
- The Llama 3 Herd of Models
- Mistral 7B
- Gemma 3 Technical Report
- Textbooks Are All You Need II: phi-1.5 technical report
- RoBERTa: A Robustly Optimized BERT Pretraining Approach
- LLMs Encode How Difficult Problems Are
- Gemma: Open Models Based on Gemini Research and Technology
- Qwen2.5 Technical Report
- Qwen2 Technical Report
- Yi: Open Foundation Models by 01.AI
- TinyLlama: An Open-Source Small Language Model
- Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models
Related papers
- Exploring Solution Divergence and Its Effect on Large Language Model Problem Solving
- Ishigaki-IDS-Bench: A Benchmark for Generating Information Delivery Specification from BIM Information Requirements
- Subliminal Steering: Stronger Encoding of Hidden Signals
- MedStruct-S: A Benchmark for Key Discovery, Key-Conditioned QA and Semi-Structured Extraction from OCR Clinical Reports
- The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures
- Untangling the Mechanisms of Misleading Context in Medical Question Answering