Papers by Venktesh V
EXPLORA: Efficient Exemplar Subset Selection for Complex Reasoning (2024.emnlp-main)
Copied to clipboard
Kiran Purohit, Venktesh V, Raghuram Devalla, Krishna Yerragorla, Sourangshu Bhattacharya, Avishek Anand
| Challenge: | Recent advances in large language models (LLMs) have enabled in-context learning (ICL) a critical challenge in ICL is the selection of optimal exemplars . |
| Approach: | They propose an algorithm for static exemplar subset selection for reasoning tasks . they propose a method that estimates parameters without incorporating confidence information . |
| Outcome: | The proposed method significantly reduces the number of LLM calls to 11% of those required by state-of-the-art methods and achieves a substantial performance improvement of 12.24%. |
Test-time Corpus Feedback: From Retrieval to RAG (2026.findings-eacl)
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) pipelines treat retrieval and reasoning as isolated components, limiting performance on complex tasks. |
| Approach: | They propose to integrate large language models with retrieval to improve query quality . they also propose to use feedback to improve the query, retrieved context, or document pool . |
| Outcome: | The proposed methods bridge IR and NLP perspectives and highlight retrieval as a dynamic, learnable component of end-to-end RAG systems. |
SUNAR: Semantic Uncertainty based Neighborhood Aware Retrieval for Complex QA (2025.naacl-long)
Copied to clipboard
| Challenge: | Open-domain complex question-answering systems face challenges in retrieving and reasoning over information that addresses multifaceted queries. |
| Approach: | They propose a method that leverages large language models to guide a Neighborhood Aware Retrieval process. |
| Outcome: | The proposed approach outperforms retrieve-and-reason baselines on two complex QA datasets. |
Think Right, Not More: Test-Time Scaling for Numerical Claim Verification (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Fact-checking real-world claims requires multistep reasoning and numerical reasoning . large language models are unable to understand nuance of numerical aspects . |
| Approach: | They propose scaling test-time compute (TTS) for large language models to solve this problem . they train a verifier model to navigate the space of possible reasoning paths . |
| Outcome: | The proposed approach achieves 1.8x higher efficiency than standard TTS while delivering 18.8% performance improvement over single-shot verification methods. |