Lakshya A Agrawal

Recent advances in prompt learning allow large language model agents to acquire task-relevant knowledge from inference-time context without parameter changes. For example, existing methods (like ACE or GEPA) can learn system prompts to improve accuracy based on previous agent runs. However, these methods primarily focus on single-agent or low-parallelism settings. This fundamentally limits their ability to efficiently learn from a large set of collected agentic traces. It would be efficient and beneficial to run prompt learning in parallel to accommodate the growing trend of learning from many agentic traces or parallel agent executions. Yet without a principled strategy for scaling, current methods suffer from quality degradation with high parallelism. To improve the quality delay tradeoff of prompt learning, we propose Combee, a plug-and-play framework that scales parallel prompt learning on top of existing methods such as ACE and GEPA. Combee speeds up learning and enables running many agents in parallel while preserving most of the quality of sequential learning from their aggregate traces. To achieve this, Combee leverages parallel scans and employs an augmented shuffle mechanism; Combee also introduces a dynamic batch size controller to balance quality and delay. Evaluations on AppWorld, Terminal-Bench, Formula, and FiNER demonstrate that Combee substantially improves the quality delay tradeoff of prompt learning, achieving up to 17× speedup over previous methods at equivalent cost while matching or approaching their best accuracy.