Inference-time medoid selection for stochastic robot action chunks
Teams running diffusion or flow-matching robot policies can add a wrapper that samples several action chunks for the same observation and instruction, clusters those chunks in action space, and executes the medoid of the largest cluster. This is a deployable change because it does not require retraining the policy or training a separate scorer.
KeyStone is the concrete template. It batches K sampled action chunks, uses L2 distance over flattened action trajectories, and chooses an actual sampled chunk, which avoids averaging across different motion modes. Reported gains are large enough to justify a local A/B test: GR00T N1.6 on SimplerEnv-WidowX rose from 50.0% to 63.3% success at K=4, and SmolVLA on LIBERO rose from 50.4% to 57.2% at K=16. A robotics team can test this by logging single-sample failures, replaying the same tasks with K in {4, 8, 16}, and accepting the wrapper only if the added latency fits the control loop.