Table of Contents
Fetching ...

Synthesizing Procedural Memory: Challenges and Architectures in Automated Workflow Generation

Nishant Gaurav, Adit Akarsh, Ankit Ranjan, Manoj Bajaj

TL;DR

The paper addresses how to endow LLMs with the ability to autonomously synthesize production-grade procedural memory in the form of executable code, using a cross-service Outlook–OneDrive case study. It introduces a four-gap framework—Discovery, Verification, Decomposition, and Scaling—driven by hypothesize, probe, and code, and operationalizes it via Dynamic Model Context Protocol, a probe phase, intrinsic derivation, and Linear State Anchoring with external memory. Key contributions include active tool discovery through semantic search, grounding tool schemas with a Probe routine, replacing reliance on large search trees with intrinsic reasoning and a writeable plan counter, and proposing memory/persistence strategies for production reliability. The approach provides a practical blueprint for turning conversational agents into autonomous workflow architects capable of generating robust, scalable automation at scale.

Abstract

While CodeMem establishes executable code as the optimal representation for agentic procedural memory, the mechanism for autonomously synthesizing this memory from a blank slate remains underexplored. This paper operationalizes the transition of Large Language Models from passive tool-users to active workflow architects. Through a high-fidelity case study of a cross-service orchestration task involving Outlook and OneDrive, we identify and address four structural bottlenecks in automated skill generation: the Discovery Gap involving navigation of large tool registries, the Verification Gap regarding grounding tool response structures, the Decomposition Gap which replaces inefficient search with Linear State Anchoring, and the Scaling Gap focused on concurrency and persistence. We demonstrate that by enforcing a scientific methodology of hypothesize, probe, and code, agents can autonomously write robust, production-grade code skills.

Synthesizing Procedural Memory: Challenges and Architectures in Automated Workflow Generation

TL;DR

The paper addresses how to endow LLMs with the ability to autonomously synthesize production-grade procedural memory in the form of executable code, using a cross-service Outlook–OneDrive case study. It introduces a four-gap framework—Discovery, Verification, Decomposition, and Scaling—driven by hypothesize, probe, and code, and operationalizes it via Dynamic Model Context Protocol, a probe phase, intrinsic derivation, and Linear State Anchoring with external memory. Key contributions include active tool discovery through semantic search, grounding tool schemas with a Probe routine, replacing reliance on large search trees with intrinsic reasoning and a writeable plan counter, and proposing memory/persistence strategies for production reliability. The approach provides a practical blueprint for turning conversational agents into autonomous workflow architects capable of generating robust, scalable automation at scale.

Abstract

While CodeMem establishes executable code as the optimal representation for agentic procedural memory, the mechanism for autonomously synthesizing this memory from a blank slate remains underexplored. This paper operationalizes the transition of Large Language Models from passive tool-users to active workflow architects. Through a high-fidelity case study of a cross-service orchestration task involving Outlook and OneDrive, we identify and address four structural bottlenecks in automated skill generation: the Discovery Gap involving navigation of large tool registries, the Verification Gap regarding grounding tool response structures, the Decomposition Gap which replaces inefficient search with Linear State Anchoring, and the Scaling Gap focused on concurrency and persistence. We demonstrate that by enforcing a scientific methodology of hypothesize, probe, and code, agents can autonomously write robust, production-grade code skills.
Paper Structure (21 sections, 1 figure)