Daniel Jaroslawicz, Brendan Whiting, Parth Shah, Karime Maamari
Distyl AI · {daniel, brendan, parth, karime}@distyl.ai
NeurIPS 2025 LLM Evaluation Workshop Poster
INFONET Journal Club · May 29, 2026
Presenter: Donghyeon Kim
arxiv.org/abs/2507.11538 · openreview.net/forum?id=UnWroaGuOa · distylai.github.io/IFScale
While developing Shortcut, I repeatedly encountered a problem:
I'm exploring MAS / Dynamically Self-Structured MAS to address this. But before any of that — before proof of concept, before experiments — I needed a way to measure the problem first.
The IFScale benchmark solves this by quantifying how instruction-following degrades as the number of instructions increases.
Recent models push context windows past 1M tokens: DeepSeek V4 Pro, Claude Opus 4.7, Gemini 2.5 Pro, and more.
Researchers have uncovered common failure patterns in LLMs — primacy effects, silent instruction dropping, quality degradation under multiple constraints.
At the time of publication, none of these had been systematically measured as instruction density scales.
| Benchmark | What They Test | The Gap | IFScale's Answer |
|---|---|---|---|
| FollowBench | Multi-constraint tasks e.g., "Write 300 words, include a table, end politely" | Only 5–10 per prompt | Tests 10 to 500 |
| ComplexBench | Multi-step compositions e.g., "Summarize, then translate, then format as JSON" | Complex but few instructions | Systematically varies count |
| IFEval | Verifiable constraints e.g., "Use 4 paragraphs, start with Dear, no commas" | Fixed count, never varied | Varies density in steps of 10 |
| InfoBench | Diverse instruction types e.g., "Respond in French, use bullet points, avoid very" | Count not a variable | Makes count the independent variable |
| DIM-Bench | Distractor resilience e.g., "Write a summary (ignore: list primes under 100)" | Only tests irrelevant instructions | Measures relevant instruction-following across densities |
Context windows have grown from thousands to a million tokens. But as the table shows, no existing benchmark tests how instruction-following degrades when instruction count itself becomes the variable — even though omission errors and primacy effects are already known problems.
Write a professional business report. Include every keyword from the instruction list. Each instruction is a single constraint:
Why this works: simple enough to grade with regex — no ambiguity. The underlying job never changes, so instruction count is the only variable.
Each density level runs 5 times with different random seeds. The graph plots the average with ±1 standard deviation. o4-mini checks coherence (1–10); outputs that are only keyword lists, too short, or score below 6 are retried.
How 500 curated business terms were created from SEC 10-K filings (business reports)
| Provider | Models |
|---|---|
| OpenAI | o3r, o4-minir, gpt-4o, gpt-4.1, gpt-4.1-mini, gpt-4.1-nano |
| Anthropic | claude-opus-4, claude-sonnet-4, claude-3.7-sonnet, claude-3.5-haiku (+ reasoning variants) |
| gemini-2.5-pror, gemini-2.5-flash | |
| xAI | grok-3-beta, grok-3-mini |
| Meta | llama-4-maverick, llama-4-scout |
| DeepSeek | deepseek-r1r |
| Alibaba | qwen3 |
r = reasoning mode
| Density levels | 10, 20, …, 500 (50 levels, step of 10) | Smooth degradation curve, granularity |
| 5 seeds per level | Independent random seeds | Statistical stability, variance measurement |
| Stratified sampling | Consistent difficulty across levels | Fair comparison, no difficulty drift |
| API | OpenRouter, default generation params | Natural generation, no tuning bias |
| Reasoning effort | "high" where applicable | Maximize reasoning model capability |
| Accuracy | % of required keywords the model successfully includes |
| Std Dev | How much accuracy varies across 5 runs — measures consistency |
| Omission Rate | How often keywords are completely missing vs. approximated |
| Primacy Ratio | Errors in last ⅓ ÷ errors in first ⅓ — measures position bias |
| Latency | Time from prompt to completed output, in seconds |
| Coherence | o4-mini rates report quality on a 1–10 rubric |
$$\text{Primacy Ratio} = \dfrac{\text{errors(last }\frac{1}{3})}{\text{errors(first }\frac{1}{3})}\quad \begin{cases} > 1.0 & \text{later violated more} \\ = 1.0 & \text{no bias} \\ < 1.0 & \text{earlier violated more} \end{cases}$$
Put important instructions first — but at extreme densities, ordering stops helping.
At low densities, errors are balanced. As density increases, omission takes over.
| Model | O:M at 500 | What This Means |
|---|---|---|
| llama-4-scout | 34.9 | drops keywords, almost never approximates |
| claude-3.5-haiku | 31.7 | |
| llama-4-maverick | 20+ | |
| … | ||
| claude-opus-4 (r) | 4.1 | still attempts approximations |
| gemini-2.5-pro | ↓ as density ↑ | ratio decreases — tries harder under load |
| Model | 10 inst. | 250 inst. |
|---|---|---|
| o4-mini r | 12.4s | 436.2s |
| o3 r | 26.3s | 219.6s |
| claude-3.5-haiku | 9.3s | 10.5s |
| gpt-4o | 9.3s | 13.2s |
General-purpose models maintain near-constant latency.
Reasoning models earn their accuracy by spending more time thinking — latency explodes as instruction count grows. General-purpose models stay fast regardless of density.
When you divide accuracy by latency, speed wins:
| By Accuracy | By Efficiency |
|---|---|
| 1. o3 / gemini-2.5-pro | 1. grok-3-mini |
| 2. grok-3 | 2. gemini-2.5-flash |
| 3. gpt-4.1 | 3. gpt-4.1-nano |
Reasoning models take minutes. Smaller models take seconds. For latency-sensitive applications, a fast mid-tier model often wins.
We have seen that models drop instructions, skip the later ones, and stop trying under load. With all of that happening, you might wonder: does the report still make any sense?
If a model has to include 500 keywords, maybe it just stuffs them in and stops writing real sentences. So the paper also measured something beyond accuracy: basic writing quality.
o3 and o4-mini were the only models whose reports became noticeably worse as instruction count grew. At high densities, their output stopped reading like a real business report.
Why did this happen? These models produced very few tokens to begin with. o3 wrote only about 1,500 tokens when given 500 instructions. Since 500 of those words had to be keywords, roughly one out of every three words was predetermined — leaving almost no room for normal sentences to form.
Practical guidelines based on what the numbers tell us.
What this paper did not test, and what it did not answer.
Questions?
| Model | 10 | 50 | 100 | 250 | 500 |
|---|---|---|---|---|---|
| claude-3.5-haiku | 98.0 | 78.0 | 43.4 | 16.6 | 8.5 |
| claude-3.7-sonnet | 100.0 | 99.6 | 94.8 | 72.9 | 52.7 |
| claude-opus-4 | 100.0 | 100.0 | 94.6 | 67.9 | 44.6 |
| claude-opus-4 r | 92.0 | 99.6 | 81.8 | 81.5 | 52.1 |
| claude-sonnet-4 | 100.0 | 98.0 | 94.4 | 77.2 | 42.9 |
| claude-sonnet-4 r | 100.0 | 100.0 | 94.8 | 80.0 | 39.9 |
| deepseek-r1 r | 98.0 | 94.8 | 86.8 | 49.1 | 30.9 |
| gemini-2.5-flash | 100.0 | 96.0 | 82.0 | 50.7 | 34.2 |
| gemini-2.5-pro r | 100.0 | 100.0 | 100.0 | 97.7 | 67.3 |
| gpt-4.1 | 100.0 | 100.0 | 98.4 | 84.7 | 56.4 |
| gpt-4.1-mini | 100.0 | 100.0 | 97.2 | 67.6 | 43.2 |
| gpt-4.1-nano | 100.0 | 94.0 | 84.0 | 37.4 | 20.4 |
| gpt-4o | 100.0 | 63.6 | 40.0 | 14.4 | 7.5 |
| grok-3-beta | 100.0 | 100.0 | 99.2 | 90.3 | 61.9 |
| grok-3-mini | 98.0 | 96.8 | 88.0 | 27.2 | 13.5 |
| llama-4-maverick | 98.0 | 92.8 | 68.4 | 8.8 | 4.2 |
| llama-4-scout | 100.0 | 53.6 | 30.8 | 10.6 | 6.1 |
| o3 r | 100.0 | 100.0 | 100.0 | 97.3 | 62.8 |
| o4-mini r | 100.0 | 100.0 | 99.6 | 93.0 | 52.5 |
| qwen3 | 100.0 | 92.0 | 87.2 | 46.8 | 26.9 |
| Pattern | Curve | Key Trait | Examples | Best For |
|---|---|---|---|---|
| Threshold | Flat → steep drop | Near-perfect until critical density | o3, gemini-2.5-pro | High-recall at 100+ instructions |
| Linear | Steady downward slope | Predictable across all densities | gpt-4.1, claude-3.7-sonnet | Predictable tradeoffs |
| Exponential | Rapid drop → floor | Overwhelmed early, ~7–15% floor | claude-3.5-haiku, llama-4-scout | ≤50 instructions only |
llama-4-maverick is an extreme outlier with abnormally high variance, suggesting fundamentally different instruction-processing mechanisms.