Decomposing Queries into Tool Calls for Long-Video Keyframe Retrieval
Abstract
ToolMerge is a keyframe retrieval method that uses an LLM-based planner to decompose queries into tool calls and merge their rankings with boolean operators, achieving competitive performance on video QA and caption retrieval.
Keyframe selection is a direct way to provide verifiable visual evidence for long-video question answering (QA). Queries differ in what they require, and finding the right frames depends on knowing what to look for. Existing keyframe selectors either score every frame against a single query, or decompose the query into a fixed schema evaluated by a single visual tool. We propose ToolMerge, a keyframe retrieval method based on decomposition and merging: an Large Language Model (LLM) based planner decomposes the query into tool calls and specifies how their per-tool rankings are merged using boolean operators. To evaluate retrieval directly, we construct Molmo-2 Moments (M2M), a benchmark in which every question is anchored to a specific time interval by construction. Across QA, question retrieval, and caption retrieval, ToolMerge is competitive with prior keyframe selectors, most notably on caption retrieval, outperforming other methods by 5%. Code and data can be found at https://github.com/michalsr/ToolMerge .
Get this paper in your agent:
hf papers read 2605.23826 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 1
Datasets citing this paper 1
michalsr/molmo2-moments
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper