EXPLORA: Efficient Exemplar Subset Selection for Complex Reasoning
Kiran Purohit, Venktesh V, Raghuram Devalla, Krishna Mohan Yerragorla,, Sourangshu Bhattacharya, Avishek Anand

TL;DR
EXPLORA is a novel method for selecting exemplar subsets in large language models that reduces computational costs and improves reasoning performance on complex tasks.
Contribution
It introduces EXPLORA, an exploration-based algorithm for static exemplar selection that minimizes LLM calls and enhances reasoning accuracy.
Findings
Reduces LLM calls to ~11% of previous methods
Achieves a 12.24% performance improvement
Open-sourced code and data for reproducibility
Abstract
Answering reasoning-based complex questions over text and hybrid sources, including tables, is a challenging task. Recent advances in large language models (LLMs) have enabled in-context learning (ICL), allowing LLMs to acquire proficiency in a specific task using only a few demonstration samples (exemplars). A critical challenge in ICL is the selection of optimal exemplars, which can be either task-specific (static) or test-example-specific (dynamic). Static exemplars provide faster inference times and increased robustness across a distribution of test examples. In this paper, we propose an algorithm for static exemplar subset selection for complex reasoning tasks. We introduce EXPLORA, a novel exploration method designed to estimate the parameters of the scoring function, which evaluates exemplar subsets without incorporating confidence information. EXPLORA significantly reduces the…
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.
Code & Models
Videos
Taxonomy
TopicsAI-based Problem Solving and Planning · Bayesian Modeling and Causal Inference · Semantic Web and Ontologies
