Juntao Dai
2026
Perception, Understanding and Reasoning: A Multimodal Benchmark for Video Fake News Detection
Cui Yakun | Peng Qi | Fushuo Huo | Hang Du | Weijie Shi | Juntao Dai | Zhenghao Zhu | Sirui Han
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Cui Yakun | Peng Qi | Fushuo Huo | Hang Du | Weijie Shi | Juntao Dai | Zhenghao Zhu | Sirui Han
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
The advent of multi-modal large language models (MLLMs) has greatly advanced research on video fake news detection (VFND) tasks. Existing benchmarks typically focus on the detection accuracy, while failing to provide fine-grained assessments for the entire detection process. To address these limitations, we introduce POVFNDB (Process-oriented Video Fake News Detection Benchmark), a process-oriented benchmark comprising 10 tasks designed to systematically evaluate MLLMs’ perception, understanding, and reasoning capabilities in VFND. This benchmark contains 36,240 human-annotated question-answer (QA) in structured or open-ended formats, spanning 15 distinct evaluation dimensions that characterize different aspects of the video fake news detection process.Using POVFNDB, we conduct comprehensive evaluations on both proprietary and open-source MLLMs. Moreover, We fine-tune Qwen2.5VL-7B-Instruct on a reasoning dataset generated by our proposed POVFND-CoT, a chain-of-thought method that utilizes rationales from evaluation results and rationale validation. The resulting model achieves sota performance on VFND.
A Game-Theoretica Negotiation Framework for Cross-Cultural Consensus
Guoxi Zhang | Jiawei Chen | Tianzhuo Yang | Jiaming Ji | Yaodong Yang | Juntao Dai
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Guoxi Zhang | Jiawei Chen | Tianzhuo Yang | Jiaming Ji | Yaodong Yang | Juntao Dai
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large language models (LLMs) are shaping global values, yet they frequently exhibit a pronounced WEIRD (Western, Educated, Industrialized, Rich, Democratic) cultural bias, marginalizing diverse viewpoints and posing challenges for reconciling diverse populations with varying cultural backgrounds and value systems. In this work, we move beyond simple alignment methods to propose a new paradigm for cross-cultural fairness. We introduce a Nash Consensus Negotiation framework under the formulation of cross-cultural consensus as a Nash Equilibrium. Each LLM iteratively proposes and refines natural-language guidelines, guided by a utility function balancing self-consistency with mutual acceptance, while penalizing redundancy. The process expands the proposal space and converges to a consensus, yielding fair and interpretable consensus outcomes. We evaluate our framework against baselines using quantitative metrics, qualitative analysis, and large-scale human studies. Experiments demonstrate that our framework generates higher-quality and more balanced consensus, effectively mitigating assimilation toward WEIRD values. Furthermore, we finetune diverse LLM architectures with negotiation data via preference optimization and supervised reasoning, reducing cultural distances by up to 95.53%. Overall, our work offers a systematic path to mitigate cultural bias in LLMs by guiding them toward self-consistency, mutually-acceptable equilibria.
Benchmarking Fine-Grained Error Detection in Multimodal Reasoning
Chi-Min Chan | Han Zhu | Chunyang Jiang | Jiaming Ji | Juntao Dai | Wei Xue | Sirui Han | Yike Guo
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Chi-Min Chan | Han Zhu | Chunyang Jiang | Jiaming Ji | Juntao Dai | Wei Xue | Sirui Han | Yike Guo
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Multimodal Process Reward Models (MPRMs) have emerged as a pivotal framework for enhancing the reasoning capabilities of Multimodal Large Language Models (MLLMs). However, the research community currently lacks a dedicated benchmark to rigorously assess the error discernment capabilities of these models.To address this gap, we introduce PRMBench-V, a novel benchmark specifically designed to evaluate MPRMs’ proficiency in detecting erroneous reasoning steps across diverse error categories. Leveraging a semi-automated annotation pipeline augmented with human verification, we construct a comprehensive dataset comprising 907 unique queries, each annotated with nine distinct error types, resulting in 8,163 test cases with fine-grained step-level error labels.Through extensive experiments involving over 15 open- and closed-source models, we uncover several key findings: (1) even the strongest existing MPRMs achieve only \textasciitilde30% accuracy in error identification; (2) while partial error detection achieves moderate precision and recall (\textasciitilde60%), overall accuracy remains low (\textasciitilde20%); and (3) benchmark scores exhibit a strong correlation with downstream task performance gains (r=0.86). Furthermore, we demonstrate that PRMBench-V can inform the development of more robust MPRMs: by introducing the Bayesian Rater Reliability Process Reward Model (BR2-PRM), we achieve up to a 4.8% performance improvement through test-time scaling.We believe that PRMBench-V will serve as a valuable resource for advancing MPRM research, enabling more rigorous evaluation and fostering the development of models with fine-grained multimodal reasoning capabilities.
SafeMT: Multi-turn Safety for Multimodal Language Models
Han Zhu | Juntao Dai | Jiaming Ji | Haoran Li | Chengkun Cai | Pengcheng Wen | Chi-Min Chan | Boyuan Chen | Yaodong Yang | Sirui Han | Yike Guo
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Han Zhu | Juntao Dai | Jiaming Ji | Haoran Li | Chengkun Cai | Pengcheng Wen | Chi-Min Chan | Boyuan Chen | Yaodong Yang | Sirui Han | Yike Guo
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
With the widespread use of multi-modal Large Language models (MLLMs), safety issues have become a growing concern. Multi-turn dialogues, which are more common in everyday interactions, pose a greater risk than single prompts; however, existing benchmarks do not adequately consider this situation. To encourage the community to focus on the safety issues of these models in multi-turn dialogues, we introduce SafeMT, a benchmark that features dialogues of varying lengths generated from harmful queries accompanied by images. This benchmark consists of 10,000 samples in total, encompassing 17 different scenarios and four jailbreak methods. Additionally, we propose Safety Index (SI) to evaluate the general safety of MLLMs during conversations. We assess the safety of 17 models using this benchmark and discover that the risk of successful attacks on these models increases as the number of turns in harmful dialogues rises. This observation indicates that the safety mechanisms of these models are inadequate for recognizing the hazard in dialogue interactions. We propose a dialogue safety moderator capable of detecting malicious intent concealed within conversations and providing MLLMs with relevant safety policies. Experimental results from several open-source models indicate that this moderator is more effective in reducing multi-turn Attack Success Rate (ASR) compared to existed guard models.
Omni-RewardBench: Toward a Comprehensive Evaluation of Generative Reward Models Across Modalities
Chi-Min Chan | Yujin Zhou | Pengcheng Wen | Boqin Yin | Jiaming Ji | Juntao Dai | Wei Xue | Sirui Han | Yike Guo
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Chi-Min Chan | Yujin Zhou | Pengcheng Wen | Boqin Yin | Jiaming Ji | Juntao Dai | Wei Xue | Sirui Han | Yike Guo
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
The rise of Omni-modality Large Language Models (OLLMs) capable of jointly processing text, audio, and visual inputs marks a major step toward general intelligence. Ensuring their alignment with human preferences requires effective Omni-modality Reward Models (ORMs), which serve as surrogates for human judgment to guide OLLMs behavior. However, ORMs evaluation remains underdeveloped in the previous literature. Existing benchmarks are largely text-centric or limited to bimodal tasks, restricting comprehensive assessment for ORMs. To bridge this gap, we introduce Omni-RewardBench, the first benchmark for comprehensive evaluation of ORMs across modalities. In short, our contributions are threefold: (1) a hybrid automatic-annotation and human-verification pipeline to construct high-quality evaluation data; (2) extensive experiments on 20+ models, including inherently omni-modal and modality-bridged systems. Our experimental results demonstrate that current OLLMs fall short as reward models, revealing several common failure modes such as perception failure, modality dominance failure, and cross-modal fusion failure; and (3) strong correlations between Omni-RewardBench scores and downstream performance (IID r = 0.94, OOD r = 0.72), validating its reliability as a predictor of real-world capability and alignment quality.
SafeMCP: Proactive Power Regulation for LLM Agent Defense via Environment-Grounded Look-Ahead Reasoning
Lichao Wang | ZhaoXing Ren | Tianzhuo Yang | Jiaming Ji | Chi Harold Liu | Yaodong Yang | Juntao Dai
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Lichao Wang | ZhaoXing Ren | Tianzhuo Yang | Jiaming Ji | Chi Harold Liu | Yaodong Yang | Juntao Dai
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
As Large Language Model (LLM) agents increasingly leverage the Model Context Protocol (MCP) to operate in complex environments, the expansion of their action spaces offers agents unsafe capabilities and underscores the risk of power-seeking. While broad action space and greater environment influence are essential for task fulfillment, they creates a fragile risk surface where minor errors or hallucinations are magnified into catastrophic failures. In response, we propose SafeMCP, a server-side defense plugin that constrains tool acquisition via predictive reasoning regarding future safety risks. SafeMCP utilizes an internal world model for look-ahead reasoning to implement a two-tier defense: proactive tool filtering to constrain hazardous power expansion and immediate intervention as a fail-safe. To train SafeMCP, we introduce a three-stage pipeline comprising environmental dynamic grounding, safe policy initialization, and reinforcement learning (RL) with dual verifiable rewards. Experiments on PowerSeeking Bench, ToolEmu, and AgentHarm show that SafeMCP achieves a safe equilibrium, effectively mitigating risks while preserving agent utility.
When Slower Isn’t Truer: Inverse Scaling Law of Truthfulness in Multimodal Reasoning
Sitong Fang | Wenjing Cao | Jiahao Li | Xuyao Wang | Chi-Min Chan | Sirui Han | Juntao Dai | Yike Guo | Yaodong Yang | Jiaming Ji
Findings of the Association for Computational Linguistics: ACL 2026
Sitong Fang | Wenjing Cao | Jiahao Li | Xuyao Wang | Chi-Min Chan | Sirui Han | Juntao Dai | Yike Guo | Yaodong Yang | Jiaming Ji
Findings of the Association for Computational Linguistics: ACL 2026
Reasoning models have attracted increasing attention for their ability to tackle complex tasks, embodying the System II (slow thinking) paradigm in contrast to System I (fast, intuitive responses). Yet a key question remains: Does slower reasoning necessarily lead to more truthful answers? Our findings suggest otherwise. We conduct the first systematic study of the inverse scaling law in slow-thinking paradigms for multimodal reasoning. We find that when confronted with incomplete or misleading visual inputs, slow-thinking models are more prone to fabricating plausible yet false details to justify untruthful reasoning. To analyze this behavior, we construct a 5,000-sample hierarchical prompt dataset annotated by 50 human participants. The prompts progressively increase in complexity, revealing a consistent pattern: slower reasoning models tend to follow depth-first search (DFS) thinking, persistently exploring flawed premises, while faster chat models favor breadth-first search (BFS) inference, showing greater caution under uncertainty. These findings reveal a critical vulnerability of reasoning models: while effective in structured domains such as math, their DFS-style reasoning becomes fragile when confronted with ambiguous, multimodal inputs.
2025
Towards Advanced Mathematical Reasoning for LLMs via First-Order Logic Theorem Proving
Chuxue Cao | Mengze Li | Juntao Dai | Jinluan Yang | Zijian Zhao | Shengyu Zhang | Weijie Shi | Chengzhong Liu | Sirui Han | Yike Guo
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Chuxue Cao | Mengze Li | Juntao Dai | Jinluan Yang | Zijian Zhao | Shengyu Zhang | Weijie Shi | Chengzhong Liu | Sirui Han | Yike Guo
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Large language models (LLMs) have shown promising first-order logic (FOL) reasoning capabilities with applications in various areas. However, their effectiveness in complex mathematical reasoning involving multi-step FOL deductions is still under-researched. While LLMs perform competitively on established mathematical reasoning benchmarks, they struggle with multi-step FOL tasks, as demonstrated by Deepseek-Prover-V2-7B’s low accuracy (4.2%) on our proposed theorem proving dataset. This issue arises from the limited exploration of diverse proof strategies and the potential for early reasoning mistakes to undermine entire proofs. To address these issues, we propose DREAM, a self-adaptive solution that enhances the Diversity and REAsonability of LLMs’ generation strategies. DREAM incorporates an Axiom-Driven Strategy Diversification mechanism to promote varied strategic outcomes and a Sub-Proposition Error Feedback to help LLMs reflect on and correct their proofs. Our contributions include pioneering advancements in LLMs’ mathematical reasoning through FOL theorem proving, introducing a novel inference stage solution that improves performance by 0.6% to 6.4%, and providing a curated dataset of 447 mathematical theorems in Lean 4 format for evaluation.
Automate Strategy Finding with LLM in Quant Investment
Zhizhuo Kou | Holam Yu | Junyu Luo | Jingshu Peng | Xujia Li | Chengzhong Liu | Juntao Dai | Lei Chen | Sirui Han | Yike Guo
Findings of the Association for Computational Linguistics: EMNLP 2025
Zhizhuo Kou | Holam Yu | Junyu Luo | Jingshu Peng | Xujia Li | Chengzhong Liu | Juntao Dai | Lei Chen | Sirui Han | Yike Guo
Findings of the Association for Computational Linguistics: EMNLP 2025
We present a novel three-stage framework leveraging Large Language Models (LLMs) within a risk-aware multi-agent system for automate strategy finding in quantitative finance. Our approach addresses the brittleness of traditional deep learning models in financial applications by: employing prompt-engineered LLMs to generate executable alpha factor candidates across diverse financial data, implementing multimodal agent-based evaluation that filters factors based on market status, predictive quality while maintaining category balance, and deploying dynamic weight optimization that adapts to market conditions. Experimental results demonstrate the robust performance of the strategy in Chinese & US market regimes compared to established benchmarks. Our work extends LLMs capabilities to quantitative trading, providing a scalable architecture for financial signal extraction and portfolio construction. The overall framework significantly outperforms all benchmarks with 53.17% cumulative return on SSE50 (Jan 2023 to Jan 2024), demonstrating superior risk-adjusted performance and downside protection on the market.
Search
Fix author
Co-authors
- Sirui Han 7
- Yike Guo 6
- Jiaming Ji 6
- Chi-Min Chan 4
- Yaodong Yang (杨耀东) 4
- Chengzhong Liu 2
- Weijie Shi 2
- Pengcheng Wen 2
- Wei Xue 2
- Tianzhuo Yang 2
- Han Zhu 2
- Chengkun Cai 1
- Chuxue Cao 1
- Wenjing Cao 1
- Jiawei Chen 1
- Boyuan Chen (陈博远) 1
- Lei Chen 1
- Hang Du 1
- Sitong Fang 1
- Fushuo Huo 1
- Chunyang Jiang 1
- Zhizhuo Kou 1
- Haoran Li 1
- Mengze Li 1
- Jiahao Li 1
- Xujia Li 1
- Chi Harold Liu 1
- Junyu Luo 1
- Jingshu Peng 1
- Peng Qi 1
- ZhaoXing Ren 1
- Lichao Wang 1
- Xuyao Wang 1
- Cui Yakun 1
- Jinluan Yang 1
- Boqin Yin 1
- Holam Yu 1
- Guoxi Zhang 1
- Shengyu Zhang 1
- Zijian Zhao 1
- Yujin Zhou 1
- Zhenghao Zhu 1