paper-with-me

홈 › Papers

RPTS: Tree-Structured Reasoning Process Scoring for Faithful Multimodal Evaluation

2025-11-10 · Haofeng Wang, Yu Zhang arxiv

Large Vision-Language Models (LVLMs) excel in multimodal reasoning and have shown impressive performance on various multimodal benchmarks. However, most of these benchmarks evaluate models primarily through multiple-choice or short-answer formats, which do not take the reasoning process into account. Although some benchmarks assess the reasoning process, their methods are often overly simplistic and only examine reasoning when answers are incorrect. This approach overlooks scenarios where flawed reasoning leads to correct answers. In addition, these benchmarks do not consider the impact of intermodal relationships on reasoning. To address this issue, we propose the Reasoning Process Tree Score (RPTS), a tree structure-based metric to assess reasoning processes. Specifically, we organize the reasoning steps into a reasoning tree and leverage its hierarchical information to assign weighted faithfulness scores to each reasoning step. By dynamically adjusting these weights, RPTS not only evaluates the overall correctness of the reasoning, but also pinpoints where the model fails in the reasoning. To validate RPTS in real-world multimodal scenarios, we construct a new benchmark, RPTS-Eval, comprising 374 images and 390 reasoning instances. Each instance includes reliable visual-textual clues that serve as leaf nodes of the reasoning tree. Furthermore, we define three types of intermodal relationships to investigate how intermodal interactions influence the reasoning process. We evaluated representative LVLMs (e.g., GPT4o, Llava-Next), uncovering their limitations in multimodal reasoning and highlighting the differences between open-source and closed-source commercial LVLMs. We believe that this benchmark will contribute to the advancement of research in the field of multimodal reasoning.

📄 PDF Abstract BibTeX arXiv:2511.06899

Code (0)

등록된 구현이 없습니다.

Tasks

Multimodal Reasoning

Similar Papers 제목 키워드 기반

Propagation Tree Is Not Deep: Adaptive Graph Contrastive Learning Approach for Rumor Detection

2025-08-10 · Chaoqun Cui, Caiyan Jia arxiv

Rumor detection on social media has become increasingly important. Most existing graph-based models presume rumor propagation trees (RPTs) have deep structures and learn sequential stance features along branches. However…

Contrastive Learning

Generating an Overview Report over Many Documents

2019-08-17 · Jingwen Wang, Hao Zhang, Cheng Zhang, Wenjing Yang 외

How to efficiently generate an accurate, well-structured overview report (ORPT) over thousands of related documents is challenging. A well-structured ORPT consists of sections of multiple levels (e.g., sections and subse…

AttributeDecision MakingDiversityDocument Summarization+1

Solving Arithmetic Word Problems by Scoring Equations with Recursive Neural Networks

2020-09-11 · Klim Zaporojets, Giannis Bekoulis, Johannes Deleu, Thomas Demeester 외

Solving arithmetic word problems is a cornerstone task in assessing language understanding and reasoning capabilities in NLP systems. Recent works use automatic extraction and ranking of candidate solution equations prov…

Governance by Evidence: Regulated Predictors in Decision-Tree Models

2025-12-17 · Alexios Veskoukis, Dimitris Kalles arxiv

Decision-tree methods are widely used on structured tabular data and are valued for interpretability across many sectors. However, published studies often list the predictors they use (for example age, diagnosis codes, l…

TreeGPT: Pure TreeFFN Encoder-Decoder Architecture for Structured Reasoning Without Attention Mechanisms

2025-09-06 · Zixi Li arxiv

We present TreeGPT, an attention-free neural architecture that explores the potential of pure TreeFFN encoder-decoder design for structured reasoning tasks. Unlike traditional transformer approaches that rely on attentio…

Computational Efficiency