Shoubin Yu
Author directory2026
Balancing Faithfulness and Performance in Reasoning via Multi-Listener Soft Execution
Nithin Sivakumaran | Shoubin Yu | Hyunji Lee | Yue Zhang | Ali Payani | Mohit Bansal | Elias Stengel-Eskin
Findings of the Association for Computational Linguistics: EMNLP 2026
Nithin Sivakumaran | Shoubin Yu | Hyunji Lee | Yue Zhang | Ali Payani | Mohit Bansal | Elias Stengel-Eskin
Findings of the Association for Computational Linguistics: EMNLP 2026
Chain-of-thought (CoT) reasoning sometimes fails to faithfully reflect the true computation of a large language model (LLM), hampering its utility in explaining how LLMs arrive at their answers. Moreover, optimizing for faithfulness and interpretability in reasoning often degrades task performance. To address this tradeoff and improve CoT faithfulness, we propose Reasoning Execution by Multiple Listeners (REMuL), a multi-party reinforcement learning approach. REMuL builds on the hypothesis that reasoning traces which other parties can follow will be more faithful. A speaker model generates a reasoning trace, which is truncated and passed to a pool of listener models who “execute” the trace, continuing the trace to an answer. Speakers are rewarded for producing reasoning that is clear to listeners, with additional correctness regularization via masked supervised finetuning to counter the tradeoff between faithfulness and performance. On multiple reasoning benchmarks (BIG-Bench Extra Hard, MuSR, ZebraLogicBench, and FOLIO), REMuL consistently and substantially improves three measures of faithfulness – hint attribution, early answering area over the curve (AOC), and mistake injection AOC – while also improving accuracy. Our analysis finds that these gains are robust across training domains and are associated with shorter and more direct CoTs.
How Well Do Vision-Language Models Understand Movies?
Emmanouil Zaranis | António Farinhas | Saul Santos | Beatriz Canaverde | Miguel Moura Ramos | Wafaa Mohammed | Giuseppe Attanasio | Chrysoula Zerva | Nithin Sivakumaran | Shoubin Yu | Elena Bueno-Benito | Aditya K Surikuchi | Ben Peters | Danae Sanchez Villegas | Andre G. Viveiros | Pavlo Vasylenko | Baohao Liao | Sonal Sannigrahi | Jaehong Yoon | Elias Stengel-Eskin | Mariella Dimiccoli | Oswald Lanz | Alessandro Suglia | Mohit Bansal | Sandro Pezzelle | Stella Frank | Vlad Niculae | Desmond Elliott | Raffaella Bernardi | Raquel Fernández | Andre Martins
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Emmanouil Zaranis | António Farinhas | Saul Santos | Beatriz Canaverde | Miguel Moura Ramos | Wafaa Mohammed | Giuseppe Attanasio | Chrysoula Zerva | Nithin Sivakumaran | Shoubin Yu | Elena Bueno-Benito | Aditya K Surikuchi | Ben Peters | Danae Sanchez Villegas | Andre G. Viveiros | Pavlo Vasylenko | Baohao Liao | Sonal Sannigrahi | Jaehong Yoon | Elias Stengel-Eskin | Mariella Dimiccoli | Oswald Lanz | Alessandro Suglia | Mohit Bansal | Sandro Pezzelle | Stella Frank | Vlad Niculae | Desmond Elliott | Raffaella Bernardi | Raquel Fernández | Andre Martins
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Vision-language models (VLMs) can increasingly handle extended contexts and answer questions about long videos—but can they understand the narrative structure of movies as humans do? To investigate this question, we introduce MF2 (Movie Facts and Fibs), a fully manually curated benchmark designed to evaluate whether models can identify, recall, and comprehend information central to the movie’s storyline, using both the visual and textual modalities. MF2 includes over 50 open-licensed movies, each paired with manually constructed sets of claim pairs: one true claim (fact) and one plausible but false (fib), totaling over 850 pairs. Our analysis across 20 open-source and 2 proprietary models reveals a substantial gap relative to human performance. While subtitles provide a strong signal for narrative understanding, other textual sources (e.g., synopses) are less informative. In contrast, when visual information is distributed across the entire movie and jointly embedded with subtitles, models struggle to identify and effectively use the relevant content. However, when the visual input is restricted to claim-relevant visual content, models improve significantly, indicating substantial room for improvement in processing large multimodal contexts and distinguishing relevant from irrelevant information. Overall, our findings highlight persistent challenges in multimodal narrative understanding for current VLMs. We release our data and code to support further research in this direction.
2025
MEXA: Towards General Multimodal Reasoning with Dynamic Multi-Expert Aggregation
Shoubin Yu | Yue Zhang | Ziyang Wang | Jaehong Yoon | Mohit Bansal
Findings of the Association for Computational Linguistics: EMNLP 2025
Shoubin Yu | Yue Zhang | Ziyang Wang | Jaehong Yoon | Mohit Bansal
Findings of the Association for Computational Linguistics: EMNLP 2025
Combining pre-trained expert models offers substantial potential for scalable multimodal reasoning, but building a unified framework remains challenging due to the increasing diversity of input modalities and task complexity. For instance, medical diagnosis requires precise reasoning over structured clinical tables, while financial forecasting depends on interpreting plot-based data to make informed predictions. To tackle this challenge, we introduce MEXA, a training-free framework that performs modality- and task-aware aggregation of multiple expert models to enable effective multimodal reasoning across diverse and distinct domains. MEXA dynamically selects expert models based on the input modality and the task-specific reasoning demands (i.e., skills). Each expert model, specialized in a modality task pair, generates interpretable textual reasoning outputs. MEXA then aggregates and reasons over these outputs using a Large Reasoning Model (LRM) to produce the final answer. This modular design allows flexible and transparent multimodal reasoning across diverse domains without additional training overhead. We extensively evaluate our approach on diverse multimodal benchmarks, including Video Reasoning, Audio Reasoning, 3D Understanding, and Medical QA. MEXA consistently delivers performance improvements over strong multimodal baselines, highlighting the effectiveness and broad applicability of our expert-driven selection and aggregation in diverse multimodal reasoning tasks.
Video-RTS: Rethinking Reinforcement Learning and Test-Time Scaling for Efficient and Enhanced Video Reasoning
Ziyang Wang | Jaehong Yoon | Shoubin Yu | Md Mohaiminul Islam | Gedas Bertasius | Mohit Bansal
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Ziyang Wang | Jaehong Yoon | Shoubin Yu | Md Mohaiminul Islam | Gedas Bertasius | Mohit Bansal
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Despite advances in reinforcement learning (RL)-based video reasoning with large language models (LLMs), data collection and fine- tuning remain significant challenges. These methods often rely on large-scale supervised fine-tuning (SFT) with extensive video data and long Chain-of-Thought (CoT) annotations, making them costly and hard to scale. To address this, we present Video-RTS, a new approach to improve video reasoning capability with drastically improved data efficiency by combining data-efficient RL with a video-adaptive test-time scaling (TTS) strategy. Building on observations about the data scaling, we skip the resource-intensive SFT step and employ efficient pure-RL training with output-based rewards, requiring no additional annotations or extensive fine-tuning. Furthermore, to utilize computational resources more efficiently, we introduce a sparse-to-dense video TTS strategy that improves inference by iteratively adding frames based on output consistency. We validate our approach on multiple video reasoning benchmarks, showing that Video-RTS surpasses existing video reasoning models by 2.4% in accuracy using only 3.6% training samples. Specifically, Video-RTS achieves a 4.2% improvement on Video-Holmes, a recent and challenging video reasoning benchmark. Notably, our pure RL training and adaptive video TTS offer complementary strengths, enabling Video-RTS’s strong reasoning performance.
RACCooN: Versatile Instructional Video Editing with Auto-Generated Narratives
Jaehong Yoon | Shoubin Yu | Mohit Bansal
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Jaehong Yoon | Shoubin Yu | Mohit Bansal
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Recent video generative models primarily rely on detailed, labor-intensive text prompts for tasks, like inpainting or style editing, limiting adaptability for personal/raw videos. This paper proposes RACCooN, a versatile and user-friendly video-to-paragraph-to-video editing method, supporting diverse video editing capabilities, such as removal, addition, and modification, through a unified pipeline. RACCooN consists of two principal stages: Video-to-Paragraph (V2P), which automatically generates structured video descriptions capturing both scene context and object details, and Paragraph-to-Video (P2V), where users (optionally) refine these descriptions to guide a video diffusion model for flexible content modifications, including removing, changing subjects, and/or adding new objects. Key contributions of RACCooN include: (1) A multi-granular spatiotemporal pooling strategy for structured video understanding, capturing both broad context and fine-grained details of major objects to enable precise text-based video editing without the need for complex human annotations. (2) A video generative model fine-tuned on our curated video-paragraph-mask dataset, enhances the editing and inpainting quality. (3) The capability to seamlessly generate new objects in videos by forecasting their movements through automatically generated mask planning. In the end, users can easily edit complex videos with RACCooN’s automatic explanations and guidance. We demonstrate its versatile capabilities in video-to-paragraph generation (up to 9.4%p absolute improvement in human evaluations) and video content editing (relative to 49.7% lower FVD), and can be integrated with SoTA video generation models for further enhancement.
2024
A Simple LLM Framework for Long-Range Video Question-Answering
Ce Zhang | Taixi Lu | Md Mohaiminul Islam | Ziyang Wang | Shoubin Yu | Mohit Bansal | Gedas Bertasius
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
Ce Zhang | Taixi Lu | Md Mohaiminul Islam | Ziyang Wang | Shoubin Yu | Mohit Bansal | Gedas Bertasius
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing
We present LLoVi, a simple yet effective Language-based Long-range Video question-answering (LVQA) framework. Our method decomposes the short- and long-range modeling aspects of LVQA into two stages. First, we use a short-term visual captioner to generate textual descriptions of short video clips (0.5-8 seconds in length) densely sampled from a long input video. Afterward, an LLM aggregates the densely extracted short-term captions to answer a given question. Furthermore, we propose a novel multi-round summarization prompt that asks the LLM first to summarize the noisy short-term visual captions and then answer a given input question. To analyze what makes our simple framework so effective, we thoroughly evaluate various components of our framework. Our empirical analysis reveals that the choice of the visual captioner and LLM is critical for good LVQA performance. The proposed multi-round summarization prompt also leads to a significant LVQA performance boost. Our method achieves the best-reported results on the EgoSchema dataset, best known for very long-form video question-answering. LLoVi also outperforms the previous state-of-the-art by 10.2% and 6.2% on NExT-QA and IntentQA for LVQA. Finally, we extend LLoVi to grounded VideoQA, which requires both QA and temporal localization, and show that it outperforms all prior methods on NExT-GQA. Code is available at https://github.com/CeeZh/LLoVi.
Search
Fix author
Co-authors
- Mohit Bansal 6
- Jaehong Yoon 4
- Ziyang Wang 3
- Gedas Bertasius 2
- Md Mohaiminul Islam 2
- Nithin Sivakumaran 2
- Elias Stengel-Eskin 2
- Yue Zhang 2
- Giuseppe Attanasio 1
- Raffaella Bernardi 1
- Elena Bueno-Benito 1
- Beatriz Canaverde 1
- Mariella Dimiccoli 1
- Desmond Elliott 1
- António Farinhas 1
- Raquel Fernández 1
- Stella Frank 1
- Oswald Lanz 1
- Hyunji Lee 1
- Baohao Liao 1
- Taixi Lu 1
- André F. T. Martins 1
- Wafaa Mohammed 1
- Vlad Niculae 1
- Ali Payani 1
- Ben Peters 1
- Sandro Pezzelle 1
- Miguel Moura Ramos 1
- Danae Sanchez Villegas 1
- Sonal Sannigrahi 1
- Saul Santos 1
- Alessandro Suglia 1
- Aditya K Surikuchi 1
- Pavlo Vasylenko 1
- Andre G. Viveiros 1
- Emmanouil Zaranis 1
- Chrysoula Zerva 1
- Ce Zhang 1