MCTS-KBQA: Monte Carlo Tree Search for Knowledge Base Question Answering
Guanming Xiong, Haochen Li, Wen Zhao

TL;DR
This paper introduces MCTS-KBQA, a novel framework that enhances knowledge base question answering by integrating Monte Carlo Tree Search with large language models, improving reasoning especially in low-resource settings.
Contribution
It proposes a MCTS-based reasoning framework for KBQA that requires no fine-tuning and introduces new annotated reasoning datasets for better evaluation.
Findings
Outperforms linear decision methods in low-resource scenarios
Achieves comparable results to fully supervised models with less data
Provides new annotated reasoning datasets for KBQA
Abstract
This study explores how to enhance the reasoning capabilities of large language models (LLMs) in knowledge base question answering (KBQA) by leveraging Monte Carlo Tree Search (MCTS). Semantic parsing-based KBQA methods are particularly challenging as these approaches require locating elements from knowledge bases and generating logical forms, demanding not only extensive annotated data but also strong reasoning capabilities. Although recent approaches leveraging LLMs as agents have demonstrated considerable potential, these studies are inherently constrained by their linear decision-making processes. To address this limitation, we propose a MCTS-based framework that enhances LLMs' reasoning capabilities through tree search methodology. We design a carefully designed step-wise reward mechanism that requires only direct prompting of open-source instruction LLMs without additional…
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 · Natural Language Processing Techniques · Semantic Web and Ontologies
MethodsBalanced Selection
