Nagarajan Natarajan
2026
Learning Optimal Message Representations for Agentic Communication
Shashwat Gupta | Anson Bastos | Mayukh Das | Supriyo Ghosh | Nagarajan Natarajan | Chetan Bansal | Saravan Rajmohan
Findings of the Association for Computational Linguistics: ACL 2026
Shashwat Gupta | Anson Bastos | Mayukh Das | Supriyo Ghosh | Nagarajan Natarajan | Chetan Bansal | Saravan Rajmohan
Findings of the Association for Computational Linguistics: ACL 2026
Large Language Models (LLMs) have demonstrated remarkable capabilities in agentic collaborative problem-solving, albeit a gap exists. Existing frameworks predominantly rely on natural language as a primary representation (format) for agentic communication. However natural language could be ambiguous and verbose. Furthermore, recent works have shown that alternative representations can enhance performance in LLMs on certain tasks. But current approaches lack the intelligence necessary to understand, learn or apply optimal communication representations adaptively. In this paper, we propose to dynamically learn the optimal message representations to enhance agentic performance. We model the optimization problem as an Expanding Markov Decision Process (EMDP) and propose our method named OPTiMACS. We evaluate our system across benchmark datasets of collaborative problem-solving. The results show significant performance improvements while maintaining efficiency. Our work bridges the gap between rigid communication protocols and open-ended natural language by providing an adaptive framework that learns task-aware structural representations.
2025
Task Facet Learning: A Structured Approach To Prompt Optimization
Gurusha Juneja | Gautam Jajoo | Hua Li | Jian Jiao | Nagarajan Natarajan | Amit Sharma
Findings of the Association for Computational Linguistics: ACL 2025
Gurusha Juneja | Gautam Jajoo | Hua Li | Jian Jiao | Nagarajan Natarajan | Amit Sharma
Findings of the Association for Computational Linguistics: ACL 2025
Given a task in the form of a basic description and its training examples, prompt optimization is the problem of synthesizing the given information into a text prompt for a large language model. Humans solve this problem by also considering the different facets that define a task (e.g., counter-examples, explanations, analogies) and including them in the prompt. However, it is unclear whether existing algorithmic approaches, based on iteratively editing a given prompt or automatically selecting a few in-context examples, can cover the multiple facets required to solve a complex task. In this work, we view prompt optimization as that of learning multiple facets of a task from a set of training examples. We exploit structure in the prompt optimization problem and break down a prompt into loosely coupled semantic sections. The proposed algorithm, UniPrompt, (1) clusters the input space and uses clustered batches so that each batch likely corresponds to a different facet of the task, and (2) utilizes a feedback mechanism to propose adding, editing or deleting a section, which in turn is aggregated over a batch to capture generalizable facets. Empirical evaluation on multiple datasets and a real-world task shows that prompts generated using UniPrompt obtain higher accuracy than human-tuned prompts and those from state-of-the-art methods. In particular, our algorithm can generate long, complex prompts that existing methods are unable to generate.