Papers by Soumyabrata Pal
From Tokens to Steps: Verification-Aware Speculative Decoding for Efficient Multi-Step Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Speculative decoding (SD) allows a lightweight draft model to propose outputs that a stronger target model verifies. |
| Approach: | They propose a verification-aware speculative decoding framework that performs step-level verification using only model-internal signals. |
| Outcome: | Experiments show that SpecGuard outperforms both SD and reward-guided SD in accuracy and reliability tests. |
From Selection to Generation: A Survey of LLM-based Active Learning (2025.acl-long)
Copied to clipboard
Yu Xia, Subhojyoti Mukherjee, Zhouhang Xie, Junda Wu, Xintong Li, Ryan Aponte, Hanjia Lyu, Joe Barrow, Hongjie Chen, Franck Dernoncourt, Branislav Kveton, Tong Yu, Ruiyi Zhang, Jiuxiang Gu, Nesreen K. Ahmed, Yu Wang, Xiang Chen, Hanieh Deilamsalehy, Sungchul Kim, Zhengmian Hu, Yue Zhao, Nedim Lipka, Seunghyun Yoon, Ting-Hao Kenneth Huang, Zichao Wang, Puneet Mathur, Soumyabrata Pal, Koyel Mukherjee, Zhehao Zhang, Namyong Park, Thien Huu Nguyen, Jiebo Luo, Ryan A. Rossi, Julian McAuley
| Challenge: | Large Language Models (LLMs) have been used for selection and training of data for active learning. |
| Approach: | They propose an intuitive taxonomy that categorizes LLM-based active learning techniques and discuss the transformative roles they can play in the active learning loop. |
| Outcome: | The proposed model can generate entirely new data instances and provide more cost-effective annotations with fewer labeled data instances. |
PromptRefine: Enhancing Few-Shot Performance on Low-Resource Indic Languages with Example Selection from related Example Banks (2025.naacl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated impressive few-shot learning capabilities through in-context learning. |
| Approach: | They propose a novel Alternating Minimization approach for example selection that improves ICL performance on low-resource Indic languages. |
| Outcome: | The proposed approach outperforms existing frameworks for retrieving examples on low-resource Indic languages. |
RELIC: Enhancing Reward Model Generalization for Low-Resource Indic Languages with Few-Shot Examples (2025.findings-emnlp)
Copied to clipboard
Soumya Suvra Ghosal, Vaibhav Singh, Akash Ghosh, Soumyabrata Pal, Subhadip Baidya, Sriparna Saha, Dinesh Manocha
| Challenge: | a new reward model for low-resource Indic languages is proposed . a preference-based training approach is prohibitively expensive, authors say . |
| Approach: | a new in-context learning framework is proposed to train a retriever to select in-constext examples from low-resource Indic languages. |
| Outcome: | a new in-context learning framework for reward modeling in low-resource Indic languages is developed . the proposed framework outperforms existing examples on three preference datasets . |
FiRST: Finetuning Router-Selective Transformers for Input-Adaptive Latency Reduction (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to improve latency via skipping layers have limitations . fiRST is a model-agnostic framework that reduces inference latency while maintaining quality . |
| Approach: | They propose a model-agnostic framework that skips transformer layers during decoding . it is fully compatible with KV caching, enabling faster decoding while maintaining quality . |
| Outcome: | a new framework reduces inference latency by using layer-specific routers to skip transformer layers during decoding. |
TTD-SQL: Tree-Guided Token Decoding for Efficient and Schema-Aware SQL Generation (2025.emnlp-industry)
Copied to clipboard
Chetan Sharma, Ramasuri Narayanam, Soumyabrata Pal, Kalidas Yeturu, Shiv Kumar Saini, Koyel Mukherjee
| Challenge: | Large language models (LLMs) have achieved state-of-the-art accuracy on benchmarks like Spider and BIRD, but inference latency due to sequential autoregressive decoding remains a challenge for real-time deployments. |
| Approach: | a new framework integrates SQL grammar and database schema constraints into the decoding process . tree-Guided Token Decoding (TTD-SQL) precomputes token-level decision trees over SQL keywords, table names, and column identifiers . |
| Outcome: | a new framework reduces schema hallucinations and inference latency due to autoregressive decoding . tree-Guided Token Decoding achieves 19.96% token-rate speedups . |