- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces RING-Nav, a training-free method capable of solving diverse navigation tasks in a unified framework. RING-Nav integrates task progress, episodic memory, and spatial evidence into CNS, which is then applied to tool decision-making and execution in SGTO. RSI-EG is proposed to store cross-episode tool executions and can be used in subsequent episodes through relevant experience retrieval.
Critical strengths
- Improving a unified navigation system without repeatedly fine-tuning models on diverse tasks is a practical direction.
- The empirical results are promising. The gains in R2R-CE and OmniNavBench suggest that the framework may offer practical benefits beyond simply deploying a fixed underlying vision-language model.
Critical weaknesses
- The central claim of RSI is insufficiently substantiated.
The experience graph evolves primarily through the accumulation of cross-episode records, while the procedures of retrieval, utility estimation, and decision fusion remain fixed. Improving task performance with a growing memory does not mean that the system is recursively improving itself. The paper does not demonstrate that the agent or the RSI-EG is becoming better (e.g., better estimation, better retrieval, or generating useful improvements) over iterations.
Moreover, as the central aspect of the paper statement, the authors should provide related work on RSI.
- The difference from conventional experience-based memory is unclear.
The current mechanism appears closely related to retrieval-augmented decision-making. For example, Expel [1] leverages experience accumulated in previous tasks to improve performance without fine-tuning. The authors should clarify the difference between RSI and experience retrieval methods.
- Concern about unfair evaluation.
RING-Nav maintains cross-episode tool execution history to inform subsequent navigation decisions. However, the applied benchmarks typically evaluate episodes independently, without allowing information leakage from other test episodes. Since test episodes may be conditioned in identical environments, inter-episode information sharing during evaluation risks introducing information leakage—thereby compromising evaluation fairness. For instance, in object navigation tasks, if the target object (e.g., a chair) has already been observed in a prior episode, the agent may bypass essential exploration behaviors, artificially inflating performance metrics. To ensure fair comparison, the authors should evaluate on lifelong (e.g., goat [2]) or continual learning (e.g., C-Nav [3]) benchmarks, which inherently allow the use of information from previous episodes.
- Missing many details.
The definitions of active subtask, current progress, and episodic memory in lines 208–209 are not specified. The weight values in the formulas of section 3.3 are not provided. The inputs and outputs of each tool are not explained. The harness prompt is not provided. The absence of these details critically undermines the method’s reproducibility.
[1] Expel: Llm agents are experiential learners (AAAI2024)
[2] Goat-bench: A benchmark for multi-modal lifelong navigation (CVPR2024)
[3] C-nav: Towards self-evolving continual object navigation in open world (NeurIPS2026)
Questions for authors
- What is the precise definition of the recursive self-improving in RING-Nav?
- Does the system become more effective at improving itself over successive iterations?
- Does the order of episodes have a significant impact on the evaluation results?
6 comments
Response to Reviewer GohK (2/5)
3. Because multiple navigation tools can successfully complete the same subgoal, tool selection generally lacks a unique ground-truth label. We therefore assess the navigation policy produced by successive RSI-EG updates through task success (SR) and success-weighted path efficiency (SPL). We track both metrics over 0–600 development episodes on VLN-CE, OGN, and OmniNavBench, averaging OGN results across HM3D and MP3D.
We also evaluate context-conditioned historical-utility guidance through the w/o ablation in Table 1. Although resembling conventional experience-based memory, this guidance addresses a specific challenge of embodied navigation. Whereas digital agents often receive structured states and tool feedback, embodied agents face perceptual errors and motion-induced observation changes that can degrade visual, geometric, and execution-feedback inputs, leading to decisions without sufficient evidence. RSI-EG supplements VLM reasoning with historical utility estimated through rule-based experience retrieval, providing a harness-level constraint intended to reduce unreliable judgments and unsupported reasoning.
For the full method (with ), increasing experience from 0 to 600 episodes raises SR/SPL from 36.0%/32.2% to 62.0%/52.6% on VLN-CE, from 44.3%/19.6% to 57.8%/25.7% on OGN, and from 12.5%/8.6% to 28.8%/21.2% on OmniNavBench. Starting from the same initial results, w/o reaches only 40.0%/32.7%, 48.8%/19.9%, and 18.8%/12.3%, respectively, with smaller gains and partial declines in later rounds. At 600 episodes, the full method exceeds this variant by an average of 13.7% in SR and 11.5% in SPL. We have added the corresponding performance curves to Fig. 4 of the revised manuscript.
These results support cumulative improvement in the navigation policy through successive RSI-EG updates and the contribution of historical-utility guidance alongside experience-informed reasoning. They also support our design motivation: constraining unreliable VLM decisions under perceptual uncertainty helps translate accumulated experience into larger, more sustained navigation gains.
Table 1. Navigation performance across successive episodes. The full method (with ) combines experience-informed VLM reasoning with context-conditioned historical value. The w/o variant retains experience-informed agent reasoning but removes this . Column headings indicate accumulated episodes; all SR and SPL values are percentages.
| Mode | Task | Metric | 0 | 120 | 240 | 360 | 480 | 600 |
|---|---|---|---|---|---|---|---|---|
| with | VLN-CE | SR | 36.0 | 53.0 | 57.0 | 60.0 | 62.0 | 62.0 |
| SPL | 32.2 | 47.2 | 49.8 | 51.6 | 52.5 | 52.6 | ||
| OGN | SR | 44.3 | 53.1 | 55.4 | 56.9 | 57.6 | 57.8 | |
| SPL | 19.6 | 22.4 | 23.1 | 24.6 | 25.8 | 25.7 | ||
| OmniNavBench | SR | 12.5 | 22.5 | 25.0 | 27.5 | 28.8 | 28.8 | |
| SPL | 8.6 | 14.9 | 16.5 | 17.6 | 21.2 | 21.2 | ||
| w/o | VLN-CE | SR | 36.0 | 39.0 | 41.0 | 43.0 | 43.0 | 40.0 |
| SPL | 32.2 | 34.0 | 33.6 | 35.6 | 35.2 | 32.7 | ||
| OGN | SR | 44.3 | 46.0 | 47.8 | 49.2 | 49.2 | 48.8 | |
| SPL | 19.6 | 20.1 | 20.7 | 21.3 | 21.3 | 19.9 | ||
| OmniNavBench | SR | 12.5 | 16.3 | 17.5 | 20.0 | 20.0 | 18.8 | |
| SPL | 8.6 | 10.2 | 11.8 | 13.2 | 12.8 | 12.3 |
Response to Reviewer GohK (3/5)
4. We thank the reviewer for this constructive suggestion and have added related work on RSI to the revised manuscript:
Recursive Self-Improvement (RSI) broadly concerns systems using their own capabilities and feedback to improve themselves, with definitions varying in what is improved and how recursion is realized. Mechanism-level approaches explore self-modifying weights and the optimization of programs or algorithms that drive subsequent improvement [irie2022selfreferential, zelikman2024stop, ishibashi2025selfdeveloping, zhang2026hyperagents, liu2026evox]. Agent-level approaches enable cumulative improvement through execution-logic modification, successor evaluation, and evolutionary search [yin2025godel, zhang2026darwin, wang2026huxley], as well as experience sharing [weng2026gea] and memory-based adaptation [ouyang2026reasoningbank]. Self-generated rewards and interaction data also support iterative model improvement [yuan2024selfrewarding, wu2025metarewarding, zhang2026rsir]. Consistent with our harness-level view of RSI, SpecForge iteratively refines external behavioral specifications using execution feedback while keeping model weights and the search procedure fixed [cheng2026specforge]. However, embodied RSI must account for spatial constraints and context-dependent tool effectiveness [liu2026mobiagent], which RING-Nav addresses through geometry-aware experience retrieval and adaptive tool decision fusion.
W2
W2 The difference from conventional experience-based memory is unclear. The current mechanism appears closely related to retrieval-augmented decision-making. For example, Expel [1] leverages experience accumulated in previous tasks to improve performance without fine-tuning. The authors should clarify the difference between RSI and experience retrieval methods.
Our RSI recursively connects experience updates with subsequent experience acquisition. In ExpeL’s reported protocol [2], experiences collected through ReAct and Reflexion support insight extraction and retrieval-augmented evaluation; the resulting cross-task knowledge is not fed back into another collection round. In RING-Nav, the experience graph guides tool decisions, their execution outcomes update the graph, and the updated graph guides subsequent decisions and experience acquisition. Thus, each updated harness generates experience for its own subsequent update, establishing the harness-level RSI defined in Q1. For fair comparison with zero-shot methods, RSI-EG is frozen during evaluation on VLN-CE, OGN, and OmniNavBench, with no test interactions written back.
[2] ExpeL: LLM Agents Are Experiential Learners (AAAI 2024).
Response to Reviewer GohK (1/5)
We are encouraged by the reviewer’s recognition of the practical value of training-free unified navigation and positive assessment of our promising results on R2R-CE and OmniNavBench. We address all the concerns point by point through clarifications of RSI and evaluation protocols, additional cumulative-improvement, GOAT-Bench, and episode-order experiments, and expanded RSI related work and implementation details.
Q1
We thank the reviewer for requesting a clearer RSI definition and supporting evidence. For Q1, we define harness-level RSI as cumulative improvement arising from feedback between an agent’s evolving experience and decision-making. This interpretation is closely related to SpecForge [1], accepted to NeurIPS 2026, which refines external behavioral specifications through execution feedback while keeping model weights and the search procedure fixed.
In RING-Nav, the current experience graph guides tool decisions; the resulting episodes and execution outcomes update the graph, which then guides decisions and experience acquisition in the next episode. Thus, each updated harness helps generate the experience used for its subsequent update.
We have added this definition to the Introduction of the revised manuscript.
[1] SpecForge: Recursive Self-Improvement for Coding Agents via Behavioral Specifications (NeurIPS 2026).
W1 and Q2
We thank the reviewer for these constructive comments. We respond in four parts:
1. The tool-selection decision in manuscript Eq. (7) is
=\underset{(u_j,\xi)\in\mathcal{A}_t}{\arg\max} \left[ \left(1-\lambda_{ij}^{(n)}(x_t^{j,\xi})\right)L_t(j,\xi) +\lambda_{ij}^{(n)}(x_t^{j,\xi})Q_{ij}^{(n)}(x_t^{j,\xi}) \right].$$ First, the agent directly uses retrieved experience before assigning candidate scores $L_t(j,\xi)$. As the graph evolves, changing evidence can alter its reasoning and assessment of candidate tools. Second, both $Q_{ij}^{(n)}$ and $\lambda_{ij}^{(n)}$ are adaptive: Eqs. (5)–(6) compute historical utility from relevant execution outcomes and the fusion weight from their effective support in the current navigation context. Graph updates can therefore change both a candidate’s estimated utility and the influence of historical evidence on its selection. **2.** As clarified in Q1, recursion is the feedback between the evolving experience graph and the policy generating its updates: the graph guides tool decisions, the resulting executions and outcomes update it, and the updated graph guides decisions and experience acquisition in the next episode. Thus, later experience is generated by the updated harness rather than an unchanged initial policy. We empirically evaluate whether this process produces useful improvements below.