Various human-designed prompt engineering techniques have been proposed to improve problem solvers based on Large Language Models (LLMs), yielding many disparate code bases. We unify these approaches by describing LLM-based agents as computational graphs. Each node implements a function to process multimodal data or query other LLMs. Each edge describes the information flow between operations and agents. Graphs can be recursively combined into larger composite graphs representing hierarchies of inter-agent collaboration. Our novel automatic graph optimizers (1) refine node-level LLM prompts (node optimization) and (2) improve agent orchestration by changing graph connectivity (edge optimization). Experiments demonstrate that our framework can be used to efficiently develop, integrate, and automatically improve diverse LLM agents.
@misc{zhuge2024language,
title={Language Agents as Optimizable Graphs},
author={Mingchen Zhuge and Wenyi Wang and Louis Kirsch and Francesco Faccio and Dmitrii Khizbullin and J\"{u}rgen Schmidhuber},
year={2024},
eprint={2402.16823},
archivePrefix={arXiv},
primaryClass={cs.AI}
}
Offical Email: gptswarm@gmail.com
Personal Emails: mingchen.zhuge@kaust.edu.sa, wenyi.wang@kaust.edu.sa, dmitrii.khizbullin@kaust.edu.sa, francesco.faccio@kaust.edu.sa, mail@louiskirsch.com
Address: KAUST AI Initiative (Building 12, 3rd floor), KAUST, Thuwal, KSA
We look forward to hearing from you!