Learning Hierarchical Procedural Memory for LLM Agents through Bayesian Selection and Contrastive Refinement
Saman Forouzandeh, Wei Peng, Parham Moradi, Xinghuo Yu, Mahdi Jalili
TL;DR
MACLA presents a memory-augmented framework that decouples reasoning from learning by maintaining a frozen LLM and updating an external hierarchical procedural memory. Three core mechanisms—Bayesian procedure selection, contrastive refinement, and meta-procedural composition—enable sample-efficient, interpretable, and continual improvement without LLM parameter updates. Across four diverse benchmarks, MACLA achieves state-of-the-art average performance with a 7B model and delivers dramatic reductions in memory-construction time while compressing thousands of trajectories into hundreds of reusable procedures. The work demonstrates robust generalization, efficient inference, and a principled approach to managing procedural knowledge for long-horizon tasks.
Abstract
We present MACLA, a framework that decouples reasoning from learning by maintaining a frozen large language model while performing all adaptation in an external hierarchical procedural memory. MACLA extracts reusable procedures from trajectories, tracks reliability via Bayesian posteriors, selects actions through expected-utility scoring, and refines procedures by contrasting successes and failures. Across four benchmarks (ALFWorld, WebShop, TravelPlanner, InterCodeSQL), MACLA achieves 78.1 percent average performance, outperforming all baselines. On ALFWorld unseen tasks, MACLA reaches 90.3 percent with 3.1 percent positive generalization. The system constructs memory in 56 seconds, 2800 times faster than the state-of-the-art LLM parameter-training baseline, compressing 2851 trajectories into 187 procedures. Experimental results demonstrate that structured external memory with Bayesian selection and contrastive refinement enables sample-efficient, interpretable, and continually improving agents without LLM parameter updates.
