The Evaluation Crisis
Why N-of-10 trials and unreported variance mislead: 95% per-step success is unusable at 30 steps.
- Last reviewed
- Reading time
- 10 min
- Citations
- 9
A robot learning paper announces its headline result as a single number: the success rate. That number compresses several choices into one digit: how many times the task was attempted, how long each attempt was allowed to run, how the scene was arranged, and who scored the outcome. Two policies can both report 80% and sit an order of magnitude apart in real capability, because one number was earned over five decisions and the other over thirty. This module covers what the success rate hides, measured in three places: the statistics of small trial counts, the brittleness of clean benchmarks, and the bias of single-lab scoring. Each has a response now being built, and the responses are as much the story as the problem.
What the success rate hides: the horizon
A success rate is an episode-level outcome, and an episode is a chain of decisions. A policy that must make 30 correct decisions in a row, each succeeding 95% of the time, completes the whole task 0.95 to the power 30 of the time, which is 21.5%. The per-step number sounded strong; the task-level number is a coin flip weighted toward failure. The product is the deployment metric, because users experience whole tasks, and it is not what most tables report. Drag the episode length slider below out to 100 steps and watch the same 95% policy fall to 0.6%.
(0.950)^30 = 21.5% episode success
The evaluation calculator at 95.0 percent per-step success reports 21.5% episode success after 30 decisions and 0.6% at the 100-step end of the range, crossing half only around step 14.
Sampled episode success by episode length
| episode length | episode success |
|---|---|
| 0 steps | 100.0% |
| 10 steps | 59.9% |
| 25 steps | 27.7% |
| 50 steps | 7.7% |
| 75 steps | 2.1% |
| 100 steps | 0.6% |
The calculator above computes that product. The per-step slider spans the full range on purpose, so the boundary cases are honest: at 0% per-step the task never completes once the horizon is at least one step, at 100% it always completes, and at a horizon of exactly one step the readout equals the per-step value. No setting produces a meaningless number, and the decay curve is the point. The inverse reading matters too. Two tasks that both report 80% episode success demand different per-step reliabilities: over five steps, 80% implies about 95.6% per step, while over thirty steps it implies about 99.3%. Without the step count, the two results are not comparable, and the step count is frequently absent from the report.
Prediction
Read the reasoning
(0.950)^14 = 48.8% episode success
The evaluation-crisis prediction panel is seeded at 14 steps so episode success sits at 48.8% when per-step success is 95.0 percent, and the curve still ends at 0.6% by step 100 after crossing 50 percent near step 14.
Sampled episode success by episode length
| episode length | episode success |
|---|---|
| 0 steps | 100.0% |
| 10 steps | 59.9% |
| 25 steps | 27.7% |
| 50 steps | 7.7% |
| 75 steps | 2.1% |
| 100 steps | 0.6% |
- About 200 decisions, because errors average out over an episodeThis encodes the belief that independent mistakes cancel like noise around a mean. A successful episode needs every decision right, so errors compound toward zero, and a longer episode is strictly worse, not safer.
- About 50 decisions, since 95% leaves little room for errorThis reads the per-step number as if it carried over linearly to the task. The loss is multiplicative: by 50 decisions the product is 7.7%, far past a coin flip and heading for the floor.
- About 14 decisions, because the loss compounds at every stepThe product crosses one half between the 13th and 14th decision: 0.95 to the 14th is 48.8%, and the module’s own horizon arithmetic already lands 30 steps at 21.5%. Episode success halves roughly every 14 decisions, so the coin flip arrives early, not late.horizon arithmetic
At 95% per step, the task is a coin flip after 14 decisions and down to 21.5% after 30: the per-step number cannot be read off the task-level number.
Small samples limit comparison
The second thing the number hides is its own uncertainty. Toyota Research Institute's Large Behavior Model program took the opposite approach to scale. The models extend the Diffusion Policy recipe into multitask systems trained on about 1,700 demonstration hours in the Ramen mixture: 468 hours of internally collected real bimanual teleoperation, 45 simulation hours, 32 UMI handheld-collection hours, and roughly 1,150 hours curated from a subset of Open X-Embodiment Chi 2023 TRI LBM Team 2025. TRI reports 1,800 real-world rollouts and over 47,000 simulation rollouts. The protocol used 50 real attempts per task per policy per condition and targeted 200 in simulation; Section 8.4 discloses missing simulation data for some combinations. Hardware comparisons were blind, with policy order randomized within bundles sharing an initial condition. Simulation used automated predicates rather than human scoring TRI LBM Team 2025.
For binary success rates, TRI plots Bayesian posteriors over each policy’s success probability using a uniform prior. It gives two reasons for using violin plots: they show the whole parameter distribution rather than a single interval, and overlapping confidence intervals can be misread as an absence of statistical separation even when a hypothesis test can distinguish the policies. These distributions describe individual policy checkpoints; they do not include variation from stochastic training TRI LBM Team 2025.
Snyder et al. give 10 or 50 trials as examples of small feasible sample sizes for policy comparison, not a census of what most papers run or a universal range. Their formal trial budget is specified per policy Snyder 2025. TRI warns of a significant risk that many robotics papers are measuring statistical noise because of insufficient power. That warning does not establish how many papers are wrong. Likewise, a comparison that fails to find a significant difference does not establish that the policies are equivalent TRI LBM Team 2025 Snyder 2025.
Snyder et al. propose STEP, a sequential policy-comparison test that can stop when sufficient evidence accumulates or remain inconclusive when its trial budget is exhausted. The observed arXiv v4 reports up to 32% fewer evaluation trials against state-of-the-art sequential baselines, not a guaranteed saving against fixed-budget testing. Its feasible baselines are Lai and SAVI; the oracle comparison uses information unavailable to an evaluator. The analysis assumes i.i.d. binary outcomes, an evaluator-selected significance level and maximum number of trials per policy. The reported experiments use a uniform risk-accumulation schedule, and statistical power varies with the setting and method Snyder 2025.
TRI also uses a sequential framework for binary policy comparison, but explicitly adopts the Lai test identified in its reference 79 rather than STEP. Its categorical task-progress comparisons use Welch’s t-test, with a stated normality-assumption caveat; Type-I error is not globally controlled across all tasks shown together TRI LBM Team 2025.
Clean benchmarks overstate
The third hiding place is the benchmark itself. Simulation benchmarks are cheap and reproducible, which is why result tables fill with them. LIBERO’s original lifelong-learning benchmark reports 130 tasks: ten each in LIBERO-Spatial, LIBERO-Object, and LIBERO-Goal, plus 100 in LIBERO-100. The paper splits LIBERO-100 into 90 short-horizon pretraining tasks and ten long-horizon downstream tasks; that last subset is not another 100-task evaluation suite. Each generated task has 50 human-expert demonstrations collected through Spacemouse teleoperation Liu 2023. LIBERO-Plus asked what those scores survive Fei 2025. The authors perturb the benchmark along seven dimensions: object layout, camera viewpoint, robot initial state, language instruction, lighting, background texture, and sensor noise. Models that score 95% on the clean benchmark fall below 30% under modest shifts of camera viewpoint or initial state. The language ablation cuts deeper: shuffle or remove the instruction and performance barely moves, evidence that the models were largely ignoring the language they appeared to be following Fei 2025. A high clean-benchmark score can coexist with no real task understanding, and the two are only distinguishable by evaluation under variation.
Simulation as an evaluation proxy
If real rollouts are expensive and clean benchmarks overstate, the obvious middle ground is simulation. The question is whether simulated performance predicts real performance at all. SIMPLER was built to answer it Li 2024. It identifies visual differences between rendered and real images and control differences in how the robot responds to the same actions. Visual matching mitigates the first with real-image backgrounds and matched object and robot textures; offline system identification mitigates the second by fitting controller stiffness and damping against recorded action and end-effector trajectories. These are methods for reducing the gaps, not guarantees that they are closed Li 2024.
The project site reports approximately 1,500 evaluation episodes from each of real and simulation on Google Robot and WidowX setups. These are paired policy-and-task comparisons, not an established 1,500 one-to-one matching raw-trial count: the paper’s simulated trials multiply with environment variants, tuned robot colors, and Octo random seeds. Octo simulation success rates are averaged over three seeds; Google Robot results also average four arm-color versions, while WidowX does not use that color averaging Li 2024.
Pearson correlation measures linear agreement in policy performance. Mean Maximum Rank Violation (MMRV) instead weights incorrect policy orderings by their real-world performance margins and averages each policy’s worst violation. Pearson can be unstable when policies perform similarly, and low MMRV does not mean that absolute success rates or individual rollouts match. Agreement varies by task: the WidowX carrot-placement comparison contains a ranking error, unlike the other final-success comparisons in that table. The reported distribution-shift agreement likewise concerns the tested tasks, policies, and perturbations. SIMPLER complements real rollouts; its experiments focus on rigid objects, and its green-screening assumes fixed cameras and misses shadows and other visual details Li 2024. Sim-to-real transfer as a training technique has its own module; see Sim-to-Real Transfer.
Blind, distributed, pairwise
RoboArena distributes policy evaluation across seven universities using the DROID Franka Panda platform Khazatsky 2024 Atreya 2025. Evaluators choose tasks and scenes after receiving anonymous policy endpoints, then run each pair back-to-back while closely matching the initial conditions within the pair. The paper calls the protocol double-blind and specifies that evaluators do not know which policies they are evaluating; it does not establish that every server operator or policy developer is blind to all assignments. Evaluators provide progress scores, preferences, and explanations Atreya 2025. The v2 study reports 612 pairwise comparisons across seven DROID-trained policies. Running the other five policies on each tested task produced 4,284 individual rollouts for an exhaustive progress-score oracle. Against that particular oracle, the authors report better ranking agreement than a conventional DROID evaluation using 17 tasks and 44 episodes per policy, measured with Pearson correlation and Mean Maximum Rank Violation. Their task-aware preference model and progress-score rankings capture complementary information. This is a comparison within the tested policy, task, evaluator, and hardware population, not a universal guarantee that distributed rankings are more accurate or cheaper Atreya 2025.
RoboChallenge instead hosts robots at its testing site and exposes asynchronous observation and action APIs; model inference remains with the submitting user. Its initial Table30 benchmark contains tasks performed on or around a table. The benchmark protocol uses held-out demonstration frames to guide scene resets, but lighting and camera drift remain, and the system cannot verify that the remotely run model matches the submitted name Yakefu 2025. These approaches address different evaluation needs: RoboArena explicitly remains complementary to controlled, single-condition experiments, while RoboChallenge standardizes its own benchmark setup. Neither paper establishes that one protocol is best for every evaluation Atreya 2025 Yakefu 2025.
Reading a result table
Five questions recover what the single number hides. How many rollouts produced it, and does the paper report the uncertainty around it at all, whether as an interval or a posterior; TRI chose 50 real attempts per task per policy per condition and still acknowledges measurement noise TRI LBM Team 2025. How long is the task, because the same episode success implies different per-step reliabilities at different horizons, and the calculator above shows the arithmetic. What survives perturbation, because a clean-benchmark score needs a robustness counterpart before it means deployment Fei 2025. Who scored it and where, and how closely did the ranking agree with the comparison population the study actually tested Atreya 2025. And what correlation backs any simulation number, because sim agreement is task-dependent and must be measured, not assumed Li 2024. The field's response to the crisis is exactly this instrumentation: sequential tests that spend trials efficiently, perturbation benchmarks that probe brittleness, sim proxies with stated correlations, and blind distributed arenas. Adoption remains partial, which is why the questions are still worth asking of every table you read.
Self-check
Read the reasoning
- Neither policy is established as better; inspect the uncertainty and comparison protocolA reported rate is not a policy comparison. TRI uses posterior distributions to characterize uncertainty and hypothesis tests to compare policies. Snyder et al. explain that an inconclusive test does not establish equivalence. Fifty trials is TRI’s protocol choice, not a universal threshold for an interpretable result.
- The identical reported success rates establish equivalent performanceThe same empirical rate does not establish equal underlying success probabilities. A failure to detect a difference can reflect insufficient power rather than equivalence.
- Policy B is better because it used the more rigorous protocolMore information about how a policy was evaluated does not establish that its success probability is higher. Compare the policies under a suitable statistical procedure instead of ranking them by trial count.
Trial count and uncertainty matter, but neither equal reported rates nor an inconclusive test establish policy equivalence.
See also
- RL Fine-Tuning of Policies
DPPO, ConRFT, Recap, pi_RL, residual RL, and HIL-SERL: closing the reliability gap with on-policy experience.
- The Data Bottleneck
Robot-hours versus LLM tokens: the log-log reality of embodied data and teleop-farm economics.
- Sim-to-Real Transfer
Domain randomization, teacher-student distillation, system identification, and real-to-sim correction.
- The Reliability Gap
80% is a demo, 99.9% is a product: what deployment numbers actually show.
Linked from
- RL Fine-Tuning of Policies
DPPO, ConRFT, Recap, pi_RL, residual RL, and HIL-SERL: closing the reliability gap with on-policy experience.
- Robot Learning Curriculum for ML Engineers
A dependency-aware route from supervised learning to real robot policies, with the minimum robotics stack each stage assumes.
- World Model Evaluation for Robotics
Visual fidelity is not enough: evaluate action sensitivity, rollout consistency, task progress, policy ranking and real-world agreement.
- The Reliability Gap
80% is a demo, 99.9% is a product: what deployment numbers actually show.
- Generalization
What the pi0.5 and pi0.7 results demonstrate, and what they do not: the open-world gap.
- Competing Theses
End-to-end scaling versus hierarchy versus world models versus RL fine-tuning, with falsification criteria.
- The Bear Case
Why this could be another robotics winter, and the milestones that would prove it wrong.
References
TRI LBM Team, Jose Barreiros, Andrew Beaulieu, Aditya Bhat, Rick Cory, Eric Cousineau, Hongkai Dai, Ching-Hsin Fang, and 74 more, 2025.
https://arxiv.org/abs/2507.05331
Cheng Chi, Zhenjia Xu, Siyuan Feng, Eric Cousineau, Yilun Du, Benjamin Burchfiel, Russ Tedrake, Shuran Song, 2023.
https://arxiv.org/abs/2303.04137
David Snyder, Asher James Hancock, Apurva Badithela, Emma Dixon, Patrick Miller, Rares Andrei Ambrus, Anirudha Majumdar, Masha Itkina, and 1 more, RSS 2025.
https://arxiv.org/abs/2503.10966
Bo Liu, Yifeng Zhu, Chongkai Gao, Yihao Feng, Qiang Liu, Yuke Zhu, Peter Stone, 2023.
https://arxiv.org/abs/2306.03310
Senyu Fei, Siyin Wang, Junhao Shi, Zihao Dai, Jikun Cai, Pengfang Qian, Li Ji, Xinzhe He, and 5 more, 2025.
https://arxiv.org/abs/2510.13626
Xuanlin Li, Kyle Hsu, Jiayuan Gu, Karl Pertsch, Oier Mees, Homer Rich Walke, Chuyuan Fu, Ishikaa Lunawat, and 8 more, 2024.
https://arxiv.org/abs/2405.05941
Pranav Atreya, Karl Pertsch, Tony Lee, Moo Jin Kim, Arhan Jain, Artur Kuramshin, Clemens Eppner, Cyrus Neary, and 24 more, 2025.
https://arxiv.org/abs/2506.18123
Adina Yakefu, Bin Xie, Chongyang Xu, Enwen Zhang, Erjin Zhou, Fan Jia, Haitao Yang, Haoqiang Fan, and 29 more, 2025.
https://arxiv.org/abs/2510.17950
Alexander Khazatsky, Karl Pertsch, Suraj Nair, 2024.
https://arxiv.org/abs/2403.12945
Spot a factual error or missing qualification? Report a content correction.