Is Your Imitation Learning Policy Better than Mine? Policy Comparison with Near-Optimal Stopping

Imitation learning has enabled robots to perform complex, long-horizon tasks in challenging dexterous manipulation settings.As new methods are developed, they must be rigorously evaluated and compared against corresponding baselines through repeated evaluation trials.However, policy comparison is fundamentally constrained by a small feasible sample size (e.g., 10 or 50) due to significant human effort and limited inference throughput of policies.This paper proposes a novel statistical framework for rigorously comparing two policies in the small sample size regime.Prior work in statistical policy comparison relies on batch testing, which requires a fixed, predetermined number of trials and lacks flexibility in adapting the sample size to the observed evaluation data.Furthermore, extending the test with additional trials risks inducing inadvertent p-hacking, undermining statistical assurances.In contrast, our proposed statistical test is sequential, allowing researchers to decide whether or not to run more trials based on intermediate results.This adaptively tailors the number of trials to the difficulty of the underlying comparison, saving significant time and effort without sacrificing probabilistic correctness.Extensive numerical simulation and real-world robot manipulation experiments show that our test achieves near-optimal stopping, letting researchers stop evaluation and make a decision in a nearminimal number of trials.Specifically, it reduces the number of evaluation trials by up to 32% as compared to state-of-theart baselines, while preserving the probabilistic correctness and statistical power of the comparison.Moreover, our method is strongest in the most challenging comparison instances (requiring the most evaluation trials); in a multi-task comparison scenario, we save the evaluator more than 160 simulation rollouts.* Nmax for each scenario.This selection is heuristically reasonable, but leaves potential for further improvements in future work.

Authors

Publication Details

Published
2025-06-21
DOI
https://doi.org/10.15607/rss.2025.xxi.077
Primary Topic
Auction Theory and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Is Your Imitation Learning Policy Better than Mine? Policy Comparison with Near-Optimal Stopping

Patrick Miller, Masha Itkina, Rareş Ambruş, Erica Dixon et al.
Auction Theory and Applications
article

Is Your Imitation Learning Policy Better than Mine? Policy Comparison with Near-Optimal Stopping

Patrick Miller, Masha Itkina, Rareş Ambruş, Erica Dixon, David Snyder, Haruki Nishimura, Apurva Badithela, Anirudha Majumdar, Asher J. Hancock
article en

Abstract

Imitation learning has enabled robots to perform complex, long-horizon tasks in challenging dexterous manipulation settings.As new methods are developed, they must be rigorously evaluated and compared against corresponding baselines through repeated evaluation trials.However, policy comparison is fundamentally constrained by a small feasible sample size (e.g., 10 or 50) due to significant human effort and limited inference throughput of policies.This paper proposes a novel statistical framework for rigorously comparing two policies in the small sample size regime.Prior work in statistical policy comparison relies on batch testing, which requires a fixed, predetermined number of trials and lacks flexibility in adapting the sample size to the observed evaluation data.Furthermore, extending the test with additional trials risks inducing inadvertent p-hacking, undermining statistical assurances.In contrast, our proposed statistical test is sequential, allowing researchers to decide whether or not to run more trials based on intermediate results.This adaptively tailors the number of trials to the difficulty of the underlying comparison, saving significant time and effort without sacrificing probabilistic correctness.Extensive numerical simulation and real-world robot manipulation experiments show that our test achieves near-optimal stopping, letting researchers stop evaluation and make a decision in a nearminimal number of trials.Specifically, it reduces the number of evaluation trials by up to 32% as compared to state-of-theart baselines, while preserving the probabilistic correctness and statistical power of the comparison.Moreover, our method is strongest in the most challenging comparison instances (requiring the most evaluation trials); in a multi-task comparison scenario, we save the evaluator more than 160 simulation rollouts.* Nmax for each scenario.This selection is heuristically reasonable, but leaves potential for further improvements in future work.

Openalex Percentile: Top 72%
Auction Theory and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.