Methodology

Reference definition

The reference is the implementation recorded for each run. Its provider, precision and measurement conditions identify the baseline. Speedup is reference latency ÷ optimized latency on the same board, rounded to one decimal.

Measurement boundaries

Each run says what one number covers: a policy call at p50, a frame interval, or an action chunk. A frame interval is not single-frame latency.

Boundaries must match on both sides of a comparison. When they do not, the row carries a note that says how, and a mismatch that works against the faster path is flagged as conservative.

Quality results

Speed is listed with the quality result measured with it: closed-loop success for policies, mask IoU for tracking, token-exact agreement for grounding models, max_abs difference for actor networks.

A recorded quality result does not imply a pass/fail threshold. Where a paired test on common seeds exists, such as McNemar, it is shown next to the point estimate. A point estimate alone does not prove that quality was preserved.

Configuration changes

A change to the denoise schedule or step count is a different configuration and is named in the measurement conditions. Read quality results with their evaluation suite. Paths recorded as variants are excluded from the fastest-path comparison.

Evidence states

Every value is in exactly one state. A missing value is never shown as zero and never inferred from a neighbouring row.

Records and reproduction

Open measurement details for the implementation, precision and test conditions behind each result. Source reports are linked when available.

What this site is not

It is not a universal ranking and not a hardware support list. It is not physical-robot validation unless a row says so.