P Aditya Sreekar
Author directory2026
Eluna: An Agentic LLM System for Automating Warehouse Operations with Reasoning and Task Execution
Ning Liu | P Aditya Sreekar | Kalle Kujanpää | Zhaoxuan Zhu | Kaiwen Liu | Chuanneng Sun | Jorge Marchena Menendez | Matthew J Bales | Tianyu Yang | Shahnawaz Alam | Rose Yu | Baoyuan Liu | Kristina Lisa Klinkner | Shervin Malmasi
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing: Industry Track
Ning Liu | P Aditya Sreekar | Kalle Kujanpää | Zhaoxuan Zhu | Kaiwen Liu | Chuanneng Sun | Jorge Marchena Menendez | Matthew J Bales | Tianyu Yang | Shahnawaz Alam | Rose Yu | Baoyuan Liu | Kristina Lisa Klinkner | Shervin Malmasi
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing: Industry Track
Warehouse operations are governed by Standard Operating Procedures (SOPs) that encode complex, multi-system decision logic, which must be executed reliably under strict time constraints, yet LLM agents lack mechanisms to enforce procedural compliance and degrade under the context overload full SOP specifications introduce. We present Eluna, a production-deployed agentic system for reliable SOP execution. Eluna is a graph-guided, multi-agent framework that encodes SOPs as directed acyclic graphs with progressive disclosure and delegates independent tasks to parallel sub-agents, each with persistent code execution and live data access. To meet production latency and accuracy needs, we use asymmetric episodic distillation where a strong teacher is improved through episodic error memories, then a smaller student is fine-tuned on the corrected trajectories with memory stripped, internalizing corrections without inference-time overhead. On a 13-task benchmark and two production applications, our fine-tuned models match or exceed their teacher, beat all larger off-the-shelf baselines, and reach 94% expert agreement on the ticket processing application.
2024
AXCEL: Automated eXplainable Consistency Evaluation using LLMs
P Aditya Sreekar | Sahil Verma | Suransh Chopra | Abhishek Persad | Sarik Ghazarian | Narayanan Sadagopan
Findings of the Association for Computational Linguistics: EMNLP 2024
P Aditya Sreekar | Sahil Verma | Suransh Chopra | Abhishek Persad | Sarik Ghazarian | Narayanan Sadagopan
Findings of the Association for Computational Linguistics: EMNLP 2024
Large Language Models (LLMs) are widely used in both industry and academia for various tasks, yet evaluating the consistency of generated text responses continues to be a challenge. Traditional metrics like ROUGE and BLEU show a weak correlation with human judgment. More sophisticated metrics using Natural Language Inference (NLI) have shown improved correlations but are complex to implement, require domain-specific training due to poor cross-domain generalization, and lack explainability. More recently, prompt-based metrics using LLMs as evaluators have emerged; while they are easier to implement, they still lack explainability and depend on task-specific prompts, which limits their generalizability. This work introduces Automated eXplainable Consistency Evaluation using LLMs (AXCEL), a prompt-based consistency metric which offers explanations for the consistency scores by providing detailed reasoning and pinpointing inconsistent text spans. AXCEL is also a generalizable metric which can be adopted to multiple tasks without changing the prompt. AXCEL outperforms both non-prompt and prompt-based state-of-the-art (SOTA) metrics in detecting inconsistencies across summarization by 8.7%, free text generation by 6.2%, and data-to-text conversion tasks by 29.4%. We also evaluate the influence of underlying LLMs on prompt based metric performance and recalibrate the SOTA prompt-based metrics with the latest LLMs for fair comparison. Further, we show that AXCEL demonstrates strong performance using open source LLMs.