- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes RecallNav, a model for lifelong navigation. Its main contribution is to introduce goal-agnostic visual memory storage and the corresponding image retrieval mechanism. This allows the agent to retrieve relevant images in advance when handling subsequent subtasks in a lifelong navigation setting, providing additional visual evidence for downstream decisions. The experiments demonstrate that RecallNav achieves strong performance using a relatively small backbone model of around 3B–4B parameters, together with a 2B-parameter memory retrieval module.
Critical strengths
1.The paper achieves strong empirical performance using relatively small models, with a 3B or 4B backbone and a 2B embedding model, outperforming some 7B models. This suggests that lifelong navigation can be addressed effectively with smaller models through a well-designed overall architecture. This is a meaningful finding.
2.The ablation studies validate the contribution of visual memory retrieval, demonstrating that it improves the model's performance on subtasks.
Critical weaknesses
1.The visual memory in the experiments is stored without any capacity constraints. This seems inconsistent with the goal of lifelong navigation, where memory scalability is an important consideration. Since the number of subtasks within an episode is still limited in current benchmarks, the method can complete the tasks by relying on this effectively unbounded storage strategy. However, unlimited memory storage is not a reasonable assumption for genuine lifelong navigation.
2.The title and abstract claim that the method learns when to recall and where to search, but the proposed framework does not appear to substantiate these claims. Both when to recall and where to search are determined by fixed components of the framework, rather than being explicitly learned or decided by the policy model. Essentially, the model is trained to make decisions based on the available, more relevant visual evidence, such as retrieved memories. Recall is performed as part of the ongoing process rather than being triggered by a learned decision about when it is needed. Meanwhile, the search location is determined using retrieved images and their associated depth maps. Therefore, the framework does not explicitly learn when to recall or where to search, despite the claims made in the paper.
Questions for authors
None.
5 comments
Response to Reviewer 83rC (2/2)
[W2]: Learned recall and search decisions
RecallNav learns whether to recall a target and which frontier to explore. The policy either selects frontier through EXPLORE() or selects image and predicts the target's bounding box through FOUND() (Eq. 1). Eq. 2 supervises the complete action output. This learned action choice is also recognized in Reviewer hEny's W2 and Reviewer Qpvm's summary.
“When to recall” is the policy's decision to select a historical image through FOUND(). Retrieval runs at every decision to supply candidate images. The policy then chooses whether to ground the target in memory, ground it in a current view, or continue exploring. Section 3.3 defines recall as the return visit triggered by grounding in memory, followed by a new panorama and another policy decision. We have clarified this distinction between candidate retrieval and an executed recall.
“Where to search” is the policy's selection of frontier through EXPLORE(). The depth-based destination computation mentioned in the review applies to executing FOUND(): it converts the policy-selected image and predicted target box into a reachable destination using depth and camera pose. This computation follows the policy's grounding prediction and does not select the exploration frontier.
Recall supervision improves navigation with the retrieval procedure and controller fixed. Replacing memory-recall training examples with an equal number of current-view examples reduces SR from 81.0% to 62.5% (Table 4). On identical held-out contexts, RecallNav achieves 80.4% macro-averaged agreement with expert decision categories, compared with 45.2% for No SFT (Table R2).
Gentle Reminder
Dear Reviewer 83rC,
Thank you again for your time and effort in reviewing our paper.
As the discussion period draws to a close, we would like to kindly remind you that approximately two days remain for further comments or questions. We would greatly appreciate any feedback on our rebuttal and additional experimental results, and welcome the opportunity to address any remaining questions or concerns before the discussion period ends.
Thank you very much for your time and consideration.
Best regards,
Authors
Response to Reviewer 83rC (1/2)
We thank the reviewer for recognizing the empirical results and for raising concerns about memory capacity and the role of the learned policy. We address these points with fixed-budget archive evaluations and a clarification of the learned action interface.
[W1]: Memory capacity
RecallNav largely preserves its navigation performance under fixed archive budgets. Our focus is on using previously collected observations to support navigation under subsequent goals, as also noted by Reviewer hEny. In the static scenes evaluated here, repeated visits can produce overlapping views. We used this spatial redundancy to decide which observations to remove in Table R6. Developing adaptive memory management policies that better preserve evidence for unknown future goals under fixed storage budgets remains a direction for future work.
We evaluated 100- and 200-frame limits without retraining on all 360 Val-Unseen episodes. Each limit is fixed across all goals and episodes in its condition. The retention rule uses overlap among views in the static scenes evaluated here: panoramas captured before policy decisions are prioritized; the current panorama and images representing frontiers are retained and counted toward the budget. We first remove other images collected during movement or episode initialization, followed by past panoramas if needed. Within each group, the views most redundant in position and viewing direction are removed first.
Table R6. Memory retention in the main NavMesh setting: Qwen2.5-VL-3B, all 360 GOAT-Bench Val-Unseen episodes / 2,669 goals. Frame counts and storage are averaged over policy decisions; storage is in decimal MB.
Table R5 in our response to Reviewer Qpvm reports a separate TSDF evaluation on 36 Val-Unseen episodes (278 goals), in which both the 100- and 200-frame limits were satisfied at every decision. The two experiments use the same retention priorities but differ in frontier construction and episode coverage. Appendix K.3 includes both evaluations. Section 5 now distinguishes these fixed-budget results from the remaining challenge of adaptive retention for unknown future goals and memory updates in dynamic environments.