Anticipatory Evaluation of Language Models: Predicting LLM Benchmark Scores from Descriptions
summary
The gist
The gist The authors investigate whether evaluation outcomes can be forecast before any experiments are conducted by studying text-only performance prediction, where models estimate performance from
In short
Researchers investigated if models can predict LLM performance scores just from text descriptions of tasks and setups, without running experiments. They created EVALCAST, a resource of description-performance pairs. Experiments showed that reasoning-enabled LLMs significantly outperform simpler methods at predicting absolute performance, suggesting this forecasting method is feasible for prioritizing benchmarks.
Key concepts
- Anticipatory Evaluation
- This is the idea of trying to predict how well a language model will perform on a task before actually running the experiment. Instead of waiting for results, researchers use text descriptions to forecast outcomes.
- EVALCAST
- EVALCAST is a curated resource containing 2,290 pairs of task descriptions and their corresponding performance results from over 1,500 papers. It serves as the dataset used to train and test models that attempt to predict performance based only on text.
- Regression vs. Pairwise Prediction
- The study tested two ways to use the data: regression, where a model predicts an absolute score (like 85/100), and pairwise prediction, where it compares the relative difficulty between two different tasks. Both methods showed promise in capturing different aspects of performance forecasting.
Terminology used across episodes
This episode discusses
- Anticipatory Evaluation of Language Models: Predicting LLM Benchmark Scores from Descriptions · Paper Radio
- Comparing Humans, GPT-4, and GPT-4V On Abstraction and Reasoning Tasks
- The ConceptARC Benchmark: Evaluating Understanding and Generalization in the ARC Domain
- GPT-4 Technical Report
- Chronos: Learning the Language of Time Series
- Schema-Driven Information Extraction from Heterogeneous Tables
- TEMPO: Prompt-based Generative Pre-trained Transformer for Time Series Forecasting
- Training Compute-Optimal Large Language Models
- KaLM-Embedding: Superior Training Data Brings A Stronger Embedding Model
- GPT-4o System Card
- Time-LLM: Time Series Forecasting by Reprogramming Large Language Models
- Scaling Laws for Neural Language Models
- ScholarEval: Research Idea Evaluation Grounded in Literature
- Language Model Embeddings Can Be Sufficient for Bayesian Optimization
- TS-RAG: Retrieval-Augmented Generation based Time Series Foundation Models are Stronger Zero-Shot Forecaster
- FaVIQ: FAct Verification from Information-seeking Questions
- The Battle of LLMs: A Comparative Study in Conversational QA Tasks
- LLM Processes: Numerical Predictive Distributions Conditioned on Natural Language
- Large Language Model Prediction Capabilities: Evidence from a Real-World Forecasting Tournament
- Importance Sampling is All You Need: Predict LLM's performance on new benchmark by reusing existing benchmark
- OmniPred: Language Models as Universal Regressors
The paper
Anticipatory Evaluation of Language Models: Predicting LLM Benchmark Scores from Descriptions · Read on arXiv
Jungsoo Park, Ethan Mendes, Gabriel Stanovsky, Alan Ritter
Georgia Institute of Technology · The Hebrew University of Jerusalem
Modern ML research increasingly faces an evaluation bottleneck: building benchmarks and running experiments is costly, slowing iteration. We ask how much can be inferred about evaluation outcomes before experiments, given only a natural-language description of the task and setup. We call this setting anticipatory evaluation. We introduce EVALCAST, a literature-grounded resource of 2,290 description-performance pairs from 1,519 arXiv papers, including a test set of papers published after the model's knowledge cutoff. We evaluate two tasks: predicting absolute performance through regression and comparing benchmark difficulty through pairwise prediction. Experiments with frontier LLMs show that accurate regression remains challenging, while pairwise predictions can recover relative performance ordering under matched settings. Comparable performance on post-cutoff and streaming evaluations suggests that the observed signal is not solely attributable to previously reported results. Overall, EVALCAST provides a resource and evaluation framework for studying anticipatory evaluation and its potential use in prioritizing benchmarks.
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: Today's paper: "Anticipatory Evaluation of Language Models".
Jane: The gist The authors investigate whether evaluation outcomes can be forecast before any experiments are conducted by studying text-only performance prediction,
Tom: First, who's behind it and why it matters.
Paper summary: Tom: So we're looking at this paper, "Anticipatory Evaluation of Language Models: Predicting LLM Benchmark Scores from Descriptions." What it claims is that we can actually guess how well a language model will perform on a task before we ever run the experiment.
Jane: That sounds really interesting to think about because right now, building those benchmarks and running the experiments is just so slow for everyone in the field. The paper investigates if you can forecast evaluation outcomes just from a natural-language description of the task and setup alone.
Lu: Specifically, they study text-only performance prediction, where models estimate performance from task descriptions and experimental configurations without ever having access to actual dataset instances. They build this up using something called PRECOG, which is this literature-grounded resource of two thousand two hundred ninety description–performance pairs from one thousand five hundred nineteen arXiv papers <ref:2509.20645#pg1>.
Meng: two thousand two hundred ninety pairs is a lot of data to curate and maintain. What's the main point they're pushing with all that text?
Tom: The core idea is that you can use this corpus to predict absolute performance through regression, or you can compare benchmark difficulty by making pairwise predictions. They found that experiments with frontier models show that while accurate regression is challenging, pairwise predictions can recover relative performance ordering if the settings match up.
Jane: And they're saying that even comparable performance on post-cutoff and streaming evaluations suggests the signal we see isn't just from previously reported results. It implies there’s something happening in the description itself that gives us a hint.
Lu: The method involves an extractor LLM producing a schema-aligned, identity-masked description xi that summarizes everything: the task, data collection, evaluation protocol, difficulty cues and prompting strategy. Then the model performs reasoning to output a numeric estimate y hat i in the range of zero to one hundred given that description.
Meng: Reasoning models are powerful, but how do they actually do this when they don't have the actual test data? Is it just pattern matching on the text?
Tom: Not just pattern matching. They use a regression problem where an LLM regressor f theta predicts the normalized target y hat i equals f theta of xi and Zi, where Zi is optional evidence retrieved by querying a time-bounded literature corpus C with a top k retriever Rk on a query formed from xi.
Jane: So, if you give the model a description, it looks at that text and then optionally searches relevant past papers for context before making its prediction. That sounds like a loop where it reasons based on retrieved evidence.
Paper summary: Lu: It can iterate in a ReAct-style loop, reasoning about past results and issuing queries to refine its estimation before outputting the final score, which they say can be as low as nine point nine mean absolute error at high confidence thresholds.
Meng: That's a specific number. What does that mean for deployment? If we use this to prioritize which benchmarks we build, what’s the practical value of a prediction with an error rate like that?
Tom: The implication is that this system can serve as a lightweight planning tool for zero-result settings by predicting difficulty upfront and prioritizing configurations. In one case study, the system predicted sixty-eight percent accuracy for GPT-4o on the on-air variant and fourteen percent on the off-air variant of verbal reasoning puzzles, yielding a mean absolute error of five point five percentage points.
Jane: So, it’s not just about guessing if something will pass; it’s about telling designers which parts of the setup are most promising to build first. They also showed it can guide benchmark design by estimating performance across different settings, like the number of multiple-choice options or how distractors are constructed.
Lu: They predict GPT–4o accuracies ranging from eighty-six percent down to sixty percent for configurations with five, ten, fifteen, twenty, and twenty-five options respectively. That gives designers a coarse but quantitative signal for where to allocate their resources at the design stage.
Meng: From my side of things, I'm worried about the complexity of feeding all this literature in. What is the cost to run this kind of reasoning loop on a massive scale? Does it break at scale when we try to deploy these prediction tools into our actual evaluation pipelines?
Tom: They compared text-encoder–based regressors like kNN and XGBoost trained on embeddings from E5-Mistral-7B LLMs, and then they tested GPT–five in its reasoning configuration against Qwen3 with no thinking to quantify the contribution of explicit reasoning.
Jane: And what did they find when it came to those baselines? Was the raw embedding approach better than what you saw with the full reasoning capabilities?
Tom: GPT–five achieved a mean absolute error of fourteen point six on a leakage-controlled two thousand twenty-five test split, which substantially outperformed a strong text-embedding baseline. When we restricted it to high-confidence predictions, that error dropped further to nine point nine mean absolute error.
Paper summary: Lu: The retrieval analysis showed that while search improves GPT–five’s performance prediction, it doesn't help Qwen3 as much with the same method <ref:2509.20645#pg2>. The results indicate that retrieval isn't the main source of forecasting gains in PRECOG; most of the signal comes from reasoning over curated descriptions plus the model’s own knowledge.
Meng: So, if we want to make this practical for production, are we relying on a super powerful model like GPT–five just to do this prediction <ref:2509.20645#pg2>? Or can smaller models get close enough?
Tom: The human comparison study showed expert forecasters achieved a mean absolute error of nineteen point six, while GPT–five attained an error of thirteen point six on the same subset <ref:2509.20645#pg2>. This underscores the potential value of LLM-based predictors as early-stage decision aids.
Jane: It’s interesting that even with reasoning enabled, they still see a gap between expert human forecasters and what the models are predicting, even if those predictions are much better than simple text encoders. What does that suggest about where the uncertainty lies?
Lu: The paper points out that forecasting performance based solely on text-only descriptions could be a practical approach in real-world applications, with GPT–five plus Search achieving a mean absolute error of fourteen point zero on newly released datasets and unseen experiment–dataset combinations <ref:2509.20645#pg2>.
Tom: That demonstrates the feasibility of anticipatory evaluation in streaming settings. It means we can start using these descriptions to make better choices before we even commit to running the full expensive evaluation suite.
Jane: So, what does this mean for the future of how we evaluate language models? It suggests a path where we prioritize configurations and design choices based on text alone, rather than waiting for the data collection phase.
Lu: The overall findings suggest that reasoning-enabled LLMs substantially outperform embedding-based baselines, achieving a mean absolute error of fourteen point six overall and nine point nine at high confidence thresholds. This provides a resource and evaluation framework for studying anticipatory evaluation and its potential use in prioritizing benchmarks.
Meng: So, to summarize for the people listening who don't read the deep dive: this paper gives us a way to use text descriptions of tasks to predict how well an AI model will perform, which could help us design better tests before we spend time running those tests.
Tom: Exactly. It moves evaluation from being purely reactive to potentially proactive, using only the description of what we want to test as our starting point for prioritization and resource allocation.
Conclusion: Tom: So we’re wrapping up this look at "Anticipatory Evaluation of Language Models: Predicting LLM Benchmark Scores from Descriptions." Essentially, these authors are showing how you can use just a written description of a task and setup to guess how well an AI model will actually perform on that task.
Jane: That sounds like it could save a ton of time for people building benchmarks. So, what’s the big idea behind this approach?
Tom: The core idea is moving evaluation from being purely reactive to potentially proactive. Instead of running all those expensive experiments just to see the result, you use that text description as a starting point for prioritizing what you test and what configurations are most promising.
Lu: They’re using a literature-grounded resource called PRECOG, which has two thousand two hundred ninety description-performance pairs from papers on arXiv. It’s like they built this massive library of past results to train their prediction system.
Meng: So, it’s not just guessing; they have real data from published papers to train the model on. How accurate are these predictions when you actually try them out?
Tom: They found that a reasoning-enabled LLM, GPT-five achieved a mean absolute error of fourteen point six on their test split. That’s pretty solid when you compare it to simpler text encoder baselines.
Jane: Fourteen point six is a number we can work with. What does this actually change for someone who just listens to the show?
Tom: It means that designers can use this system as a lightweight planning tool for zero-result settings. They can predict which parts of a task setup will be hard or easy before they even start building it, allowing them to prioritize cleaning up the harder variants first.
Lu: They also showed it’s useful for benchmark design itself. You can feed in different options—say, five options versus twenty-five multiple-choice answers—and the system predicts the AI's performance across that range of settings.
Meng: That gives you a quantitative signal for resource allocation at the design stage, which is helpful because nobody has time to run every single combination manually.
Jane: It seems like they’re showing that this text-only forecasting approach isn't just academic; it's feasible and provides an early decision aid for how we build better tests. Where do you think this goes next?
Tom: The paper suggests that even with reasoning enabled, you still have a gap between those model predictions and expert human forecasters, but the gains over simple models are still significant. They show it’s practical in streaming settings too.
Jane: So the implication is we can start using these descriptions to make better choices before we commit to running the full evaluation suite for a new set of data collection.
More episodes
- 2604.07341-ReCodeAgent: A Multi-agent Workflow for Language-Agnostic Translation and Validation of Large-Scale Repositories
- 2605.10414-Remember to Forget: Gated Adaptive Positional Encoding
- 2605.22949-MARGIN: Runtime Confidence Calibration for Multi-Agent Foundation Model Coordination
- 2610.10875-Barron Optimal Transport I: Generative Modeling
- 2505.13546-Prompt Stability Matters: Evaluating and Optimizing Auto-Generated Prompt in General-Purpose Systems
- 2507.12553-Is This Just Fantasy? Language Model Representations Reflect Human Judgments of Event Plausibility
- 2501.05559-Forget About It: Mitigating Forgetting Without Replay or Auxiliary Objectives
- 2504.07170-Trustworthy AI Must Account for Interactions
- 2509.09498-SEDM: Selective Self-Evolving Distributed Memory for Agents
- 2607.06772-Efficient Long-Horizon Learning for Learned Optimization