Harnessing Adaptive Topology Representations for Zero-Shot Graph Question Answering
Yanbin Wei, Jiangyue Yan, Chun Kang, Yang Chen, Hua Liu, James T. Kwok, Yu Zhang

TL;DR
This paper introduces DynamicTRF, a framework that adaptively selects optimal graph representations for zero-shot graph question answering, improving accuracy and response efficiency in large multimodal models.
Contribution
It designs tailored topology representations, a new metric GRE, and a TRF router to enhance zero-shot graph QA performance and response conciseness.
Findings
DynamicTRF improves zero-shot graph QA accuracy.
The framework enhances response efficiency and conciseness.
Extensive experiments validate its effectiveness across multiple tasks.
Abstract
Large Multimodal Models (LMMs) have shown generalized zero-shot capabilities in diverse domain question-answering (QA) tasks, including graph QA that involves complex graph topologies. However, most current approaches use only a single type of graph representation, namely Topology Representation Form (TRF), such as prompt-unified text descriptions or style-fixed visual styles. Those "one-size-fits-all" approaches fail to consider the specific preferences of different models or tasks, often leading to incorrect or overly long responses. To address this, we first analyze the characteristics and weaknesses of existing TRFs, and then design a set of TRFs, denoted by , tailored to zero-shot graph QA. We then introduce a new metric, Graph Response Efficiency (GRE), which measures the balance between the performance and the brevity in graph QA. Built on these, we develop the DynamicTRF…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Semantic Web and Ontologies · Advanced Graph Neural Networks
