Papers › VideoTree: Adaptive Tree-based Video Representation for LLM Reasoning on Long Videos

VideoTree: Adaptive Tree-based Video Representation for LLM Reasoning on Long Videos

29 May 2024CVPR 2025 1arXiv:2405.19209archive 2025-07-28

Ziyang Wang, Shoubin Yu, Elias Stengel-Eskin, Jaehong Yoon, Feng Cheng, Gedas Bertasius, Mohit Bansal

Long-form video understanding has been a challenging task due to the high redundancy in video data and the abundance of query-irrelevant information. To tackle this challenge, we propose VideoTree, a training-free framework which builds a query-adaptive and hierarchical video representation for LLM reasoning over long-form videos. First, VideoTree extracts query-relevant information from the input video through an iterative process, progressively refining the selection of keyframes based on their relevance to the query. Furthermore, VideoTree leverages the inherent hierarchical structure of long video data, which is often overlooked by existing LLM-based methods. Specifically, we incorporate multigranularity information into a tree-based representation, allowing VideoTree to extract query-relevant details from long videos in a coarse-to-fine manner. This enables the model to effectively handle a wide range of video queries with varying levels of detail. Finally, VideoTree aggregates the hierarchical query-relevant information within the tree structure and feeds it into an LLM reasoning model to answer the query. Our experiments show that our training-free method improves both reasoning accuracy and efficiency compared to existing methods. Specifically, VideoTree outperforms the existing training-free approaches on the popular EgoSchema and NExT-QA benchmarks with less inference time, achieving 61.1% and 75.6% accuracy on the test set without additional video-specific training. Moreover, on the long split of Video-MME benchmark (average 44 minutes), the training-free VideoTree framework achieves better performance than the strong proprietary GPT-4V model and other MLLMs that were extensively trained on video data.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2405.19209")

Code

Syntology Ran 11 of 11 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 11 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 11 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Ziyang412/VideoTree officialmentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 11 ran; 0 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11ran

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from Ziyang412/VideoTree. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

build_fewshot_examples Ziyang412/VideoTree/util.py official repository ran fingerprinted MIT (permissive) · a16cc02636239688 · report
cosine_similarity Ziyang412/VideoTree/depth_expansion.py official repository ran fingerprinted MIT (permissive) · b92a31685a22299f · report
find_closest_points_in_temporal_order_subsub Ziyang412/VideoTree/depth_expansion.py official repository ran MIT (permissive) · 863db1147f3fdd20 · report
find_closest_points_per_cluster Ziyang412/VideoTree/adaptive_breath_expansion.py official repository ran MIT (permissive) · 4cd91b167b647601 · report
first_char_after_anchor Ziyang412/VideoTree/prompts.py official repository ran MIT (permissive) · 3c2914cfae3c5c3a · report
first_char_as_answer Ziyang412/VideoTree/prompts.py official repository ran fingerprinted MIT (permissive) · dd8763aca4a7d6b7 · report
hierarchical_clustering_with_external_primary Ziyang412/VideoTree/depth_expansion.py official repository ran MIT (permissive) · e561f95df17f4c8b · report
identity Ziyang412/VideoTree/prompts.py official repository ran fingerprinted MIT (permissive) · 036725c05a3d96f8 · report
load_frame_features Ziyang412/VideoTree/adaptive_breath_expansion.py official repository ran MIT (permissive) · ec6d415be2b2d979 · report
load_json Ziyang412/VideoTree/util.py official repository ran MIT (permissive) · 658682feda4928a2 · report
load_pkl Ziyang412/VideoTree/util.py official repository ran MIT (permissive) · 8080055de6293a6b · report

Tasks

MMEVideo UnderstandingZero-Shot Video Question Answer

2 archive task tags without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Zero-Shot Video Question Answer EgoSchema (fullset) VideoTree (GPT4) Accuracy 61.1 #9 of 29 Archive leaderboard report
Zero-Shot Video Question Answer EgoSchema (subset) VideoTree (GPT4) Accuracy 66.2 #4 of 14 Archive leaderboard report
Zero-Shot Video Question Answer IntentQA VideoTree (GPT4) Accuracy 66.9 #5 of 13 Archive leaderboard report
Zero-Shot Video Question Answer NExT-QA VideoTree (GPT4) Accuracy 73.5 #6 of 27 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

SET

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections