- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes ProtoConv for navigation to goals specified by categories, images, or instance descriptions. A prototype graph stores prior observations in multiple forms and their relations. Each goal retrieves three form-specific roots, which are expanded into kernels using random walks with restart. These kernels are matched against an online semantic graph, and the responses guide waypoint selection. Experiments cover ObjectNav, image- and text-specified instance navigation, and sequential goals on GOAT-Bench.
Critical strengths
-
The method allows a goal expressed in one form to retrieve appearance features, descriptions, and spatial context from prior observations. Separating the prototype graph from the online semantic graph gives a clear account of how cross-scene experience can support current goal grounding within a shared navigation framework.
-
ProtoConv retrieves goal-conditioned kernels to focus on relevant prior knowledge. Its proposed matching function considers both node content and relation sequences, providing contextual evidence beyond appearance similarity. The explicit kernels and spatial response maps also make it easier to inspect which retrieved cues support waypoint selection.
Critical weaknesses
-
Equation (3) defines a probability distribution with at least mass at the root; Appendix A.2 confirms that the probabilities sum to one. With , every non-root node therefore has probability at most 0.5. Applying the cutoff with in Eq. (4) excludes all non-root nodes, leaving only the explicitly retained root. Under the stated rule, the kernels would therefore contain no non-root relational context, which is inconsistent with the multi-node examples in Figure 3 and makes the relation-matching gains reported in Table 2 difficult to reconcile with the formulation. The preceding text instead describes retaining a top fraction, but Appendix A.2 repeats the absolute cutoff. The authors need to clarify the implemented rule and report the resulting kernel sizes. This may be a specification error, but it leaves the central mechanism and its experimental interpretation unresolved.
-
Equation (5) does not define its normalization factor . The relation indicator also refers to a path from each root to a node without specifying how to handle multiple paths with different relation sequences, or whether cycles and repeated nodes are permitted. These choices determine which evidence contributes and when propagation terminates. Appendix A.3 repeats the path indicator without resolving these ambiguities. Explicit definitions or pseudocode for normalization, path selection or aggregation, and termination are needed to reproduce the response scores on which waypoint selection depends.
Questions for authors
-
Which kernel-retention rule was actually used in the reported experiments: an absolute probability cutoff, a top-ranked fraction, or another rule? At and , how many nodes did the resulting kernels typically contain?
-
What is the exact definition of in Eq. (5), including when there are no valid matches at a given depth? Does normalization depend on all candidate node pairs or only relation-consistent pairs?
-
When several paths connect a root to the same node, which paths contribute to Eq. (5), and how are their contributions combined? Are edge direction and repeated nodes taken into account, and what terminates propagation in graphs with cycles?