mlsanityData to 14 Oct 2026

Hardness of Samples Need to be Quantified for a Reliable Evaluation System: Exploring Potential Opportunities with a New Task

arXiv 2210.07631 ↗First posted 14 Oct 2022cs.CL cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Evaluation of models on benchmarks is unreliable without knowing the degree of sample hardness; this subsequently overestimates the capability of AI systems and limits their adoption in real world applications. We propose a Data Scoring task that requires assignment of each unannotated sample in a benchmark a score between 0 to 1, where 0 signifies easy and 1 signifies hard. Use of unannotated samples in our task design is inspired from humans who can determine a question difficulty without knowing its correct answer. This also rules out the use of methods involving model based supervision (since they require sample annotations to get trained), eliminating potential biases associated with models in deciding sample difficulty. We propose a method based on Semantic Textual Similarity (STS) for this task; we validate our method by showing that existing models are more accurate with respect to the easier sample-chunks than with respect to the harder sample-chunks. Finally we demonstrate five novel applications.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 26 of its 40 references that are in the map. First posted on arXiv 14 Oct 2022.

Builds on

26 of 40 references.

References · 26

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2022Training language models to follow instructions with human feedbackcited by 15,971
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  4. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  5. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,780
  6. 2016Gaussian Error Linear Units (GELUs)cited by 3,502
  7. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  8. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
  9. 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,385
  10. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,470
  11. 2019Natural Adversarial Examplescited by 1,408
  12. 2021Cross-Task Generalization via Natural Language Crowdsourcing Instructionscited by 699
14 more
  1. 2018Annotation Artifacts in Natural Language Inference Datacited by 671
  2. 2017Adversarial Examples for Evaluating Reading Comprehension Systemscited by 571
  3. 2020Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamicscited by 425
  4. 2018AllenNLP: A Deep Semantic Natural Language Processing Platformcited by 347
  5. 2020Pretrained Transformers Improve Out-of-Distribution Robustnesscited by 294
  6. 2020Selective Question Answering under Domain Shiftcited by 238
  7. 2019WinoGrande: An Adversarial Winograd Schema Challenge at Scalecited by 204
  8. 2021Reframing Instructional Prompts to GPTk's Languagecited by 176
  9. 2020Adversarial Filters of Dataset Biasescited by 160
  10. 2018How Much Reading Does Reading Comprehension Require? A Critical Investigation of Popular Benchmarkscited by 88
  11. 2022Investigating Selective Prediction Approaches Across Several Tasks in IID, OOD, and Adversarial Settingscited by 66
  12. 2015Towards Universal Paraphrastic Sentence Embeddingscited by 60
  13. 2019MultiQA: An Empirical Investigation of Generalization and Transfer in Reading Comprehensioncited by 60
  14. 2020DQI: A Guide to Benchmark Evaluationcited by 7

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.