CertOD: Class-Conditional Pair Certificates for Matched Object Detections in Autonomous Driving
Abstract
Object detection combines a discrete class and a continuous box. Certifying both under class-specific error budgets requires a joint guarantee conditional on the true class, which is unknown at inference, so selecting a geometric margin by the detector's possibly incorrect top-1 label does not establish that guarantee. CertOD instead emits per-class pair certificates: one calibrated box for each surviving class hypothesis. Under within-class exchangeability it provides finite-sample coverage of the event that the true class is retained and its associated box contains the object, at each class's prescribed level for matched detections of certifiable classes. Against a matched single-box control, pairs reduce retained true-class pedestrian area by (median) and (p90) on BDD100K at a exclusion rate; CODA2022 reproduces the tail benefit (– across four common classes). The gain requires a consumer that retains class–box associations: the smallest axis-aligned envelope of all pairs is exactly the conservative single box. Supremum scoring lowers the finite-quantile sample threshold roughly fourfold against coordinate Bonferroni without shrinking pedestrian boxes, and unified joint scoring is larger in median area wherever the class set is held fixed. We also report three boundaries: of BDD100K pedestrians match no proposal, zero-shot transfer of BDD thresholds to CODA2022 misses all eight tested score–class targets, and the repair weakens as the detector sharpens—on the misclassified slices its joint coverage falls from to across four backbones, because a better classifier yields smaller class sets.
est. 32% chance this paper gets accepted at ICLR 2027.
What do you think this paper will get?
All positions stay anonymous.