mlsanityData to 7 Oct 2026

Post Turing: Mapping the landscape of LLM Evaluation

arXiv 2311.02049 ↗First posted 3 Nov 2023cs.CL cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

In the rapidly evolving landscape of Large Language Models (LLMs), introduction of well-defined and standardized evaluation methodologies remains a crucial challenge. This paper traces the historical trajectory of LLM evaluations, from the foundational questions posed by Alan Turing to the modern era of AI research. We categorize the evolution of LLMs into distinct periods, each characterized by its unique benchmarks and evaluation criteria. As LLMs increasingly mimic human-like behaviors, traditional evaluation proxies, such as the Turing test, have become less reliable. We emphasize the pressing need for a unified evaluation system, given the broader societal implications of these models. Through an analysis of common evaluation methodologies, we advocate for a qualitative shift in assessment approaches, underscoring the importance of standardization and objective criteria. This work serves as a call for the AI community to collaboratively address the challenges of LLM evaluation, ensuring their reliability, fairness, and societal benefit.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 64 of its 88 references that are in the map. First posted on arXiv 3 Nov 2023.

Builds on

64 of 88 references.

References · 64

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  4. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  5. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  6. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  8. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  9. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  10. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  11. 2021Program Synthesis with Large Language Modelscited by 3,509
  12. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
38 more
  1. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
  2. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  3. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  4. 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,970
  5. 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,968
  6. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,829
  7. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
  8. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,718
  9. 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,538
  10. 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,332
  11. 2022LaMDA: Language Models for Dialog Applicationscited by 1,218
  12. 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,199
  13. 2023WizardLM: Empowering large pre-trained language models to follow complex instructionscited by 1,116
  14. 2023LIMA: Less Is More for Alignmentcited by 1,080
  15. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
  16. 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
  17. 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 883
  18. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
  19. 2023StarCoder: may the source be with you!cited by 790
  20. 2019CTRL: A Conditional Transformer Language Model for Controllable Generationcited by 754
  21. 2023WizardCoder: Empowering Code Large Language Models with Evol-Instructcited by 728
  22. 2018CoQA: A Conversational Question Answering Challengecited by 674
  23. 2022DS-1000: A Natural and Reliable Benchmark for Data Science Code Generationcited by 442
  24. 2018QuAC : Question Answering in Contextcited by 379
  25. 2023The Belebele Benchmark: a Parallel Reading Comprehension Dataset in 122 Language Variantscited by 300
  26. 2023CodeGeeX: A Pre-Trained Model for Code Generation with Multilingual Benchmarking on HumanEval-Xcited by 294
  27. 2023The False Promise of Imitating Proprietary LLMscited by 254
  28. 2021QuestEval: Summarization Asks for Fact-based Evaluationcited by 241
  29. 2023FLASK: Fine-grained Language Model Evaluation based on Alignment Skill Setscited by 198
  30. 2020Unsupervised Evaluation of Interactive Dialog with DialoGPTcited by 139
  31. 2023Large language models can accurately predict searcher preferencescited by 129
  32. 2017Bilateral Multi-Perspective Matching for Natural Language Sentencescited by 120
  33. 2023Artificial Artificial Artificial Intelligence: Crowd Workers Widely Use Large Language Models for Text Production Taskscited by 102
  34. 2023Value Kaleidoscope: Engaging AI with Pluralistic Human Values, Rights, and Dutiescited by 97
  35. 2023Anchor Points: Benchmarking Models with Much Fewer Examplescited by 84
  36. 2023Evaluating Cognitive Maps and Planning in Large Language Models with CogEvalcited by 77
  37. 2022RankGen: Improving Text Generation with Large Ranking Modelscited by 72
  38. 2021Can Generative Pre-trained Language Models Serve as Knowledge Bases for Closed-book QA?cited by 62

50 most cited of 64 All 64 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 0; 2026: 1.

4 papers.