Xiaobo Jin
Author directory2026
Dunhuang-Bench: How Well Do MLLMs Understand Cultural Heritage?
Junyi Yuan | Jian Zhang | Tianxiu Yu | Yanlin Zhou | Xiaobo Jin | Qiufeng Wang | Fangyu Wu
Findings of the Association for Computational Linguistics: ACL 2026
Junyi Yuan | Jian Zhang | Tianxiu Yu | Yanlin Zhou | Xiaobo Jin | Qiufeng Wang | Fangyu Wu
Findings of the Association for Computational Linguistics: ACL 2026
Dunhuang art, a cornerstone of global heritage, demands fine-grained visual perception anchored by specialized cultural knowledge. Given the strong performance of multimodal large language models (MLLMs) on generic multimodal benchmarks, to what extent can they understand artifacts from Dunhuang art that are grounded in cultural context? To this end, we construct Dunhuang-Bench, a large-scale benchmark comprising 486 images and 22,970 QA pairs. It incorporates diverse task formats to evaluate MLLMs’ cultural understanding: Question Answering with Text Description, Multi-turn Dialogue, and Question Answering with Choices. Guided by Panofsky’s theory of iconology, we design two tasks including visual perception and knowledge reasoning for the evaluation of content understanding. In addition, we follow the theory of formal analytic tradition to design another task of artistic appreciation in our Dunhuang-Bench. Extensive evaluations of 20 mainstream MLLMs on Dunhuang-Bench reveal a consistent performance drop from perception and appreciation to reasoning. Moreover, CoT and few-shot prompting show marginal or negative impact, highlighting the limits of prompting-based improvements. Dunhuang-Bench thus provides a challenging benchmark for advancing multimodal cultural understanding. Data and code will be publicly available.
Reactivating Test-Time Scaling for Plane Geometry Problem Solving
Xiaoqiang Kang | Shengen Wu | Maizhen Ning | Xiaobo Jin | Kaizhu Huang | Yutao Yue | Xiaowei Huang | Qiufeng Wang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Xiaoqiang Kang | Shengen Wu | Maizhen Ning | Xiaobo Jin | Kaizhu Huang | Yutao Yue | Xiaowei Huang | Qiufeng Wang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Plane geometry problem (PGP) solving has become a critical benchmark for multimodal reasoning because it requires accurate visual perception and precise multi-step symbolic deduction. Although test-time scaling (TTS) has demonstrated remarkable success in general mathematical reasoning, it fails to scale effectively under the symbolic-program paradigm for plane geometry. We identify two key obstacles: limited reasoning diversity induced by rigid symbolic programs and insufficient explicit visual grounding before symbolic deduction. To address these issues, we propose Multi-Trace Synthesis (MTS), which converts each symbolic program into heterogeneous reasoning traces, including executable Python scripts and CoT-augmented variants. We further propose Perception-Augmented (PA) training, which parses diagrams into structured semantic clauses before deduction, and Consensus-Guided Multi-Trace Ensemble (CG-MTE) for efficient self-adaptive inference. Experiments on three geometry benchmarks show that our method consistently improves PGP-solving across model scales and achieves strong performance against both general-purpose MLLMs and specialized geometry solvers. Under test-time scaling, CG-MTE achieves a comparable accuracy to high-budget self-consistency while reducing sampling cost by up to 8×. Code and data are publicly available at https://github.com/Jason8Kang/ReTTS-PGPS.
2025
Can GRPO Boost Complex Multimodal Table Understanding?
Xiaoqiang Kang | Shengen Wu | Zimu Wang | Yilin Liu | Xiaobo Jin | Kaizhu Huang | Wei Wang | Yutao Yue | Xiaowei Huang | Qiufeng Wang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Xiaoqiang Kang | Shengen Wu | Zimu Wang | Yilin Liu | Xiaobo Jin | Kaizhu Huang | Wei Wang | Yutao Yue | Xiaowei Huang | Qiufeng Wang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Existing table understanding methods face challenges due to complex table structures and intricate logical reasoning. While supervised finetuning (SFT) dominates existing research, reinforcement learning (RL), such as Group Relative Policy Optimization (GRPO), has shown promise but struggled with low initial policy accuracy and coarse rewards in tabular contexts. In this paper, we introduce Table-R1, a three-stage RL framework that enhances multimodal table understanding through: (1) Warm-up that prompts initial perception and reasoning capabilities, (2) Perception Alignment GRPO (PA-GRPO), which employs continuous Tree-Edit-Distance Similarity (TEDS) rewards for recognizing table structures and contents, and (3) Hint-Completion GRPO (HC-GRPO), which utilizes fine-grained rewards of residual steps based on the hint-guided question. Extensive experiments demonstrate that Table-R1 can boost the model’s table reasoning performance obviously on both held-in and held-out datasets, outperforming SFT and GRPO largely. Notably, Qwen2-VL-7B with Table-R1 surpasses larger specific table understanding models (e.g., Table-LLaVA 13B), even achieving comparable performance to the closed-source model GPT-4o on held-in datasets, demonstrating the efficacy of each stage of Table-R1 in overcoming initialization bottlenecks and reward sparsity, thereby advancing robust multimodal table understanding.