拆解视频语言模型的时序定位与文本回答,提升事件理解准确性
Factorized Learning for Temporally Grounded Video-Language Models
- 分步学习:先定位事件再基于证据回答,解耦两个任务
- 引入证据标记,增强对事件级视觉语义的捕捉能力
- 提出新型偏好优化算法,显式建模时间定位概率
近期视频语言模型在视频理解方面展现出巨大潜力,但在事件级感知的时序定位上仍不准确。我们观察到,时序定位与文本回答构成逻辑层级关系:准确的时序证据定位是可靠文本回答的基础。然而,现有方法通常耦合处理这两项任务,缺乏清晰结构,导致目标次优。本文从解耦学习视角出发,提出D²VLM框架,将两项任务解耦并强调其内在依赖。采用“定位后基于证据回答”的范式,引入证据标记以捕捉事件级视觉语义,超越以往聚焦时间戳表示的做法。为进一步促进学习,设计新型因子化偏好优化(FPO)算法,将概率性时序定位建模显式纳入优化目标,实现对时序定位与文本回答的联合偏好学习。同时构建合成数据集,弥补缺乏适用于因子化偏好学习且具显式时序定位标注的数据集的不足。在多项任务上的实验验证了本方法的显著优势。代码已开源。
原文摘要 · Abstract (English)
Recent video-language models have shown great potential for video understanding, but still struggle with accurate temporal grounding for event-level perception. We observe that two main factors in video understanding (i.e., temporal grounding and textual response) form a logical hierarchy: accurate temporal evidence grounding lays the foundation for reliable textual response. However, existing works typically handle these two tasks in a coupled manner without a clear logical structure, leading to sub-optimal objectives. We address this from a factorized learning perspective. We first propose D$^2$VLM, a framework that decouples the learning of these two tasks while also emphasizing their inherent dependency. We adopt a "grounding then answering with evidence referencing" paradigm and introduce evidence tokens for evidence grounding, which emphasize event-level visual semantic capture beyond the focus on timestamp representation in existing works. To further facilitate the learning of these two tasks, we introduce a novel factorized preference optimization (FPO) algorithm. Unlike standard preference optimization, FPO explicitly incorporates probabilistic temporal grounding modeling into the optimization objective, enabling preference learning for both temporal grounding and textual response. We also construct a synthetic dataset to address the lack of suitable datasets for factorized preference learning with explicit temporal grounding. Experiments on various tasks demonstrate the clear advantage of our approach. Our source code is available at https://github.com/nusnlp/d2vlm.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。