alphaFeedback

WorksComputer Science

LVMem: Image-Augmented Memory for Long-Horizon Question Answering

AI contributions
  • DeepSeek · multiple versions
  • GPT · multiple versions
  • Codex
  • Claude
View details
Ancillary data
1 code link
View

Abstract

Reliable language-guided perception is essential for embodied agents, where questions about objects, events, and their locations must be answered from long observation histories. Unlike conventional visual question answering, realistic robotic settings require reasoning over extended temporal horizons and persistent scene memory. We build upon the view-based memory paradigm and propose an efficient framework for long-horizon spatio-temporal question answering. While existing view-based systems typically store either text captions or visual embeddings, we extend the ReMEmbR-style memory with image paths that link each stored description to its original visual content. To make the stored annotations more informative, we replace uniform sampling during memory construction with an optical-flow-based frame selection strategy (PSFR) and store an object-centric descriptive scene representation instead of plain captions. We further equip a VLM-based agent with an adaptive retrieval tool that returns the image associated with the most relevant caption, allowing the agent to decide when visual inspection is needed. On the OC-NaVQA benchmark, LVMem outperforms ReMEmbR on binary and positional metrics with both backbones and matches or exceeds a 4D scene graph DAAAM baseline on binary accuracy, while operating on a lightweight view-based memory that requires no explicit graph construction.

Proposed LVMem approach

Figure 1. Proposed LVMem approach. A long video sequence is divided into fixed-length segments, from which PSFR selects the most informative frames. An object-centric textual scene representation generator produces one scene description per segment from its selected frames, which is stored in memory alongside the segment’s timestamp, pose, and image path. For a given query, the VLM agent calls the image retrieval tool to obtain the image linked to the most relevant description, enabling joint reasoning over visual and textual evidence.

Introduction

Embodied agents that operate over hours or days accumulate vast streams of visual experience. A warehouse robot, for example, may be asked: “Which shelf had the damaged box?” or “What did the loading dock look like when you passed it?”. Answering such queries goes beyond retrieving a text snippet: the agent must recall what it actually saw, where, and when. This demands a memory that preserves visual evidence across long horizons, remains spatially and temporally consistent, and can be queried efficiently as it grows.

We formalize the problem of long-horizon spatio-temporal question answering as follows. Given a continuous stream of RGB observations with associated poses and timestamps, and a natural language query about objects, events, or states in the environment, the goal is to produce an accurate answer. This requires building a memory representation from the observation stream and reasoning jointly over visual appearance, spatial locations, and temporal ordering.

This challenge becomes especially difficult in realistic robotic scenarios, where the environment evolves over time and the robot must reason over extended temporal horizons. A robot may observe the same object from multiple viewpoints, encounter changes in object locations, and need to combine information collected at different moments in time. Multimodal large language models have demonstrated strong capabilities in visual reasoning and language understanding [1], [2], but they still struggle with long video sequences [3], [4], persistent scene memory [5], and efficient retrieval of relevant information from large observation histories.

Structured scene representations offer a promising direction for addressing these limitations. In particular, scene graphs provide a compact and interpretable representation of objects, their attributes and interactions [6], and have been extended to dynamic 4D settings where nodes correspond to entities, edges encode semantic and spatial relations, and temporal information captures scene evolution [7, 8]. Recent approaches such as DAAAM [9] have explored 4D scene graphs for robotics, yet they rely on explicit geometric reconstruction and per-object description generation. Such representations are attractive for robotics because they support persistent memory and enable reasoning across long horizons. However, constructing and maintaining explicit 4D scene graphs in large-scale environments remains computationally demanding.

An alternative line of work stores annotated observations in a structured memory index, such as a vector database, which can be queried efficiently without explicit 3D reconstruction. Recent approaches like ReMEmbR [10] have shown promising results on spatio-temporal question answering using this paradigm, achieving efficient retrieval through text-based indexing of frame annotations. However, these methods rely solely on textual descriptions for retrieval and reasoning, which limits the agent’s ability to verify visual details or resolve ambiguities that require direct inspection of the original image content.

In this work, we build upon the view-based memory paradigm of ReMEmbR [10] and propose an extension that improves long-horizon question answering by providing the agent with access to visual evidence beyond textual descriptions and by selecting more informative frames during memory construction.

Our contribution can be summarized as follows:

  • We introduce LVMem, a view-based framework for long-horizon spatio-temporal question answering over recorded robot observations. LVMem represents observations as object-centric scene descriptions and links each to its source image, timestamp, and pose, equipping a VLM agent with a selectively invoked visual retrieval tool. This enables the agent to inspect visual details omitted from the stored descriptions while retaining text-, position-, and time-based access to memory, without explicit 3D reconstruction.

  • We propose motion-guided memory construction under a fixed frame budget by integration of the existing Patchwise Sparse-Flow Retention (PSFR) method into segment-level scene description generation and evaluate it against uniform sampling with identical segment lengths and frame counts. With six frames per 10-second segment, PSFR improves binary accuracy by 8.96 percentage points and reduces mean positional error from 89.98 m to 68.16 m, demonstrating the importance of frame selection for downstream memory-based question answering.

  • Through comparisons with ReMEmbR and DAAAM methods and ablations on OC-NaVQA, we examine how frame selection, visual retrieval, text retrieval depth, and scene description configuration affect answer quality. LVMem improves binary and free-form text accuracy over ReMEmbR by 10.95 and 15.15 percentage points with Qwen3.5-9B, and by 19.90 and 5.05 points with GPT-5-Mini, respectively. Our ablations further show that visual augmentation depends on retrieval context: additional images can improve descriptive answers while degrading positional estimates or destabilizing temporal predictions.

Long-horizon embodied question answering requires reasoning over extended observation histories, where relevant evidence may be sparse and distributed across time. Existing approaches differ mainly in how they represent, retain and retrieve this information.

Long-Horizon Question Answering

Recent MLLMs perform well on short clips but degrade as observation histories grow beyond the available context window. VideoARM [11] performs agentic reasoning over a hierarchical memory for long-form video understanding. Benchmarks such as FindingDory [12] and HourVideo [4] highlight the difficulty of retrieving sparse evidence over long temporal horizons. Spatial reasoning remains challenging: GPT4Scene [1] and ST-Think [2] study scene-level and 4D reasoning, while Spatial4D-Bench [5] and Video-MSR [13] expose persistent weaknesses in spatio-temporal reasoning. Other approaches encode structure directly into video representations: Video-3D LLM [14] introduces 3D-aware position encoding, and LITA [15] uses explicit time tokens for temporal localization. Both require end-to-end training tied to a specific backbone, and such representations are typically consumed within the model context rather than retained as persistent, independently queryable memory. OnlineSI [16] moves toward persistent spatial memory through incremental semantic reconstruction, but its bounded representation is still passed directly to the language model rather than selectively queried.

Scene Graphs and Knowledge Representations for Robotics

Scene graphs explicitly organize observations into persistent spatial and semantic structure. HOV-SG [17] constructs hierarchical open-vocabulary graphs over floors, rooms, and objects, while ConceptGraphs [18] associates multi-view 3D objects with open-vocabulary semantic descriptors and inter-object relations. Clio [19] extends hierarchical scene graphs to online, task-driven construction, and Khronos [20] models short-term motion together with long-term environmental change. GraphEQA [21] combines an online hierarchical scene graph with task-relevant images for embodied question answering. Among structured-memory approaches, DAAAM [9] builds a hierarchical 4D scene graph for long-horizon spatio-temporal QA, while EGG [7] introduces explicit event nodes and VL-KnG [8] constructs spatio-temporal knowledge graphs from video without explicit 3D reconstruction. Such graph-based representations provide rich global structure but require explicit graph construction or maintenance.

Knowledge Retrieval and Agentic Reasoning over Structured Memory

Persistent memory is only useful if relevant evidence can be retrieved efficiently. WorldMM [22], EventMemAgent [23], and StreamReady [24] use episodic, semantic, or hierarchical memory for long-form reasoning, focusing on temporal abstraction rather than spatially grounded representations. ReMEmbR [10] stores VLM-generated captions in a vector database and uses an iterative agent for text-, position-, and time-based retrieval, but the agent reasons only over stored textual descriptions. STaR [25] additionally retrieves keyframes for visual inspection through task-conditioned selection. Graph-based memories such as DAAAM [9], EGG [7], and VL-KnG [8] combine structured representations with agentic or hybrid retrieval. Beyond retrieval, Surprise-Gated Memory [26] studies selective episode retention, while UQ-DAAAM [27] quantify uncertainty over object descriptions and actively refine them. A tension persists: text-based memories scale efficiently but may discard visual detail, whereas multimodal memories retain richer evidence that must be selectively retrieved and integrated. LVMem retains the lightweight ReMEmbR representation while linking retrieved descriptions back to their source images, enabling a study when visual evidence actually helps.

Method

We present a framework for long-horizon spatio-temporal question answering that extends the existing view-based memory system of ReMEmbR [10]. Rather than redesigning the memory from scratch, we augment it in three ways. First, we replace uniform frame sampling during memory construction with an optical-flow-based selection strategy (PSFR) [28]. Second, we replace the plain captions with an object-centric descriptive scene representation and augment the memory entries with image paths that point to the corresponding source frames. Finally, we equip the VLM agent with an adaptive retrieval tool that returns the images corresponding to the most relevant descriptions, enabling joint reasoning over textual and visual evidence (see Figure 2).

Overview of the proposed pipeline

Figure 2. Overview of the proposed pipeline. Each temporal segment is processed by PSFR, which selects the most informative frames; the first selected frame is stored as an image path alongside the resulting object-centric scene description. At query time, the VLM agent invokes a visual retrieval tool that returns the image paired with the most relevant description, enabling joint reasoning over textual and visual evidence to reason jointly over both modalities.

Memory Construction

We follow the memory-building pipeline of ReMEmbR [10], which splits a video stream SS into fixed-length temporal segments {s1,…,sL}\{s_1,\ldots,s_L\}, each spanning TT seconds. We introduce two modifications to this pipeline.

First, instead of uniform frame sampling within each segment, we apply PSFR [28], a training-free optical-flow-based method that selects the most informative frames while discarding static or redundant content. Let segment sis_i contain mim_i frames Fi={fi,1,…,fi,mi}\mathcal{F}_i=\{f_{i,1},\ldots,f_{i,m_i}\}. Uniform sampling selects KK frames at equal intervals, while PSFR selects a subset Fi⊂Fi\mathcal{F}_i\subset\mathcal{F}_i of the same size KK, using sparse optical flow to identify frames with strong structural change. Both methods therefore return exactly KK frames per segment, which allows a direct comparison under identical frame counts (see Table II) and isolates the selection criterion from the frame budget.

Second, we introduce the object-centric descriptive scene representation, a textual description of a segment designed for retrieval. A vision-language model ϕθ\phi_\theta, instructed by a structured prompt π\pi, maps them to four fields,

di=ϕθ(Fi;π)=(σi,Oi,Hi,Xi),(1)d_i=\phi_\theta(\mathcal{F}_i;\pi)=(\sigma_i,\mathcal{O}_i,\mathcal{H}_i,\mathcal{X}_i), \tag*{(1)}

where σi\sigma_i is the scene type (with the weather, for outdoor scenes), Oi\mathcal{O}_i the visible objects, Hi\mathcal{H}_i the people with their activity and clothing, and Xi\mathcal{X}_i the readable text, quoted verbatim. Since a model asked to describe a scene tends to summarize it, omitting the entities a later query will ask about, the object field is specified as a set of attributed entities,

Oi={(wj,cj,nj)}j,wj∉G,\mathcal{O}_i=\{(w_j,c_j,n_j)\}_j,\qquad w_j\notin\mathcal{G},
cj∈C∪{⊥},nj∈N,(2)c_j\in\mathcal{C}\cup\{\perp\},\qquad n_j\in\mathbb{N}, \tag*{(2)}

where wjw_j is a noun, cjc_j its color from a fixed palette C\mathcal{C}, njn_j its count, ⊥\perp the absence of a color and G\mathcal{G} a list of generic nouns (object, item, device, etc.). The representation is thus enumerative (distinct entities are listed separately, with repeated ones merged under a count), attributive (color and count are bound to their noun), specific (wj∉Gw_j\notin\mathcal{G}), and positive: a field with no visible content is omitted rather than negated, since a statement such as “no ATM is visible” lies close in embedding space to a query about the same entity and would be retrieved while containing no answer.

The field labels are then stripped and empty fields dropped, yielding a prose description τi\tau_i. Generating with structure but storing without it is deliberate: requesting prose directly causes the model to summarize and drop entities, while retaining the labels would place identical tokens in every entry and dilute the embedding. Each segment is stored as the record

ri=(E(τi),τi,pi,ti,ui),(3)r_i=(E(\tau_i),\tau_i,p_i,t_i,u_i), \tag*{(3)}

where EE is the mxbai-embed-large-v1 model [29], pip_i and tit_i are the pose and timestamp, and uiu_i is the path to the first frame of Fi\mathcal{F}_i.

We further augment the memory index with an image path column. Since PSFR discards static and redundant frames, retained frames contain non-trivial visual content, so we use the first one as a deterministic visual anchor without an additional ranking step. We store file paths rather than base64-encoded images to keep the index compact; the image data itself remains on disk, ensuring fast retrieval.

Retrieval with Visual Augmentation

We adopt the ReMEmbR retrieval architecture [10], which provides a tool-calling agent with access to text-based, position-based, and time-based retrieval over the vector database. All text-based search reduces to a top-kk query over the stored embeddings. Given a query qq, retrieval returns the kk segments with the smallest L2L_2 distance to the query embedding,

Rk(q)=arg top-k⁡i∈{1,…,L}∥E(q)−ei∥2,(4)R_k(q) = \underset{i \in\{1,\ldots,L\}}{\operatorname{arg\,top-k}} \left\lVert E(q) - e_i \right\rVert_2, \tag*{(4)}

where ei=E(τi)e_i = E(\tau_i) is the embedding of the ii-th segment. The existing text tool then returns the corresponding descriptions,

TextRetrieve⁡(q)={τi}i∈Rk(q).(5)\operatorname{TextRetrieve}(q) = \{\tau_i\}_{i \in R_k(q)}. \tag*{(5)}

We extend the toolset with a novel image retrieval tool, which accepts a natural language query and returns the image path corresponding to the most semantically relevant description. Internally, it performs the same top-kk search but returns image paths instead of text,

ImageRetrieve⁡(q)={ui}i∈RM(q),(6)\operatorname{ImageRetrieve}(q) = \{u_i\}_{i \in R_M(q)}, \tag*{(6)}

where MM is a configurable parameter and uiu_i is the anchor frame path from Eq. (3).

As in the original ReMEmbR, the agent may invoke retrieval tools iteratively, up to a configurable number of steps. The agent can adaptively decide when to invoke the image retrieval tool: if textual descriptions are sufficient to answer a query, it proceeds without visual retrieval; if the query requires fine-grained visual details, such as reading signs or distinguishing similar objects, it calls the image retrieval tool to obtain the relevant images.

Visual-Enhanced Answer Generation

At the final reasoning step, we replace the LLM of ReMEmbR with a VLM that jointly processes retrieved texts and images. Before calling the VLM, the agent checks whether the image retrieval tool was invoked during the retrieval phase. If it was and the corresponding image paths were collected, these images are loaded and attached to the prompt; otherwise, generation proceeds in text-only mode.

Concretely, let xx denote the user’s question and Q={q1,…,qm}\mathcal{Q} = \{q_1,\ldots,q_m\} the set of retrieval sub-queries issued by the agent while answering xx. Let

U=⋃q∈QImageRetrieve⁡(q)\mathcal{U} = \bigcup_{q \in\mathcal{Q}} \operatorname{ImageRetrieve}(q)

be the set of unique image paths returned across all such calls. Each image is downscaled and re-encoded before being passed to the VLM: we rescale the longer side to at most hmax⁡=768h_{\max} = 768 pixels and save as JPEG with quality k=80k = 80, which reduces both the token cost and the payload size while preserving sufficient visual information. The resulting bytes are base64-encoded and attached to the prompt together with the textual context. We set the image detail level to low to further reduce token usage.

The VLM then produces a structured answer in JSON format with fields for text, binary, position, time, and duration, matching the output format of ReMEmbR. If the API returns a context-length error, the agent returns a default empty response instead of failing.

Experiments

Dataset

Following prior work [9], [10], we evaluate our approach on the OC-NaVQA benchmark [9]. The dataset comprises 7 video sequences from the CODe dataset [30], featuring 210 questions about the robot’s long-horizon navigation experience. Questions are categorized into spatial, temporal (point-in-time and duration), and descriptive (binary and text) types. For evaluation, we report Binary Accuracy (%), Text Accuracy (%, LLM-as-a-judge with Qwen3.5-0.8B), Positional Error (meters), and Temporal and Duration Errors (minutes) for all categories.

Baselines

We compare our approach against two baselines: ReMEmbR [10] in its original configuration (VILA1.5-3b [31] captioner, original prompt) and DAAAM [9]. LVMem instead uses the object-centric descriptive scene representation (Qwen3.5-9B, structured prompt) and its retrieval tool returns the images linked to the 5 most relevant scene representations. We evaluate all methods with two VLM backbones: Qwen3.5-9B and GPT-5-Mini, to analyze the impact of the reasoning agent. We use SGLang [32] for local inference of open-source VLMs and OpenRouter for API-based access to proprietary models.

Results

Table I reports the comparison on OC-NaVQA. LVMem outperforms ReMEmbR on binary and text accuracy with both backbones, and reduces positional error substantially in both configurations. With GPT-5-Mini, LVMem attains the highest binary accuracy among all methods and remains competitive on text accuracy, though its duration error is higher than DAAAM’s, while its temporal error falls between ReMEmbR and DAAAM. With Qwen3.5-9B, LVMem improves over ReMEmbR on binary, text, positional, and temporal metrics; the two methods are close on duration errors.

DAAAM with GPT-5-Mini achieves the strongest text accuracy and the lowest temporal and duration errors, but it is highly sensitive to the choice of backbone: switching to Qwen3.5-9B substantially degrades its binary and text accuracy, below both ReMEmbR and LVMem. LVMem, in contrast, remains stable across backbones and improves with Qwen3.5-9B on binary and positional metrics, while ReMEmbR shows the opposite trend, with GPT-5-Mini outperforming Qwen on text. This suggests that the optimal backbone depends on both the memory representation and the question type. Overall, LVMem offers the most consistent performance across backbones, while DAAAM achieves the strongest results only with GPT-5-Mini.

Figure 3 illustrates a failure mode of text-only memory: when a question targets a fine-grained visual attribute, the stored description may omit it even if the corresponding observation was recorded. Here, both baselines store a description of the sculpture but neither mentions its color, and DAAAM’s scene graph node, though linked to the correct object, describes only its reflective surface. LVMem avoids this failure because the adaptive retrieval tool lets the agent fetch the source frame and answer from the image itself, rather than from the stored text alone.

Question and responses comparing ReMEmbR, DAAAM, and LVMem for a sculpture image

Figure 3. A question asking for the color of a horse sculpture. Text-based baselines describe the sculpture as “metal” and “reflective” and cannot determine its color. LVMem retrieves the corresponding frame and answers correctly based on the visible brown tone.

Ablation studies

  1. PSFR vs uniform sampling: Table II isolates the effect of frame selection during memory construction. Both variants use the same segment parameters (10 seconds, 6 frames), the same visual retrieval tool returning one image, and the original ReMEmbR captioning configuration (VILA1.5-3b, original prompt).

Replacing uniform sampling with PSFR consistently improves all metrics, with the largest gain on binary accuracy (8.96%) and a smaller improvement in text accuracy. Positional error drops substantially, and temporal and duration errors also decrease. The improvements are consistent across all three runs, as indicated by the standard deviations.

These results confirm that the quality of stored descriptions depends directly on which frames are selected. By prioritizing frames with significant visual content and discarding static or redundant ones, PSFR produces more informative descriptions, which in turn improve retrieval and downstream question answering.

  1. Retrieval depth and visual augmentation: Table III varies the number of documents returned by text retrieval (kk) jointly with the number of images MM, under two modes of supplying visual evidence. In the tool mode, the agent invokes the adaptive visual retrieval tool, which returns the images linked to the top retrieved descriptions. In the top-MM mode, the tool is bypassed and images from the top-MM retrieved descriptions are appended directly to the generation prompt. The M=0M = 0 rows use no images and thus serve

MethodBinary [%] ↑Text [%] ↑Pos. [m] ↓Temp. [min] ↓Dur. [min] ↓Latency [s] ↓
ReMEmbR (GPT-5-Mini)56.72±5.3836.36±3.0352.69±5.495.19±1.013.66±0.99-
DAAAM (GPT-5-Mini)73.30±2.9442.30±21.3556.37±6.383.83±1.502.58±1.72-
LVMem (Ours, GPT-5-Mini)76.62±3.7641.41±6.3134.68±0.364.81±0.614.88±0.51-
ReMEmbR (Qwen3.5-9B)65.17±3.1124.24±3.0368.67±12.7616.95±20.464.96±2.2219.19±5.05
DAAAM (Qwen3.5-9B)43.50±10.9723.09±2.9765.92±7.927.86±1.983.87±2.9930.67±38.76
LVMem (Ours, Qwen3.5-9B)76.12±2.5939.39±3.0350.12±4.964.23±0.543.67±2.3020.91±5.33

Table 1. Comparison on OC-NAVQA. Mean ± std. dev. over 3 runs. ReMEmbR uses its original configuration, LVMem our proposed representation. Segment parameters are identical (3 seconds, 6 frames). Latency is measured on a single H100 GPU and reported only for local inference, as API-based runs incur variable network and queueing overhead.

PSFR vs uniform sampling

SamplingBinary [%] ↑Text [%] ↑Pos. [m] ↓Temp. [min] ↓Dur. [min] ↓
uniform55.72±5.6522.22±1.7589.98±9.055.60±2.264.27±0.12
PSFR64.68±4.8025.25±1.7568.16±12.964.71±2.663.83±0.99

Table 2. Effect of PSFR on OC-NAVQA performance for LVMem with Qwen3.5-9B. Segment parameters: 10 seconds, 6 frames.

Retrieval depth and visual augmentation

ModekkImgBin. [%] ↑Text [%] ↑Pos. [m] ↓Temp. [min] ↓Dur. [min] ↓
top-M5066.70±0.9034.30±7.6060.30±0.204.16±0.235.92±2.02
top-M20067.20±3.0030.30±3.0054.50±16.903.39±0.674.53±0.12
tool5169.65±1.7228.28±1.7568.15±4.725.43±1.694.99±1.73
top-M5169.20±3.8038.40±1.7078.20±3.902.03±0.183.79±0.10
top-M20168.20±2.3032.30±6.3072.50±6.706.50±2.684.19±0.67
tool5374.13±2.2822.22±1.7567.53±4.824.75±1.273.78±0.34
top-M5373.00±1.7033.30±3.0077.10±8.004.43±0.774.34±0.67
top-M20365.70±3.9037.70±4.2062.60±3.105.66±0.174.73±0.38
tool5575.62±3.1134.34±1.7568.76±2.8924.51±34.863.15±0.44
top-M5577.30±2.5034.10±1.2071.70±3.704.73±0.464.25±1.03
top-M20566.70±3.4035.80±7.1066.00±10.605.30±1.264.63±0.02

Table 3. Joint effect of text retrieval depth kk and the number of images MM on OC-NAVQA with LVMem (Qwen3.5-9B). In the top-MM mode, images from the top-MM retrieved descriptions are always appended directly to the generation prompt. In the tool mode, the agent instead invokes the adaptive visual retrieval tool, which returns the images linked to the top retrieved descriptions. Segment parameters: 3 seconds, 6 frames.

as text-only baselines under identical memory construction. Descriptions, frame selection, and the agent are held fixed throughout.

Attaching images at shallow retrieval depth improves binary accuracy monotonically, with the gain growing as more images are added. At deep retrieval depth, however, the effect disappears: binary accuracy is flat across image counts. The two information sources therefore act as substitutes rather than complements — images supply information the agent otherwise lacks only when the textual context is shallow, and contribute little once the prompt already contains many descriptions.

Positional error follows the opposite pattern. It is lowest with no images, at both retrieval depths, and increases once images are attached at every non-zero setting. The effect is systematic rather than run-to-run variation. We hypothesize that when images are present, the VLM shifts toward visual grounding and produces less accurate spatial estimates than when reasoning from the positional metadata embedded in the retrieved descriptions.

Retrieval depth does not improve accuracy: moving from k=5k = 5 to k=20k = 20 leaves binary accuracy unchanged at every image count, and positional error improves only modestly. We therefore adopt k=5k = 5 in all remaining experiments.

Finally, we compare the adaptive tool against a variant that always attaches images from the last retrieved documents on every query. This non-adaptive variant attains competitive binary accuracy but suffers from a higher duration error. This confirms that selectively invoking the visual tool matters: indiscriminately attaching images to every query degrades temporal reasoning. Overall, a moderate number of images per tool call provides the best trade-off between accuracy and stability, while more images yield the highest binary accuracy at the cost of increased variance.

Effect of the scene description models

Table 4 examines the effect of the scene description model by replacing VILA1.5-3b with Qwen3.5-9B while keeping all other components fixed (k=5k=5, same embedding model, same agent). The two configurations differ both in model capacity and in prompt design: VILA receives a generic free-form prompt from the original ReMEmbR codebase, while Qwen is guided by a structured prompt that enforces explicit object enumeration with colors from a fixed palette, prohibits negations and hedging language, and limits the output to 110 words. The structured output is post-processed into continuous prose to ensure consistent embedding.

Scene description modelPromptImagesBinary [%] ↑Text [%] ↑Pos. [m] ↓Temp. [min] ↓Dur. [min] ↓
VILA1.5-3bReMEmbR066.70±0.9034.30±7.6060.30±0.204.16±0.235.92±2.02
169.20±3.8038.40±1.7078.20±3.902.03±0.183.79±0.10
373.00±1.7033.30±3.0077.10±8.004.43±0.774.34±0.67
577.30±2.5034.10±1.2071.70±3.704.73±0.464.25±1.03
Qwen3.5-9BLVMem076.10±2.1031.10±1.5043.60±3.0015.98±22.234.46±1.43
181.00±5.4031.80±3.9053.30±4.603.82±1.104.68±0.65
376.90±0.9034.80±1.7060.00±3.805.62±2.784.20±1.11
578.00±1.9030.30±5.5054.60±5.403.56±0.704.76±0.94

Table 4. Effect of different scene description models and prompts within our LVMem pipeline on OC-NAVQA at k=5k=5. Images from top-mm retrieved documents are attached at generation; the visual retrieval tool is not used. Segment parameters: 3 seconds, 6 frames.

Binary accuracy improves with Qwen across all image settings, with the largest gain at one image. Positional error is also lower with Qwen at every image count, and both improvements exceed the run-to-run standard deviation, indicating a robust effect rather than an artifact of a particular configuration.

The gain can be traced to the coverage of stored entities: VILA descriptions omit objects such as ATMs and police emergency poles that Qwen descriptions include. For questions about such objects, VILA-based retrieval returns irrelevant documents, while Qwen-based retrieval finds the correct entry, cutting positional error by up to an order of magnitude.

Text accuracy, however, does not improve: VILA is higher in three of four image settings. Such questions require distinguishing between similar objects (e.g., “the bike rack closest to the trash can”), and mentions of common objects such as bike racks increase by an order of magnitude in Qwen descriptions, diluting retrieval and returning a plausible but incorrect entry. The structured prompt thus improves the inclusion of rare objects at the cost of disambiguation among frequent ones.

Temporal error for Qwen at zero images is inflated by a single outlier of in one of the three runs; the remaining temporal and duration values are comparable between models and show no consistent advantage for either model.

Limitations

Our approach has several limitations. First, increasing the number of images returned by the visual retrieval tool does not monotonically improve performance. While additional images can help resolve queries that require fine-grained visual details, they also introduce noise: at five images per tool call, temporal error is dominated by outliers, and a non-adaptive variant that always attaches images to every query degrades duration estimation by several orders of magnitude. This confirms that selective invocation matters, but also that the number of images per call requires careful tuning.

Second, the observed gains are concentrated on binary and free-form text accuracy, where LVMem improves consistently over ReMEmbR. Duration estimation, in contrast, shows no consistent improvement across backbones: LVMem is better with Qwen3.5-9B but worse with GPT-5-Mini. This is expected, since our method targets visual details that are lost in the stored descriptions, and such details matter most for descriptive queries.

Finally, our method operates on a lightweight view-based memory and does not build an explicit 3D representation. This design choice reduces memory construction cost but may limit performance on questions that benefit from explicit spatial or temporal structure: LVMem improves over DAAAM on binary and positional metrics with some backbones, but remains behind on text accuracy and duration estimation.

Conclusion

We presented LVMem, a framework for long-horizon spatio-temporal question answering that extends the view-based memory of ReMEmbR with visual content and improved frame selection. We make three contributions: we augment the memory index with image paths that link each stored object-centric descriptive scene representation to its source frame, we introduce an adaptive visual retrieval tool that allows the agent to request images when textual descriptions are insufficient, and we replace uniform frame sampling with existing PSFR [28], an optical-flow-based strategy that selects more informative frames for scene description generation.

On the OC-NaVQA benchmark, our method improves over ReMEmbR on binary, text, and positional metrics with both backbones, and substantially reduces temporal error, while remaining competitive with the 4D scene graph method DAAAM without requiring explicit graph construction. Ablations confirm that both PSFR and adaptive image retrieval contribute to these gains, and that indiscriminate image attachment degrades performance.

These results suggest that visual augmentation of view-based memory is a practical and effective direction for long-horizon question answering, improving scene perception for embodied agents.

Acknowledgment

The authors used AI-based tools during the preparation of this manuscript. For text drafting, editing, and translation, the authors used DeepSeek (accessed via the web interface) and OpenAI models. For code generation, debugging, and refactoring, the authors used DeepSeek, OpenAI Codex, and Claude. Table formatting and layout were also assisted by these tools. All AI-generated content was reviewed, verified, and edited by the authors, who take full responsibility for the content of this work.

References

  1. [1]Z. Qi, Z. Zhang, Y. Fang, J. Wang, and H. Zhao, “Gpt4scene: Understand 3d scenes from videos with vision-language models,” arXiv preprint arXiv:2501.01428, 2025.arxiv.org/abs/2501.01428
  2. [2]P. Wu, Y. Liu, M. Liu, and J. Shen, “St-think: How multimodal large language models reason about 4d worlds from ego-centric videos,” in Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2026, pp. 5174–5183.
  3. [3]H. Wu, D. Li, B. Chen, and J. Li, “Longvideobench: A benchmark for long-context interleaved video-language understanding,” Advances in Neural Information Processing Systems, vol. 37, pp. 28 828–28 857, 2024.arxiv.org/abs/2407.15754
  4. [4]K. Chandrasegaran, A. Gupta, L. M. Hadzic, T. Kota, J. He, C. Eyzaguire, Z. Durante, M. Li, J. Wu, and L. Fei-Fei, “Hourvideo: 1-hour video-language understanding,” Advances in Neural Information Processing Systems, vol. 37, pp. 53 168–53 197, 2024.arxiv.org/abs/2411.04998
  5. [5]P. Wang, Y. Liu, G. Wu, E. R. Corral-Soto, C. Huang, B. Xu, D. Bai, X. Yan, Y. Ren, X. Chen, et al., “Spatial4d-bench: A versatile 4d spatial intelligence benchmark,” arXiv preprint arXiv:2601.00092, 2025.arxiv.org/abs/2601.00092
  6. [6]Z. Jiao, Y. Niu, Z. Zhang, S.-C. Zhu, Y. Zhu, and H. Liu, “Sequential manipulation planning on scene graph,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2022, pp. 8203–8210.arxiv.org/abs/2207.04364
  7. [7]P. Nguyen, F. Verdoja, and V. Kyrki, “Event-grounding graph: Unified spatio-temporal scene graph from robotic observations,” IEEE Robotics and Automation Letters, 2026.
  8. [8]M. A. Mdfaa, S. Lukina, T. Akhtyamov, A. Nigmatzyanov, D. Nalberskii, S. Zagoruyko, and G. Ferrer, “Vl-kng: Visual scene understanding for navigation goal identification using spatiotemporal knowledge graphs,” arXiv preprint arXiv:2510.01483, 2025.
  9. [9]N. Gorlo, L. Schmid, and L. Carlone, “Describe anything anywhere at any moment,” arXiv preprint arXiv:2512.00565, 2025. [Online]. Available: https://arxiv.org/abs/2512.00565
  10. [10]A. Anwar, J. Welsh, J. Biswas, S. Pouya, and Y. Chang, “Remembr: Building and reasoning over long-horizon spatio-temporal memory for robot navigation,” in 2025 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2025, pp. 2838–2845.arxiv.org/abs/2409.13682
  11. [11]Y. Yin, Q. Meng, M. Chen, J. Ding, Z. Shao, and Z. Yu, “Videoarm: Agentic reasoning over hierarchical memory for long-form video understanding,” arXiv preprint arXiv:2512.12360, 2025.arxiv.org/abs/2512.12360
  12. [12]K. Yadav, Y. Ali, G. Gupta, Y. Gal, and Z. Kira, “Findingory: A benchmark to evaluate memory in embodied agents,” arXiv preprint arXiv:2506.15635, 2025.arxiv.org/abs/2506.15635
  13. [13]R. Zhu, X. Shen, S. Wu, C. Miao, X. Yu, Y. Li, W. Li, D. Xia, and J. Huang, “Video-msr: Benchmarking multi-hop spatial reasoning capabilities of mlms,” arXiv preprint arXiv:2601.09430, 2026.
  14. [14]D. Zheng, S. Huang, and L. Wang, “Video-3d llm: Learning position-aware video representation for 3d scene understanding,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2025, pp. 8995–9006.arxiv.org/abs/2412.00493
  15. [15]D.-A. Huang, S. Liao, S. Radhakrishnan, H. Yin, P. Molchanov, Z. Yu, and J. Kautz, “Litza: Language instructed temporal-localization assistant,” in European Conference on Computer Vision. Springer, 2024, pp. 202–218.arxiv.org/abs/2403.19046
  16. [16]Z. Liu, Z. Chen, L. Pan, and Z. Liu, “Onlinesei: Taming large language model for online 3d understanding and grounding,” arXiv preprint arXiv:2601.16538, 2026.arxiv.org/abs/2601.16538
  17. [17]A. Werby, C. Huang, M. Büchner, A. Valada, and W. Burgard, “Hierarchical open-vocabulary 3d scene graphs for language-grounded robot navigation,” in Robotics: Science and Systems (RSS), 2024. [Online]. Available: https://arxiv.org/abs/2403.17846
  18. [18]Q. Gu, A. Kuwajerwala, S. Morin, K. M. Jatavallabhula, B. Sen, A. Agarwal, C. Rivera, W. Paul, K. Ellis, R. Chellappa, et al., “Conceptgraphs: Open-vocabulary 3d scene graphs for perception and planning,” in 2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2024, pp. 5021–5028.arxiv.org/abs/2309.16650
  19. [19]D. Maggio, Y. Chang, N. Hughes, M. Trang, D. Griffith, C. Dougherty, E. Cristofalo, L. Schmid, and L. Carlonе, “Clio: Real-time task-driven open-set 3d scene graphs,” IEEE Robotics and Automation Letters, vol. 9, no. 10, pp. 8921–8928, 2024.arxiv.org/abs/2404.13696
  20. [20]L. Schmid, M. Abate, Y. Chang, and L. Carlone, “Khronos: A unified approach for spatio-temporal metric-semantic slam in dynamic environments,” in Robotics: Science and Systems (RSS), 2024.arxiv.org/abs/2402.13817
  21. [21]S. Saxena, B. Buchanan, C. Paxton, P. Liu, B. Chen, N. Vaskevicius, L. Palmieri, J. Francis, and O. Kroemer, “GraphEQA: Using 3D semantic scene graphs for real-time embodied question answering,” in Proceedings of the 9th Conference on Robot Learning, ser. Proceedings of Machine Learning Research, vol. 305. PMLR, 2025, pp. 2714–2742.arxiv.org/abs/2412.14480
  22. [22]W. Yeo, K. Kim, J. Yoon, and S. J. Hwang, “Worldmm: Dynamic multimodal memory agent for long video reasoning,” arXiv preprint arXiv:2512.02425, 2025.arxiv.org/abs/2512.02425
  23. [23]S. Wen, Z. Wang, X. Zhang, L. Huang, and W. Wu, “Eventmemagent: Hierarchical event-centric memory for online video understanding with adaptive tool use,” arXiv preprint arXiv:2602.15329, 2026.arxiv.org/abs/2602.15329
  24. [24]S. Azad, V. Vineet, and Y. S. Rawat, “Streamready: Learning what to answer and when in long streaming videos,” arXiv preprint arXiv:2603.08620, 2026.arxiv.org/abs/2603.08620
  25. [25]M. Yuan, H. Zhang, M. Mohammadi, R. Li, J. Shan, and S. L. Waslander, “Star: Scalable task-conditioned retrieval for long-horizon multi-modal robot memory,” IEEE Robotics and Automation Letters, vol. 11, no. 5, pp. 5994–6001, 2026.DOI
  26. [26]N. Gorlo, D. K. Wise, A. Speranzon, and L. Carlone, “Worth remembering: Surprise-gated robot episodic memory,” arXiv preprint arXiv:2606.03787, 2026.
  27. [27]H. Zhang, N. Gorlo, and L. Carlone, “Remember with confidence: Uncertainty quantification for spatio-temporal memory with probabilistic guarantees,” arXiv preprint arXiv:2606.08277, 2026.arxiv.org/abs/2606.08277
  28. [28]T. Zemskova, S. Andryushenko, I. Obubrov, V. Khoruzhaia, E. Eroshenko, E. Derevyanka, and D. Yudin, “Focusgraph: Graph-structured frame selection for embodied long video question answering,” arXiv preprint arXiv:2603.04349, 2026.arxiv.org/abs/2603.04349
  29. [29]S. Lee, A. Shakir, D. Koenig, and J. Lipp. (2024) Open source strikes bread - new fluffy embeddings model. [Online]. Available: https://www.mixedbread.ai/blog/mxbai-embed-large-v1
  30. [30]A. Zhang, C. Eranki, C. Zhang, J.-H. Park, R. Hong, P. Kalyani, L. Kalyanaraman, A. Gamare, A. Bagad, M. Esteva, et al., “Toward robust robot 3-d perception in urban environments: The ut campus object dataset,” IEEE Transactions on Robotics, vol. 40, pp. 3322–3340, 2024.
  31. [31]J. Lin, H. Yin, W. Ping, P. Molchanov, M. Shoeybi, and S. Han, “Vila: On pre-training for visual language models,” in 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2024, pp. 26679–26689.arxiv.org/abs/2312.07533
  32. [32]L. Zheng, L. Yin, Z. Xie, C. Sun, J. Huang, C. H. Yu, S. Cao, C. Cozyrakis, I. Stoica, J. E. Gonzalez, et al., “Sglang: Efficient execution of structured language model programs,” Advances in neural information processing systems, vol. 37, pp. 62557–62583, 2024.arxiv.org/abs/2312.07104

Paper details

vlnc:W_qrh5pr7t
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Computer Science

DeepSeek (multiple versions), GPT (multiple versions), Codex, Claude · View statement →

Looking for related papers…
Contents