Semantic Exploration with Adaptive Gating for Efficient Problem Solving with Language Models
Sungjae Lee, Hyejin Park, Jaechang Kim, Jungseul Ok

TL;DR
SEAG introduces an adaptive gating mechanism for large language models that intelligently decides when to perform tree searches, reducing redundancy and computational costs while improving accuracy in complex reasoning tasks.
Contribution
The paper presents SEAG, a novel method that dynamically controls tree search based on answer confidence, enhancing efficiency and semantic exploration in reasoning with LLMs.
Findings
SEAG improves accuracy by 4.3% on average.
Reduces computational costs to 31% of existing methods.
Effective across diverse models and reasoning benchmarks.
Abstract
Recent advancements in large language models (LLMs) have shown remarkable potential in various complex tasks requiring multi-step reasoning methods like tree search to explore diverse reasoning paths. However, existing methods often suffer from computational inefficiency and redundancy. First, they overlook the diversity of task difficulties, leading to unnecessarily extensive searches even for easy tasks. Second, they neglect the semantics of reasoning paths, resulting in redundant exploration of semantically identical paths. To address these limitations, we propose Semantic Exploration with Adaptive Gating (SEAG), a computationally efficient method. SEAG employs an adaptive gating mechanism that dynamically decides whether to conduct a tree search, based on the confidence level of answers from a preceding simple reasoning method. Furthermore, its tree-based exploration consolidates…
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
Taxonomy
TopicsAI-based Problem Solving and Planning · Topic Modeling · Intelligent Tutoring Systems and Adaptive Learning
