activity
20232025
collaborators

5 papers

cs.AI2025

Synthesizing Procedural Memory: Challenges and Architectures in Automated Workflow Generation

Nishant Gaurav, Adit Akarsh, Ankit Ranjan +1

While CodeMem establishes executable code as the optimal representation for agentic procedural memory, the mechanism for autonomously synthesizing this memory from a blank slate re…

cs.SE2025

CodeMem: Architecting Reproducible Agents via Dynamic MCP and Procedural Memory

Nishant Gaurav, Adit Akarsh, Tejas Ravishankar +1

Current tool-using AI agents suffer from limited action space, context inefficiency, and probabilistic instability that makes them unsuitable for handling repetitive tasks which ar…

cs.SE2025

Dynamic ReAct: Scalable Tool Selection for Large-Scale MCP Environments

Nishant Gaurav, Adit Akarsh, Ankit Ranjan +1

We present Dynamic ReAct, a novel approach for enabling ReAct agents to efficiently operate with extensive Model Control Protocol (MCP) tool sets that exceed the contextual memory…

cs.CL2024

GUIDEQ: Framework for Guided Questioning for progressive informational collection and classification

Priya Mishra, Suraj Racha, Kaustubh Ponkshe +2

Question Answering (QA) is an important part of tasks like text classification through information gathering. These are finding increasing use in sectors like healthcare, customer…

eess.SY2023

Approximation of Convex Envelope Using Reinforcement Learning

Vivek S. Borkar, Adit Akarsh

Oberman gave a stochastic control formulation of the problem of estimating the convex envelope of a non-convex function. Based on this, we develop a reinforcement learning scheme t…