arXiv:2607. 20468v1 Announce Type: new Abstract: AI agents are increasingly used to automate research and development tasks, yet existing benchmarks typically evaluate them on prescribed workflows or narrow action spaces.
By Jehyeok Yeon, Ben Rank, Maksym Andriushchenko
arXiv:2608.21836v1 Announce Type: new
Abstract: Large language models have become increasingly capable agents for low-level code and kernel optimization, but isolated kernel benchmarks provide only a...
By Hui Zeng, Pengfei Yang, Yanxin Chen, Fusong Ju, Xinran Wei
arXiv:2602.18998v2 Announce Type: replace
Abstract: LLM agents are increasingly expected to operate as general-purpose systems that resolve real-world user requests, yet their dynamic scaling behavio...
By Xiaochuan Li, Ryan Ming, Pranav Setlur, Abhijay Paladugu, Andy Tang, Hao Kang, Shuai Shao, Rong Jin, Chenyan Xiong
arXiv:2609.40284v1 Announce Type: cross
Abstract: Computer use agents (CUAs), which use graphical user interfaces (GUIs) to complete tasks on a computer, have recently surpassed human performance on...
By Pranjal Aggarwal, Lawrence Keunho Jang, Sean Welleck, Daniel Fried, Ruslan Salakhutdinov, Jing Yu Koh
Configuring distributed LLM training across hundreds of GPUs requires jointly optimizing tensor, pipeline, expert, context, and data parallelism alongside micro-batch size, recomputation, sharding, an...
The paper introduces BudgetAPO, a single‑stage prompt optimizer designed for tight‑budget scenarios where only a few hundred model calls are feasible. BudgetAPO adapts the evaluation slice size to each task’s noise level, uses a fixed slice to turn accept/reject decisions into paired comparisons, and applies a reflective operator to jointly rewrite reasoning strategy and output format. Across seven benchmarks and five subject models, BudgetAPO outperforms existing methods, ranking first on every subject and requiring far fewer calls to achieve comparable or superior performance.
By Haoyue Liu, Zhichao Wang, Huanyu Yan, Xiaoying Tang