Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.03973 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913824074891264 |
|---|---|
| author | Liu, Jiale Zeng, Yifan Zhang, Shaokun Zhang, Chi Højmark-Bertelsen, Malte Gadeberg, Marie Normann Wang, Huazheng Wu, Qingyun |
| author_facet | Liu, Jiale Zeng, Yifan Zhang, Shaokun Zhang, Chi Højmark-Bertelsen, Malte Gadeberg, Marie Normann Wang, Huazheng Wu, Qingyun |
| contents | LLM-based optimization has shown remarkable potential in enhancing agentic systems. However, the conventional approach of prompting LLM optimizer with the whole training trajectories on training dataset in a single pass becomes untenable as datasets grow, leading to context window overflow and degraded pattern recognition. To address these challenges, we propose Fine-Grained Optimization (FGO), a scalable framework that divides large optimization tasks into manageable subsets, performs targeted optimizations, and systematically combines optimized components through progressive merging. Evaluation across ALFWorld, LogisticsQA, and GAIA benchmarks demonstrate that FGO outperforms existing approaches by 1.6-8.6% while reducing average prompt token consumption by 56.3%. Our framework provides a practical solution for scaling up LLM-based optimization of increasingly sophisticated agent systems. Further analysis demonstrates that FGO achieves the most consistent performance gain in all training dataset sizes, showcasing its scalability and efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_03973 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Divide, Optimize, Merge: Fine-Grained LLM Agent Optimization at Scale Liu, Jiale Zeng, Yifan Zhang, Shaokun Zhang, Chi Højmark-Bertelsen, Malte Gadeberg, Marie Normann Wang, Huazheng Wu, Qingyun Computation and Language LLM-based optimization has shown remarkable potential in enhancing agentic systems. However, the conventional approach of prompting LLM optimizer with the whole training trajectories on training dataset in a single pass becomes untenable as datasets grow, leading to context window overflow and degraded pattern recognition. To address these challenges, we propose Fine-Grained Optimization (FGO), a scalable framework that divides large optimization tasks into manageable subsets, performs targeted optimizations, and systematically combines optimized components through progressive merging. Evaluation across ALFWorld, LogisticsQA, and GAIA benchmarks demonstrate that FGO outperforms existing approaches by 1.6-8.6% while reducing average prompt token consumption by 56.3%. Our framework provides a practical solution for scaling up LLM-based optimization of increasingly sophisticated agent systems. Further analysis demonstrates that FGO achieves the most consistent performance gain in all training dataset sizes, showcasing its scalability and efficiency. |
| title | Divide, Optimize, Merge: Fine-Grained LLM Agent Optimization at Scale |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2505.03973 |