paper-with-me

홈 › Papers

MOSS-ChatV: Reinforcement Learning with Process Reasoning Reward for Video Temporal Reasoning

2025-09-25 · Sicheng Tao, Jungang Li, Yibo Yan, Junyan Zhang, Yubo Gao, Hanqian Li, ShuHang Xun, Yuxuan Fan, Hong Chen, Jianxiang He, Xuming Hu arxiv

Video reasoning has emerged as a critical capability for multimodal large language models (MLLMs), requiring models to move beyond static perception toward coherent understanding of temporal dynamics in complex scenes. Yet existing MLLMs often exhibit process inconsistency, where intermediate reasoning drifts from video dynamics even when the final answer is correct, undermining interpretability and robustness. To address this issue, we introduce MOSS-ChatV, a reinforcement learning framework with a Dynamic Time Warping (DTW)-based process reward. This rule-based reward aligns reasoning traces with temporally grounded references, enabling efficient process supervision without auxiliary reward models. We further identify dynamic state prediction as a key measure of video reasoning and construct MOSS-Video, a benchmark with annotated reasoning traces, where the training split is used to fine-tune MOSS-ChatV and the held-out split is reserved for evaluation. MOSS-ChatV achieves 87.2\% on MOSS-Video (test) and improves performance on general video benchmarks such as MVBench and MMVU. The framework consistently yields gains across different architectures, including Qwen2.5-VL and Phi-2, confirming its broad applicability. Evaluations with GPT-4o-as-judge further show that MOSS-ChatV produces more consistent and stable reasoning traces.

📄 PDF Abstract BibTeX arXiv:2509.21113

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

ChatVTG: Video Temporal Grounding via Chat with Video Dialogue Large Language Models

2024-10-01 · Mengxue Qu, Xiaodong Chen, Wu Liu, Alicia Li 외

Video Temporal Grounding (VTG) aims to ground specific segments within an untrimmed video corresponding to the given natural language query. Existing VTG methods largely depend on supervised learning and extensive annota…

A Rolling Stone Gathers No Moss: Adaptive Policy Optimization for Stable Self-Evaluation in Large Multimodal Models

2025-08-05 · Wenkai Wang, Hongcan Guo, Zheqi Lv, Shengyu Zhang arxiv

Self-evaluation, a model's ability to assess the correctness of its own output, is crucial for Large Multimodal Models (LMMs) to achieve self-improvement in multi-turn conversations, yet largely absent in foundation mode…

Reinforcement Learning

Minimax Policy for Heavy-tailed Bandits

2020-07-20 · Lai Wei, Vaibhav Srivastava

We study the stochastic Multi-Armed Bandit (MAB) problem under worst-case regret and heavy-tailed reward distribution. We modify the minimax policy MOSS for the sub-Gaussian reward distribution by using saturated empiric…

Multi-Armed Bandits

A Mixture of Surprises for Unsupervised Reinforcement Learning

2022-10-13 · Andrew Zhao, Matthieu Gaetan Lin, Yangguang Li, Yong-Jin Liu 외

Unsupervised reinforcement learning aims at learning a generalist policy in a reward-free manner for fast adaptation to downstream tasks. Most of the existing methods propose to provide an intrinsic reward based on surpr…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)Unsupervised Reinforcement Learning

ChatVis: Automating Scientific Visualization with a Large Language Model

2024-10-07 · Tanwi Mallick, Orcun Yildiz, David Lenz, Tom Peterka

We develop an iterative assistant we call ChatVis that can synthetically generate Python scripts for data analysis and visualization using a large language model (LLM). The assistant allows a user to specify the operatio…

Language ModelingLanguage ModellingLarge Language Model