Guanming Xiong

dblp:243/7517 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
7since 2021 · last 2026
0000-0001-8634-3669ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Hybrid KBQA with Tree-Structured Sub-Question Decomposition
Liqiang Wen, Hexinyun Huang, Guanming Xiong, Wen Zhao 0008
ICIC (24)4
2025 Multi-Turn Interactions for Text-to-SQL with Large Language Models
Guanming Xiong, Junwei Bao 0001, Hongfei Jiang, Yang Song 0021, Wen Zhao 0008
CIKM1
2025 EDGE: Efficient Data Selection for LLM Agents via Guideline Effectiveness
abstract
Large Language Models (LLMs) have shown remarkable capabilities as AI agents. However, existing methods for enhancing LLM-agent abilities often lack a focus on data quality, leading to inefficiencies and suboptimal results in both fine-tuning and prompt engineering. To address this issue, we introduce EDGE, a novel approach for identifying informative samples without needing golden answers. We propose the Guideline Effectiveness (GE) metric, which selects challenging samples by measuring the impact of human-provided guidelines in multi-turn interaction tasks. A low GE score indicates that the human expertise required for a sample is missing from the guideline, making the sample more informative. By selecting samples with low GE scores, we can improve the efficiency and outcomes of both prompt engineering and fine-tuning processes for LLMs. Extensive experiments validate the performance of our method. Our method achieves competitive results on the HotpotQA and WebShop and datasets, requiring 75% and 50% less data, respectively, while outperforming existing methods. We also provide a fresh perspective on the data quality of LLM-agent fine-tuning.
Guanming Xiong, Haochen Li 0001, Wen Zhao 0008
IJCAI2
2025 CLEAR-KGQA: Clarification-Enhanced Ambiguity Resolution for Knowledge Graph Question Answering
abstract
This study addresses the challenge of ambiguity in knowledge graph question answering (KGQA). While recent KGQA systems have made significant progress, particularly with the integration of large language models (LLMs), they typically assume user queries are unambiguous, which is an assumption that rarely holds in real-world applications. To address these limitations, we propose a novel framework that dynamically handles both entity ambiguity (e.g., distinguishing between entities with similar names) and intent ambiguity (e.g., clarifying different interpretations of user queries) through interactive clarification. Our approach employs a Bayesian inference mechanism to quantify query ambiguity and guide LLMs in determining when and how to request clarification from users within a multi-turn dialogue framework. We further develop a two-agent interaction framework where an LLM-based user simulator enables iterative refinement of logical forms through simulated user feedback. Experimental results on the WebQSP and CWQ dataset demonstrate that our method significantly improves performance by effectively resolving semantic ambiguities. Additionally, we contribute a refined dataset of disambiguated queries, derived from interaction histories, to facilitate future research in this direction.1
Liqiang Wen, Guanming Xiong, Tong Mo, Weiping Li 0002
IJCNN2
2024 Interactive-KBQA: Multi-Turn Interactions for Knowledge Base Question Answering with Large Language Models
abstract
This study explores the realm of knowledge base question answering (KBQA).KBQA is considered a challenging task, particularly in parsing intricate questions into executable logical forms.Traditional semantic parsing (SP)-based methods require extensive data annotations, which result in significant costs.Recently, the advent of few-shot in-context learning, powered by large language models (LLMs), has showcased promising capabilities.However, fully leveraging LLMs to parse questions into logical forms in low-resource scenarios poses a substantial challenge.To tackle these hurdles, we introduce Interactive-KBQA, a framework designed to generate logical forms through direct interaction with knowledge bases (KBs).Within this framework, we have developed three generic APIs for KB interaction.For each category of complex question, we devised exemplars to guide LLMs through the reasoning processes.Our method achieves competitive results on the We-bQuestionsSP, ComplexWebQuestions, KQA Pro, and MetaQA datasets with a minimal number of examples (shots).Importantly, our approach supports manual intervention, allowing for the iterative refinement of LLM outputs.By annotating a dataset with step-wise reasoning processes, we showcase our model's adaptability and highlight its potential for contributing significant enhancements to the field. 1
Guanming Xiong, Junwei Bao 0001, Wen Zhao 0008
ACL (1)1
2022 AutoQGS: Auto-Prompt for Low-Resource Knowledge-based Question Generation from SPARQL
abstract
This study investigates the task of knowledge-based question generation (KBQG). Conventional KBQG works generated questions from fact triples in the knowledge graph, which could not express complex operations like aggregation and comparison in SPARQL. Moreover, due to the costly annotation of large-scale SPARQL-question pairs, KBQG from SPARQL under low-resource scenarios urgently needs to be explored. Recently, since the generative pre-trained language models (PLMs) typically trained in natural language (NL)-to-NL paradigm have been proven effective for low-resource generation, e.g., T5 and BART, how to effectively utilize them to generate NL-question from non-NL SPARQL is challenging. To address these challenges, AutoQGS, an auto-prompt approach for low-resource KBQG from SPARQL, is proposed. Firstly, we put forward to generate questions directly from SPARQL for KBQG task to handle complex operations. Secondly, we propose an auto-prompter trained on large-scale unsupervised data to rephrase SPARQL into NL description, smoothing the low-resource transformation from non-NL SPARQL to NL question with PLMs. Experimental results on the WebQuestionsSP, ComlexWebQuestions 1.1, and PathQuestions show that our model achieves state-of-the-art performance, especially in low-resource settings. Furthermore, a corpora of 330k factoid complex question-SPARQL pairs is generated for further KBQG research.
Guanming Xiong, Junwei Bao 0001, Wen Zhao 0008, Youzheng Wu, Xiaodong He 0001
CIKM1
2022 CSS: Contrastive Span Selector for Multi-span Question Answering
Guanming Xiong
PRICAI (1)2