Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

Polymath: A Self-Optimizing Agent with Dynamic Hierarchical Workflow

Created by
  • Haebom

Author

Chia-Tung Ho, Jing Gong, Xufeng Yao, Yunsheng Bai, Abhishek B Akkur, Haoxing Ren

Outline

To address the efficiency and scalability limitations of agent systems based on large-scale language models (LLMs), this paper proposes Polymath, a multilayered workflow agent with self-optimization capabilities. Polymath leverages the flexibility of workflow graphs and the expressive power of code-based workflows to solve a variety of real-world problems. It improves workflows by integrating multi-grid-based graph optimization and self-reflection-based evolutionary algorithms, even without labeled data. Experimental results on six benchmark datasets, including coding, mathematics, and multi-round question-answering, show that Polymath outperforms state-of-the-art baseline models by an average of 8.1%.

Takeaways, Limitations

Takeaways:
We present a self-optimizing agent capable of solving real-world problems without labeled data.
Combine the benefits of workflow graphs and code-based workflows for greater flexibility and expressiveness.
Effective workflow optimization using multi-grid-based graph optimization and self-reflection-based evolutionary algorithms.
Demonstrated performance improvements over existing models in benchmarks across various fields.
Limitations:
Further research is needed to evaluate the generalization performance of the proposed method and its applicability to various problem types.
Experiments were conducted using only six benchmark datasets, requiring more diverse and extensive experiments.
Consideration should be given to the complexity and computational cost of self-reflection-based evolutionary algorithms.
👍