- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies selection failures in frozen open-vocabulary detectors. A correct candidate may already exist in the proposal field yet never appear in the final output. The authors identify two causes: appended labels can evict unchanged candidates through shared finite caps, and scalar confidence can misrank localization quality. They verify that preserved scores stay unchanged when labels are added, and show that relaxing the final cap alone removes most of the vocabulary-induced loss. Based on this diagnosis, the paper proposes VoPR, a training-free calibration applied between one frozen forward pass and an unchanged selector. PVR adjusts class admission via bounded, image-conditioned class offsets derived from top-M proposal support and spatial consistency. CQC refines individual candidates via semantic competition against nearby text classes, top-L redecoding of the native DFL box distributions, and non-self peer agreement fused with confidence. A selector-level theorem shows that class-broadcast offsets can only admit prefixes of the native NMS-survivor sequences, which motivates the candidate-specific second stage. Experiments use paired same-process comparisons on WeDetect at three scales, covering component comparisons, a held-out composition audit, distractor-vocabulary tests, cross-architecture ports, and latency measurements. The method yields consistent positive gains on COCO, LVIS, and COCO-O under fixed output budgets.
Critical strengths
1.The paper addresses a recognized problem in open-vocabulary detection. Vocabulary-induced degradation and confidence–localization misranking are both documented in prior work (e.g., LOVD, VocAda, and the localization-confidence literature). The paper gives them a unified account at the selector level, which is a clear and useful framing. 2. The method has practical value as a genuine plug-in. Many deployments must keep the detector frozen: no training data, no retraining budget, and a fixed output budget. VoPR operates between one frozen forward pass and an unchanged selector. It needs no training and no parameter updates, and it leaves the native post-processing pipeline intact. It is orthogonal to representation learning and can be attached to existing checkpoints that expose dense class logits and box distributions. 3. The reasoning chain from diagnosis to design is complete. Cap-relaxation interventions verify the claimed failure pathway. The class-wise prefix-constraint theorem identifies what class-level routing cannot do, which motivates the candidate-specific second stage. Component experiments then test each stage separately. Diagnosis, theory, and method are internally consistent.
Critical weaknesses
- No comparison with same-field methods. Vocabulary-induced degradation is documented in LOVD and VocAda. Confidence–localization misranking is documented in the localization-confidence literature. Training-free test-time corrections for detection already exist: ViTPrompt (CVPR 2026) refines boxes and scores at test time, and BCA+ (Zhou et al., 2025) adapts class scores without training. None of these is cited or compared. Neither are ProCal, FRACAL, or faithful AggDet. All gains are measured only against the paper's own pre-trained baseline. The cross-architecture ports were "selected on their evaluation splits," in the authors' own words. The advantage over existing training-free corrections is not established.
- Marginal gains at a non-negligible cost. Filtering and refining candidate boxes is known to help detection (Soft-NMS, Fitness NMS, IoU-Net, AggDet). Against this backdrop, the gains here are small: +0.20–0.35 COCO AP, no change in relative standing, LVIS deltas down to +0.06 AP without uncertainty quantification. The cost is heavy for a test-time method. The exact variant adds roughly 85% inference latency; the sparse variant adds about 30%. For training-free test-time correction, lightweight deployment is the main appeal. This trade-off is never weighed against cheaper options (PVR-only routing, relaxed output caps).
- Too many hyperparameters for a training-free method. The sensitivity audit alone sweeps ten hyperparameters per model scale (Appendix H, Table 17). Tiny adds two more (J and δ; Table 15). Several frozen values differ across scales, with no stated principle. All were tuned on COCO val2017 — the same split used for the headline results. The five-fold audit keeps the hyperparameters fixed and corrects only the composition choice, on one scale. Its estimate (+0.16) falls below the headline (+0.20). For a method claiming "no training, no parameter updates," this hand-tuning is a hidden cost.
Questions for authors
- In TTA, nearly every method improves over the frozen pre-trained baseline. Baseline-relative gains alone therefore cannot establish effectiveness. Can you compare VoPR against TTAOD baselines under the same protocol (e.g., ViTPrompt, BCA+, ProCal, FRACAL, or AggDet)? And can you state the method's scope of application — which distribution shifts, vocabulary regimes, and detector families it targets?
- The many hyperparameters ease reproduction but reduce the method's practical value. Can you justify the necessity of each hyperparameter? Is there a minimal configuration that retains most of the gain?
- The full inference pipeline nearly doubles the computation cost. At this price, many alternative methods become viable substitutes. Can you add orthogonality tests with other modules (e.g., existing test-time corrections) and verify that the gains stack? Such results would markedly strengthen the paper.