Model Benchmarking

Computer-vision benchmarking compares models under the same data, preprocessing, metrics, and deployment constraints. It should connect task scores from detection and segmentation metrics to practical constraints such as latency, memory, calibration, and domain shift.

What a benchmark specifies

A benchmark should specify a tuple

where is a frozen dataset, is the metric set, is the slice taxonomy, and is the compute environment. Reporting only misses false-positive cost, recall requirements, and runtime.

For detector benchmarks, should include both ranking metrics and operating-point metrics. Detection and segmentation metrics defines AP50, AP75, COCO-style mAP, AR@K, and error buckets such as miss, duplicate, localization, and background rates. Reporting only one mAP number can hide whether the model fails by missing objects, drawing loose boxes, duplicating detections, or ranking background boxes too high.

Worked benchmark comparison

On a 10-image binary benchmark with 5 positives, compare two candidate models:

modelcorrect predictionstrue positives foundfalse positiveslatency
fast7 of 103 of 5112 ms
slow9 of 104 of 5047 ms

The resulting metrics are

modelaccuracyrecallfalse positiveslatency
fast112 ms
slow047 ms

The slow model is better on accuracy, recall, and false positives, but it is almost four times slower. If the product needs sub-20 ms inference, the fast model may still be the deployable choice even though its task metrics are worse.

Caveats

Benchmark leakage is common: duplicate images, slices from the same patient, near-identical video frames, or training-set augmentations in the test set. For object detection, match image size and NMS settings; for image classification, report class imbalance and calibration.

References