Papers by Balasubramaniam Srinivasan
A Systematic Survey of Automatic Prompt Optimization Techniques (2025.emnlp-main)
Copied to clipboard
Kiran Ramnath, Kang Zhou, Sheng Guan, Soumya Smruti Mishra, Xuan Qi, Zhengyuan Shen, Shuai Wang, Sangmin Woo, Sullam Jeoung, Yawei Wang, Haozhu Wang, Han Ding, Yuzhe Lu, Zhichao Xu, Yun Zhou, Balasubramaniam Srinivasan, Qiaojing Yan, Yueyan Chen, Haibo Ding, Panpan Xu, Lin Lee Cheong
| Challenge: | Recent advances in prompt engineering have created impediments for end users to adopt . however, prompt engineering remains an impedance due to rapid advances in models, tasks, and associated best practices. |
| Approach: | They propose to define APO as a 5-part unifying framework and categorize all relevant works based on their salient features. |
| Outcome: | The proposed framework aims to improve the performance of large language models on various tasks. |
NameGuess: Column Name Expansion for Tabular Data (2023.emnlp-main)
Copied to clipboard
| Challenge: | Tabular data is used for storing and organizing information in web and enterprise applications. |
| Approach: | They propose a task to expand column names as a natural language generation problem by conditioning on table content and column header names to improve auto-regressive models. |
| Outcome: | The proposed task improves auto-regressive models on table content and column header names to match human performance. |
CoverICL: Selective Annotation for In-Context Learning via Active Graph Coverage (2024.emnlp-main)
Copied to clipboard
Costas Mavromatis, Balasubramaniam Srinivasan, Zhengyuan Shen, Jiani Zhang, Huzefa Rangwala, Christos Faloutsos, George Karypis
| Challenge: | In-context learning (ICL) uses few-shot labeled examples to perform selective annotation. |
| Approach: | They propose an algorithm that incorporates uncertainty sampling into selective annotation for ICL . CoverICL builds a nearest-neighbor graph based on the semantic similarity between candidate ICL examples . |
| Outcome: | The proposed algorithm outperforms existing methods for low-budget active learning (AL) it is up to 2x more budget-efficient than SOTA methods for high-budge AL. |
IPR: Intelligent Prompt Routing with User-Controlled Quality-Cost Trade-offs (2025.emnlp-industry)
Copied to clipboard
Aosong Feng, Balasubramaniam Srinivasan, Yun Zhou, Zhichao Xu, Kang Zhou, Sheng Guan, Yueyan Chen, Xian Wu, Ninad Kulkarni, Yi Zhang, Zhengyuan Shen, Dmitriy Bespalov, Soumya Smruti Mishra, Yifei Teng, Darren Yow-Bang Wang, Haibo Ding, Lin Lee Cheong
| Challenge: | Existing systems require users to manually select models or employ rigid routing rules that fail to capture the continuous spectrum of query complexity. |
| Approach: | They propose a quality-constrained intelligent prompt routing framework that automatically selects optimal models based on predicted response quality and user-specified tolerance levels. |
| Outcome: | The proposed framework achieves 43.9% cost reduction while maintaining quality parity with strongest model in the Claude family and processes requests with sub-150ms latency. |
Diffusion Language Model Inference with Monte Carlo Tree Search (2026.findings-eacl)
Copied to clipboard
Zheng Huang, Kiran Ramnath, Yueyan Chen, Aosong Feng, Sangmin Woo, Balasubramaniam Srinivasan, Zhichao Xu, Kang Zhou, Shuai Wang, Haibo Ding, Lin Lee Cheong
| Challenge: | Existing methods for inference use heuristics to determine which positions to unmask and which tokens to commit . MEDAL is an inference-time scaling framework that integrates Monte Carlo Tree SEarch initialization for Diffusion Language Model inference. |
| Approach: | They propose a framework that integrates Monte Carlo Tree SEarch initialization for Diffusion Language Model inference. |
| Outcome: | The proposed framework achieves 22.0% improvement over existing inference strategies across multiple benchmarks. |
BayesFlow: A Probability Inference Framework for Meta-Agent Assisted Workflow Generation (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable generality, often solving tasks with a single carefully engineered prompt. |
| Approach: | They propose to cast automatic workflow generation as Bayesian inference over a posterior distribution on workflows and instantiate BayesFlow as Bayer-based workflow generation framework. |
| Outcome: | The proposed framework improves accuracy by 9 percentage points over baselines and 65 percentage points on pool-wide benchmarks. |
DiscoverGPT: Multi-task Fine-tuning Large Language Model for Related Table Discovery (2025.findings-naacl)
Copied to clipboard
Xuming Hu, Xiao Qin, Chuan Lei, Asterios Katsifodimos, Zhengyuan Shen, Balasubramaniam Srinivasan, Huzefa Rangwala
| Challenge: | Existing methods to learn and evaluate the table semantic relatedness of tabular data are based on pretrain-and-finetune paradigms. |
| Approach: | They propose a multi-task fine-tuning framework that holistically discovers and leverages the intricate relationships among the supervisions to optimize the performance on the data discovery task. |
| Outcome: | The proposed framework outperforms the best performing baseline by up to 7% in F1 score. |