MLLM Frame Subset Ensembling for Audio-Visual Video QA and MLLM-based Reranking for Ad-hoc Video Search in TRECVID 2025
Authors: Andreas Goulas, Damianos Galanopoulos, Ioannis Patras, Vasileios Mezaris
Organizations: Information Technologies Institute (ITI), Centre of Research and Technology Hellas (CERTH), Thessaloniki, Greece · Queen Mary University of London, London, UK
This paper presents the overview of the runs related to the Ad-hoc Video Search (AVS) and Video Question Answering (VQA) tracks of TRECVID 2025 on behalf of the CERTH-ITI team. For the AVS track, we introduce a two-stage framework built on foundation models. In the first stage, multiple vision-language models (VLMs) encode both the input query, augmented through LLM-generated rephrasings, and the candidate video shots, producing weighted similarity scores for initial retrieval. In the second stage, we utilize a Multimodal-LLM(MLLM)-based reranking module that evaluates the semantic alignment between each shot among the top-N highest-ranked ones and the original query, generating updated relevance scores for reordering these shots. This MLLM-driven reranking significantly improves contextual matching and produces more accurate final rankings without requiring any model training. Regarding the VQA track, we fine-tune an audio-visual MLLM model on the provided TRECVID training dataset and we implement an inference-time scaling technique to enhance the multimodal understanding capabilities of the MLLM. For the open-ended Answer Generation (AG) task, we aggregate multiple model responses per question via a majority vote. The responses are generated with greedy sampling from different random frame subsets of the video and they are ranked based on the number of votes. For the Multiple-Choice (MC) task, instead of voting, we use mean pooling on the logits assigned by the fine-tuned model to each candidate response. Through the combination of fine-tuning and frame subset ensembling we achieve the highest score across 3 metrics in the VQA AG task and the second highest in the VQA MC task.
Figures & tables
Figure 1: An overview of the proposed AVS method.
LLM
Prompts
LLaMA-3.2-1B-Instruct (query expansion)
You are given a short visual description used for video retrieval, such as < query >. Your task is to rephrase the sentence while preserving all visual details, entities, and attributes. Do not remove or replace any element. Only change the phrasing or order of words. Provide twenty alternatives. Original: < query >
Qwen2.5-VL-7B (reranking)
How relevant is this image to the following caption: < query >? Answer with a single number 1-10.
Table 1: The prompts that were used for query augmentation and for the video shot reranking.
Network Family
Pre-trained Model
Network Family
Pre-trained Model
BLIP
base_coco
BEiT3
base_coco (retrieval)
base_flickr
base_flickr30k (retrieval)
large_coco
large_coco (retrieval)
large_flickr
large_flickr30k (retrieval)
BLIP-2
itm_coco
CLIP
RN101
itm_pretrain
RN50
Table 2: The cross-modal network families and their pre-trained model variations utilized in our AVS 2025 participation.
Run id:
2022
2023
2024
2025
ITI_CERTH.25 run_1
0.332
0.379
0.416
0.421
ITI_CERTH.25 run_2
0.331
0.378
0.412
0.41
ITI_CERTH.25 run_3
0.312
0.357
0.381
0.369
ITI_CERTH.25 run_4
0.284
0.330
0.344
0.337
Table 3: Mean Extended Inferred Average Precision (MXinfAP) for all submitted runs for the 2022, 2023, 2024 and 2025 fully automatic AVS tasks. Best results are emphasized .
Figure 2: AVS 2025 ranking of all submitted runs using the combined ground truth of 2024 and 2025 evaluations, in MXinfAP terms. Red bars indicate our submitted runs.
Figure 3: AVS 2025 ranking of all submitted runs using only the 2024 ground truth, in MXinfAP terms. Red bars indicate our submitted runs.
Figure 4: Video Question Answering architecture.
Figure 5: VQA Answer Generation (AG) ranking of all submitted runs in TRECVID 2025, sorted by STS score. Run IDs in red on the horizontal axis indicate our submitted runs.
Run id:
METEOR
BERTScore
STS
certh.vqa.ag.run_1
0.260 *
0.903 *
0.348
certh.vqa.ag.run_2
0.260 *
0.898
0.351 *
certh.vqa.ag.run_3
0.203
0.891
0.285
certh.vqa.ag.run_4
0.260
0.903
0.348
Table 4: Official results for the submitted runs in the VQA Answer Generation (AG) task. Best results are emphasized . The results of Run 4 are de-emphasized because the run is the same as Run 1, with all quote characters removed.
Run id:
METEOR
BERTScore
STS
certh.vqa.ag.run_1 + Top-1
0.265
0.905
0.356
certh.vqa.ag.run_2 + Top-1
0.260
0.898
0.351
certh.vqa.ag.run_3 + Top-1
0.215
0.897
0.304
Table 5: Results with top-1 selection for the VQA Answer Generation (AG) task. Best results are emphasized .
Figure 6: VQA Multiple Choice (MC) track ranking of all submitted runs in TRECVID 25 sorted by top-1 accuracy. Run IDs in red on the horizontal axis indicate our submitted runs.
Run id:
Variant
Top-1 (%)
MRR
certh.vqa.mc.run_1
zero-shot
74.2
0.843
certh.vqa.mc.run_2
SFT
76.1
0.855
certh.vqa.mc.run_3
zero-shot
53.0
0.708
certh.vqa.mc.run_4
SFT
55.9
0.727
Table 6: Official results for the VQA Multiple Choice (MC) task. Best results are emphasized . SFT refers to Supervised Fine-tuning.
Method
Top-1 (%)
MRR
Base model
73.2
0.838
+ multiple generations
74.2
0.843
Fine-tuned model
74.4
0.845
+ multiple generations
76.1
0.855
Table 7: Ablation study for the VQA Multiple Choice (MC) task. Best results are emphasized .
Multimodal large language models (MLLMs) process multimodal inputs by converting text, images, and videos into token sequences that are subsequently processed by a backbone language model. While MLLMs have achieved excellent performance in understanding the content of individual images, video understanding remains significantly more difficult because videos contain large number of video frames. MLLMs typically process only a subset of these frames, usually ranging from 8 to 64. MLLMs usually sample frames uniformly, regardless of their relevance to the question being answered. To address this limitation, several training-free, model-agnostic methods for selecting question-relevant frames have recently been proposed. In this work, we introduce a frame-selection method designed specifically for multiple-choice questions. We extend the query text by appending semantic cues derived from the answer choices and employ a direct query-frame alignment scoring mechanism. To the best of our knowledge, our method is the first to directly utilize answer choices as inference-time cues for selecting frames relevant to answering a question. The method first constructs a compact candidate pool by subsampling video frames at a fixed rate. The frames are then scored according to their maximum cosine similarity across all question-answer pairs to identify the most relevant frames for a given query. This approach preserves a fixed token budget while improving the relevance of the visual evidence provided to the downstream MLLM. We evaluate the effectiveness of our frame-selection method on the MLVU, Video-MME, and LongVideoBench benchmarks using three MLLMs: LLaVA-Mini, Qwen2-VL, and LLaVA-Video. Experimental results demonstrate that answer-aware frame selection generally outperforms uniform sampling and existing training-free frame-selection methods under the same frame budget.
Md. Safayet Islam, Dilip Sarkar, Liang Liang
Department of Computer Science University of Miami Coral Gables, FL 33146
Recent multimodal large language models (MLLMs) have substantially advanced video understanding, yet long-form video QA remains challenging under fixed input token budgets, where uniform sampling can be inefficient for evidence localization. We propose ReQuest , an uncertainty-driven, question-adaptive keyframe selection pipeline that aligns question intent with relevant video content through selective computation. ReQuest integrates (i) a lightweight question-aware selector distilled from MLLM-generated supervision, (ii) Re-thinking Routing that triggers additional inference only when the model is uncertain with a length-adaptive criterion, and (iii) uncertainty-guided adaptive non-maximum suppression that selects temporally diverse frames while adjusting spacing based on question difficulty. As a plug-andplay method, ReQuest improves long-video QA without modifying or fine-tuning the underlying MLLM. Experiments on Video-MME, MLVU, and LongVideoBench demonstrate consistent accuracy gains with competitive computational cost, with particularly strong improvements in medium and long video regimes.
Minkuk Kim, Suyong Yun, Young Tae Kim +3
Kyung Hee University, Republic of Korea · Electronics and Telecommunications Research Institute (ETRI), Republic of Korea
Long-form video question answering requires reasoning over extended temporal contexts, making frame selection a critical bottleneck for multi-modal large language models (MLLMs) bound by finite context windows. Within the controlled frame-budget regime that governs practical deployment, prior selectors score frames against a single global query embedding; as a result, compositional multimodal questions that involve temporal ordering or cross-modal cues such as "what happens on screen right after the narrator mentions the reaction?" are flattened into a representation that loses sub-event ordering and modality bindings. We introduce HiMu, a training-free framework for compositional multimodal frame selection. A single text-only LLM call decomposes the query into a hierarchical logic tree whose leaves are atomic predicates, each routed to a lightweight expert spanning vision (CLIP, open-vocabulary detection, OCR) and audio (speech recognition and non-speech sound matching). Expert signals are normalized, smoothed to align across modalities, and composed bottom-up through fuzzy-logic operators that enforce temporal sequencing and adjacency, yielding a continuous per-frame satisfaction curve. Under the standard 16-frame budget on Video-MME, LongVideoBench, and HERBench-Lite, HiMu achieves state-of-the-art accuracy among frame selection methods and improves over uniform sampling across seven diverse MLLMs as a drop-in module, matching the accuracy of uniform sampling at 4x its frame budget, without retraining and without multiple iterative MLLM calls during selection.
Dan Ben-Ami, Gabriele Serussi, Kobi Cohen +1
INSIGHT Lab, Ben-Gurion University of the Negev, Israel · Ben-Gurion University of the Negev, Israel