- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes DAGC, a training-free coarse-to-fine indexing strategy that reduces the cost of building video graphs. On top of Vgent, DAGC merges visually redundant adjacent chunks into a lighter graph for offline construction, while keeping a mapping to the original chunks. After retrieval on this coarse graph, the selected regions are mapped back to the original chunks for fine-grained downstream reasoning. Experiments on VideoMME, MLVU, and LVB show reduced construction time with largely maintained performance. The method also transfers to another LVLM family and another video RAG framework.
Critical strengths
- Extensive experiments across various VLM backbones and RAG frameworks support the method’s robustness.
- The motivation of decoupling relevant-region localization from detailed downstream reasoning is convincing and timely.
Critical weaknesses
-
The paper is hard to read and not self-contained. Although DAGC operates on top of Vgent, many parts of the method are not described in detail, and they are not covered in the appendix. For example, there is no description of which VLM is used for entity extraction, no exact formulation of and , and no clarification of whether is raw pixels or visual features after the vision encoder or adapter. In addition, Table 5 lacks sufficient explanations of SN, RR, and TE. These omissions make the paper difficult to understand and reproduce.
-
Limited novelty and insufficient justification. Coarse-to-fine indexing is reasonable, but it reads as a simple application, adapting ideas already explored in many other areas. The paper is not convincing on why coarse indexing is sufficient for video RAG and how the resulting accuracy–efficiency trade-off can be minimized, since most explanations rely on empirical results rather than logical justification. The efficiency claim is also not fully supported. There is no complexity analysis, and it is unclear whether the frames of merged nodes overlap with the original chunks and whether vision encoder features are reused. If they are not reused, it is unclear whether this additional cost is included in the offline time. Finally, the interpretation of why performance drops excessively only on VideoMME is insufficient. Attributing it simply to longer videos is not convincing, since this does not hold for LVB.
Questions for authors
-
Is raw pixels or visual features after the vision encoder? If features are used, which encoder is used, and are the encoded features reused when re-sampling frames for merged nodes?
-
What causes the larger drop on VideoMME compared to LVB and MLVU? An analysis of failure cases, such as whether the key evidence was merged into coarse nodes, would help clarify this.
Thank you for the detailed rebuttal. The clarifications on the efficiency analysis and Q1–Q2 helped me better understand the paper. However, I still have concerns regarding (1) the presentation, (2) the justification of coarse indexing, and (3) the novelty.
1. Presentation.
Most of my original points concerned missing descriptions, and the clarifications in the rebuttal (e.g., the definitions of Rs and Rs+, the graph construction criterion, and the BGE-large-en-v1.5 embedding model) are not described in the paper at all. Since ICLR allows revisions during the rebuttal period, I recommend reflecting them in the manuscript. The paper should also state which retrieval components are inherited from Vgent and which are modified or newly introduced. In addition, please clarify whether semantic extraction for the other backbones (Qwen2.5-VL-3B, Qwen2-VL-7B, InternVL3.5-8B) also uses Qwen2.5-VL-7B-Instruct.
2. Justification of coarse indexing.
Table 5 does not directly show why coarse indexing is sufficient. Since RR jointly covers recovery and reranking, the gain from 60.6 to 63.1 cannot be attributed to fine-grained recovery alone. A more direct analysis would be to quantitatively compare retrieval performance between fine-grained (Vgent) and coarse-grained retrieval.
3. Novelty.
The paper does not discuss the challenges of converting a fine-grained graph index into a coarse one, nor does it provide detailed experiments on the related design choices (e.g., adapting graph construction for merged nodes, or using vision-encoder features or a lightweight encoder instead of raw-pixel descriptors). Without such considerations, DAGC reads as simply inserting a coarse-indexing step into Vgent, which feels more like an engineering modification.