- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes tracing hierarchical agent decisions via 4d spatio-temporal saliency. The motivation behind the research is that per-frame 2D saliency does not successfully handle the rich 3D environment. The authors design a testbed with a VLM-PPO agent to verify the motivation. By analyzing the results of the testbed, the paper presents a 4D (3D + time) heat map.
Critical strengths
-
Motivation: the paper presents a clear motivation. The storyline in the introduction section that motivates the proposed study is straightforward.
-
Testbed and analysis for method design: the authors present the testbed and experimental results before illustrating the proposed method for better understanding the motivation.
Critical weaknesses
-
The experiment: the test conditions and tasks are too simple to generalize over multiple situations and there is no comparative study demonstrating the effectiveness of the proposed method.
-
The method: accumulating saliency over multiple regions does not necessarily represent the true saliency. Feeding the overall map or other information and querying it for saliency estimation would simply be able to substitute for the proposed method.
Questions for authors
-
Can you compare the proposed method against 3D VLMs and geometric VLMs? Comparing the proposed method with related areas could present the contributions in a more effective manner.
-
Can the proposed method enhance the performance of robot tasks by tracing saliency?
-
Does reasoning over a top-view map replace the proposed method?
4 comments
I sincerely appreciate the authors for taking the time to prepare the response.
I still question the significance of the technical contribution and particularly the generality of the method. In addition, as the authors have not answered my questions, my concerns about those issues remain unresolved.
Response to Reviewer VJn4 (Questions and Contribution)
Thank you for your reply, and we apologize for not answering your three questions directly. We answer them first, then return to the technical contribution and its generality.
Q1. Can you compare the proposed method against 3D VLMs and geometric VLMs?
Our method does not compete with 3D or geometric VLMs. Those are planners, the part of the robot that makes decisions. Our method is an audit layer that explains what any planner relied on. So the two do not replace each other. They combine, and the combination gives a richer heat field.
3D VLMs. These models take depth or point clouds as input, often alongside images. Integrated Gradients applies to depth the same way it applies to pixels. The path grows each depth value from zero to its true value. Each 3D point then receives its own attribution score. These scores already live in 3D, so they enter the world-anchored field directly. Pixel and point attributions then share one world frame and can be compared. This shows whether the two inputs drive the decision from the same regions of space or from different ones. A clear division of labor would be useful in practice: each input could be limited to the regions it relies on, which would cut input size and latency.
Geometric VLMs. These models read several camera views at once and reason about the 3D scene behind them. Here our method applies with almost no change. Each view gets its own attribution map, and each map is unprojected with its own camera pose (Eq. 2). Without our method, an auditor would face one map per camera per query, which multiplies the pile of Appendix M by the number of cameras. With our method, all views fuse into one shared field. The auditor can also keep one field per camera to compare them.
Our framework needs only a per-pixel or per-point score, plus depth and pose (Section 1, contribution 1). This is why it already transfers across four attributors and three further planners (Appendices I and K).
Q2. Can the proposed method improve the performance of robot tasks by tracing saliency?
This paper focuses on auditing, not on improving performance, and we do not claim performance gains. But the field gives a natural training signal. A human or a larger teacher VLM can mark the task-relevant objects as 3D bounding boxes, static or moving. The gap between these boxes and the agent's own heat field can then serve as a loss for fine-tuning. This follows the idea of saliency supervision: penalize attribution that falls outside the relevant regions.
World-anchoring makes this practical. A 3D box is labeled once and projected into every frame automatically. In 2D, the same label would have to be drawn again in every frame. Our own agent shows where this could help. Its field holds a persistent lobe on the background wall in every outcome group (Figure 4, Appendix O). Supervision of this kind could steer attention back toward the targets.
Q3. Does reasoning over a top-view map replace the proposed method?
No. A top-view map changes the robot's inputs, for example to a camera on a drone instead of the robot's own camera. Our method still applies to that system. It would then explain which parts of the drone's view drove the decision, instead of the robot's view.
This is a promising setting. In search and rescue, ground robots may work with aerial drones. Many agents then move and decide at the same time. A per-frame explanation would give one stack of maps per agent. A world-anchored field puts every agent's attribution onto one shared map of the terrain. An auditor can rotate that map and replay it over time to see which places influenced the team's decisions.
Technical contribution and generality:
To our knowledge, no prior method anchors attribution in the world for an agent that moves while it decides. Our contribution turns a pile of camera-tied maps into one object that can be pooled, sliced, replayed and intervened on.
The method is general by construction. It needs three things: a per-pixel score, depth and camera pose. Any attributor provides the first (Appendix I). Most mobile robots already estimate the other two for navigation, through SLAM or lidar-inertial odometry. Appendix G shows the reading holds under pose and depth noise. The paper also runs it on two further open planners (Appendix K), a black-box API planner (Appendix I) and a moving target (Appendix L).
The same idea extends beyond vision. Robots increasingly read sound, touch and other sensors along with video. Any signal with a known position in space can be anchored in the same field. Finding the best way to attribute and visualize such mixed signals will take work across XAI, robotics and visualization. We see world-anchored attribution as a first, necessary step toward that goal.
I sincerely appreciate the authors for taking the time to prepare this response.
I still think that other previous research works can be applied to the proposed problem setting with a slight modification. The exact match of the input format is not always possible, so some related baselines I mentioned in the previous comments should be incorporated and compared. Furthermore, I am not certain about the significance of the technical contribution. The auditing should deliver some value for other systems. Without showing the benefit of the proposed system, I would question the need to formulate one. Lastly, I think the proposed method can be easily replaced by other conventional methods, such as top-view maps, as I pointed out in Q3. The authors could do an extensive literature survey and compare related methods in a table or some effective way to demonstrate the superiority of the proposed method.
Response to Reviewer VJn4 (Weaknesses W1 & W2)
W1. "The tasks are too simple, and there is no comparative study."
The simple arena is a deliberate choice. Our contribution is not a navigation policy. It is a way to place attribution in the world, so that the decisions of a moving robot can be audited. To test an explanation method, we first need a setting where the factors behind a decision are clear. Section 4 builds one. The bare two-cube arena, the mirrored layouts and the same-color control let us measure the agent's biases exactly (Table 1). Clutter would hide them. Section 4 states this design choice.
The framework is not tied to this arena. The paper already tests it beyond the main setup:
On a comparative study: we know of no prior method that gives world-anchored attribution for a robot that moves while it decides. The natural baseline is per-frame 2D saliency. The new Figure 9 (page 10) compares the two on the same 20 episodes. The 2D baseline gives the auditor 1,084 maps from 301 queries, each in its own camera pose. These maps cannot be added, sliced or compared. Our method turns the same maps into one field. Every analysis in the paper runs on that field: pooling (Figure 4), outcome splits (Figure 5) and closed-loop masking (Section 6). None of these has a per-frame version. In particular, a 2D image mask cannot follow a physical region while the camera moves, so occlusion auditing of a driving robot is not even defined in 2D (Section 1, contribution 3). Appendix M shows how the 2D pile grows with the memory window.
W2. "Accumulated saliency is not true saliency. Feeding an overall map and querying it could replace the method."
We agree that accumulated attribution is not "true" causal saliency, and we do not claim it is. Section 1 ("Scope of the claim") states that we do not propose a new definition of pixel importance. Section 5.3 states that our guarantees establish neither semantic correctness nor causal faithfulness. Our attributor, Integrated Gradients, satisfies known axioms such as sensitivity and implementation invariance. It has the same standing as 2D saliency in computer vision: it shows what drove the output, not a causal proof. We point it at the exact steering token the robot sampled (Section 5.1). We then test faithfulness separately, with closed-loop occlusion (Section 6) and with matched random regions (Appendix Q).
The accumulation is also not a raw sum. Each world bin shows the mean attribution per time the bin was seen, so how often a region was seen is divided out (Appendix O). Proposition 1 shows that the pooled field converges as trials are added.
On feeding an overall map: the robot never has one. Its planner sees only its onboard camera (Section 3, Figure 3a). Our goal is to audit the robot as deployed, using only what it actually saw. A model queried with a top-down map is a different system with different inputs. Its answer would describe that model, not the policy that drove our robot. Asking a model what it found important also yields a self-report, which is not attribution (Jacovi & Goldberg, 2020). Adding aerial or map data, for example from a drone, is an interesting direction, but it is outside the scope of this paper. We have listed it as future work in Section 8.