Do Embodied VLMs Actually Use Their Scene-Graph Memory?
Shubh Garg, Divyansh Pandey, Vedant Khandelwal, Niyati Rawal, Amit Sheth
Abstract
Embodied agents that answer questions about their route need a memory of what they saw, and scene graphs are a natural form for it. A vision-language model (VLM) can receive such a graph as text or through a graph encoder, but accuracy alone cannot show whether the graph holds the episode's facts, reaches the model, or is actually relied on. In this diagnostic study, we introduce a graph-swap test for the last of these: each episode is given another episode's graph, and we count how many answers change. On an embodied question-answering benchmark with routes through two to seven rooms, we use it to compare ways of delivering scene-graph memory to a fine-tuned VLM. As text, the memory is used strongly, adding 30 points on route questions. As a graph, it is not, and we trace why: the encoder preserves the information, but standard pooled and late fusion discard it. Giving each node its own input token recovers part of it, a gain of 8.3 points on route questions that the swap test confirms comes from the graph. The test also exposes a shortcut that accuracy hides: when the same facts appear in the text, the model ignores its graph. The test thus offers a cheap check of whether a VLM uses its scene-graph memory, and our analysis points to how that memory should be delivered.
Create a lesson
Related papers
ActOR: Ambient AI-Based Agentic Orchestration for Humanoid Autonomy in Operating Rooms
Han Zhang, Sicheng Lu, Aleks Santari et al.
DiMuRe: Diagnosis-Guided Multilevel Recovery for Robotic Task Execution
Renkai Yi, Yuwei Wu, Haoyu Zhang et al.
Online iLQR-MPC with Whole-Body Control for Robust Humanoid Locomotion
Xiang Li, Linlin Ou, Ruihan Wu et al.
Grasping and Stabilizing Tumbling Objects with Rotating-Base Multi-Arm Space Manipulators
Farhad Aghili
Online Hamilton-Jacobi Reachability Onboard the Robot Control Loop: A Real-Time GPU Solver for Safety-Critical Autonomy
Kevin Weekly, Alexandre M. Bayen
VARP: A Visual Adaptive Rearrangement Planner for Non-Monotone Object Rearrangement Planning
Hanwen Ren, Meng Zheng, Zhongpai Gao et al.