Zing Forum

Reading

ParaVT: A Multi-Agent Parallel Video Tool Calling Framework to Resolve the Tool Prior Paradox

ParaVT is the first end-to-end RL-trained multi-agent parallel video tool calling framework. It addresses the error propagation and context contamination issues of serial calling by invoking multiple time window cropping tools in a single call. The PARA-GRPO algorithm is proposed to resolve the tool prior paradox, achieving an average improvement of 7.9% across 6 long video understanding benchmarks.

多模态模型强化学习视频理解工具调用多智能体GRPO长视频智能体
Published 2026-05-20 02:01Recent activity 2026-05-21 10:51Estimated read 5 min
ParaVT: A Multi-Agent Parallel Video Tool Calling Framework to Resolve the Tool Prior Paradox
1

Section 01

ParaVT Framework Guide: A Multi-Agent Parallel Video Tool Calling Solution to Resolve the Tool Prior Paradox

ParaVT is the first end-to-end RL-trained multi-agent parallel video tool calling framework. Its core innovation lies in invoking multiple time window cropping tools simultaneously in a single dialogue turn, addressing the error propagation, context contamination, and inference cost issues of serial calling. The framework proposes the PARA-GRPO algorithm to tackle the tool prior paradox, achieving an average performance improvement of 7.9% across 6 long video understanding benchmarks.

2

Section 02

Tool Calling Challenges in Long Video Understanding

Large multimodal models (LMMs) face context window capacity limitations when processing long videos, requiring tool calls to extend their perceptual capabilities. Existing RL-based tool calling methods mostly use serial mode, which has defects such as uncorrectable propagation of single wrong cropping, context contamination from multi-turn calls, and inference cost growing linearly with the number of turns.

3

Section 03

ParaVT Framework Design: Multi-Agent Parallelism and End-to-End RL Training

ParaVT adopts a multi-agent architecture where the main model generates multiple cropping instructions, and sub-agents process the corresponding segment features in parallel and aggregate the results, compressing multi-turn tasks into a single turn to reduce latency. The framework uses end-to-end RL training, where the model autonomously learns the optimal cropping strategy through interaction with the environment instead of relying on imitation of manual annotations.

4

Section 04

Discovery and Verification of the Tool Prior Paradox

When applying standard RL to ParaVT, the tool prior paradox was discovered: the tool prior formed by LMM pre-training leads to format collapse (unparseable output) and tool-skipping shortcuts (directly guessing answers). Cross-model verification shows that weak-prior models have stable formats but cannot trigger tool calls, confirming that prior is both a necessary condition and a training threat.

5

Section 05

PARA-GRPO Algorithm: Key Mechanism to Resolve the Tool Prior Paradox

PARA-GRPO adds two mechanisms to the standard GRPO: 1. Targeted format reward: Apply rewards only at structured token positions prone to collapse, stabilizing the format while preserving exploration space; 2. Frame budget randomization: Randomly vary the frame budget to force the model to call tools instead of relying on shortcuts.

6

Section 06

Experimental Results: Significant Improvements in Performance and Efficiency

ParaVT achieves an average improvement of 7.9% across 6 long video understanding benchmarks (including action recognition, temporal localization, and video question answering); PARA-GRPO increases the format compliance rate from 0.13 to 0.64; parallel calling compresses multi-turn interactions into a single turn, reducing inference latency proportionally with the number of turns.

7

Section 07

Research Insights and Future Directions

ParaVT reveals that RL training needs to collaborate with pre-trained priors rather than confront them. Limitations include only supporting video cropping tools and high system complexity; future directions are to expand complex tool chains, explore the tool prior paradox in other domains, and develop general prior-aware RL algorithms.