- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes PROW, a neighborhood-aware representation learning framework for open-world object detection (OWOD). Its key idea is to reuse neighborhood relations among known-class prototypes as a shared relational structure for two objectives: local class discrimination and multi-component foreground modeling.
Critical strengths
Complete incremental design: inherited prototypes/graph, frozen-teacher pseudo labels, and replay are combined; ablations show pseudo labels mainly preserve known classes while replay mainly improves U-Recall.
Strong empirical results: leading U-Recall and K-mAP on most M-OWODB tasks, clear A-OSE reduction, and reasonably thorough ablations and hyperparameter sensitivity.
Lightweight: only about 2% additional parameters relative to the base detector.
Critical weaknesses
Limited detector/backbone scope: only Deformable DETR + ResNet50 + DINO pretraining is evaluated. Other DETR variants or stronger backbones is unverified.
Graph construction depends on matched positive query quality: both graph updates and local discrimination rely on matched positives. Inaccurate matching, few samples, or class imbalance may introduce noisy relations.
Heuristic component threshold: the mean off-diagonal adjacency weight is used as the grouping threshold, and the number of components may fluctuate during training; stability and its effect on objectness are not fully analyzed.
Questions for authors
How does the number of components Mt evolve during training? Can the mean threshold cause large fluctuations in Mt? Could you report sensitivity of Mt?
What are the precision and recall of pseudo labels? Over longer task sequences, can frozen-teacher pseudo labels accumulate errors?
Can the method transfer to other DETR variants or CNN detectors?
Q1. Table 6 reports the actual component counts and full size distributions on M-OWODB. As the known classes expand from 20 to 40, 60, and 80, the recorded graphs contain 3, 5, 7, and 9 components. Component sizes range from 4–12, 4–14, 4–14, and 3–21 prototypes, respectively. The largest component contains 60% of prototypes in Task 1 and at most 35% in Tasks 2–4. Across the reported tasks, the learned prototype graph produces multiple foreground components, with no collapse into a single connected component and no singleton components.
Figure 3 further shows how the connected-component structure of the learned prototype graph evolves during training. Task 1 maintains three components over epochs 13–39, while Task 2 maintains five components over epochs 78–109. Adjacent-epoch ARI remains 1.0 over epochs 14–39 in Task 1 and 80–109 in Task 2, indicating that class prototypes retain the same foreground-component assignments during these intervals. Edge Jaccard also exhibits smaller fluctuations during later training, showing more consistent overlap between consecutive edge sets.
Appendix D.2 examines threshold sensitivity on the same fixed Task-1 graph. Thresholds of 0.9, 1.0, and 1.1 times the mean off-diagonal edge weight all yield three components of sizes 12, 4, and 4. Thus, the component count and size distribution remain unchanged under the tested ±10% threshold perturbations.
Manuscript revision: We add graph statistics and dynamics to Section 4.4 (Table 6 and Figure 3), with threshold sensitivity analysis in Appendix D.2.
Q2. As detailed in Appendix A.2, we report the precision and recall of old-class pseudo-labels across the three task transitions, which are 89.5%/33.4%, 94.3%/32.7%, and 91.1%/29.2%, respectively, at IoU≥0.5. The consistently high precision suggests that pseudo-label noise is relatively limited, despite the lower recall. Moreover, Table A.2 shows consistent improvements with replay across subsequent tasks. Specifically, replay improves U-Recall and K-mAP from 35.7 to 38.7 and from 50.6 to 51.7 on Task 2, respectively. On Task 3, the corresponding improvements are from 29.8 to 32.7 and from 44.4 to 46.4. On Task 4, K-mAP increases from 42.1 to 44.8. These results suggest that replay helps mitigate the impact of imperfect pseudo-labels. While error propagation across tasks cannot be entirely ruled out [1], these results provide empirical support for the effectiveness of replay.
Manuscript revision: We add the ablation results of pseudo-label supervision and replay across incremental tasks in Table A.2 (Appendix A.2).
Q3. PROW can also transfer beyond DETR to a CNN detector. We implement it on RandBox-based Fast R-CNN using the same training and inference configuration as OrthogonalDet, which differs from the main Top-100 setting. Table B.1 shows that PROW improves U-Recall by 9.0/5.6/4.4 percentage points and reduces A-OSE by 584/136/238 on M-OWODB Tasks 1–3. K-mAP also increases by 1.5/1.3/1.1/0.2 percentage points across Tasks 1–4.
Manuscript revision: We add experiments evaluating transfer to a CNN-based detector in Appendix B (Table B.1).
References
[1] Qiuchen Wang, Zehui Chen, Chenhongyi Yang, Jiaming Liu, Zhenyu Li, and Feng Zhao. PseDet: Revisiting the Power of Pseudo Label in Incremental Object Detection. ICLR, 2025.