Papers
arxiv:2606.13141

Rethinking RAG in Long Videos: What to Retrieve and How to Use It?

Published on Jun 11
· Submitted by
Yuho Lee
on Jun 15
Authors:
,
,
,
,
,
,

Abstract

VideoRAG systems are extended to handle long egocentric videos with multi-modal retrieval across temporal granularities, addressing limitations in existing benchmarks and methods through a new benchmark and chunk-adaptive reranking approach.

Retrieval-augmented generation is moving beyond text into long, egocentric video, where systems must select query-relevant chunks across multiple modalities and temporal granularities. Yet progress in VideoRAG is limited by two gaps: existing benchmarks allow queries to be answered without the video, obscuring retrieval errors, and prior methods apply a single modality-granularity configuration per query, ignoring chunk-level variability. We address both by introducing V-RAGBench, a benchmark of langlequery, evidence chunk, answerrangle triplets that enables faithful, decoupled evaluation of retrieval and generation, and CARVE, a simple method that runs parallel retrievers across configurations and employs chunk-adaptive reranking to identify the winning configuration for each chunk. Each chunk then enters the generator under its winning configuration selected during retrieval, yielding an interleaved evidence form where the chunk-level decision propagates across both stages. CARVE outperforms eight recent VideoRAG baselines, with the chunks supplied to the generator interleaving multiple configurations rather than sharing a single one, a behavior unattainable by query-level methods.

Community

Paper author Paper submitter

If you have any question about the paper, please contact yuholee@kaist.ac.kr

This is an interesting take on VideoRAG. I really like the point about how existing benchmarks often let models answer queries without even needing the video footage, which definitely makes it hard to tell if the retrieval is actually working.

I'm curious how CARVE handles the computational overhead of running those parallel retrievers for every chunk. Does this approach significantly slow down inference compared to the baselines?

I made a podcast on it with ResearchPod, it makes it easy to get the key concepts on the go:
https://researchpod.app/episode/bf84ea63-24c4-40f0-a075-43f25157dfdc

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2606.13141
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2606.13141 in a model README.md to link it from this page.

Datasets citing this paper 1

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2606.13141 in a Space README.md to link it from this page.

Collections including this paper 2