Challenge: Existing approaches to estimate question difficulty rely on readability formulas, retrieval-based signals, or popularity statistics.
Approach: They propose a method that estimates question difficulty by computing the entropy of plausibility scores over candidate answers.
Outcome: The proposed method outperforms baselines across four QA datasets and shows strong robustness across hyperparameter variations and question types.

Similar Papers

The LLM Already Knows: Estimating LLM-Perceived Question Difficulty via Hidden Representations (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for difficulty estimation rely on repeated response sampling, auxiliary models, or fine-tuning the target model itself.
Approach: They propose a method that leverages only the hidden representations produced by large language models.
Outcome: The proposed method outperforms baselines in difficulty estimation on textual and multimodal tasks and improves adaptive reasoning strategies with fewer generated tokens.
PEDANTS: Cheap but Effective and Interpretable Answer Equivalence (2024.findings-emnlp)

Copied to clipboard

Challenge: Current short-form QA evaluations lack diverse styles of evaluation data and rely on expensive and slow LLMs.
Approach: They propose a rubric for machine QA that is more stable than an exact match and neural methods.
Outcome: The proposed evaluations improve on the existing short-form QA evaluations using the Trivia community.
Take Out Your Calculators: Estimating the Real Difficulty of Question Items with LLM Student Simulations (2026.findings-acl)

Copied to clipboard

Challenge: Standardized math assessments require expensive human pilot studies to establish the difficulty of test items.
Approach: They propose to use large language models to model difficulty of multiple-choice math questions for real-world students.
Outcome: The proposed model predicts difficulty of multiple-choice math questions for students . correlations between model and real-world difficulty are high, the authors show .
Measuring Retrieval Complexity in Question Answering Systems (2024.findings-acl)

Copied to clipboard

Challenge: a new metric, retrieval complexity (RC), measures the difficulty of answering questions.
Approach: They propose a retrieval complexity metric conditioned on the completeness of retrieved documents . they propose an unsupervised pipeline to measure RC given an arbitrary retrieval system .
Outcome: The proposed pipeline measures RC more accurately than alternative estimators on six challenging QA benchmarks.
Bend but Don’t Break? Multi-Challenge Stress Test for QA Models (D19-58)

Copied to clipboard

Challenge: a gap remains in reasoning ability compared to a human, and performance tends to degrade when models are exposed to less-constrained tasks.
Approach: They conduct extensive qualitative and quantitative analyses on the results of four models across four datasets . they relate common errors to model capabilities and discuss a way forward .
Outcome: The proposed model performance is based on the results of four models across four datasets.
Can Large Language Models Always Solve Easy Problems if They Can Solve Harder Ones? (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have impressive capabilities, but still suffer from inconsistency issues.
Approach: They develop a ConsisEval benchmark to evaluate LLMs' inconsistency . they find that LLM models can paradoxically fail at easier problems .
Outcome: The proposed model achieves highest consistency score but inconsistent to specific questions due to distraction by redundant information, misinterpretation of questions, etc.
What Factors Influence LLMs’ Judgments? A Case Study on Question Answering (2024.lrec-main)

Copied to clipboard

Challenge: Existing studies indicate that Large Language Models perform at a level comparable to humans with advantages of speed and cost-effectiveness in different fields.
Approach: They propose to introduce four unexplored factors and a new dimension of question difficulty to provide a more comprehensive understanding of LLMs’ judgments across varying question intricacies.
Outcome: The proposed dimensions of question difficulty and answer quantity provide valuable insights into optimizing LLMs’ performance as judges.
Test-Time Self-Adaptive Small Language Models for Question Answering (2023.findings-emnlp)

Copied to clipboard

Challenge: Recent instruction-finetuned large language models (LMs) have shown notable performances in various tasks, such as question-answering.
Approach: They propose to use unlabeled test data to transfer smaller language models with limited knowledge.
Outcome: The proposed strategy shows significant performance improvements on benchmark QA datasets with higher robustness across diverse prompts, enabling LMs to stay stable.
DT-QDC: A Dataset for Question Comprehension in Online Test (2020.coling-main)

Copied to clipboard

Challenge: Existing methods to measure difficulty of questions are not accurate enough to guide learning.
Approach: They propose to use a Chinese DT-QDC dataset to measure difficulty of questions and provide a new model that can improve the judgment of difficulty from different perspectives.
Outcome: The proposed methods outperform baselines by 7.79% on F1-score and 15.92% on MAE, 28.26% on MSE, and 28.2% on MSC on the new DT-QDC dataset.
Large Language Models Meet Knowledge Graphs for Question Answering: Synthesis and Opportunities (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have shown remarkable performance on question-answering tasks due to their superior capabilities in natural language understanding and generation.
Approach: They propose a structured taxonomy that categorizes the methodology of synthesizing LLMs and knowledge graphs for QA according to the categories of QA and the KG’s role when integrating with LLM.
Outcome: The proposed taxonomy categorizes the methods according to the categories of QA and the KG’s role when integrating with LLMs.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations