Benchmarking and Improving Large Vision-Language Models for Fundamental Visual Graph Understanding and Reasoning

Yingjie Zhu, Xuefeng Bai, Kehai Chen, Yang Xiang, Jun Yu +1 more
12/18/2024
cs.CLcs.CV

No official code found. Best implementation: AAAndy-Zhu/VGCure (13 stars, last commit 2025-12-04).

Abstract

Large Vision-Language Models (LVLMs) have demonstrated remarkable performance across diverse tasks. Despite great success, recent studies show that LVLMs encounter substantial limitations when engaging with visual graphs. To study the reason behind these limitations, we propose VGCure, a comprehensive benchmark covering 22 tasks for examining the fundamental graph understanding and reasoning capacities of LVLMs. Extensive evaluations conducted on 14 LVLMs reveal that LVLMs are weak in basic graph understanding and reasoning tasks, particularly those concerning relational or structurally complex information. Based on this observation, we propose a structure-aware fine-tuning framework to enhance LVLMs with structure learning abilities through three self-supervised learning tasks. Experiments validate the effectiveness of our method in improving LVLMs' performance on fundamental and downstream graph learning tasks, as well as enhancing their robustness against complex visual graphs.

View on arXivView PDF

Code Implementations(1)

AAAndy-Zhu/VGCureCommunity100%

Repository of Benchmarking and Improving Large Vision-Language Models for Fundamental Visual Graph Understanding and Reasoning

131PythonMar 26, 202510 months ago

Similar Papers

Cite this paper

@article{zhu2024benchmarking,
  title  = {Benchmarking and Improving Large Vision-Language Models for Fundamental Visual Graph Understanding and Reasoning},
  author = {Yingjie Zhu and Xuefeng Bai and Kehai Chen and Yang Xiang and Jun Yu and Min Zhang},
  year   = {2024},
  eprint = {2412.13540},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.13540v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.13540.svg)](https://codeofpaper.com/paper/2412.13540)

Discussion